![]() |
NeoPZ
|
Contains the implementation of the BiCGSTAB function which solves the unsymmetric linear system using BiConjugate Gradient Stabilized method. More...
Go to the source code of this file.
Functions | |
| template<class Matrix , class Vector , class Preconditioner , class Real > | |
| int | BiCGSTAB (const Matrix &A, Vector &x, const Vector &b, Preconditioner &M, int64_t &max_iter, Real &tol, Vector *residual, const int FromCurrent) |
BiCGSTAB solves the unsymmetric linear system using the Preconditioned BiConjugate Gradient Stabilized method. More... | |
Contains the implementation of the BiCGSTAB function which solves the unsymmetric linear system using BiConjugate Gradient Stabilized method.
Definition in file bicgstab.h.
| int BiCGSTAB | ( | const Matrix & | A, |
| Vector & | x, | ||
| const Vector & | b, | ||
| Preconditioner & | M, | ||
| int64_t & | max_iter, | ||
| Real & | tol, | ||
| Vector * | residual, | ||
| const int | FromCurrent | ||
| ) |
BiCGSTAB solves the unsymmetric linear system
using the Preconditioned BiConjugate Gradient Stabilized method.
| A | – matrix of the system |
| b | – vector of the system |
| M | – preconditioner matrix |
| x | – approximate solution to |
| 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 – BiCGSTAB BiCGSTAB follows the algorithm described on p. 27 of the SIAM Templates book. |
Definition at line 27 of file bicgstab.h.
References Dot(), Norm(), test::res, and TPZExtractVal::val().
Referenced by TPZMatrix< STATE >::SolveBICGStab().
1.8.13