GenericDecompositionOperations<T>.RQDecompose Method

public override void RQDecompose(
	int m,
	int n,
	Array2D<T> a,
	Array1D<T> tau,
	out int info
)

Public Overrides Sub RQDecompose ( 
	m As Integer,
	n As Integer,
	a As Array2D(Of T),
	tau As Array1D(Of T),
	<OutAttribute> ByRef info As Integer
)

public:
virtual void RQDecompose(
	int m, 
	int n, 
	Array2D<T> a, 
	Array1D<T> tau, 
	[OutAttribute] int% info
) override

abstract RQDecompose : 
        m : int * 
        n : int * 
        a : Array2D<'T> * 
        tau : Array1D<'T> * 
        info : int byref -> unit 
override RQDecompose : 
        m : int * 
        n : int * 
        a : Array2D<'T> * 
        tau : Array1D<'T> * 
        info : int byref -> unit 

Parameters

m  Int32

C# Copy

M is INTEGER
The number of rows of the matrix A.  M >= 0.

n  Int32

C# Copy

N is INTEGER
The number of columns of the matrix A.  N >= 0.

a  Array2D<T>

C# Copy

A is DOUBLE PRECISION array, dimension (LDA,N)
On entry, the M-by-N matrix A.
On exit,
if m <= n, the upper triangle of the subarray
A(1:m,n-m+1:n) contains the M-by-M upper triangular matrix R;
if m >= n, the elements on and above the (m-n)-th subdiagonal
contain the M-by-N upper trapezoidal matrix R;
the remaining elements, with the array TAU, represent the
orthogonal matrix Q as a product of min(m,n) elementary
reflectors (see Further Details).

C# Copy

LDA is INTEGER
The leading dimension of the array A.  LDA >= max(1,M).

tau  Array1D<T>

C# Copy

TAU is DOUBLE PRECISION array, dimension (min(M,N))
The scalar factors of the elementary reflectors (see Further
Details).

info  Int32

C# Copy

INFO is INTEGER
= 0:  successful exit
< 0:  if INFO = -i, the i-th argument had an illegal value

Further Details:

The matrix Q is represented as a product of elementary reflectors
   Q = H(1) H(2) . . . H(k), where k = min(m,n).
Each H(i) has the form
   H(i) = I - tau * v * v**T
where tau is a real scalar, and v is a real vector with
v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in
A(m-k+i,1:n-k+i-1), and tau in TAU(i).

Authors: Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver, NAG Ltd.

Date: November 2011

public override void RQDecompose(
	int m,
	int n,
	Array2D<Complex<T>> a,
	Array1D<Complex<T>> tau,
	out int info
)

Public Overrides Sub RQDecompose ( 
	m As Integer,
	n As Integer,
	a As Array2D(Of Complex(Of T)),
	tau As Array1D(Of Complex(Of T)),
	<OutAttribute> ByRef info As Integer
)

public:
virtual void RQDecompose(
	int m, 
	int n, 
	Array2D<Complex<T>> a, 
	Array1D<Complex<T>> tau, 
	[OutAttribute] int% info
) override

abstract RQDecompose : 
        m : int * 
        n : int * 
        a : Array2D<Complex<'T>> * 
        tau : Array1D<Complex<'T>> * 
        info : int byref -> unit 
override RQDecompose : 
        m : int * 
        n : int * 
        a : Array2D<Complex<'T>> * 
        tau : Array1D<Complex<'T>> * 
        info : int byref -> unit 

Parameters

m  Int32

C# Copy

M is INTEGER
The number of rows of the matrix A.  M >= 0.

n  Int32

C# Copy

N is INTEGER
The number of columns of the matrix A.  N >= 0.

a  Array2D<Complex<T>>

C# Copy

A is COMPLEX*16 array, dimension (LDA,N)
On entry, the M-by-N matrix A.
On exit,
if m <= n, the upper triangle of the subarray
A(1:m,n-m+1:n) contains the M-by-M upper triangular matrix R;
if m >= n, the elements on and above the (m-n)-th subdiagonal
contain the M-by-N upper trapezoidal matrix R;
the remaining elements, with the array TAU, represent the
unitary matrix Q as a product of min(m,n) elementary
reflectors (see Further Details).

C# Copy

LDA is INTEGER
The leading dimension of the array A.  LDA >= max(1,M).

tau  Array1D<Complex<T>>

C# Copy

TAU is COMPLEX*16 array, dimension (min(M,N))
The scalar factors of the elementary reflectors (see Further
Details).

info  Int32

C# Copy

INFO is INTEGER
= 0:  successful exit
< 0:  if INFO = -i, the i-th argument had an illegal value

Further Details:

The matrix Q is represented as a product of elementary reflectors
   Q = H(1)**H H(2)**H . . . H(k)**H, where k = min(m,n).
Each H(i) has the form
   H(i) = I - tau * v * v**H
where tau is a complex scalar, and v is a complex vector with
v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on
exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i).

Authors: Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver, NAG Ltd.

Date: November 2011

Reference