BiConjugateGradientSolver<T> Class

public class BiConjugateGradientSolver<T> : IterativeSparseSolver<T>

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

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

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

Inheritance

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

Type Parameters

T

Use the BiConjugateGradientSolver<T> class to solve large, non-symmetric sparse systems of equations using the Bi-Conjugate Gradient (BiCG) method. For symmetric systems, the method is twice as slow as the Conjugate Graident method (see the ConjugateGradientSolver<T> class).

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