FV3 Bundle
|
#include <DRPCGMinimizer.h>
Public Member Functions | |
const std::string | classname () const override |
DRPCGMinimizer (const eckit::Configuration &, const CostFct_ &) | |
~DRPCGMinimizer () | |
Public Member Functions inherited from oops::DRMinimizer< MODEL > | |
DRMinimizer (const CostFct_ &J) | |
~DRMinimizer () | |
Public Member Functions inherited from oops::Minimizer< MODEL > | |
Minimizer (const CostFct_ &J) | |
virtual | ~Minimizer () |
ControlIncrement< MODEL > * | minimize (const eckit::Configuration &) |
Private Types | |
typedef BMatrix< MODEL > | Bmat_ |
typedef CostFunction< MODEL > | CostFct_ |
typedef ControlIncrement< MODEL > | CtrlInc_ |
typedef HtRinvHMatrix< MODEL > | HtRinvH_ |
Private Member Functions | |
double | solve (CtrlInc_ &, CtrlInc_ &, CtrlInc_ &, const Bmat_ &, const HtRinvH_ &, const double, const double, const int, const double) override |
Private Attributes | |
QNewtonLMP< CtrlInc_, Bmat_ > | lmp_ |
DRPCG Minimizer.
Derber-Rosati Preconditioned Conjugate Gradients solver.
This solver is based on the standard Preconditioned Conjugate Gradients solver for Ax=b (G. H. Golub and C. F. Van Loan, Matrix Computations), and on the Derber and Rosati double PCG algorithm (J. Derber and A. Rosati, 1989, J. Phys. Oceanog. 1333-1347). For details see S. Gurol, PhD Manuscript, 2013. It solves \( Ax=b\) for the particular case \( A=B^{-1}+C\), without requiring the application of \( B^{-1}\). This algorithm is similar to DRIPCG except it includes standard PCG instead IPCG and stopping criteria is based on the preconditioner norm.
A must be square, symmetric, positive definite.
A preconditioner must be supplied that, given a vector q, returns an approximation to \( (AB)^{-1} q\). Possible preconditioning is detailed in S. Gurol, PhD Manuscript, 2013. Note that the traditional \( B\)-preconditioning corresponds to precond= \(I\).
On entry:
On exit, dx will contain the solution \( dx \) and dxh will contain \( B^{-1} dx\). The return value is the achieved reduction in preconditioned residual norm.
Iteration will stop if the maximum iteration limit "maxiter" is reached or if the residual norm reduces by a factor of "tolerance".
Each matrix must implement a method:
which applies the matrix to the first argument, and returns the matrix-vector product in the second. (Note: the const is optional, but recommended.)
Definition at line 78 of file DRPCGMinimizer.h.
|
private |
Definition at line 79 of file DRPCGMinimizer.h.
|
private |
Definition at line 80 of file DRPCGMinimizer.h.
|
private |
Definition at line 81 of file DRPCGMinimizer.h.
|
private |
Definition at line 82 of file DRPCGMinimizer.h.
oops::DRPCGMinimizer< MODEL >::DRPCGMinimizer | ( | const eckit::Configuration & | conf, |
const CostFct_ & | J | ||
) |
Definition at line 99 of file DRPCGMinimizer.h.
|
inline |
Definition at line 87 of file DRPCGMinimizer.h.
|
inlineoverridevirtual |
Implements oops::DRMinimizer< MODEL >.
Definition at line 85 of file DRPCGMinimizer.h.
|
overrideprivatevirtual |
Implements oops::DRMinimizer< MODEL >.
Definition at line 106 of file DRPCGMinimizer.h.
|
private |
Definition at line 93 of file DRPCGMinimizer.h.