ComplexLU Class

ComplexLU Class

LU factorization of a matrix of type Complex.

Inheritance Hierarchy

SystemObject
Imsl.MathComplexLU

Namespace: Imsl.Math
Assembly: ImslCS (in ImslCS.dll) Version: 6.5.2.0

Syntax

C++

Copy

[SerializableAttribute]
public class ComplexLU

<SerializableAttribute>
Public Class ComplexLU

[SerializableAttribute]
public ref class ComplexLU

[<SerializableAttribute>]
type ComplexLU =  class end

The ComplexLU type exposes the following members.

Constructors

	Name	Description
	ComplexLU	Creates the LU factorization of a square matrix of type Complex.

Top

Methods

	Name	Description
	Condition	Return an estimate of the reciprocal of the condition number.
	Determinant	Return the determinant of the matrix used to construct this instance.
	Equals	Determines whether the specified object is equal to the current object. (Inherited from Object.)
	Finalize	Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.)
	GetHashCode	Serves as a hash function for a particular type. (Inherited from Object.)
	GetL	Returns the lower triangular portion of the LU factorization of A.
	GetPermutationMatrix	Returns the permutation matrix which results from the LU factorization of A.
	GetType	Gets the Type of the current instance. (Inherited from Object.)
	GetU	Returns the unit upper triangular portion of the LU factorization of A.
	Inverse	Returns the inverse of the matrix used to construct this instance.
	MemberwiseClone	Creates a shallow copy of the current Object. (Inherited from Object.)
	Solve(Complex)	Return the solution x of the linear system Ax = bi> using the LU factorization of A, where A is the input matrix a.
	Solve(Complex, Complex)	Return the solution x of the linear system Ax = b using the LU factorization of A.
	SolveTranspose	Return the solution x of the linear system .
	ToString	Returns a string that represents the current object. (Inherited from Object.)

Top

Properties

	Name	Description
	NumberOfProcessors	Perform the parallel calculations with the maximum possible number of processors set to NumberOfProcessors.

Top

Remarks

ComplexLU performs an LU factorization of a complex general coefficient matrix. ComplexLU's method Condition estimates the condition number of the matrix. The LU factorization is done using scaled partial pivoting. Scaled partial pivoting differs from partial pivoting in that the pivoting strategy is the same as if each row were scaled to have the same infinity norm.

The condition number of the matrix A is defined to be $\kappa \left( A \right) = \left\| A \right\|_1 \left\| {A ^{-1}} \right\|_1$ . Since it is expensive to compute $\left\| {A^{-1}} \right\|_1$ , the condition number is only estimated. The estimation algorithm is the same as used by LINPACK and is described by Cline et al. (1979).

Note that A is not retained for use by other methods of this class, only the factorization of A is retained. Thus, A is a required parameter to the condition method.

An estimated condition number greater than $1/\epsilon$ (where $\epsilon$ is machine precision) indicates that very small changes in A can cause very large changes in the solution x. Iterative refinement can sometimes find the solution to such a system.

ComplexLU fails if U, the upper triangular part of the factorization, has a zero diagonal element. This can occur only if A either is singular or is very close to a singular matrix.

The Solve method can be used to solve systems of equations. The method Determinant can be called to compute the determinant of the coefficient matrix.

ComplexLU is based on the LINPACK routine CGECO; see Dongarra et al. (1979). CGECO uses unscaled partial pivoting.

Reference

Imsl.Math Namespace

Other Resources

Example