|
| | CQuasiNewtonInvLeastSquares ()=default |
| | Default construction without allocation.
|
| |
| | CQuasiNewtonInvLeastSquares (Index nsample, Index npt, Index nvar, Index nptdomain=0) |
| | Construction with allocation, see "resize".
|
| |
| void | resize (Index nsample, Index npt, Index nvar, Index nptdomain=0) |
| | Resize the object.
|
| |
| Index | size () const |
| | Size of the object, the number of samples.
|
| |
| void | reset () |
| | Discard all history, keeping the current solution.
|
| |
| su2matrix< Scalar > & | FPresult () |
| | Access the current fixed-point result.
|
| |
| const su2matrix< Scalar > & | FPresult () const |
| |
| Scalar & | FPresult (Index iPt, Index iVar) |
| |
| const Scalar & | FPresult (Index iPt, Index iVar) const |
| |
| su2matrix< Scalar > & | solution () |
| | Access the current solution approximation.
|
| |
| const su2matrix< Scalar > & | solution () const |
| |
| Scalar & | operator() (Index iPt, Index iVar) |
| |
| const Scalar & | operator() (Index iPt, Index iVar) const |
| |
| const su2matrix< Scalar > & | compute () |
| | Compute and return a new approximation.
|
| |
template<class Scalar_t, bool WithMPI = true>
class CQuasiNewtonInvLeastSquares< Scalar_t, WithMPI >
A quasi-Newton fixed-point (FP) accelerator based on IQN-ILS.
- Note
- The implementation prioritizes storage, the LS problem is solved via the normal equations as that is easy to make parallel over MPI, it may however be unstable with large sample sizes (compared to QR decomp). Usage: Allocate, store the initial solution (operator (i,j), default is 0), run the FP, store its result ("FPresult"), compute new solution, use it as the new input of the FP, run the FP, etc.