GeneralizedMinimalResidualSolver<T> Class

public class GeneralizedMinimalResidualSolver<T> : IterativeSparseSolver<T>

Public Class GeneralizedMinimalResidualSolver(Of T)
	Inherits IterativeSparseSolver(Of T)

generic<typename T>
public ref class GeneralizedMinimalResidualSolver : public IterativeSparseSolver<T>

type GeneralizedMinimalResidualSolver<'T> = 
    class
        inherit IterativeSparseSolver<'T>
    end

Inheritance

Object  →  ManagedIterativeAlgorithm<DenseVector<T>, T, SolutionReport<DenseVector<T>, T>>  →  IterativeSparseSolver<T>  →  GeneralizedMinimalResidualSolver<T>

Type Parameters

T

Use the GeneralizedMinimalResidualSolver<T> 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<T> is used. Finally, the Solve() 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.

Reference