NeoPZ
|
Contains the implementation of the IR function which solves the unsymmetric linear system using the Iterative Refinement method. More...
Go to the source code of this file.
Functions | |
template<class Matrix , class Vector , class Preconditioner , class Real > | |
int | IR (Matrix &A, Vector &x, const Vector &b, Preconditioner &M, Vector *residual, int64_t &max_iter, Real &tol, const int FromCurrent) |
IR solves the unsymmetric linear system Ax = b using Iterative Refinement (preconditioned Richardson iteration). More... | |
Contains the implementation of the IR function which solves the unsymmetric linear system using the Iterative Refinement method.
Definition in file ir.h.
int IR | ( | Matrix & | A, |
Vector & | x, | ||
const Vector & | b, | ||
Preconditioner & | M, | ||
Vector * | residual, | ||
int64_t & | max_iter, | ||
Real & | tol, | ||
const int | FromCurrent | ||
) |
IR solves the unsymmetric linear system Ax = b using Iterative Refinement (preconditioned Richardson iteration).
A | – matrix of the system |
b | – vector of the system |
M | – preconditioner matrix |
x | – approximate solution to Ax = b |
max_iter | – the number of iterations performed before the tolerance was reached |
tol | – the residual after the final iteration |
residual | – residual vector (return) |
FromCurrent | – for type of operation (MultAdd) Iterative template routine – Preconditioned Richardson |
Definition at line 24 of file ir.h.
References Norm(), test::res, and TPZExtractVal::val().
Referenced by TPZMatrix< STATE >::SolveIR().