Package com.numericalmethod.suanshu.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative.preconditioner

• Interface Summary
Interface Description
Preconditioner
Preconditioning reduces the condition number of the coefficient matrix of a linear system to accelerate the convergence when the system is solved by an iterative method.
PreconditionerFactory
This constructs a new instance of Preconditioner for a coefficient matrix.
• Class Summary
Class Description
IdentityPreconditioner
This identity preconditioner is used when no preconditioning is applied.
JacobiPreconditioner
The Jacobi (or diagonal) preconditioner is one of the simplest forms of preconditioning, such that the preconditioner is the diagonal of the coefficient matrix, i.e., P = diag(A).
SSORPreconditioner
SSOR preconditioner is derived from a symmetric coefficient matrix A which is decomposed as A = D + L + Lt The SSOR preconditioning matrix is defined as M = (D + L)D-1(D + L)t or, parameterized by ω M(ω) = (1/(2 - ω))(D / ω + L)(D / ω)-1(D / ω + L)t