summaryrefslogtreecommitdiff
path: root/SRC/dlaqr4.f
diff options
context:
space:
mode:
authorjulie <julielangou@users.noreply.github.com>2011-09-30 18:34:50 +0000
committerjulie <julielangou@users.noreply.github.com>2011-09-30 18:34:50 +0000
commit13acf3d65eb8df4cb8df221509bf0178396dcff1 (patch)
treee3adc3e2fab395b82d4e1bc5111ad5a74afe4be3 /SRC/dlaqr4.f
parentd3718a28ef2fad11da862ba0782d39ce506d249f (diff)
downloadlapack-13acf3d65eb8df4cb8df221509bf0178396dcff1.tar.gz
lapack-13acf3d65eb8df4cb8df221509bf0178396dcff1.tar.bz2
lapack-13acf3d65eb8df4cb8df221509bf0178396dcff1.zip
Comments fix to be able to generate the new layout and the corresponding Doxygen documentation
Diffstat (limited to 'SRC/dlaqr4.f')
-rw-r--r--SRC/dlaqr4.f22
1 files changed, 13 insertions, 9 deletions
diff --git a/SRC/dlaqr4.f b/SRC/dlaqr4.f
index 31b77d1f..8a42623e 100644
--- a/SRC/dlaqr4.f
+++ b/SRC/dlaqr4.f
@@ -14,16 +14,16 @@
$ Z( LDZ, * )
* ..
*
-* This subroutine implements one level of recursion for DLAQR0.
+* Purpose
+* =======
+*
+* DLAQR4 implements one level of recursion for DLAQR0.
* It is a complete implementation of the small bulge multi-shift
* QR algorithm. It may be called by DLAQR0 and, for large enough
* deflation window size, it may be called by DLAQR3. This
* subroutine is identical to DLAQR0 except that it calls DLAQR2
* instead of DLAQR3.
*
-* Purpose
-* =======
-*
* DLAQR4 computes the eigenvalues of a Hessenberg matrix H
* and, optionally, the matrices T and Z from the Schur decomposition
* H = Z T Z**T, where T is an upper quasi-triangular matrix (the
@@ -34,8 +34,8 @@
* of a matrix A which has been reduced to the Hessenberg form H
* by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T.
*
-* Arguments
-* =========
+* Arguments
+* =========
*
* WANTT (input) LOGICAL
* = .TRUE. : the full Schur form T is required;
@@ -49,6 +49,7 @@
* The order of the matrix H. N .GE. 0.
*
* ILO (input) INTEGER
+*
* IHI (input) INTEGER
* It is assumed that H is already upper triangular in rows
* and columns 1:ILO-1 and IHI+1:N and, if ILO.GT.1,
@@ -78,6 +79,7 @@
* The leading dimension of the array H. LDH .GE. max(1,N).
*
* WR (output) DOUBLE PRECISION array, dimension (IHI)
+*
* WI (output) DOUBLE PRECISION array, dimension (IHI)
* The real and imaginary parts, respectively, of the computed
* eigenvalues of H(ILO:IHI,ILO:IHI) are stored in WR(ILO:IHI)
@@ -92,6 +94,7 @@
* WI(i+1) = -WI(i).
*
* ILOZ (input) INTEGER
+*
* IHIZ (input) INTEGER
* Specify the rows of Z to which transformations must be
* applied if WANTZ is .TRUE..
@@ -159,12 +162,13 @@
* If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
* accessed.
*
-* ================================================================
+* Further Details
+* ===============
+*
* Based on contributions by
* Karen Braman and Ralph Byers, Department of Mathematics,
* University of Kansas, USA
*
-* ================================================================
* References:
* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
* Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
@@ -175,7 +179,7 @@
* Algorithm Part II: Aggressive Early Deflation, SIAM Journal
* of Matrix Analysis, volume 23, pages 948--973, 2002.
*
-* ================================================================
+* ================================================================
* .. Parameters ..
*
* ==== Matrices of order NTINY or smaller must be processed by