aboutsummaryrefslogtreecommitdiff
path: root/SRC/cungrq.f
diff options
context:
space:
mode:
authorjulie <julielangou@users.noreply.github.com>2011-10-06 06:53:11 +0000
committerjulie <julielangou@users.noreply.github.com>2011-10-06 06:53:11 +0000
commite1d39294aee16fa6db9ba079b14442358217db71 (patch)
tree30e5aa04c1f6596991fda5334f63dfb9b8027849 /SRC/cungrq.f
parent5fe0466a14e395641f4f8a300ecc9dcb8058081b (diff)
Integrating Doxygen in comments
Diffstat (limited to 'SRC/cungrq.f')
-rw-r--r--SRC/cungrq.f170
1 files changed, 118 insertions, 52 deletions
diff --git a/SRC/cungrq.f b/SRC/cungrq.f
index 470d6f0c..a81004cb 100644
--- a/SRC/cungrq.f
+++ b/SRC/cungrq.f
@@ -1,71 +1,137 @@
- SUBROUTINE CUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
+*> \brief \b CUNGRQ
*
-* -- LAPACK routine (version 3.3.1) --
-* -- LAPACK is a software package provided by Univ. of Tennessee, --
-* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-* -- April 2011 --
+* =========== DOCUMENTATION ===========
*
-* .. Scalar Arguments ..
- INTEGER INFO, K, LDA, LWORK, M, N
-* ..
-* .. Array Arguments ..
- COMPLEX A( LDA, * ), TAU( * ), WORK( * )
-* ..
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
+*
+* Definition
+* ==========
*
+* SUBROUTINE CUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
+*
+* .. Scalar Arguments ..
+* INTEGER INFO, K, LDA, LWORK, M, N
+* ..
+* .. Array Arguments ..
+* COMPLEX A( LDA, * ), TAU( * ), WORK( * )
+* ..
+*
* Purpose
* =======
*
-* CUNGRQ generates an M-by-N complex matrix Q with orthonormal rows,
-* which is defined as the last M rows of a product of K elementary
-* reflectors of order N
-*
-* Q = H(1)**H H(2)**H . . . H(k)**H
-*
-* as returned by CGERQF.
+*>\details \b Purpose:
+*>\verbatim
+*>
+*> CUNGRQ generates an M-by-N complex matrix Q with orthonormal rows,
+*> which is defined as the last M rows of a product of K elementary
+*> reflectors of order N
+*>
+*> Q = H(1)**H H(2)**H . . . H(k)**H
+*>
+*> as returned by CGERQF.
+*>
+*>\endverbatim
*
* Arguments
* =========
*
-* M (input) INTEGER
-* The number of rows of the matrix Q. M >= 0.
-*
-* N (input) INTEGER
-* The number of columns of the matrix Q. N >= M.
-*
-* K (input) INTEGER
-* The number of elementary reflectors whose product defines the
-* matrix Q. M >= K >= 0.
-*
-* A (input/output) COMPLEX array, dimension (LDA,N)
-* On entry, the (m-k+i)-th row must contain the vector which
-* defines the elementary reflector H(i), for i = 1,2,...,k, as
-* returned by CGERQF in the last k rows of its array argument
-* A.
-* On exit, the M-by-N matrix Q.
+*> \param[in] M
+*> \verbatim
+*> M is INTEGER
+*> The number of rows of the matrix Q. M >= 0.
+*> \endverbatim
+*>
+*> \param[in] N
+*> \verbatim
+*> N is INTEGER
+*> The number of columns of the matrix Q. N >= M.
+*> \endverbatim
+*>
+*> \param[in] K
+*> \verbatim
+*> K is INTEGER
+*> The number of elementary reflectors whose product defines the
+*> matrix Q. M >= K >= 0.
+*> \endverbatim
+*>
+*> \param[in,out] A
+*> \verbatim
+*> A is COMPLEX array, dimension (LDA,N)
+*> On entry, the (m-k+i)-th row must contain the vector which
+*> defines the elementary reflector H(i), for i = 1,2,...,k, as
+*> returned by CGERQF in the last k rows of its array argument
+*> A.
+*> On exit, the M-by-N matrix Q.
+*> \endverbatim
+*>
+*> \param[in] LDA
+*> \verbatim
+*> LDA is INTEGER
+*> The first dimension of the array A. LDA >= max(1,M).
+*> \endverbatim
+*>
+*> \param[in] TAU
+*> \verbatim
+*> TAU is COMPLEX array, dimension (K)
+*> TAU(i) must contain the scalar factor of the elementary
+*> reflector H(i), as returned by CGERQF.
+*> \endverbatim
+*>
+*> \param[out] WORK
+*> \verbatim
+*> WORK is COMPLEX array, dimension (MAX(1,LWORK))
+*> On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*> \endverbatim
+*>
+*> \param[in] LWORK
+*> \verbatim
+*> LWORK is INTEGER
+*> The dimension of the array WORK. LWORK >= max(1,M).
+*> For optimum performance LWORK >= M*NB, where NB is the
+*> optimal blocksize.
+*> \endverbatim
+*> \verbatim
+*> If LWORK = -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 LWORK is issued by XERBLA.
+*> \endverbatim
+*>
+*> \param[out] INFO
+*> \verbatim
+*> INFO is INTEGER
+*> = 0: successful exit
+*> < 0: if INFO = -i, the i-th argument has an illegal value
+*> \endverbatim
+*>
+*
+* Authors
+* =======
*
-* LDA (input) INTEGER
-* The first dimension of the array A. LDA >= max(1,M).
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
*
-* TAU (input) COMPLEX array, dimension (K)
-* TAU(i) must contain the scalar factor of the elementary
-* reflector H(i), as returned by CGERQF.
+*> \date November 2011
*
-* WORK (workspace/output) COMPLEX array, dimension (MAX(1,LWORK))
-* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*> \ingroup complexOTHERcomputational
*
-* LWORK (input) INTEGER
-* The dimension of the array WORK. LWORK >= max(1,M).
-* For optimum performance LWORK >= M*NB, where NB is the
-* optimal blocksize.
+* =====================================================================
+ SUBROUTINE CUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
*
-* If LWORK = -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 LWORK is issued by XERBLA.
+* -- LAPACK computational routine (version 3.3.1) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2011
*
-* INFO (output) INTEGER
-* = 0: successful exit
-* < 0: if INFO = -i, the i-th argument has an illegal value
+* .. Scalar Arguments ..
+ INTEGER INFO, K, LDA, LWORK, M, N
+* ..
+* .. Array Arguments ..
+ COMPLEX A( LDA, * ), TAU( * ), WORK( * )
+* ..
*
* =====================================================================
*