BiConjugateGradientStabilizedSolver<T> Class

public class BiConjugateGradientStabilizedSolver<T> : IterativeSparseSolver<T>

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

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

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

Inheritance

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

Type Parameters

T

Use the BiConjugateGradientStabilizedSolver<T> class to solve large, non-symmetric sparse systems of equations using the Stabilized Bi-Conjugate Gradient method (BiCGStab). Convergence is more stable than the Conjugate Gradient Squared (CGS) 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.

Reference