sgerqf - compute an RQ factorization of a real M-by-N matrix A
SUBROUTINE SGERQF( M, N, A, LDA, TAU, WORK, LDWORK, INFO) INTEGER M, N, LDA, LDWORK, INFO REAL A(LDA,*), TAU(*), WORK(*)
SUBROUTINE SGERQF_64( M, N, A, LDA, TAU, WORK, LDWORK, INFO) INTEGER*8 M, N, LDA, LDWORK, INFO REAL A(LDA,*), TAU(*), WORK(*)
SUBROUTINE GERQF( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], [INFO]) INTEGER :: M, N, LDA, LDWORK, INFO REAL, DIMENSION(:) :: TAU, WORK REAL, DIMENSION(:,:) :: A
SUBROUTINE GERQF_64( [M], [N], A, [LDA], TAU, [WORK], [LDWORK], * [INFO]) INTEGER(8) :: M, N, LDA, LDWORK, INFO REAL, DIMENSION(:) :: TAU, WORK REAL, DIMENSION(:,:) :: A
#include <sunperf.h>
void sgerqf(int m, int n, float *a, int lda, float *tau, int *info);
void sgerqf_64(long m, long n, float *a, long lda, float *tau, long *info);
sgerqf computes an RQ factorization of a real M-by-N matrix A: A = R * Q.
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).
WORK(1)
returns the optimal LDWORK.
If LDWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LDWORK is issued by XERBLA.
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
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'
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).