ConjugateGradientSquaredSolver<T> Class

public class ConjugateGradientSquaredSolver<T> : IterativeSparseSolver<T>

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

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

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

Inheritance

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

Type Parameters

T

Use the ConjugateGradientSquaredSolver<T> class to solve large, non-symmetric sparse systems of equations using the Conjugate Gradient Squared (CGS) method. Convergence can sometimes be erratic, and may sometimes break down completely.

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.

Reference