Constructs a new sparse linear solver that uses the quasi-minimal residual algorithm.
SystemObject Extreme.Mathematics.AlgorithmsManagedIterativeAlgorithmDenseVector Extreme.Mathematics.LinearAlgebra.IterativeSolversIterativeSparseSolver Extreme.Mathematics.LinearAlgebra.IterativeSolversQuasiMinimalResidualSolver
Namespace: Extreme.Mathematics.LinearAlgebra.IterativeSolversAssembly: Extreme.Numerics.Net40 (in Extreme.Numerics.Net40.dll) Version: 6.0.16073.0 (6.0.16312.0)
public class QuasiMinimalResidualSolver : IterativeSparseSolver
Public Class QuasiMinimalResidualSolver
Inherits IterativeSparseSolver
public ref class QuasiMinimalResidualSolver : public IterativeSparseSolver
type QuasiMinimalResidualSolver =
class
inherit IterativeSparseSolver
end
The QuasiMinimalResidualSolver type exposes the following members.
Top
Top
Top
Use the QuasiMinimalResidualSolver class to solve large, non-symmetric sparse
systems of equations using the Quasi-Minimal Residual (QMR) method. This method is more robust
than the Bi-Conjugate Gradient method.
To solve a system of equations using this class, construct a new instance, passing the matrix of
the system to the constructor.
You can optionally set a preconditioner by setting the
Preconditioner property. By default, a JacobiPreconditioner
is used. Finally, the Solve(Vector) method solves the system.
Once the algorithm finished, the Status property indicates
whether the algorithm completed successfully.
Numerical Libraries
Supported in: 5.x, 4.x
Reference