stzrqf - routine is deprecated and has been replaced by routine STZRZF
SUBROUTINE STZRQF( M, N, A, LDA, TAU, INFO) INTEGER M, N, LDA, INFO REAL A(LDA,*), TAU(*)
SUBROUTINE STZRQF_64( M, N, A, LDA, TAU, INFO) INTEGER*8 M, N, LDA, INFO REAL A(LDA,*), TAU(*)
SUBROUTINE TZRQF( [M], [N], A, [LDA], TAU, [INFO]) INTEGER :: M, N, LDA, INFO REAL, DIMENSION(:) :: TAU REAL, DIMENSION(:,:) :: A
SUBROUTINE TZRQF_64( [M], [N], A, [LDA], TAU, [INFO]) INTEGER(8) :: M, N, LDA, INFO REAL, DIMENSION(:) :: TAU REAL, DIMENSION(:,:) :: A
#include <sunperf.h>
void stzrqf(int m, int n, float *a, int lda, float *tau, int *info);
void stzrqf_64(long m, long n, float *a, long lda, float *tau, long *info);
stzrqf routine is deprecated and has been replaced by routine STZRZF.
STZRQF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A to upper triangular form by means of orthogonal transformations.
The upper trapezoidal matrix A is factored as
A = ( R 0 ) * Z,
where Z is an N-by-N orthogonal matrix and R is an M-by-M upper triangular matrix.
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
The factorization is obtained by Householder's method. The kth transformation matrix, Z( k ), which is used to introduce zeros into the ( m - k + 1 )th row of A, is given in the form
Z( k ) = ( I 0 ),
( 0 T( k ) )
where
T( k ) = I - tau*u( k )*u( k )', u( k ) = ( 1 ), ( 0 ) ( z( k ) )
tau is a scalar and z( k ) is an ( n - m ) element vector. tau and z( k ) are chosen to annihilate the elements of the kth row of X.
The scalar tau is returned in the kth element of TAU and the vector u( k ) in the kth row of A, such that the elements of z( k ) are in a( k, m + 1 ), ..., a( k, n ). The elements of R are returned in the upper triangular part of A.
Z is given by
Z = Z( 1 ) * Z( 2 ) * ... * Z( m ).