Package no.uib.cipr.matrix.sparse
Class IR
java.lang.Object
no.uib.cipr.matrix.sparse.AbstractIterativeSolver
no.uib.cipr.matrix.sparse.IR
- All Implemented Interfaces:
IterativeSolver
Iterative Refinement. IR solves the unsymmetric linear system
Ax = b
using Iterative Refinement (preconditioned Richardson
iteration).-
Field Summary
Fields inherited from class no.uib.cipr.matrix.sparse.AbstractIterativeSolver
iter, M
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class no.uib.cipr.matrix.sparse.AbstractIterativeSolver
checkSizes, getIterationMonitor, getPreconditioner, setIterationMonitor, setPreconditioner
-
Constructor Details
-
IR
Constructor for IR. Uses the given vector as template for creating scratch vectors. Typically, the solution or the right hand side vector can be passed, and the template is not modified- Parameters:
template
- Vector to use as template for the work vectors needed in the solution process
-
-
Method Details
-
solve
Description copied from interface:IterativeSolver
Solves the given problem, writing result into the vector.- Parameters:
A
- Matrix of the problemb
- Right hand sidex
- Solution is stored here. Also used as initial guess- Returns:
- The solution vector x
- Throws:
IterativeSolverNotConvergedException
-