summaryrefslogtreecommitdiff
path: root/SRC/zgeqrt.f
diff options
context:
space:
mode:
authorHans Johnson <hans-johnson@uiowa.edu>2016-07-09 11:16:07 -0500
committerHans Johnson <hans-johnson@uiowa.edu>2016-07-09 11:19:34 -0500
commit9dafba6d415309f957edde1ce011e3ae646f9cbd (patch)
tree2780c80119923ba687cccb702356f5fa7a5075ce /SRC/zgeqrt.f
parent9c7f84bd600f53c59f89f16ad745e3be5cab2f07 (diff)
downloadlapack-9dafba6d415309f957edde1ce011e3ae646f9cbd.tar.gz
lapack-9dafba6d415309f957edde1ce011e3ae646f9cbd.tar.bz2
lapack-9dafba6d415309f957edde1ce011e3ae646f9cbd.zip
STYLE: Remove trailing whitespace in Fortran files
This is mostly a long term maintenance improvement. Many coding styles require elimination of trailing whitespace, and many editors and source code management configurations automatically gobble up whitespace. When these tools gobble up whitespace, it complicates reviewing the meaningful code changes. By removing whitespace on one patch, it makes future code reviews much easier. =SCRIPT==================================================================== if which tempfile &>/dev/null; then TEMPMAKER=tempfile elif which mktemp &>/dev/null; then TEMPMAKER=mktemp else echo "Cannot find tempfile program." 2>&1 exit 1 fi MYTEMP=$($TEMPMAKER) trap 'rm -f $MYTEMP' SIGINT SIGTERM stripit() { echo "stripping $1" sed 's/[ \t]*$//' "$1" > $MYTEMP cp $MYTEMP "$1" } if [ $# -gt 0 ]; then while [ "$1" != "" ]; do stripit $1 shift done else while read -t 2; do stripit $REPLY done fi rm $MYTEMP =================================================
Diffstat (limited to 'SRC/zgeqrt.f')
-rw-r--r--SRC/zgeqrt.f42
1 files changed, 21 insertions, 21 deletions
diff --git a/SRC/zgeqrt.f b/SRC/zgeqrt.f
index 0603c4fe..84dac16f 100644
--- a/SRC/zgeqrt.f
+++ b/SRC/zgeqrt.f
@@ -2,31 +2,31 @@
*
* =========== DOCUMENTATION ===========
*
-* Online html documentation available at
-* http://www.netlib.org/lapack/explore-html/
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
*
*> \htmlonly
-*> Download ZGEQRT + dependencies
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrt.f">
-*> [TGZ]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrt.f">
-*> [ZIP]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrt.f">
+*> Download ZGEQRT + dependencies
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrt.f">
+*> [TGZ]</a>
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrt.f">
+*> [ZIP]</a>
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrt.f">
*> [TXT]</a>
-*> \endhtmlonly
+*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE ZGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO )
-*
+*
* .. Scalar Arguments ..
* INTEGER INFO, LDA, LDT, M, N, NB
* ..
* .. Array Arguments ..
* COMPLEX*16 A( LDA, * ), T( LDT, * ), WORK( * )
* ..
-*
+*
*
*> \par Purpose:
* =============
@@ -34,7 +34,7 @@
*> \verbatim
*>
*> ZGEQRT computes a blocked QR factorization of a complex M-by-N matrix A
-*> using the compact WY representation of Q.
+*> using the compact WY representation of Q.
*> \endverbatim
*
* Arguments:
@@ -103,10 +103,10 @@
* Authors:
* ========
*
-*> \author Univ. of Tennessee
-*> \author Univ. of California Berkeley
-*> \author Univ. of Colorado Denver
-*> \author NAG Ltd.
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
*
*> \date November 2013
*
@@ -130,9 +130,9 @@
*> in the matrix A. The 1's along the diagonal of V are not stored in A.
*>
*> Let K=MIN(M,N). The number of blocks is B = ceiling(K/NB), where each
-*> block is of order NB except for the last block, which is of order
+*> block is of order NB except for the last block, which is of order
*> IB = K - (B-1)*NB. For each of the B blocks, a upper triangular block
-*> reflector factor is computed: T1, T2, ..., TB. The NB-by-NB (and IB-by-IB
+*> reflector factor is computed: T1, T2, ..., TB. The NB-by-NB (and IB-by-IB
*> for the last block) T's are stored in the NB-by-N matrix T as
*>
*> T = (T1 T2 ... TB).
@@ -194,7 +194,7 @@
*
DO I = 1, K, NB
IB = MIN( K-I+1, NB )
-*
+*
* Compute the QR factorization of the current block A(I:M,I:I+IB-1)
*
IF( USE_RECURSIVE_QR ) THEN
@@ -207,12 +207,12 @@
* Update by applying H**H to A(I:M,I+IB:N) from the left
*
CALL ZLARFB( 'L', 'C', 'F', 'C', M-I+1, N-I-IB+1, IB,
- $ A( I, I ), LDA, T( 1, I ), LDT,
+ $ A( I, I ), LDA, T( 1, I ), LDT,
$ A( I, I+IB ), LDA, WORK , N-I-IB+1 )
END IF
END DO
RETURN
-*
+*
* End of ZGEQRT
*
END