Namespaces

Types in MathNet.Numerics.LinearAlgebra.Complex32.Solvers

Type TFQMR

Namespace MathNet.Numerics.LinearAlgebra.Complex32.Solvers

Interfaces IIterativeSolver<T>

A Transpose Free Quasi-Minimal Residual (TFQMR) iterative matrix solver.

The TFQMR algorithm was taken from: Iterative methods for sparse linear systems. Yousef Saad Algorithm is described in Chapter 7, section 7.4.3, page 219

The example code below provides an indication of the possible use of the solver.

Constructors

Methods

Public Constructors

TFQMR()

Public Methods

bool Equals(object obj)

int GetHashCode()

Type GetType()

void Solve(Matrix<T> matrix, Vector<T> input, Vector<T> result, Iterator<T> iterator, IPreconditioner<T> preconditioner)

Solves the matrix equation Ax = b, where A is the coefficient matrix, b is the solution vector and x is the unknown vector.
Parameters
Matrix<T> matrix

The coefficient matrix, A.

Vector<T> input

The solution vector, b

Vector<T> result

The result vector, x

Iterator<T> iterator

The iterator to use to control when to stop iterating.

IPreconditioner<T> preconditioner

The preconditioner to use for approximations.

string ToString()