dtpqrt.f (3)  Linux Manuals
NAME
dtpqrt.f 
SYNOPSIS
Functions/Subroutines
subroutine dtpqrt (M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK, INFO)
DTPQRT
Function/Subroutine Documentation
subroutine dtpqrt (integerM, integerN, integerL, integerNB, double precision, dimension( lda, * )A, integerLDA, double precision, dimension( ldb, * )B, integerLDB, double precision, dimension( ldt, * )T, integerLDT, double precision, dimension( * )WORK, integerINFO)
DTPQRT
Purpose:

DTPQRT computes a blocked QR factorization of a real "triangularpentagonal" matrix C, which is composed of a triangular block A and pentagonal block B, using the compact WY representation for Q.
Parameters:

M
M is INTEGER The number of rows of the matrix B. M >= 0.
NN is INTEGER The number of columns of the matrix B, and the order of the triangular matrix A. N >= 0.
LL is INTEGER The number of rows of the upper trapezoidal part of B. MIN(M,N) >= L >= 0. See Further Details.
NBNB is INTEGER The block size to be used in the blocked QR. N >= NB >= 1.
AA is DOUBLE PRECISION array, dimension (LDA,N) On entry, the upper triangular NbyN matrix A. On exit, the elements on and above the diagonal of the array contain the upper triangular matrix R.
LDALDA is INTEGER The leading dimension of the array A. LDA >= max(1,N).
BB is DOUBLE PRECISION array, dimension (LDB,N) On entry, the pentagonal MbyN matrix B. The first ML rows are rectangular, and the last L rows are upper trapezoidal. On exit, B contains the pentagonal matrix V. See Further Details.
LDBLDB is INTEGER The leading dimension of the array B. LDB >= max(1,M).
TT is DOUBLE PRECISION array, dimension (LDT,N) The upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks. See Further Details.
LDTLDT is INTEGER The leading dimension of the array T. LDT >= NB.
WORKWORK is DOUBLE PRECISION array, dimension (NB*N)
INFOINFO is INTEGER = 0: successful exit < 0: if INFO = i, the ith argument had an illegal value
Author:

Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date:
 April 2012
Further Details:

The input matrix C is a (N+M)byN matrix C = [ A ] [ B ] where A is an upper triangular NbyN matrix, and B is MbyN pentagonal matrix consisting of a (ML)byN rectangular matrix B1 on top of a LbyN upper trapezoidal matrix B2: B = [ B1 ] < (ML)byN rectangular [ B2 ] < LbyN upper trapezoidal. The upper trapezoidal matrix B2 consists of the first L rows of a NbyN upper triangular matrix, where 0 <= L <= MIN(M,N). If L=0, B is rectangular MbyN; if M=L=N, B is upper triangular. The matrix W stores the elementary reflectors H(i) in the ith column below the diagonal (of A) in the (N+M)byN input matrix C C = [ A ] < upper triangular NbyN [ B ] < MbyN pentagonal so that W can be represented as W = [ I ] < identity, NbyN [ V ] < MbyN, same form as B. Thus, all of information needed for W is contained on exit in B, which we call V above. Note that V has the same form as B; that is, V = [ V1 ] < (ML)byN rectangular [ V2 ] < LbyN upper trapezoidal. The columns of V represent the vectors which define the H(i)'s. The number of blocks is B = ceiling(N/NB), where each block is of order NB except for the last block, which is of order IB = N  (B1)*NB. For each of the B blocks, a upper triangular block reflector factor is computed: T1, T2, ..., TB. The NBbyNB (and IBbyIB for the last block) T's are stored in the NBbyN matrix T as T = [T1 T2 ... TB].
Definition at line 189 of file dtpqrt.f.
Author
Generated automatically by Doxygen for LAPACK from the source code.