Represents a sparse linear solver that uses the Gemeralized Minimal RESidual (GMRES) algorithm.
SystemObject Extreme.Mathematics.AlgorithmsManagedIterativeAlgorithmDenseVector Extreme.Mathematics.LinearAlgebra.IterativeSolversIterativeSparseSolver Extreme.Mathematics.LinearAlgebra.IterativeSolversGeneralizedMinimalResidualSolver
Namespace: Extreme.Mathematics.LinearAlgebra.IterativeSolversAssembly: Extreme.Numerics.Net40 (in Extreme.Numerics.Net40.dll) Version: 6.0.16073.0 (6.0.16283.0)
public class GeneralizedMinimalResidualSolver : IterativeSparseSolver
Public Class GeneralizedMinimalResidualSolver
Inherits IterativeSparseSolver
public ref class GeneralizedMinimalResidualSolver : public IterativeSparseSolver
type GeneralizedMinimalResidualSolver =
class
inherit IterativeSparseSolver
end
The GeneralizedMinimalResidualSolver type exposes the following members.
Top
Top
Top
Use the GeneralizedMinimalResidualSolver class to solve large, non-symmetric sparse
systems of equations using the Generalized Minimal Residual (GMRES) 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.
The memory requirements of the GMRES method increase with every iteration. To limit memory use, the algorithm
is restarted after a number of iterations specified by the IterationsBetweenRestarts property.
The default value is 30.
Numerical Libraries
Supported in: 5.x, 4.x
Reference