ComplexDoubleQRDecomp Type

This class computes the QR factorization of a general m by n ComplexDoubleMatrix.

Copyright (c) 2003-2004, dnAnalytics Project. All rights reserved. See http://www.dnAnalytics.net for details.

Adopted to Altaxo (c) 2005 Dr. Dirk Lellinger.

Constructors

Constructor Description

ComplexDoubleQRDecomp(matrix)

Full Usage: ComplexDoubleQRDecomp(matrix)

Parameters:

Constructor for QR decomposition class. The constructor performs the factorization and the upper and lower matrices are accessible by the Q and R properties.

matrix : IROComplexDoubleMatrix

The matrix to factor.

ArgumentNullException matrix is null.

Instance members

Instance member Description

this.IsFullRank

Full Usage: this.IsFullRank

Returns: bool

Determine whether the matrix is full rank or not

Returns: bool

this.Q

Full Usage: this.Q

Returns: ComplexDoubleMatrix

Returns the orthogonal Q matrix.

Returns: ComplexDoubleMatrix

this.R

Full Usage: this.R

Returns: ComplexDoubleMatrix

Returns the upper triangular factor R.

Returns: ComplexDoubleMatrix

this.Solve

Full Usage: this.Solve

Parameters:
Returns: ComplexDoubleMatrix X that minimizes the two norm of Q*R*X-B.

Finds the least squares solution of A*X = B, where m >= n

B : ComplexDoubleMatrix

A matrix with as many rows as A and any number of columns.

Returns: ComplexDoubleMatrix

X that minimizes the two norm of Q*R*X-B.

ArgumentException Matrix row dimensions must agree.
InvalidOperationException Matrix is rank deficient or m < n.