Numerics.NET.LinearAlgebra.IterativeSolvers Namespace

The Numerics.NET.LinearAlgebra.IterativeSolvers namespace contains classes that implement iterative solvers for large, sparse systems.

Classes

BiConjugateGradientSolver<T> Represents a sparse linear solver that uses the bi-conjugate gradient algorithm.
BiConjugateGradientStabilizedSolver<T> Constructs a new sparse linear solver that uses the bi-conjugate gradient algorithm.
ConjugateGradientSolver<T> Represents a sparse linear solver that uses the standard conjugate gradient algorithm.
ConjugateGradientSquaredSolver<T> Represents a sparse solver that uses the Conjugate Gradient Squared algorithm.
GaussSeidelSolver<T> Represents a sparse linear solver that uses the Gauss-Seidel method.
GeneralizedMinimalResidualSolver<T> Represents a sparse linear solver that uses the Gemeralized Minimal RESidual (GMRES) algorithm.
IterativeSparseSolver<T> Represents an iterative algorithm for solving sparse linear systems.
JacobiSolver<T> Represents a sparse linear solver that uses the Jacobi method.
QuasiMinimalResidualSolver<T> Constructs a new sparse linear solver that uses the quasi-minimal residual algorithm.
SuccessiveOverRelaxationSolver<T> Represents a sparse linear solver that uses the Successive Over-Relaxation (SOR) method.