You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Commit 666d21a
Browse filesBrowse the repository at this point in the historyBrowse files
* fix: resolve issues 260-262 264-265 — interface dtors, Log2, test fixtures, SIMD stub, doc links
- #265: add `virtual ~T() = default` to TwiddleFactors, FastFourierTransform, PidDriver, Solver,
Optimizer, OfflineEstimator, OnlineEstimator (policy: virtual ~I() = default on every interface)
- #260: replace recursive Log2 in FastFourierTransform with an iterative static constexpr function
(policy: no recursion; embedded stack must be provably bounded)
- #264: add QNumberUtilTest fixture and convert 4 plain TEST() to TEST_F() in TestQNumber.cpp
- #261: delete SingleInstructionMultipleDataStub.hpp (dangling include, parent interface removed);
remove it from CMakeLists.txt and drop stale SIMD claim from README.md
- #262: fix 6 broken doc links in Optimizer.md and Regularization.md left by neural-network removal
(removed links to deleted losses/, model/, NeuralNetwork.md; corrected relative paths for
estimators/LinearRegression.md and optimization/Optimizer.md)
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
* Apply suggestions from code review
Co-authored-by: github-actions[bot] <41898282+github-actions[bot]@users.noreply.github.com>
* test(analysis): add coverage tests for FFT destructors, Log2, and BitReverse degenerate case
- Replace instance-based Log2 call with static-qualified call so SonarQube
tracks the iterative body even when the compiler folds instance calls
- Add TestFastFourierTransformCoverage fixture with explicit destructor tests
for ~TwiddleFactors and ~FastFourierTransform (stack-scoped, no heap)
- Add direct TEST_F assertions for FastFourierTransform<float>::Log2(1) and
Log2(8) to ensure the while-loop body and the early-exit branch are both
tracked as runtime coverage
- Add MockTwiddleFactorsDegenerate + TestFastFourierTransformSingleSample
(Length=1 FFT) so BitReverse's for-loop is entered with logr_n=0, covering
the "loop never executes" branch that Length=8 tests cannot reach
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
* Update numerical/analysis/test/TestFastFourierTransformRadix2Impl.cpp
Co-authored-by: github-actions[bot] <41898282+github-actions[bot]@users.noreply.github.com>
---------
Co-authored-by: Claude Sonnet 4.6 <noreply@anthropic.com>
Co-authored-by: github-actions[bot] <41898282+github-actions[bot]@users.noreply.github.com>
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -27,7 +27,7 @@ Refer to the documentation to quickly integrate and utilize the library's signal
27
27
|[Solvers](doc/solvers/README.md)| Gaussian Elimination, Levinson-Durbin, Durand-Kerner, Cholesky, DARE, Runge-Kutta ODE Integrators (RK4 + Dormand-Prince), Spectral Radius & Discrete Stability Margin, QR Decomposition (Householder / Givens), LU Decomposition with Partial Pivoting, Singular Value Decomposition (Golub-Kahan) |
28
28
|[Nonlinear Control](doc/nonlinear_control/README.md)| Feedback Linearization, Backstepping Control, Model Reference Adaptive Control (MRAC) |
29
29
|[Robust Control](doc/robust_control/README.md)| Active Disturbance Rejection Control (ADRC + ESO), Sliding Mode Control (SMC), Disturbance Observer (DOB), H∞ State-Feedback Control |
Copy file name to clipboardExpand all lines: doc/optimization/Optimizer.md
+8-8Lines changed: 8 additions & 8 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -2,7 +2,7 @@
2
2
3
3
## Overview & Motivation
4
4
5
-
An **optimizer** adjusts a model's parameter vector $\theta \in \mathbb{R}^P$ to minimize a [loss function](../losses/Loss.md) $\mathcal{L}(\theta)$. The simplest and most fundamental strategy is **gradient descent**: repeatedly step in the direction of steepest descent:
5
+
An **optimizer** adjusts a model's parameter vector $\theta \in \mathbb{R}^P$ to minimize a loss function $\mathcal{L}(\theta)$. The simplest and most fundamental strategy is **gradient descent**: repeatedly step in the direction of steepest descent:
@@ -14,7 +14,7 @@ This library provides a batch gradient descent optimizer with a fixed learning r
14
14
15
15
### The Gradient
16
16
17
-
The gradient $\nabla_\theta \mathcal{L}$ is obtained via [back-propagation](../NeuralNetwork.md). Each component $\frac{\partial \mathcal{L}}{\partial \theta_i}$ tells how much the loss changes when $\theta_i$ is perturbed by a small amount. The gradient points **uphill**; subtracting it moves **downhill**.
17
+
The gradient $\nabla_\theta \mathcal{L}$ is obtained via back-propagation. Each component $\frac{\partial \mathcal{L}}{\partial \theta_i}$ tells how much the loss changes when $\theta_i$ is perturbed by a small amount. The gradient points **uphill**; subtracting it moves **downhill**.
|[Loss Functions](../losses/Loss.md)| Provides the `Cost()` and `Gradient()` the optimizer calls each iteration |
133
-
|[Model](../model/Model.md)| Passes initial parameters to the optimizer and receives optimized parameters back |
134
-
|[Regularization](../regularization/Regularization.md)| Adds a penalty gradient to $\nabla\mathcal{L}$, biasing the optimizer toward simpler models |
135
-
|[Linear Regression](../../estimators/LinearRegression.md)| For MSE on a linear model, gradient descent converges to the same solution as the normal equation |
| Loss Functions| Provides the `Cost()` and `Gradient()` the optimizer calls each iteration |
133
+
| Model| Passes initial parameters to the optimizer and receives optimized parameters back |
134
+
|[Regularization](../regularization/Regularization.md)| Adds a penalty gradient to $\nabla\mathcal{L}$, biasing the optimizer toward simpler models |
135
+
|[Linear Regression](../estimators/LinearRegression.md)| For MSE on a linear model, gradient descent converges to the same solution as the normal equation |
0 commit comments