fipy.solvers.pysparse.linearGMRESSolver¶
Classes
|
The LinearGMRESSolver solves a linear system of equations using the generalized minimal residual method (GMRES) with Jacobi preconditioning. |
- class fipy.solvers.pysparse.linearGMRESSolver.LinearGMRESSolver(tolerance='default', criterion='default', iterations='default', precon='default')¶
Bases:
LinearInitialSolver
The LinearGMRESSolver solves a linear system of equations using the generalized minimal residual method (GMRES) with Jacobi preconditioning. GMRES solves systems with a general non-symmetric coefficient matrix.
The LinearGMRESSolver is a wrapper class for the the Pysparse itsolvers.gmres() and precon.jacobi() methods.
Create a Solver object.
- Parameters:
tolerance (
float
) – Required residual tolerance.criterion (
{'default', 'initial', 'unscaled', 'RHS', 'matrix', 'solution', 'preconditioned', 'natural', 'legacy'}
, optional) – Interpretation oftolerance
. See Convergence for more information.iterations (
int
) – Maximum number of iterative steps to perform.precon (
Preconditioner
) – Preconditioner to use. Not all solver suites support preconditioners.
- DEFAULT_ITERATIONS = 1000¶
Default maximum number of iterative steps to perform
- DEFAULT_PRECONDITIONER¶
alias of
JacobiPreconditioner
- DEFAULT_TOLERANCE = 1e-05¶
Default tolerance for linear solves unless criterion=”legacy”
- LEGACY_TOLERANCE = 1e-10¶
Default tolerance for linear solves if criterion=”legacy”
- __repr__()¶
Return repr(self).
- property default_tolerance¶
Default tolerance for linear solve