diff options
| author | julie <julielangou@users.noreply.github.com> | 2011-11-03 20:32:56 +0000 |
|---|---|---|
| committer | julie <julielangou@users.noreply.github.com> | 2011-11-03 20:32:56 +0000 |
| commit | 1c3ba600671a59785b0c647d400226b4cc19a11f (patch) | |
| tree | 2af647fcff119db522016721e10b5ee7768d22bb /TESTING/EIG | |
| parent | d5c30c90bdecf38da1064e2ed52583634573e741 (diff) | |
| download | lapack-1c3ba600671a59785b0c647d400226b4cc19a11f.tar.gz lapack-1c3ba600671a59785b0c647d400226b4cc19a11f.tar.bz2 lapack-1c3ba600671a59785b0c647d400226b4cc19a11f.zip | |
Cosmetic changes in Doxygen presentation.
Use \par instead of \details for section.
add a Contributors Section and a Reference Section.
Remove (some) verbatim section when not needed.
Those changes have been done by hand so I am not sure I manage to catch them all.
Diffstat (limited to 'TESTING/EIG')
330 files changed, 3637 insertions, 4295 deletions
diff --git a/TESTING/EIG/alahdg.f b/TESTING/EIG/alahdg.f index 2befca1a..8f20a5ab 100644 --- a/TESTING/EIG/alahdg.f +++ b/TESTING/EIG/alahdg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALAHDG( IOUNIT, PATH ) * @@ -15,18 +15,17 @@ * INTEGER IOUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALAHDG prints header information for the different test paths. +*> \verbatim *> -*>\endverbatim +*> ALAHDG prints header information for the different test paths. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IOUNIT *> \verbatim @@ -47,10 +46,9 @@ *> GSV: Generalized Singular Value Decomposition *> CSD: CS Decomposition *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/alareq.f b/TESTING/EIG/alareq.f index fc29edcc..1c4afbfe 100644 --- a/TESTING/EIG/alareq.f +++ b/TESTING/EIG/alareq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT ) * @@ -18,11 +18,11 @@ * LOGICAL DOTYPE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ALAREQ handles input for the LAPACK test program. It is called *> to evaluate the input line which requested NMATS matrix types for @@ -34,11 +34,10 @@ *> Read the next input line for NMATS matrix types *> Set DOTYPE(I) = .TRUE. for each valid type I *> endif -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -75,10 +74,9 @@ *> NOUT is INTEGER *> The unit number for output. NOUT >= 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/alarqg.f b/TESTING/EIG/alarqg.f index 7aa1fc1c..ec2e53b5 100644 --- a/TESTING/EIG/alarqg.f +++ b/TESTING/EIG/alarqg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALARQG( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT ) * @@ -18,11 +18,11 @@ * LOGICAL DOTYPE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ALARQG handles input for the LAPACK test program. It is called *> to evaluate the input line which requested NMATS matrix types for @@ -34,11 +34,10 @@ *> Read the next input line for NMATS matrix types *> Set DOTYPE(I) = .TRUE. for each valid type I *> endif -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -75,10 +74,9 @@ *> NOUT is INTEGER *> The unit number for output. NOUT >= 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/alasmg.f b/TESTING/EIG/alasmg.f index e7face92..e31644cf 100644 --- a/TESTING/EIG/alasmg.f +++ b/TESTING/EIG/alasmg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALASMG( TYPE, NOUT, NFAIL, NRUN, NERRS ) * @@ -15,18 +15,17 @@ * INTEGER NFAIL, NOUT, NRUN, NERRS * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALASMG prints a summary of results from one of the -CHK- routines. +*> \verbatim *> -*>\endverbatim +*> ALASMG prints a summary of results from one of the -CHK- routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -58,10 +57,9 @@ *> NERRS is INTEGER *> The number of error messages recorded. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/alasum.f b/TESTING/EIG/alasum.f index 47c60f11..c0b759d2 100644 --- a/TESTING/EIG/alasum.f +++ b/TESTING/EIG/alasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALASUM( TYPE, NOUT, NFAIL, NRUN, NERRS ) * @@ -15,18 +15,17 @@ * INTEGER NFAIL, NOUT, NRUN, NERRS * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALASUM prints a summary of results from one of the -CHK- routines. +*> \verbatim *> -*>\endverbatim +*> ALASUM prints a summary of results from one of the -CHK- routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -58,10 +57,9 @@ *> NERRS is INTEGER *> The number of error messages recorded. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/alasvm.f b/TESTING/EIG/alasvm.f index b30db3d5..5658b63b 100644 --- a/TESTING/EIG/alasvm.f +++ b/TESTING/EIG/alasvm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALASVM( TYPE, NOUT, NFAIL, NRUN, NERRS ) * @@ -15,18 +15,17 @@ * INTEGER NFAIL, NOUT, NRUN, NERRS * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALASVM prints a summary of results from one of the -DRV- routines. +*> \verbatim *> -*>\endverbatim +*> ALASVM prints a summary of results from one of the -DRV- routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -58,10 +57,9 @@ *> NERRS is INTEGER *> The number of error messages recorded. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cbdt01.f b/TESTING/EIG/cbdt01.f index b5c21189..4929d683 100644 --- a/TESTING/EIG/cbdt01.f +++ b/TESTING/EIG/cbdt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, * RWORK, RESID ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CBDT01 reconstructs a general matrix A from its bidiagonal form *> A = Q * B * P' @@ -35,11 +35,10 @@ *> The test ratio to test the reduction is *> RESID = norm( A - Q * B * PT ) / ( n * norm(A) * EPS ) *> where PT = P' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -130,10 +129,9 @@ *> RESID is REAL *> The test ratio: norm(A - Q * B * P') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cbdt02.f b/TESTING/EIG/cbdt02.f index d0909ebd..9c011420 100644 --- a/TESTING/EIG/cbdt02.f +++ b/TESTING/EIG/cbdt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CBDT02( M, N, B, LDB, C, LDC, U, LDU, WORK, RWORK, * RESID ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CBDT02 tests the change of basis C = U' * B by computing the residual *> @@ -33,11 +33,10 @@ *> *> where B and C are M by N matrices, U is an M by M orthogonal matrix, *> and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,9 @@ *> RESID is REAL *> RESID = norm( B - U * C ) / ( max(m,n) * norm(B) * EPS ), *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cbdt03.f b/TESTING/EIG/cbdt03.f index ad26cf7d..09875c33 100644 --- a/TESTING/EIG/cbdt03.f +++ b/TESTING/EIG/cbdt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CBDT03( UPLO, N, KD, D, E, U, LDU, S, VT, LDVT, WORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX U( LDU, * ), VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CBDT03 reconstructs a bidiagonal matrix B from its SVD: *> S = U' * B * V @@ -34,11 +34,10 @@ *> The test ratio to test the singular value decomposition is *> RESID = norm( B - U * S * VT ) / ( n * norm(B) * EPS ) *> where VT = V' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> RESID is REAL *> The test ratio: norm(B - U * S * V') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkbb.f b/TESTING/EIG/cchkbb.f index 0f7cfbec..158b470e 100644 --- a/TESTING/EIG/cchkbb.f +++ b/TESTING/EIG/cchkbb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKBB( NSIZES, MVAL, NVAL, NWDTHS, KK, NTYPES, DOTYPE, * NRHS, ISEED, THRESH, NOUNIT, A, LDA, AB, LDAB, @@ -27,11 +27,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKBB tests the reduction of a general complex rectangular band *> matrix to real bidiagonal form. @@ -97,11 +97,10 @@ *> (13) Rectangular matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -343,10 +342,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkbd.f b/TESTING/EIG/cchkbd.f index 604a43a9..777b416c 100644 --- a/TESTING/EIG/cchkbd.f +++ b/TESTING/EIG/cchkbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKBD( NSIZES, MVAL, NVAL, NTYPES, DOTYPE, NRHS, * ISEED, THRESH, A, LDA, BD, BE, S1, S2, X, LDX, @@ -27,11 +27,11 @@ * $ X( LDX, * ), Y( LDX, * ), Z( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKBD checks the singular value decomposition (SVD) routines. *> @@ -152,11 +152,10 @@ *> *> A subset of the full set of matrix types may be selected through *> the logical array DOTYPE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -397,10 +396,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkbk.f b/TESTING/EIG/cchkbk.f index fdc7d83d..fa9da0c7 100644 --- a/TESTING/EIG/cchkbk.f +++ b/TESTING/EIG/cchkbk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKBK( NIN, NOUT ) * @@ -14,20 +14,19 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKBK tests CGEBAK, a routine for backward transformation of *> the computed right or left eigenvectors if the orginal matrix *> was preprocessed by balance subroutine CGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -40,10 +39,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkbl.f b/TESTING/EIG/cchkbl.f index ba05f916..d0f9b6c1 100644 --- a/TESTING/EIG/cchkbl.f +++ b/TESTING/EIG/cchkbl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKBL( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKBL tests CGEBAL, a routine for balancing a general complex *> matrix and isolating some of its eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkec.f b/TESTING/EIG/cchkec.f index 6ee67009..91ea17fb 100644 --- a/TESTING/EIG/cchkec.f +++ b/TESTING/EIG/cchkec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKEC( THRESH, TSTERR, NIN, NOUT ) * @@ -16,11 +16,11 @@ * REAL THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKEC tests eigen- condition estimation routines *> CTRSYL, CTREXC, CTRSNA, CTRSEN @@ -30,11 +30,10 @@ *> results to a threshold THRESH. In addition, CTRSNA and CTRSEN are *> tested by reading in precomputed examples from a file (on input unit *> NIN). Output is written to output unit NOUT. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -60,10 +59,9 @@ *> NOUT is INTEGER *> The logical unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkee.f b/TESTING/EIG/cchkee.f index 459397c8..2b65e1c9 100644 --- a/TESTING/EIG/cchkee.f +++ b/TESTING/EIG/cchkee.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM CCHKEE * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKEE tests the COMPLEX LAPACK subroutines for the matrix *> eigenvalue problem. The test paths in this version are @@ -1012,15 +1012,14 @@ *> precomputed examples, and LWORK = NMAX*(5*NMAX+20) in the parameter *> statements below. For SVD, we assume NRHS may be as big as N. The *> parameter NEED is set to 14 to allow for 14 N-by-N matrices for CGG. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -1031,8 +1030,7 @@ * *> \ingroup complex_eig * -* ===================================================================== - PROGRAM CCHKEE +* ===================================================================== PROGRAM CCHKEE * * -- LAPACK test routine (version 3.1.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/EIG/cchkgg.f b/TESTING/EIG/cchkgg.f index 6e04957b..75539fd6 100644 --- a/TESTING/EIG/cchkgg.f +++ b/TESTING/EIG/cchkgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * TSTDIF, THRSHN, NOUNIT, A, LDA, B, H, T, S1, @@ -32,11 +32,11 @@ * $ WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKGG checks the nonsymmetric generalized eigenvalue problem *> routines. @@ -216,11 +216,10 @@ *> *> (26) U ( T1, T2 ) V where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -484,10 +483,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkgk.f b/TESTING/EIG/cchkgk.f index 5d30e1d0..3d07d259 100644 --- a/TESTING/EIG/cchkgk.f +++ b/TESTING/EIG/cchkgk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKGK( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKGK tests CGGBAK, a routine for backward balancing of *> a matrix pair (A, B). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkgl.f b/TESTING/EIG/cchkgl.f index f3b47179..f8bfcdbd 100644 --- a/TESTING/EIG/cchkgl.f +++ b/TESTING/EIG/cchkgl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKGL( NIN, NOUT ) * @@ -14,18 +14,17 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKGL tests CGGBAL, a routine for balancing a matrix pair (A, B). +*> \verbatim *> -*>\endverbatim +*> CCHKGL tests CGGBAL, a routine for balancing a matrix pair (A, B). +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -38,10 +37,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkhb.f b/TESTING/EIG/cchkhb.f index 80e8b0af..cc54fae8 100644 --- a/TESTING/EIG/cchkhb.f +++ b/TESTING/EIG/cchkhb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKHB( NSIZES, NN, NWDTHS, KK, NTYPES, DOTYPE, ISEED, * THRESH, NOUNIT, A, LDA, SD, SE, U, LDU, WORK, @@ -24,11 +24,11 @@ * COMPLEX A( LDA, * ), U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKHB tests the reduction of a Hermitian band matrix to tridiagonal *> from, used with the Hermitian eigenvalue problem. @@ -93,11 +93,10 @@ *> (13) Hermitian matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -281,10 +280,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkhs.f b/TESTING/EIG/cchkhs.f index f931e7fe..cca9ab81 100644 --- a/TESTING/EIG/cchkhs.f +++ b/TESTING/EIG/cchkhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKHS( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, T1, T2, U, LDU, Z, UZ, W1, @@ -30,11 +30,11 @@ * $ WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKHS checks the nonsymmetric eigenvalue problem routines. *> @@ -165,11 +165,10 @@ *> (19) Nonsymmetric matrix with random entries chosen from |z| < 1 *> (20) Same as (19), but multiplied by SQRT( overflow threshold ) *> (21) Same as (19), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES - INTEGER @@ -393,10 +392,9 @@ *> KCONDS(j) Selects whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cchkst.f b/TESTING/EIG/cchkst.f index 90caf9d6..e5fca938 100644 --- a/TESTING/EIG/cchkst.f +++ b/TESTING/EIG/cchkst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, AP, SD, SE, D1, D2, D3, D4, D5, @@ -29,11 +29,11 @@ * $ V( LDU, * ), VP( * ), WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKST checks the Hermitian eigenvalue problem routines. *> @@ -244,11 +244,10 @@ *> (20) Same as (16), but multiplied by SQRT( underflow threshold ) *> (21) A diagonally dominant tridiagonal matrix with geometrically *> spaced diagonal entries 1, ..., ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -585,10 +584,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cckcsd.f b/TESTING/EIG/cckcsd.f index 04f25ef5..25853005 100644 --- a/TESTING/EIG/cckcsd.f +++ b/TESTING/EIG/cckcsd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCKCSD( NM, MVAL, PVAL, QVAL, NMATS, ISEED, THRESH, * MMAX, X, XF, U1, U2, V1T, V2T, THETA, IWORK, @@ -24,20 +24,19 @@ * $ WORK( * ), X( * ), XF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCKCSD tests CUNCSD: *> the CSD for an M-by-M unitary matrix X partitioned as *> [ X11 X12; X21 X22 ]. X11 is P-by-Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -167,10 +166,9 @@ *> > 0 : If CLAROR returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cckglm.f b/TESTING/EIG/cckglm.f index 7c248a8b..ca12b26a 100644 --- a/TESTING/EIG/cckglm.f +++ b/TESTING/EIG/cckglm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCKGLM( NN, NVAL, MVAL, PVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -23,19 +23,18 @@ * $ X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCKGLM tests CGGGLM - subroutine for solving generalized linear *> model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -151,10 +150,9 @@ *> > 0 : If CLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cckgqr.f b/TESTING/EIG/cckgqr.f index 83b8e272..ad14eedd 100644 --- a/TESTING/EIG/cckgqr.f +++ b/TESTING/EIG/cckgqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCKGQR( NM, MVAL, NP, PVAL, NN, NVAL, NMATS, ISEED, * THRESH, NMAX, A, AF, AQ, AR, TAUA, B, BF, BZ, @@ -24,20 +24,19 @@ * $ TAUB( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCKGQR tests *> CGGQRF: GQR factorization for N-by-M matrix A and N-by-P matrix B, *> CGGRQF: GRQ factorization for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -194,10 +193,9 @@ *> > 0 : If CLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cckgsv.f b/TESTING/EIG/cckgsv.f index 63306cad..15d07673 100644 --- a/TESTING/EIG/cckgsv.f +++ b/TESTING/EIG/cckgsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCKGSV( NM, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, U, V, Q, ALPHA, BETA, R, @@ -24,19 +24,18 @@ * $ R( * ), U( * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCKGSV tests CGGSVD: *> the GSVD for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -181,10 +180,9 @@ *> > 0 : If CLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ccklse.f b/TESTING/EIG/ccklse.f index 389113d3..d07c5225 100644 --- a/TESTING/EIG/ccklse.f +++ b/TESTING/EIG/ccklse.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCKLSE( NN, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -23,19 +23,18 @@ * $ X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCKLSE tests CGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -151,10 +150,9 @@ *> > 0 : If CLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ccsdts.f b/TESTING/EIG/ccsdts.f index 59a18d21..76002579 100644 --- a/TESTING/EIG/ccsdts.f +++ b/TESTING/EIG/ccsdts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCSDTS( M, P, Q, X, XF, LDX, U1, LDU1, U2, LDU2, V1T, * LDV1T, V2T, LDV2T, THETA, IWORK, WORK, LWORK, @@ -23,11 +23,11 @@ * $ XF( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCSDTS tests CUNCSD, which, given an M-by-M partitioned unitary *> matrix X, @@ -47,11 +47,10 @@ *> [ 0 0 0 | I 0 0 ] [ D21 D22 ] *> [ 0 S 0 | 0 C 0 ] *> [ 0 0 I | 0 0 0 ] -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,9 @@ *> = ULPINV otherwise. *> ( EPS2 = MAX( norm( I - X'*X ) / M, ULP ). ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrges.f b/TESTING/EIG/cdrges.f index 0f0a265a..0ac5cc36 100644 --- a/TESTING/EIG/cdrges.f +++ b/TESTING/EIG/cdrges.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRGES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, ALPHA, @@ -25,11 +25,11 @@ * $ T( LDA, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRGES checks the nonsymmetric generalized eigenvalue (Schur form) *> problem driver CGGES. @@ -182,11 +182,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -364,10 +363,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrgev.f b/TESTING/EIG/cdrgev.f index 15e872b7..c52238e1 100644 --- a/TESTING/EIG/cdrgev.f +++ b/TESTING/EIG/cdrgev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRGEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, QE, LDQE, @@ -28,11 +28,11 @@ * $ T( LDA, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRGEV checks the nonsymmetric generalized eigenvalue problem driver *> routine CGGEV. @@ -177,11 +177,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -381,10 +380,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrgsx.f b/TESTING/EIG/cdrgsx.f index c285195c..14204246 100644 --- a/TESTING/EIG/cdrgsx.f +++ b/TESTING/EIG/cdrgsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, * AI, BI, Z, Q, ALPHA, BETA, C, LDC, S, WORK, @@ -27,11 +27,11 @@ * $ Z( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRGSX checks the nonsymmetric generalized eigenvalue (Schur form) *> problem expert driver CGGESX. @@ -109,7 +109,7 @@ *> and DIF_l when testing the built-in test problems. *> *> Built-in Test Matrices -*> ====================== +* ====================== *> *> All built-in test matrices are the 2 by 2 block of triangular *> matrices @@ -168,11 +168,10 @@ *> | 1-d | *> and matrix B are chosen as identity matrices (see SLATM5). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -332,10 +331,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrgvx.f b/TESTING/EIG/cdrgvx.f index 77bb5aa5..e59af941 100644 --- a/TESTING/EIG/cdrgvx.f +++ b/TESTING/EIG/cdrgvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRGVX( NSIZE, THRESH, NIN, NOUT, A, LDA, B, AI, BI, * ALPHA, BETA, VL, VR, ILO, IHI, LSCALE, RSCALE, @@ -29,11 +29,11 @@ * $ VL( LDA, * ), VR( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRGVX checks the nonsymmetric generalized eigenvalue problem *> expert driver CGGEVX. @@ -99,11 +99,10 @@ *> *> a, b, x and y will have all values independently of each other from *> { sqrt(sqrt(ULP)), 0.1, 1, 10, 1/sqrt(sqrt(ULP)) }. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -280,10 +279,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvbd.f b/TESTING/EIG/cdrvbd.f index 56204768..81528c1a 100644 --- a/TESTING/EIG/cdrvbd.f +++ b/TESTING/EIG/cdrvbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVBD( NSIZES, MM, NN, NTYPES, DOTYPE, ISEED, THRESH, * A, LDA, U, LDU, VT, LDVT, ASAV, USAV, VTSAV, S, @@ -27,11 +27,11 @@ * $ VTSAV( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVBD checks the singular value decomposition (SVD) driver CGESVD *> and CGESDD. @@ -105,11 +105,10 @@ *> on the diagonal. *> (4) Same as (3), but multiplied by the underflow-threshold / ULP. *> (5) Same as (3), but multiplied by the overflow-threshold * ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -313,10 +312,9 @@ *> If CLATMS, or CGESVD returns an error code, the *> absolute value of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrves.f b/TESTING/EIG/cdrves.f index 11bf31da..018ca409 100644 --- a/TESTING/EIG/cdrves.f +++ b/TESTING/EIG/cdrves.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, HT, W, WT, VS, LDVS, RESULT, @@ -24,11 +24,11 @@ * $ VS( LDVS, * ), W( * ), WORK( * ), WT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVES checks the nonsymmetric eigenvalue (Schur form) problem *> driver CGEES. @@ -161,11 +161,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -361,10 +360,9 @@ *> KCONDS(j) Select whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvev.f b/TESTING/EIG/cdrvev.f index 7ac5cade..5918896c 100644 --- a/TESTING/EIG/cdrvev.f +++ b/TESTING/EIG/cdrvev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, W, W1, VL, LDVL, VR, LDVR, @@ -27,11 +27,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVEV checks the nonsymmetric eigenvalue problem driver CGEEV. *> @@ -153,11 +153,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -373,10 +372,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvgg.f b/TESTING/EIG/cdrvgg.f index ebe3f9a3..141054a2 100644 --- a/TESTING/EIG/cdrvgg.f +++ b/TESTING/EIG/cdrvgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * THRSHN, NOUNIT, A, LDA, B, S, T, S2, T2, Q, @@ -19,11 +19,11 @@ * .. * .. Array Arguments .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVGG checks the nonsymmetric generalized eigenvalue driver *> routines. @@ -168,11 +168,10 @@ *> *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -404,10 +403,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvsg.f b/TESTING/EIG/cdrvsg.f index daac3882..0b69657d 100644 --- a/TESTING/EIG/cdrvsg.f +++ b/TESTING/EIG/cdrvsg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVSG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, LDB, D, Z, LDZ, AB, BB, AP, @@ -27,11 +27,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVSG checks the complex Hermitian generalized eigenproblem *> drivers. @@ -161,11 +161,10 @@ *> (19) Same as (8), but with KA = 3 and KB = 1 *> (20) Same as (8), but with KA = 3 and KB = 2 *> (21) Same as (8), but with KA = 3 and KB = 3 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -352,10 +351,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvst.f b/TESTING/EIG/cdrvst.f index 94949b38..8f2fad95 100644 --- a/TESTING/EIG/cdrvst.f +++ b/TESTING/EIG/cdrvst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, D1, D2, D3, WA1, WA2, WA3, U, @@ -27,11 +27,11 @@ * $ V( LDU, * ), WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVST checks the Hermitian eigenvalue problem drivers. *> @@ -130,11 +130,10 @@ *> with random signs. *> (17) Same as (16), but multiplied by SQRT( overflow threshold ) *> (18) Same as (16), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -320,10 +319,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvsx.f b/TESTING/EIG/cdrvsx.f index 659c26f9..3d4a8cad 100644 --- a/TESTING/EIG/cdrvsx.f +++ b/TESTING/EIG/cdrvsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVSX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, HT, W, WT, WTMP, VS, @@ -27,11 +27,11 @@ * $ WORK( * ), WT( * ), WTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVSX checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver CGEESX. @@ -206,11 +206,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -417,10 +416,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cdrvvx.f b/TESTING/EIG/cdrvvx.f index 7aa0ce03..37e6edce 100644 --- a/TESTING/EIG/cdrvvx.f +++ b/TESTING/EIG/cdrvvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVVX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, W, W1, VL, LDVL, VR, @@ -31,11 +31,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVVX checks the nonsymmetric eigenvalue problem expert driver *> CGEEVX. @@ -202,11 +202,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -477,10 +476,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cerrbd.f b/TESTING/EIG/cerrbd.f index 8563c61d..f1d71f8e 100644 --- a/TESTING/EIG/cerrbd.f +++ b/TESTING/EIG/cerrbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRBD( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CERRBD tests the error exits for CGEBRD, CUNGBR, CUNMBR, and CBDSQR. +*> \verbatim *> -*>\endverbatim +*> CERRBD tests the error exits for CGEBRD, CUNGBR, CUNMBR, and CBDSQR. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -39,10 +38,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cerrec.f b/TESTING/EIG/cerrec.f index 85eba2e2..6b1a1344 100644 --- a/TESTING/EIG/cerrec.f +++ b/TESTING/EIG/cerrec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERREC( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERREC tests the error exits for the routines for eigen- condition *> estimation for REAL matrices: *> CTRSYL, CTREXC, CTRSNA and CTRSEN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cerred.f b/TESTING/EIG/cerred.f index 48c6ab96..add9233f 100644 --- a/TESTING/EIG/cerred.f +++ b/TESTING/EIG/cerred.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRED( PATH, NUNIT ) * @@ -15,11 +15,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRED tests the error exits for the eigenvalue driver routines for *> REAL matrices: @@ -33,11 +33,10 @@ *> CBD CGESVD compute SVD of an M-by-N matrix A *> CGESDD compute SVD of an M-by-N matrix A(by divide and *> conquer) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -50,10 +49,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cerrgg.f b/TESTING/EIG/cerrgg.f index 35157021..8644d5d0 100644 --- a/TESTING/EIG/cerrgg.f +++ b/TESTING/EIG/cerrgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRGG( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRGG tests the error exits for CGGES, CGGESX, CGGEV, CGGEVX, *> CGGGLM, CGGHRD, CGGLSE, CGGQRF, CGGRQF, CGGSVD, CGGSVP, CHGEQZ, *> CTGEVC, CTGEXC, CTGSEN, CTGSJA, CTGSNA, CTGSYL and CUNCSD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cerrhs.f b/TESTING/EIG/cerrhs.f index cc3bf60b..b2ebbc0d 100644 --- a/TESTING/EIG/cerrhs.f +++ b/TESTING/EIG/cerrhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRHS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRHS tests the error exits for CGEBAK, CGEBAL, CGEHRD, CUNGHR, *> CUNMHR, CHSEQR, CHSEIN, and CTREVC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -40,10 +39,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cerrst.f b/TESTING/EIG/cerrst.f index 58552bcc..114686ca 100644 --- a/TESTING/EIG/cerrst.f +++ b/TESTING/EIG/cerrst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRST( PATH, NUNIT ) * @@ -15,21 +15,20 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRST tests the error exits for CHETRD, CUNGTR, CUNMTR, CHPTRD, *> CUNGTR, CUPMTR, CSTEQR, CSTEIN, CPTEQR, CHBTRD, *> CHEEV, CHEEVX, CHEEVD, CHBEV, CHBEVX, CHBEVD, *> CHPEV, CHPEVX, CHPEVD, and CSTEDC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -42,10 +41,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget02.f b/TESTING/EIG/cget02.f index 98beaad5..d000f9fd 100644 --- a/TESTING/EIG/cget02.f +++ b/TESTING/EIG/cget02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET02( TRANS, M, N, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * COMPLEX A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET02 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -117,10 +116,9 @@ *> The maximum over the number of right hand sides of *> norm(B - A*X) / ( norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget10.f b/TESTING/EIG/cget10.f index 59c9dc3c..34890d37 100644 --- a/TESTING/EIG/cget10.f +++ b/TESTING/EIG/cget10.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET10( M, N, A, LDA, B, LDB, WORK, RWORK, RESULT ) * @@ -19,19 +19,18 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET10 compares two matrices A and B and computes the ratio *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -84,10 +83,9 @@ *> RESULT is REAL *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget22.f b/TESTING/EIG/cget22.f index 267045e1..347e5f8e 100644 --- a/TESTING/EIG/cget22.f +++ b/TESTING/EIG/cget22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET22( TRANSA, TRANSE, TRANSW, N, A, LDA, E, LDE, W, * WORK, RWORK, RESULT ) @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), E( LDE, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET22 does an eigenvector check. *> @@ -40,11 +40,10 @@ *> where E(j) is the j-th eigenvector, and m-norm is the max-norm of a *> vector. The max-norm of a complex n-vector x in this case is the *> maximum of |re(x(i)| + |im(x(i)| over i = 1, ..., n. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -128,8 +127,8 @@ *> RESULT(2) = max | m-norm(E(j)) - 1 | / ( n ulp ) *> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget23.f b/TESTING/EIG/cget23.f index ea8da36f..a3ac53cf 100644 --- a/TESTING/EIG/cget23.f +++ b/TESTING/EIG/cget23.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET23( COMP, ISRT, BALANC, JTYPE, THRESH, ISEED, * NOUNIT, N, A, LDA, H, W, W1, VL, LDVL, VR, @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET23 checks the nonsymmetric eigenvalue problem driver CGEEVX. *> If COMP = .FALSE., the first 8 of the following tests will be @@ -113,11 +113,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -349,10 +348,9 @@ *> If >0, CGEEVX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget24.f b/TESTING/EIG/cget24.f index ee604fcb..326efbd4 100644 --- a/TESTING/EIG/cget24.f +++ b/TESTING/EIG/cget24.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET24( COMP, JTYPE, THRESH, ISEED, NOUNIT, N, A, LDA, * H, HT, W, WT, WTMP, VS, LDVS, VS1, RCDEIN, @@ -28,11 +28,11 @@ * $ WORK( * ), WT( * ), WTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET24 checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver CGEESX. @@ -118,11 +118,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -317,10 +316,9 @@ *> If >0, CGEESX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget35.f b/TESTING/EIG/cget35.f index c1cde658..b043ef35 100644 --- a/TESTING/EIG/cget35.f +++ b/TESTING/EIG/cget35.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET35( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -15,11 +15,11 @@ * REAL RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET35 tests CTRSYL, a routine for solving the Sylvester matrix *> equation @@ -34,11 +34,10 @@ *> *> norm(op(A)*X + ISGN*X*op(B) - scale*C) / *> (EPS*max(norm(A),norm(B))*norm(X)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -69,10 +68,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget36.f b/TESTING/EIG/cget36.f index 969ac57b..9db39c2c 100644 --- a/TESTING/EIG/cget36.f +++ b/TESTING/EIG/cget36.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET36( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -15,11 +15,11 @@ * REAL RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET36 tests CTREXC, a routine for reordering diagonal entries of a *> matrix in complex Schur form. Thus, CLAEXC computes a unitary matrix @@ -35,11 +35,10 @@ *> ILST. *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -70,10 +69,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget37.f b/TESTING/EIG/cget37.f index 94e1a476..ce223c62 100644 --- a/TESTING/EIG/cget37.f +++ b/TESTING/EIG/cget37.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET37( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * REAL RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET37 tests CTRSNA, a routine for estimating condition numbers of *> eigenvalues and/or right eigenvectors of a matrix. *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -75,10 +74,9 @@ *> NIN is INTEGER *> Input logical unit number *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget38.f b/TESTING/EIG/cget38.f index 54697ff7..e866bd69 100644 --- a/TESTING/EIG/cget38.f +++ b/TESTING/EIG/cget38.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET38( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * REAL RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET38 tests CTRSEN, a routine for estimating condition numbers of a *> cluster of eigenvalues and/or its associated right invariant subspace *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -76,10 +75,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget51.f b/TESTING/EIG/cget51.f index 99201d51..7c2c8d04 100644 --- a/TESTING/EIG/cget51.f +++ b/TESTING/EIG/cget51.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET51( ITYPE, N, A, LDA, B, LDB, U, LDU, V, LDV, WORK, * RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET51 generally checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> If ITYPE=3, then: *> *> RESULT = | I - UU* | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -138,10 +137,9 @@ *> value is currently limited to 1/ulp, to avoid overflow. *> Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget52.f b/TESTING/EIG/cget52.f index f2670311..67364e4e 100644 --- a/TESTING/EIG/cget52.f +++ b/TESTING/EIG/cget52.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET52( LEFT, N, A, LDA, B, LDB, E, LDE, ALPHA, BETA, * WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ BETA( * ), E( LDE, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET52 does an eigenvector check for the generalized eigenvalue *> problem. @@ -53,11 +53,10 @@ *> *> RESULT(2) = max | M(v(i)) - 1 | / ( n ulp ) *> eigenvectors v(i) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LEFT *> \verbatim @@ -145,10 +144,9 @@ *> B E is likely to overflow, then RESULT(1:2) is set to *> 10 / ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cget54.f b/TESTING/EIG/cget54.f index 724126b1..6c4da404 100644 --- a/TESTING/EIG/cget54.f +++ b/TESTING/EIG/cget54.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET54( N, A, LDA, B, LDB, S, LDS, T, LDT, U, LDU, V, * LDV, WORK, RESULT ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET54 checks a generalized decomposition of the form *> @@ -36,11 +36,10 @@ *> Specifically, *> *> RESULT = ||( A - U*S*V', B - U*T*V' )|| / (||( A, B )||*n*ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -140,10 +139,9 @@ *> The value RESULT, It is currently limited to 1/ulp, to *> avoid overflow. Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cglmts.f b/TESTING/EIG/cglmts.f index f3595285..d87bc860 100644 --- a/TESTING/EIG/cglmts.f +++ b/TESTING/EIG/cglmts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGLMTS( N, M, P, A, AF, LDA, B, BF, LDB, D, DF, * X, U, WORK, LWORK, RWORK, RESULT ) @@ -21,19 +21,18 @@ * $ BF( LDB, * ), D( * ), DF( * ), U( * ), * $ WORK( LWORK ), X( * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGLMTS tests CGGGLM - a subroutine for solving the generalized *> linear model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -134,10 +133,9 @@ *> RESULT = ----------------------------------------- *> (norm(A)+norm(B))*(norm(x)+norm(u))*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cgqrts.f b/TESTING/EIG/cgqrts.f index 74573478..c5d0f5af 100644 --- a/TESTING/EIG/cgqrts.f +++ b/TESTING/EIG/cgqrts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGQRTS( N, M, P, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ TAUA( * ), TAUB( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGQRTS tests CGGQRF, which computes the GQR factorization of an *> N-by-M matrix A and a N-by-P matrix B: A = Q*R and B = Q*T*Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( M*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cgrqts.f b/TESTING/EIG/cgrqts.f index 69004f03..ad4233e6 100644 --- a/TESTING/EIG/cgrqts.f +++ b/TESTING/EIG/cgrqts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGRQTS( M, P, N, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ TAUA( * ), TAUB( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGRQTS tests CGGRQF, which computes the GRQ factorization of an *> M-by-N matrix A and a P-by-N matrix B: A = R*Q and B = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( N*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cgsvts.f b/TESTING/EIG/cgsvts.f index b981bad7..6799f6d7 100644 --- a/TESTING/EIG/cgsvts.f +++ b/TESTING/EIG/cgsvts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGSVTS( M, P, N, A, AF, LDA, B, BF, LDB, U, LDU, V, * LDV, Q, LDQ, ALPHA, BETA, R, LDR, IWORK, WORK, @@ -23,20 +23,19 @@ * $ U( LDU, * ), V( LDV, * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGSVTS tests CGGSVD, which computes the GSVD of an M-by-N matrix A *> and a P-by-N matrix B: *> U'*A*Q = D1*R and V'*B*Q = D2*R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -192,10 +191,9 @@ *> RESULT(6) = 0 if ALPHA is in decreasing order; *> = ULPINV otherwise. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/chbt21.f b/TESTING/EIG/chbt21.f index 34fc099e..5d1aae21 100644 --- a/TESTING/EIG/chbt21.f +++ b/TESTING/EIG/chbt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBT21( UPLO, N, KA, KS, A, LDA, D, E, U, LDU, WORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBT21 generally checks a decomposition of the form *> @@ -36,11 +36,10 @@ *> Specifically: *> *> RESULT(1) = | A - U S U* | / ( |A| n ulp ) *andC> RESULT(2) = | I - UU* | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -134,10 +133,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/chet21.f b/TESTING/EIG/chet21.f index c5b0f054..1dc68f35 100644 --- a/TESTING/EIG/chet21.f +++ b/TESTING/EIG/chet21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHET21( ITYPE, UPLO, N, KBAND, A, LDA, D, E, U, LDU, V, * LDV, TAU, WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHET21 generally checks a decomposition of the form *> @@ -56,11 +56,10 @@ *> V = H(1)...H(n-2), where H(j) = I - tau(j) v(j) v(j)C> and each *> vector v(j) has its first j elements 0 and the remaining n-j elements *> stored in V(j+1:n,j). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -195,10 +194,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/chet22.f b/TESTING/EIG/chet22.f index b6e5b495..993cab13 100644 --- a/TESTING/EIG/chet22.f +++ b/TESTING/EIG/chet22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHET22( ITYPE, UPLO, N, M, KBAND, A, LDA, D, E, U, LDU, * V, LDV, TAU, WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHET22 generally checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> Specifically, if ITYPE=1, then: *> *> RESULT(1) = | U' A U - S | / ( |A| m ulp ) *andC> RESULT(2) = | I - U'U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> ITYPE INTEGER @@ -143,10 +142,9 @@ *> if LDU is at least N. *> Modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/chkxer.f b/TESTING/EIG/chkxer.f index 15bc8b3b..3cfa4d80 100644 --- a/TESTING/EIG/chkxer.f +++ b/TESTING/EIG/chkxer.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHKXER( SRNAMT, INFOT, NOUT, LERR, OK ) * @@ -15,19 +15,19 @@ * CHARACTER*(*) SRNAMT * INTEGER INFOT, NOUT * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*>\endverbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/chpt21.f b/TESTING/EIG/chpt21.f index 9ad6d7c6..6a24de65 100644 --- a/TESTING/EIG/chpt21.f +++ b/TESTING/EIG/chpt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPT21( ITYPE, UPLO, N, KBAND, AP, D, E, U, LDU, VP, * TAU, WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPT21 generally checks a decomposition of the form *> @@ -81,11 +81,10 @@ *> and the first j elements of v(j) are 0, the (j+1)-st is 1, and the *> (j+2)-nd through n-th elements are stored in V(j+2:n,j) (i.e., *> in VP( (2*n-j)*(j-1)/2 + j+2 : (2*n-j)*(j-1)/2 + n ) .) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -207,10 +206,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/chst01.f b/TESTING/EIG/chst01.f index a007da90..9d016f66 100644 --- a/TESTING/EIG/chst01.f +++ b/TESTING/EIG/chst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHST01( N, ILO, IHI, A, LDA, H, LDH, Q, LDQ, WORK, * LWORK, RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHST01 tests the reduction of a general matrix A to upper Hessenberg *> form: A = Q*H*Q'. Two test ratios are computed; @@ -37,11 +37,10 @@ *> *> In this version, ILO and IHI are not used, but they could be used *> to save some work if this is desired. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -124,10 +123,9 @@ *> RESULT(1) = norm( A - Q*H*Q' ) / ( norm(A) * N * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( N * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/clarfy.f b/TESTING/EIG/clarfy.f index 29a0e8f9..509157fc 100644 --- a/TESTING/EIG/clarfy.f +++ b/TESTING/EIG/clarfy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARFY( UPLO, N, V, INCV, TAU, C, LDC, WORK ) * @@ -19,11 +19,11 @@ * COMPLEX C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARFY applies an elementary reflector, or Householder matrix, H, *> to an n x n Hermitian matrix C, from both the left and the right. @@ -35,11 +35,10 @@ *> where tau is a scalar and v is a vector. *> *> If tau is zero, then H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/clarhs.f b/TESTING/EIG/clarhs.f index d7fb11bf..f62c7fda 100644 --- a/TESTING/EIG/clarhs.f +++ b/TESTING/EIG/clarhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARHS( PATH, XTYPE, UPLO, TRANS, M, N, KL, KU, NRHS, * A, LDA, X, LDX, B, LDB, ISEED, INFO ) @@ -21,22 +21,21 @@ * COMPLEX A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARHS chooses a set of NRHS random solution vectors and sets *> up the right hand sides for the linear system *> op( A ) * X = B, *> where op( A ) may be A, A**T (transpose of A), or A**H (conjugate *> transpose of A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -193,10 +192,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/clatm4.f b/TESTING/EIG/clatm4.f index c4a39940..0d6a1d16 100644 --- a/TESTING/EIG/clatm4.f +++ b/TESTING/EIG/clatm4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATM4( ITYPE, N, NZ1, NZ2, RSIGN, AMAGN, RCOND, * TRIANG, IDIST, ISEED, A, LDA ) @@ -21,11 +21,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATM4 generates basic square matrices, which may later be *> multiplied by others in order to produce test matrices. It is @@ -36,11 +36,10 @@ *> according to the value of ITYPE, NZ1, NZ2, RSIGN, AMAGN, and RCOND. *> It then fills in the upper triangle with random numbers, if TRIANG is *> non-zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -155,10 +154,9 @@ *> LDA is INTEGER *> Leading dimension of A. Must be at least 1 and at least N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/clctes.f b/TESTING/EIG/clctes.f index baa72da5..40f8ae28 100644 --- a/TESTING/EIG/clctes.f +++ b/TESTING/EIG/clctes.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION CLCTES( Z, D ) * @@ -14,11 +14,11 @@ * COMPLEX D, Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLCTES returns .TRUE. if the eigenvalue Z/D is to be selected *> (specifically, in this subroutine, if the real part of the @@ -26,11 +26,10 @@ *> *> It is used by the test routine CDRGES to test whether the driver *> routine CGGES succesfully sorts eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] Z *> \verbatim @@ -43,10 +42,9 @@ *> D is COMPLEX *> The denominator part of a complex eigenvalue Z/D. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/clctsx.f b/TESTING/EIG/clctsx.f index 01ed84f7..815b655e 100644 --- a/TESTING/EIG/clctsx.f +++ b/TESTING/EIG/clctsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION CLCTSX( ALPHA, BETA ) * @@ -14,21 +14,20 @@ * COMPLEX ALPHA, BETA * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This function is used to determine what eigenvalues will be *> selected. If this is part of the test driver CDRGSX, do not *> change the code UNLESS you are testing input examples and not *> using the built-in examples. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ALPHA *> \verbatim @@ -42,10 +41,9 @@ *> parameters to decide whether the pair (ALPHA, BETA) is *> selected. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/clsets.f b/TESTING/EIG/clsets.f index dc7f74f3..7e17aac7 100644 --- a/TESTING/EIG/clsets.f +++ b/TESTING/EIG/clsets.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLSETS( M, P, N, A, AF, LDA, B, BF, LDB, C, CF, * D, DF, X, WORK, LWORK, RWORK, RESULT ) @@ -20,19 +20,18 @@ * $ BF( LDB, * ), C( * ), D( * ), CF( * ), * $ DF( * ), WORK( LWORK ), X( * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLSETS tests CGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -139,10 +138,9 @@ *> RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS *> RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/csbmv.f b/TESTING/EIG/csbmv.f index 5cfff04f..9a70bb61 100644 --- a/TESTING/EIG/csbmv.f +++ b/TESTING/EIG/csbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSBMV( UPLO, N, K, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSBMV performs the matrix-vector operation *> @@ -32,11 +32,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric band matrix, with k super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -136,10 +135,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/csgt01.f b/TESTING/EIG/csgt01.f index c1a52a99..6cabeaee 100644 --- a/TESTING/EIG/csgt01.f +++ b/TESTING/EIG/csgt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSGT01( ITYPE, UPLO, N, M, A, LDA, B, LDB, Z, LDZ, D, * WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSGT01 checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> ITYPE = 2: RESULT(1) = | A B Z - Z D | / ( |A| |Z| n ulp ) *> *> ITYPE = 3: RESULT(1) = | B A Z - Z D | / ( |A| |Z| n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -136,10 +135,9 @@ *> RESULT is REAL array, dimension (1) *> The test ratio as described above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cslect.f b/TESTING/EIG/cslect.f index 649bc1d5..f040cf9c 100644 --- a/TESTING/EIG/cslect.f +++ b/TESTING/EIG/cslect.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION CSLECT( Z ) * @@ -14,11 +14,11 @@ * COMPLEX Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSLECT returns .TRUE. if the eigenvalue Z is to be selected, *> otherwise it returns .FALSE. @@ -30,21 +30,19 @@ *> zero, and .FALSE. otherwise. *> If SELOPT is at least 1, CSLECT returns SELVAL(SELOPT) and adds 1 *> to SELOPT, cycling back to 1 at SELMAX. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] Z *> \verbatim *> Z is COMPLEX *> The eigenvalue Z. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cstt21.f b/TESTING/EIG/cstt21.f index de7160c8..6d1f67f4 100644 --- a/TESTING/EIG/cstt21.f +++ b/TESTING/EIG/cstt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTT21( N, KBAND, AD, AE, SD, SE, U, LDU, WORK, RWORK, * RESULT ) @@ -20,11 +20,11 @@ * COMPLEX U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTT21 checks a decomposition of the form *> @@ -36,11 +36,10 @@ *> RESULT(1) = | A - U S U* | / ( |A| n ulp ) *> *> RESULT(2) = | I - UU* | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -116,10 +115,9 @@ *> values are currently limited to 1/ulp, to avoid overflow. *> RESULT(1) is always modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cstt22.f b/TESTING/EIG/cstt22.f index 5dbbe63b..e495692a 100644 --- a/TESTING/EIG/cstt22.f +++ b/TESTING/EIG/cstt22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTT22( N, M, KBAND, AD, AE, SD, SE, U, LDU, WORK, * LDWORK, RWORK, RESULT ) @@ -20,11 +20,11 @@ * COMPLEX U( LDU, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTT22 checks a set of M eigenvalues and eigenvectors, *> @@ -37,11 +37,10 @@ *> RESULT(1) = | U* A U - S | / ( |A| m ulp ) *> *> RESULT(2) = | I - U*U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -129,10 +128,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cunt01.f b/TESTING/EIG/cunt01.f index f7f15645..aa1a5d5b 100644 --- a/TESTING/EIG/cunt01.f +++ b/TESTING/EIG/cunt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNT01( ROWCOL, M, N, U, LDU, WORK, LWORK, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNT01 checks that the matrix U is unitary by computing the ratio *> @@ -43,11 +43,10 @@ *> where EPS is the machine precision. ROWCOL is used only if m = n; *> if m > n, ROWCOL is assumed to be 'C', and if m < n, ROWCOL is *> assumed to be 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ROWCOL *> \verbatim @@ -110,10 +109,9 @@ *> RESID = norm( I - U * U' ) / ( n * EPS ), if ROWCOL = 'R', or *> RESID = norm( I - U' * U ) / ( m * EPS ), if ROWCOL = 'C'. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/cunt03.f b/TESTING/EIG/cunt03.f index 678fdc2e..fc4660fe 100644 --- a/TESTING/EIG/cunt03.f +++ b/TESTING/EIG/cunt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNT03( RC, MU, MV, N, K, U, LDU, V, LDV, WORK, LWORK, * RWORK, RESULT, INFO ) @@ -21,11 +21,11 @@ * COMPLEX U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNT03 compares two unitary matrices U and V to see if their *> corresponding rows or columns span the same spaces. The rows are @@ -43,11 +43,10 @@ *> *> where abs(S) = 1 (chosen to minimize the expression), U(i) is the *> i-th row (column) of U, and V(i) is the i-th row (column) of V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RC *> \verbatim @@ -146,10 +145,9 @@ *> 0 indicates a successful exit *> -k indicates the k-th parameter had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dbdt01.f b/TESTING/EIG/dbdt01.f index 7850a1a7..d425b382 100644 --- a/TESTING/EIG/dbdt01.f +++ b/TESTING/EIG/dbdt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, * RESID ) @@ -20,11 +20,11 @@ * $ Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DBDT01 reconstructs a general matrix A from its bidiagonal form *> A = Q * B * P' @@ -34,11 +34,10 @@ *> The test ratio to test the reduction is *> RESID = norm( A - Q * B * PT ) / ( n * norm(A) * EPS ) *> where PT = P' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,9 @@ *> RESID is DOUBLE PRECISION *> The test ratio: norm(A - Q * B * P') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dbdt02.f b/TESTING/EIG/dbdt02.f index b2ebec23..25e79297 100644 --- a/TESTING/EIG/dbdt02.f +++ b/TESTING/EIG/dbdt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DBDT02( M, N, B, LDB, C, LDC, U, LDU, WORK, RESID ) * @@ -19,11 +19,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DBDT02 tests the change of basis C = U' * B by computing the residual *> @@ -31,11 +31,10 @@ *> *> where B and C are M by N matrices, U is an M by M orthogonal matrix, *> and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -96,10 +95,9 @@ *> RESID is DOUBLE PRECISION *> RESID = norm( B - U * C ) / ( max(m,n) * norm(B) * EPS ), *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dbdt03.f b/TESTING/EIG/dbdt03.f index 834a961c..34f07243 100644 --- a/TESTING/EIG/dbdt03.f +++ b/TESTING/EIG/dbdt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DBDT03( UPLO, N, KD, D, E, U, LDU, S, VT, LDVT, WORK, * RESID ) @@ -21,11 +21,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DBDT03 reconstructs a bidiagonal matrix B from its SVD: *> S = U' * B * V @@ -34,11 +34,10 @@ *> The test ratio to test the singular value decomposition is *> RESID = norm( B - U * S * VT ) / ( n * norm(B) * EPS ) *> where VT = V' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> RESID is DOUBLE PRECISION *> The test ratio: norm(B - U * S * V') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkbb.f b/TESTING/EIG/dchkbb.f index ca9b5375..47cdc570 100644 --- a/TESTING/EIG/dchkbb.f +++ b/TESTING/EIG/dchkbb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKBB( NSIZES, MVAL, NVAL, NWDTHS, KK, NTYPES, DOTYPE, * NRHS, ISEED, THRESH, NOUNIT, A, LDA, AB, LDAB, @@ -26,11 +26,11 @@ * $ Q( LDQ, * ), RESULT( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKBB tests the reduction of a general real rectangular band *> matrix to bidiagonal form. @@ -96,11 +96,10 @@ *> (13) Rectangular matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -337,10 +336,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkbd.f b/TESTING/EIG/dchkbd.f index 32c8dbd3..47777785 100644 --- a/TESTING/EIG/dchkbd.f +++ b/TESTING/EIG/dchkbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKBD( NSIZES, MVAL, NVAL, NTYPES, DOTYPE, NRHS, * ISEED, THRESH, A, LDA, BD, BE, S1, S2, X, LDX, @@ -27,11 +27,11 @@ * $ Y( LDX, * ), Z( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKBD checks the singular value decomposition (SVD) routines. *> @@ -174,11 +174,10 @@ *> *> A subset of the full set of matrix types may be selected through *> the logical array DOTYPE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -418,10 +417,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkbk.f b/TESTING/EIG/dchkbk.f index d21c76a1..dce21159 100644 --- a/TESTING/EIG/dchkbk.f +++ b/TESTING/EIG/dchkbk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKBK( NIN, NOUT ) * @@ -14,20 +14,19 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKBK tests DGEBAK, a routine for backward transformation of *> the computed right or left eigenvectors if the orginal matrix *> was preprocessed by balance subroutine DGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -40,10 +39,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkbl.f b/TESTING/EIG/dchkbl.f index 92cf4f1a..415ca174 100644 --- a/TESTING/EIG/dchkbl.f +++ b/TESTING/EIG/dchkbl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKBL( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKBL tests DGEBAL, a routine for balancing a general real *> matrix and isolating some of its eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkec.f b/TESTING/EIG/dchkec.f index 387881e9..427af87a 100644 --- a/TESTING/EIG/dchkec.f +++ b/TESTING/EIG/dchkec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKEC( THRESH, TSTERR, NIN, NOUT ) * @@ -16,11 +16,11 @@ * DOUBLE PRECISION THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKEC tests eigen- condition estimation routines *> DLALN2, DLASY2, DLANV2, DLAQTR, DLAEXC, @@ -31,11 +31,10 @@ *> results to a threshold THRESH. In addition, DTREXC, DTRSNA and DTRSEN *> are tested by reading in precomputed examples from a file (on input *> unit NIN). Output is written to output unit NOUT. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -61,10 +60,9 @@ *> NOUT is INTEGER *> The logical unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkee.f b/TESTING/EIG/dchkee.f index 4c8b6466..ab38e74c 100644 --- a/TESTING/EIG/dchkee.f +++ b/TESTING/EIG/dchkee.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DCHKEE * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKEE tests the DOUBLE PRECISION LAPACK subroutines for the matrix *> eigenvalue problem. The test paths in this version are @@ -1018,15 +1018,14 @@ *> precomputed examples, and LWORK = NMAX*(5*NMAX+5)+1 in the parameter *> statements below. For SVD, we assume NRHS may be as big as N. The *> parameter NEED is set to 14 to allow for 14 N-by-N matrices for DGG. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -1037,8 +1036,7 @@ * *> \ingroup double_eig * -* ===================================================================== - PROGRAM DCHKEE +* ===================================================================== PROGRAM DCHKEE * * -- LAPACK test routine (version 3.3.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/EIG/dchkgg.f b/TESTING/EIG/dchkgg.f index 15a375ab..d294b1d4 100644 --- a/TESTING/EIG/dchkgg.f +++ b/TESTING/EIG/dchkgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * TSTDIF, THRSHN, NOUNIT, A, LDA, B, H, T, S1, @@ -32,11 +32,11 @@ * $ Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKGG checks the nonsymmetric generalized eigenvalue problem *> routines. @@ -216,11 +216,10 @@ *> *> (26) U ( T1, T2 ) V where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -492,10 +491,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkgk.f b/TESTING/EIG/dchkgk.f index 911ab073..b15d303b 100644 --- a/TESTING/EIG/dchkgk.f +++ b/TESTING/EIG/dchkgk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKGK( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKGK tests DGGBAK, a routine for backward balancing of *> a matrix pair (A, B). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkgl.f b/TESTING/EIG/dchkgl.f index d462140b..04b55a8e 100644 --- a/TESTING/EIG/dchkgl.f +++ b/TESTING/EIG/dchkgl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKGL( NIN, NOUT ) * @@ -14,18 +14,17 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKGL tests DGGBAL, a routine for balancing a matrix pair (A, B). +*> \verbatim *> -*>\endverbatim +*> DCHKGL tests DGGBAL, a routine for balancing a matrix pair (A, B). +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -38,10 +37,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkhs.f b/TESTING/EIG/dchkhs.f index 0657f682..c407db08 100644 --- a/TESTING/EIG/dchkhs.f +++ b/TESTING/EIG/dchkhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKHS( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, T1, T2, U, LDU, Z, UZ, WR1, @@ -30,11 +30,11 @@ * $ WR3( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKHS checks the nonsymmetric eigenvalue problem routines. *> @@ -155,11 +155,10 @@ *> (19) Nonsymmetric matrix with random entries chosen from (-1,1). *> (20) Same as (19), but multiplied by SQRT( overflow threshold ) *> (21) Same as (19), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES - INTEGER @@ -386,10 +385,9 @@ *> KCONDS(j) Selects whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchksb.f b/TESTING/EIG/dchksb.f index cda3fae6..0cc4215d 100644 --- a/TESTING/EIG/dchksb.f +++ b/TESTING/EIG/dchksb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKSB( NSIZES, NN, NWDTHS, KK, NTYPES, DOTYPE, ISEED, * THRESH, NOUNIT, A, LDA, SD, SE, U, LDU, WORK, @@ -24,11 +24,11 @@ * $ U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKSB tests the reduction of a symmetric band matrix to tridiagonal *> form, used with the symmetric eigenvalue problem. @@ -93,11 +93,10 @@ *> (13) Symmetric matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -276,10 +275,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dchkst.f b/TESTING/EIG/dchkst.f index 76b5752d..87fc2f0e 100644 --- a/TESTING/EIG/dchkst.f +++ b/TESTING/EIG/dchkst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, AP, SD, SE, D1, D2, D3, D4, D5, @@ -28,11 +28,11 @@ * $ WA3( * ), WORK( * ), WR( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKST checks the symmetric eigenvalue problem routines. *> @@ -243,11 +243,10 @@ *> (20) Same as (16), but multiplied by SQRT( underflow threshold ) *> (21) A diagonally dominant tridiagonal matrix with geometrically *> spaced diagonal entries 1, ..., ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -573,10 +572,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dckcsd.f b/TESTING/EIG/dckcsd.f index 1bb4d9a3..52c74894 100644 --- a/TESTING/EIG/dckcsd.f +++ b/TESTING/EIG/dckcsd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCKCSD( NM, MVAL, PVAL, QVAL, NMATS, ISEED, THRESH, * MMAX, X, XF, U1, U2, V1T, V2T, THETA, IWORK, @@ -24,20 +24,19 @@ * $ WORK( * ), X( * ), XF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCKCSD tests DORCSD: *> the CSD for an M-by-M orthogonal matrix X partitioned as *> [ X11 X12; X21 X22 ]. X11 is P-by-Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -167,10 +166,9 @@ *> > 0 : If DLAROR returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dckglm.f b/TESTING/EIG/dckglm.f index 2a2c8d7f..5b8f0a32 100644 --- a/TESTING/EIG/dckglm.f +++ b/TESTING/EIG/dckglm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCKGLM( NN, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -22,19 +22,18 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCKGLM tests DGGGLM - subroutine for solving generalized linear *> model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -150,10 +149,9 @@ *> > 0 : If DLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dckgqr.f b/TESTING/EIG/dckgqr.f index c94e8d19..c75321f5 100644 --- a/TESTING/EIG/dckgqr.f +++ b/TESTING/EIG/dckgqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCKGQR( NM, MVAL, NP, PVAL, NN, NVAL, NMATS, ISEED, * THRESH, NMAX, A, AF, AQ, AR, TAUA, B, BF, BZ, @@ -23,20 +23,19 @@ * $ RWORK( * ), TAUA( * ), TAUB( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCKGQR tests *> DGGQRF: GQR factorization for N-by-M matrix A and N-by-P matrix B, *> DGGRQF: GRQ factorization for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -193,10 +192,9 @@ *> > 0 : If DLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dckgsv.f b/TESTING/EIG/dckgsv.f index 6c349494..232ab388 100644 --- a/TESTING/EIG/dckgsv.f +++ b/TESTING/EIG/dckgsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCKGSV( NM, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, U, V, Q, ALPHA, BETA, R, @@ -24,19 +24,18 @@ * $ V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCKGSV tests DGGSVD: *> the GSVD for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -181,10 +180,9 @@ *> > 0 : If DLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dcklse.f b/TESTING/EIG/dcklse.f index da3161e4..67702577 100644 --- a/TESTING/EIG/dcklse.f +++ b/TESTING/EIG/dcklse.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCKLSE( NN, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -22,19 +22,18 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCKLSE tests DGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -150,10 +149,9 @@ *> > 0 : If DLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dcsdts.f b/TESTING/EIG/dcsdts.f index 8c2d0062..6f1f9c5c 100644 --- a/TESTING/EIG/dcsdts.f +++ b/TESTING/EIG/dcsdts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCSDTS( M, P, Q, X, XF, LDX, U1, LDU1, U2, LDU2, V1T, * LDV1T, V2T, LDV2T, THETA, IWORK, WORK, LWORK, @@ -23,11 +23,11 @@ * $ XF( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCSDTS tests DORCSD, which, given an M-by-M partitioned orthogonal *> matrix X, @@ -47,11 +47,10 @@ *> [ 0 0 0 | I 0 0 ] [ D21 D22 ] *> [ 0 S 0 | 0 C 0 ] *> [ 0 0 I | 0 0 0 ] -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,9 @@ *> = ULPINV otherwise. *> ( EPS2 = MAX( norm( I - X'*X ) / M, ULP ). ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrges.f b/TESTING/EIG/ddrges.f index dd96e7c2..0ba5719e 100644 --- a/TESTING/EIG/ddrges.f +++ b/TESTING/EIG/ddrges.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRGES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, ALPHAR, @@ -26,11 +26,11 @@ * $ WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRGES checks the nonsymmetric generalized eigenvalue (Schur form) *> problem driver DGGES. @@ -200,11 +200,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -385,10 +384,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrgev.f b/TESTING/EIG/ddrgev.f index bf138b72..dfa2e472 100644 --- a/TESTING/EIG/ddrgev.f +++ b/TESTING/EIG/ddrgev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRGEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, QE, LDQE, @@ -28,11 +28,11 @@ * $ T( LDA, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRGEV checks the nonsymmetric generalized eigenvalue problem driver *> routine DGGEV. @@ -177,11 +177,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -390,10 +389,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrgsx.f b/TESTING/EIG/ddrgsx.f index 6f2f36a5..a3aa0557 100644 --- a/TESTING/EIG/ddrgsx.f +++ b/TESTING/EIG/ddrgsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, AI, * BI, Z, Q, ALPHAR, ALPHAI, BETA, C, LDC, S, @@ -26,11 +26,11 @@ * $ WORK( * ), Z( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRGSX checks the nonsymmetric generalized eigenvalue (Schur form) *> problem expert driver DGGESX. @@ -119,7 +119,7 @@ *> and DIF_l when testing the built-in test problems. *> *> Built-in Test Matrices -*> ====================== +* ====================== *> *> All built-in test matrices are the 2 by 2 block of triangular *> matrices @@ -178,11 +178,10 @@ *> | 1-d | *> and matrix B are chosen as identity matrices (see DLATM5). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -342,10 +341,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrgvx.f b/TESTING/EIG/ddrgvx.f index e1486261..f089374b 100644 --- a/TESTING/EIG/ddrgvx.f +++ b/TESTING/EIG/ddrgvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRGVX( NSIZE, THRESH, NIN, NOUT, A, LDA, B, AI, BI, * ALPHAR, ALPHAI, BETA, VL, VR, ILO, IHI, LSCALE, @@ -28,11 +28,11 @@ * $ VL( LDA, * ), VR( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRGVX checks the nonsymmetric generalized eigenvalue problem *> expert driver DGGEVX. @@ -101,11 +101,10 @@ *> *> a, b, x and y will have all values independently of each other from *> { sqrt(sqrt(ULP)), 0.1, 1, 10, 1/sqrt(sqrt(ULP)) }. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -282,10 +281,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvbd.f b/TESTING/EIG/ddrvbd.f index 3db3b7dc..85848402 100644 --- a/TESTING/EIG/ddrvbd.f +++ b/TESTING/EIG/ddrvbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVBD( NSIZES, MM, NN, NTYPES, DOTYPE, ISEED, THRESH, * A, LDA, U, LDU, VT, LDVT, ASAV, USAV, VTSAV, S, @@ -25,11 +25,11 @@ * $ VT( LDVT, * ), VTSAV( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVBD checks the singular value decomposition (SVD) drivers *> DGESVD, DGESDD, DGESVJ, and DGEJSV. @@ -126,11 +126,10 @@ *> on the diagonal. *> (4) Same as (3), but multiplied by the underflow-threshold / ULP. *> (5) Same as (3), but multiplied by the overflow-threshold * ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -302,10 +301,9 @@ *> If DLATMS, or DGESVD returns an error code, the *> absolute value of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrves.f b/TESTING/EIG/ddrves.f index 6cf863b3..41b9ce90 100644 --- a/TESTING/EIG/ddrves.f +++ b/TESTING/EIG/ddrves.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, HT, WR, WI, WRT, WIT, VS, @@ -24,11 +24,11 @@ * $ WORK( * ), WR( * ), WRT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVES checks the nonsymmetric eigenvalue (Schur form) problem *> driver DGEES. @@ -161,11 +161,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -371,10 +370,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvev.f b/TESTING/EIG/ddrvev.f index 66054207..908a155a 100644 --- a/TESTING/EIG/ddrvev.f +++ b/TESTING/EIG/ddrvev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, WR, WI, WR1, WI1, VL, LDVL, @@ -26,11 +26,11 @@ * $ WI( * ), WI1( * ), WORK( * ), WR( * ), WR1( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVEV checks the nonsymmetric eigenvalue problem driver DGEEV. *> @@ -162,11 +162,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -388,10 +387,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvgg.f b/TESTING/EIG/ddrvgg.f index 9ab41fb6..295a9c07 100644 --- a/TESTING/EIG/ddrvgg.f +++ b/TESTING/EIG/ddrvgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * THRSHN, NOUNIT, A, LDA, B, S, T, S2, T2, Q, @@ -28,11 +28,11 @@ * $ VR( LDQ, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVGG checks the nonsymmetric generalized eigenvalue driver *> routines. @@ -188,11 +188,10 @@ *> *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -434,10 +433,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvsg.f b/TESTING/EIG/ddrvsg.f index cfe511ee..e6a12d9b 100644 --- a/TESTING/EIG/ddrvsg.f +++ b/TESTING/EIG/ddrvsg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVSG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, LDB, D, Z, LDZ, AB, BB, AP, @@ -25,11 +25,11 @@ * $ RESULT( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVSG checks the real symmetric generalized eigenproblem *> drivers. @@ -159,11 +159,10 @@ *> (19) Same as (8), but with KA = 3 and KB = 1 *> (20) Same as (8), but with KA = 3 and KB = 2 *> (21) Same as (8), but with KA = 3 and KB = 3 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -338,10 +337,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvst.f b/TESTING/EIG/ddrvst.f index e1319caf..3f31ca9f 100644 --- a/TESTING/EIG/ddrvst.f +++ b/TESTING/EIG/ddrvst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, D1, D2, D3, D4, EVEIGS, WA1, @@ -27,11 +27,11 @@ * $ WA3( * ), WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVST checks the symmetric eigenvalue problem drivers. *> @@ -140,11 +140,10 @@ *> with random signs. *> (17) Same as (16), but multiplied by SQRT( overflow threshold ) *> (18) Same as (16), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -435,10 +434,9 @@ *> 95= | I - U U' | / ( n ulp ) DSBEVR('L','V','V', ... ) *> 96= |D(with Z) - D(w/o Z)| / (|D| ulp) DSBEVR('L','N','V', ... ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvsx.f b/TESTING/EIG/ddrvsx.f index 11688d6f..9dd1f03e 100644 --- a/TESTING/EIG/ddrvsx.f +++ b/TESTING/EIG/ddrvsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVSX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, HT, WR, WI, WRT, @@ -27,11 +27,11 @@ * $ WR( * ), WRT( * ), WRTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVSX checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver DGEESX. @@ -206,11 +206,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -436,10 +435,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ddrvvx.f b/TESTING/EIG/ddrvvx.f index 4b754313..b1b126ef 100644 --- a/TESTING/EIG/ddrvvx.f +++ b/TESTING/EIG/ddrvvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVVX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, WR, WI, WR1, WI1, @@ -30,11 +30,11 @@ * $ WI1( * ), WORK( * ), WR( * ), WR1( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVVX checks the nonsymmetric eigenvalue problem expert driver *> DGEEVX. @@ -211,11 +211,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -502,10 +501,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/derrbd.f b/TESTING/EIG/derrbd.f index 4735cfff..8f04d290 100644 --- a/TESTING/EIG/derrbd.f +++ b/TESTING/EIG/derrbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRBD( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRBD tests the error exits for DGEBRD, DORGBR, DORMBR, DBDSQR and *> DBDSDC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -40,10 +39,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/derrec.f b/TESTING/EIG/derrec.f index da667649..fe4079db 100644 --- a/TESTING/EIG/derrec.f +++ b/TESTING/EIG/derrec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERREC( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERREC tests the error exits for the routines for eigen- condition *> estimation for DOUBLE PRECISION matrices: *> DTRSYL, STREXC, STRSNA and STRSEN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/derred.f b/TESTING/EIG/derred.f index 9f2d4653..a7189528 100644 --- a/TESTING/EIG/derred.f +++ b/TESTING/EIG/derred.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRED( PATH, NUNIT ) * @@ -15,11 +15,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRED tests the error exits for the eigenvalue driver routines for *> DOUBLE PRECISION matrices: @@ -34,11 +34,10 @@ *> DGESDD compute SVD of an M-by-N matrix A (by divide and *> conquer) *> DGEJSV compute SVD of an M-by-N matrix A where M >= N -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -51,10 +50,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/derrgg.f b/TESTING/EIG/derrgg.f index 7b7baed0..a9b7bb89 100644 --- a/TESTING/EIG/derrgg.f +++ b/TESTING/EIG/derrgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRGG( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRGG tests the error exits for DGGES, DGGESX, DGGEV, DGGEVX, *> DGGGLM, DGGHRD, DGGLSE, DGGQRF, DGGRQF, DGGSVD, DGGSVP, DHGEQZ, *> DORCSD, DTGEVC, DTGEXC, DTGSEN, DTGSJA, DTGSNA, and DTGSYL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/derrhs.f b/TESTING/EIG/derrhs.f index 6f678b9e..92b21a7c 100644 --- a/TESTING/EIG/derrhs.f +++ b/TESTING/EIG/derrhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRHS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRHS tests the error exits for DGEBAK, SGEBAL, SGEHRD, DORGHR, *> DORMHR, DHSEQR, SHSEIN, and DTREVC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -40,10 +39,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/derrst.f b/TESTING/EIG/derrst.f index ddb94541..70ee8673 100644 --- a/TESTING/EIG/derrst.f +++ b/TESTING/EIG/derrst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRST( PATH, NUNIT ) * @@ -15,21 +15,20 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRST tests the error exits for DSYTRD, DORGTR, DORMTR, DSPTRD, *> DOPGTR, DOPMTR, DSTEQR, SSTERF, SSTEBZ, SSTEIN, DPTEQR, DSBTRD, *> DSYEV, SSYEVX, SSYEVD, DSBEV, SSBEVX, SSBEVD, *> DSPEV, SSPEVX, SSPEVD, DSTEV, SSTEVX, SSTEVD, and SSTEDC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -42,10 +41,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget02.f b/TESTING/EIG/dget02.f index dee1ae78..79ce7adc 100644 --- a/TESTING/EIG/dget02.f +++ b/TESTING/EIG/dget02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET02( TRANS, M, N, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET02 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -117,10 +116,9 @@ *> The maximum over the number of right hand sides of *> norm(B - A*X) / ( norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget10.f b/TESTING/EIG/dget10.f index 0fe5e2a8..23b1f956 100644 --- a/TESTING/EIG/dget10.f +++ b/TESTING/EIG/dget10.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET10( M, N, A, LDA, B, LDB, WORK, RESULT ) * @@ -18,19 +18,18 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET10 compares two matrices A and B and computes the ratio *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -78,10 +77,9 @@ *> RESULT is DOUBLE PRECISION *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget22.f b/TESTING/EIG/dget22.f index 39aa95d0..7a884ab7 100644 --- a/TESTING/EIG/dget22.f +++ b/TESTING/EIG/dget22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET22( TRANSA, TRANSE, TRANSW, N, A, LDA, E, LDE, WR, * WI, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET22 does an eigenvector check. *> @@ -58,11 +58,10 @@ *> To handle various schemes for storage of left eigenvectors, there are *> options to use A-transpose instead of A, E-transpose instead of E, *> and/or W-transpose instead of W. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -151,10 +150,9 @@ *> RESULT(1) = | A E - E W | / ( |A| |E| ulp ) *> RESULT(2) = max | m-norm(E(j)) - 1 | / ( n ulp ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget23.f b/TESTING/EIG/dget23.f index c055d620..ab935386 100644 --- a/TESTING/EIG/dget23.f +++ b/TESTING/EIG/dget23.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET23( COMP, BALANC, JTYPE, THRESH, ISEED, NOUNIT, N, * A, LDA, H, WR, WI, WR1, WI1, VL, LDVL, VR, @@ -31,11 +31,11 @@ * $ WI1( * ), WORK( * ), WR( * ), WR1( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET23 checks the nonsymmetric eigenvalue problem driver SGEEVX. *> If COMP = .FALSE., the first 8 of the following tests will be @@ -122,11 +122,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -359,10 +358,9 @@ *> If >0, DGEEVX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget24.f b/TESTING/EIG/dget24.f index 5020f56c..5faa12a3 100644 --- a/TESTING/EIG/dget24.f +++ b/TESTING/EIG/dget24.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET24( COMP, JTYPE, THRESH, ISEED, NOUNIT, N, A, LDA, * H, HT, WR, WI, WRT, WIT, WRTMP, WITMP, VS, @@ -27,11 +27,11 @@ * $ WR( * ), WRT( * ), WRTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET24 checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver DGEESX. @@ -117,11 +117,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -325,10 +324,9 @@ *> If >0, DGEESX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget31.f b/TESTING/EIG/dget31.f index 1f4723ed..eb79eabb 100644 --- a/TESTING/EIG/dget31.f +++ b/TESTING/EIG/dget31.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET31( RMAX, LMAX, NINFO, KNT ) * @@ -18,11 +18,11 @@ * INTEGER NINFO( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET31 tests DLALN2, a routine for solving *> @@ -46,11 +46,10 @@ *> should be on the order of 1. Here, ulp is the machine precision. *> Also, it is verified that SCALE is less than or equal to 1, and that *> XNORM = infinity-norm(X). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -76,10 +75,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget32.f b/TESTING/EIG/dget32.f index 1b0a5336..8f6fc67a 100644 --- a/TESTING/EIG/dget32.f +++ b/TESTING/EIG/dget32.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET32( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * DOUBLE PRECISION RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET32 tests DLASY2, a routine for solving *> @@ -38,11 +38,10 @@ *> should be on the order of 1. Here, ulp is the machine precision. *> Also, it is verified that SCALE is less than or equal to 1, and *> that XNORM = infinity-norm(X). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -67,10 +66,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget33.f b/TESTING/EIG/dget33.f index 81f3614c..d2a8fce0 100644 --- a/TESTING/EIG/dget33.f +++ b/TESTING/EIG/dget33.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET33( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * DOUBLE PRECISION RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET33 tests DLANV2, a routine for putting 2 by 2 blocks into *> standard form. In other words, it computes a two by two rotation @@ -32,11 +32,10 @@ *> 1) T21=0 (real eigenvalues), or *> 2) T11=T22 and T21*T12<0 (complex conjugate eigenvalues). *> We also verify that the residual is small. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -61,10 +60,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget34.f b/TESTING/EIG/dget34.f index c2c083e4..e93716ed 100644 --- a/TESTING/EIG/dget34.f +++ b/TESTING/EIG/dget34.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET34( RMAX, LMAX, NINFO, KNT ) * @@ -18,11 +18,11 @@ * INTEGER NINFO( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET34 tests DLAEXC, a routine for swapping adjacent blocks (either *> 1 by 1 or 2 by 2) on the diagonal of a matrix in real Schur form. @@ -38,11 +38,10 @@ *> *> The test code verifies these last last assertions, as well as that *> the residual in the above equation is small. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -67,10 +66,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget35.f b/TESTING/EIG/dget35.f index d9511420..1d4be1f0 100644 --- a/TESTING/EIG/dget35.f +++ b/TESTING/EIG/dget35.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET35( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * DOUBLE PRECISION RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET35 tests DTRSYL, a routine for solving the Sylvester matrix *> equation @@ -34,11 +34,10 @@ *> *> norm(op(A)*X + ISGN*X*op(B) - scale*C) / *> (EPS*max(norm(A),norm(B))*norm(X)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -63,10 +62,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget36.f b/TESTING/EIG/dget36.f index b132fa3d..1fa1c542 100644 --- a/TESTING/EIG/dget36.f +++ b/TESTING/EIG/dget36.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET36( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,11 +18,11 @@ * INTEGER NINFO( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET36 tests DTREXC, a routine for moving blocks (either 1 by 1 or *> 2 by 2) on the diagonal of a matrix in real Schur form. Thus, DLAEXC @@ -38,11 +38,10 @@ *> ILST (within +-1). *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -73,10 +72,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget37.f b/TESTING/EIG/dget37.f index 167d3212..b50eda5c 100644 --- a/TESTING/EIG/dget37.f +++ b/TESTING/EIG/dget37.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET37( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET37 tests DTRSNA, a routine for estimating condition numbers of *> eigenvalues and/or right eigenvectors of a matrix. *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -75,10 +74,9 @@ *> NIN is INTEGER *> Input logical unit number *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget38.f b/TESTING/EIG/dget38.f index f098c0c6..e1e33527 100644 --- a/TESTING/EIG/dget38.f +++ b/TESTING/EIG/dget38.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET38( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET38 tests DTRSEN, a routine for estimating condition numbers of a *> cluster of eigenvalues and/or its associated right invariant subspace *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -76,10 +75,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget39.f b/TESTING/EIG/dget39.f index 938638fd..ed0dea36 100644 --- a/TESTING/EIG/dget39.f +++ b/TESTING/EIG/dget39.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET39( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * DOUBLE PRECISION RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET39 tests DLAQTR, a routine for solving the real or *> special complex quasi upper triangular system @@ -59,11 +59,10 @@ *> *> (The (||T||+||B||)*smlnum/ulp term accounts for possible *> (gradual or nongradual) underflow in x1 and x2.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -88,10 +87,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget51.f b/TESTING/EIG/dget51.f index 42aea9f6..d49e1159 100644 --- a/TESTING/EIG/dget51.f +++ b/TESTING/EIG/dget51.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET51( ITYPE, N, A, LDA, B, LDB, U, LDU, V, LDV, WORK, * RESULT ) @@ -20,11 +20,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET51 generally checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> If ITYPE=3, then: *> *> RESULT = | I - UU' | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -133,10 +132,9 @@ *> value is currently limited to 1/ulp, to avoid overflow. *> Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget52.f b/TESTING/EIG/dget52.f index 91314e4a..85b95940 100644 --- a/TESTING/EIG/dget52.f +++ b/TESTING/EIG/dget52.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET52( LEFT, N, A, LDA, B, LDB, E, LDE, ALPHAR, * ALPHAI, BETA, WORK, RESULT ) @@ -21,11 +21,11 @@ * $ RESULT( 2 ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET52 does an eigenvector check for the generalized eigenvalue *> problem. @@ -68,11 +68,10 @@ *> *> RESULT(2) = max | M(v(j)) - 1 | / ( n ulp ) *> eigenvectors v(j) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LEFT *> \verbatim @@ -183,10 +182,9 @@ *> B E is likely to overflow, then RESULT(1:2) is set to *> 10 / ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget53.f b/TESTING/EIG/dget53.f index 55482a1d..c59967f8 100644 --- a/TESTING/EIG/dget53.f +++ b/TESTING/EIG/dget53.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET53( A, LDA, B, LDB, SCALE, WR, WI, RESULT, INFO ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET53 checks the generalized eigenvalues computed by DLAG2. *> @@ -43,11 +43,10 @@ *> *> If these tests are not passed, then s and w are scaled and *> tested anyway, if this is possible. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -111,10 +110,9 @@ *> =3: same as INFO=2, but s and w could not be scaled so *> as to compute the test. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dget54.f b/TESTING/EIG/dget54.f index cb34512d..9fb5302b 100644 --- a/TESTING/EIG/dget54.f +++ b/TESTING/EIG/dget54.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET54( N, A, LDA, B, LDB, S, LDS, T, LDT, U, LDU, V, * LDV, WORK, RESULT ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET54 checks a generalized decomposition of the form *> @@ -36,11 +36,10 @@ *> Specifically, *> *> RESULT = ||( A - U*S*V', B - U*T*V' )|| / (||( A, B )||*n*ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -140,10 +139,9 @@ *> The value RESULT, It is currently limited to 1/ulp, to *> avoid overflow. Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dglmts.f b/TESTING/EIG/dglmts.f index 42fcee9a..02fac100 100644 --- a/TESTING/EIG/dglmts.f +++ b/TESTING/EIG/dglmts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGLMTS( N, M, P, A, AF, LDA, B, BF, LDB, D, DF, X, U, * WORK, LWORK, RWORK, RESULT ) @@ -17,19 +17,18 @@ * .. * .. Array Arguments .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGLMTS tests DGGGLM - a subroutine for solving the generalized *> linear model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -130,10 +129,9 @@ *> RESULT = ----------------------------------------- *> (norm(A)+norm(B))*(norm(x)+norm(u))*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dgqrts.f b/TESTING/EIG/dgqrts.f index 99ac48b2..d3b1d86c 100644 --- a/TESTING/EIG/dgqrts.f +++ b/TESTING/EIG/dgqrts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGQRTS( N, M, P, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ WORK( LWORK ), Z( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGQRTS tests DGGQRF, which computes the GQR factorization of an *> N-by-M matrix A and a N-by-P matrix B: A = Q*R and B = Q*T*Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( M*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dgrqts.f b/TESTING/EIG/dgrqts.f index 336c709a..3fd27f9f 100644 --- a/TESTING/EIG/dgrqts.f +++ b/TESTING/EIG/dgrqts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGRQTS( M, P, N, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ WORK( LWORK ), Z( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGRQTS tests DGGRQF, which computes the GRQ factorization of an *> M-by-N matrix A and a P-by-N matrix B: A = R*Q and B = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( N*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dgsvts.f b/TESTING/EIG/dgsvts.f index 7f989f25..99c674ea 100644 --- a/TESTING/EIG/dgsvts.f +++ b/TESTING/EIG/dgsvts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGSVTS( M, P, N, A, AF, LDA, B, BF, LDB, U, LDU, V, * LDV, Q, LDQ, ALPHA, BETA, R, LDR, IWORK, WORK, @@ -24,20 +24,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGSVTS tests DGGSVD, which computes the GSVD of an M-by-N matrix A *> and a P-by-N matrix B: *> U'*A*Q = D1*R and V'*B*Q = D2*R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -193,10 +192,9 @@ *> RESULT(6) = 0 if ALPHA is in decreasing order; *> = ULPINV otherwise. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dhst01.f b/TESTING/EIG/dhst01.f index 9af8fd9b..388db957 100644 --- a/TESTING/EIG/dhst01.f +++ b/TESTING/EIG/dhst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DHST01( N, ILO, IHI, A, LDA, H, LDH, Q, LDQ, WORK, * LWORK, RESULT ) @@ -19,11 +19,11 @@ * $ RESULT( 2 ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DHST01 tests the reduction of a general matrix A to upper Hessenberg *> form: A = Q*H*Q'. Two test ratios are computed; @@ -36,11 +36,10 @@ *> *> In this version, ILO and IHI are not used and are assumed to be 1 and *> N, respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> RESULT(1) = norm( A - Q*H*Q' ) / ( norm(A) * N * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( N * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlafts.f b/TESTING/EIG/dlafts.f index 29cf46f5..e4cd0f9e 100644 --- a/TESTING/EIG/dlafts.f +++ b/TESTING/EIG/dlafts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAFTS( TYPE, M, N, IMAT, NTESTS, RESULT, ISEED, * THRESH, IOUNIT, IE ) @@ -21,20 +21,19 @@ * DOUBLE PRECISION RESULT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAFTS tests the result vector against the threshold value to *> see which tests for this matrix type failed to pass the threshold. *> Output is to the file given by unit IOUNIT. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> TYPE - CHARACTER*3 @@ -83,10 +82,9 @@ *> failed to pass the threshold so far. *> Updated on exit if any of the ratios in RESULT also fail. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlahd2.f b/TESTING/EIG/dlahd2.f index 9d2cac9a..f6b248c3 100644 --- a/TESTING/EIG/dlahd2.f +++ b/TESTING/EIG/dlahd2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAHD2( IOUNIT, PATH ) * @@ -15,18 +15,17 @@ * INTEGER IOUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DLAHD2 prints header information for the different test paths. +*> \verbatim *> -*>\endverbatim +*> DLAHD2 prints header information for the different test paths. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IOUNIT *> \verbatim @@ -50,10 +49,9 @@ *> These paths also are supplied in double precision (replace *> leading S by D and leading C by Z in path names). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlarfy.f b/TESTING/EIG/dlarfy.f index 5a75339b..fd0934cb 100644 --- a/TESTING/EIG/dlarfy.f +++ b/TESTING/EIG/dlarfy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARFY( UPLO, N, V, INCV, TAU, C, LDC, WORK ) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARFY applies an elementary reflector, or Householder matrix, H, *> to an n x n symmetric matrix C, from both the left and the right. @@ -35,11 +35,10 @@ *> where tau is a scalar and v is a vector. *> *> If tau is zero, then H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlarhs.f b/TESTING/EIG/dlarhs.f index b071ccd9..c38574a8 100644 --- a/TESTING/EIG/dlarhs.f +++ b/TESTING/EIG/dlarhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARHS( PATH, XTYPE, UPLO, TRANS, M, N, KL, KU, NRHS, * A, LDA, X, LDX, B, LDB, ISEED, INFO ) @@ -21,21 +21,20 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARHS chooses a set of NRHS random solution vectors and sets *> up the right hand sides for the linear system *> op( A ) * X = B, *> where op( A ) may be A or A' (transpose of A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -188,10 +187,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlasum.f b/TESTING/EIG/dlasum.f index d44fc991..c62a001d 100644 --- a/TESTING/EIG/dlasum.f +++ b/TESTING/EIG/dlasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASUM( TYPE, IOUNIT, IE, NRUN ) * @@ -15,22 +15,21 @@ * INTEGER IE, IOUNIT, NRUN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DLASUM prints a summary of the results from one of the test routines. +*> \verbatim *> -*>\endverbatim +*> DLASUM prints a summary of the results from one of the test routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlatb9.f b/TESTING/EIG/dlatb9.f index 8a9cf15c..905254c8 100644 --- a/TESTING/EIG/dlatb9.f +++ b/TESTING/EIG/dlatb9.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATB9( PATH, IMAT, M, P, N, TYPE, KLA, KUA, KLB, KUB, * ANORM, BNORM, MODEA, MODEB, CNDNMA, CNDNMB, @@ -19,19 +19,18 @@ * DOUBLE PRECISION ANORM, BNORM, CNDNMA, CNDNMB * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATB9 sets parameters for the matrix generator based on the type of *> matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -153,10 +152,9 @@ *> The type of distribution to be used by the random number *> generator. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlatm4.f b/TESTING/EIG/dlatm4.f index dcb3d9c1..d8bb6624 100644 --- a/TESTING/EIG/dlatm4.f +++ b/TESTING/EIG/dlatm4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATM4( ITYPE, N, NZ1, NZ2, ISIGN, AMAGN, RCOND, * TRIANG, IDIST, ISEED, A, LDA ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM4 generates basic square matrices, which may later be *> multiplied by others in order to produce test matrices. It is @@ -35,11 +35,10 @@ *> according to the value of ITYPE, NZ1, NZ2, ISIGN, AMAGN, and RCOND. *> It then fills in the upper triangle with random numbers, if TRIANG is *> non-zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -159,10 +158,9 @@ *> LDA is INTEGER *> Leading dimension of A. Must be at least 1 and at least N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlctes.f b/TESTING/EIG/dlctes.f index 7c292680..715f408f 100644 --- a/TESTING/EIG/dlctes.f +++ b/TESTING/EIG/dlctes.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION DLCTES( ZR, ZI, D ) * @@ -14,11 +14,11 @@ * DOUBLE PRECISION D, ZI, ZR * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLCTES returns .TRUE. if the eigenvalue (ZR/D) + sqrt(-1)*(ZI/D) *> is to be selected (specifically, in this subroutine, if the real @@ -27,11 +27,10 @@ *> *> It is used by the test routine DDRGES to test whether the driver *> routine DGGES succesfully sorts eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ZR *> \verbatim @@ -53,10 +52,9 @@ *> The denominator part of a complex eigenvalue *> (ZR/D) + i*(ZI/D). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlctsx.f b/TESTING/EIG/dlctsx.f index b1064910..8afcf962 100644 --- a/TESTING/EIG/dlctsx.f +++ b/TESTING/EIG/dlctsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION DLCTSX( AR, AI, BETA ) * @@ -14,21 +14,20 @@ * DOUBLE PRECISION AI, AR, BETA * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This function is used to determine what eigenvalues will be *> selected. If this is part of the test driver DDRGSX, do not *> change the code UNLESS you are testing input examples and not *> using the built-in examples. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] AR *> \verbatim @@ -50,10 +49,9 @@ *> The denominator part of a complex eigenvalue *> (AR/BETA) + i*(AI/BETA). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dlsets.f b/TESTING/EIG/dlsets.f index 75c364ff..c4dffd65 100644 --- a/TESTING/EIG/dlsets.f +++ b/TESTING/EIG/dlsets.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLSETS( M, P, N, A, AF, LDA, B, BF, LDB, C, CF, D, DF, * X, WORK, LWORK, RWORK, RESULT ) @@ -16,19 +16,18 @@ * .. * .. Array Arguments .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLSETS tests DGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -135,10 +134,9 @@ *> RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS *> RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dort01.f b/TESTING/EIG/dort01.f index 1c23a8a4..d45ec5a8 100644 --- a/TESTING/EIG/dort01.f +++ b/TESTING/EIG/dort01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORT01( ROWCOL, M, N, U, LDU, WORK, LWORK, RESID ) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORT01 checks that the matrix U is orthogonal by computing the ratio *> @@ -41,11 +41,10 @@ *> where EPS is the machine precision. ROWCOL is used only if m = n; *> if m > n, ROWCOL is assumed to be 'C', and if m < n, ROWCOL is *> assumed to be 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ROWCOL *> \verbatim @@ -101,10 +100,9 @@ *> RESID = norm( I - U * U' ) / ( n * EPS ), if ROWCOL = 'R', or *> RESID = norm( I - U' * U ) / ( m * EPS ), if ROWCOL = 'C'. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dort03.f b/TESTING/EIG/dort03.f index c6172bed..5cd4f70e 100644 --- a/TESTING/EIG/dort03.f +++ b/TESTING/EIG/dort03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORT03( RC, MU, MV, N, K, U, LDU, V, LDV, WORK, LWORK, * RESULT, INFO ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORT03 compares two orthogonal matrices U and V to see if their *> corresponding rows or columns span the same spaces. The rows are @@ -42,11 +42,10 @@ *> *> where S is +-1 (chosen to minimize the expression), U(i) is the i-th *> row (column) of U, and V(i) is the i-th row (column) of V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RC *> \verbatim @@ -140,10 +139,9 @@ *> 0 indicates a successful exit *> -k indicates the k-th parameter had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsbt21.f b/TESTING/EIG/dsbt21.f index c9f9eaed..5db0cb06 100644 --- a/TESTING/EIG/dsbt21.f +++ b/TESTING/EIG/dsbt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBT21( UPLO, N, KA, KS, A, LDA, D, E, U, LDU, WORK, * RESULT ) @@ -20,11 +20,11 @@ * $ U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBT21 generally checks a decomposition of the form *> @@ -37,11 +37,10 @@ *> Specifically: *> *> RESULT(1) = | A - U S U' | / ( |A| n ulp ) *andC> RESULT(2) = | I - UU' | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsgt01.f b/TESTING/EIG/dsgt01.f index 5b678d0b..432b61f7 100644 --- a/TESTING/EIG/dsgt01.f +++ b/TESTING/EIG/dsgt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSGT01( ITYPE, UPLO, N, M, A, LDA, B, LDB, Z, LDZ, D, * WORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDGT01 checks a decomposition of the form *> @@ -42,11 +42,10 @@ *> ITYPE = 2: RESULT(1) = | A B Z - Z D | / ( |A| |Z| n ulp ) *> *> ITYPE = 3: RESULT(1) = | B A Z - Z D | / ( |A| |Z| n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -130,10 +129,9 @@ *> RESULT is DOUBLE PRECISION array, dimension (1) *> The test ratio as described above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dslect.f b/TESTING/EIG/dslect.f index fedb29da..7b4f78f2 100644 --- a/TESTING/EIG/dslect.f +++ b/TESTING/EIG/dslect.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION DSLECT( ZR, ZI ) * @@ -14,11 +14,11 @@ * DOUBLE PRECISION ZI, ZR * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSLECT returns .TRUE. if the eigenvalue ZR+sqrt(-1)*ZI is to be *> selected, and otherwise it returns .FALSE. @@ -30,11 +30,10 @@ *> and .FALSE. otherwise. *> If SELOPT is at least 1, DSLECT returns SELVAL(SELOPT) and adds 1 *> to SELOPT, cycling back to 1 at SELMAX. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ZR *> \verbatim @@ -47,10 +46,9 @@ *> ZI is DOUBLE PRECISION *> The imaginary part of a complex eigenvalue ZR + i*ZI. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dspt21.f b/TESTING/EIG/dspt21.f index 862b26e2..dd4888e9 100644 --- a/TESTING/EIG/dspt21.f +++ b/TESTING/EIG/dspt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPT21( ITYPE, UPLO, N, KBAND, AP, D, E, U, LDU, VP, * TAU, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ U( LDU, * ), VP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPT21 generally checks a decomposition of the form *> @@ -83,11 +83,10 @@ *> and the first j elements of v(j) are 0, the (j+1)-st is 1, and the *> (j+2)-nd through n-th elements are stored in V(j+2:n,j) (i.e., *> in VP( (2*n-j)*(j-1)/2 + j+2 : (2*n-j)*(j-1)/2 + n ) .) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -203,10 +202,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dstech.f b/TESTING/EIG/dstech.f index c702f6b0..95397102 100644 --- a/TESTING/EIG/dstech.f +++ b/TESTING/EIG/dstech.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTECH( N, A, B, EIG, TOL, WORK, INFO ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A( * ), B( * ), EIG( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Let T be the tridiagonal matrix with diagonal entries A(1) ,..., *> A(N) and offdiagonal entries B(1) ,..., B(N-1)). DSTECH checks to @@ -36,11 +36,10 @@ *> eigenvalue. If each interval contains the correct number of *> eigenvalues, INFO = 0 is returned, otherwise INFO is the index of *> the first eigenvalue in the first bad interval. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> >0 if the interval containing the INFO-th eigenvalue *> contains the incorrect number of eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dstect.f b/TESTING/EIG/dstect.f index e73ecf4b..9074366e 100644 --- a/TESTING/EIG/dstect.f +++ b/TESTING/EIG/dstect.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTECT( N, A, B, SHIFT, NUM ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A( * ), B( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTECT counts the number NUM of eigenvalues of a tridiagonal *> matrix T which are less than or equal to SHIFT. T has @@ -31,11 +31,10 @@ *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal *> Matrix", Report CS41, Computer Science Dept., Stanford *> University, July 21, 1966 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -67,10 +66,9 @@ *> The number of eigenvalues of T less than or equal *> to SHIFT. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dstt21.f b/TESTING/EIG/dstt21.f index a166a5a6..d2a0b7e1 100644 --- a/TESTING/EIG/dstt21.f +++ b/TESTING/EIG/dstt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTT21( N, KBAND, AD, AE, SD, SE, U, LDU, WORK, * RESULT ) @@ -19,11 +19,11 @@ * $ SE( * ), U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTT21 checks a decomposition of the form *> @@ -36,11 +36,10 @@ *> RESULT(1) = | A - U S U' | / ( |A| n ulp ) *> *> RESULT(2) = | I - UU' | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,9 @@ *> values are currently limited to 1/ulp, to avoid overflow. *> RESULT(1) is always modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dstt22.f b/TESTING/EIG/dstt22.f index 376510f2..b7089b46 100644 --- a/TESTING/EIG/dstt22.f +++ b/TESTING/EIG/dstt22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTT22( N, M, KBAND, AD, AE, SD, SE, U, LDU, WORK, * LDWORK, RESULT ) @@ -19,11 +19,11 @@ * $ SE( * ), U( LDU, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTT22 checks a set of M eigenvalues and eigenvectors, *> @@ -36,11 +36,10 @@ *> RESULT(1) = | U' A U - S | / ( |A| m ulp ) *> *> RESULT(2) = | I - U'U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -123,10 +122,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsvdch.f b/TESTING/EIG/dsvdch.f index 9eb4577d..a517d71b 100644 --- a/TESTING/EIG/dsvdch.f +++ b/TESTING/EIG/dsvdch.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSVDCH( N, S, E, SVD, TOL, INFO ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION E( * ), S( * ), SVD( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSVDCH checks to see if SVD(1) ,..., SVD(N) are accurate singular *> values of the bidiagonal matrix B with diagonal entries @@ -37,11 +37,10 @@ *> contains the correct number of singular values, INFO = 0 is returned, *> otherwise INFO is the index of the first singular value in the first *> bad interval. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -82,10 +81,9 @@ *> >0 if the interval containing the INFO-th singular value *> contains the incorrect number of singular values. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsvdct.f b/TESTING/EIG/dsvdct.f index fa22a10a..c33ec91b 100644 --- a/TESTING/EIG/dsvdct.f +++ b/TESTING/EIG/dsvdct.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSVDCT( N, S, E, SHIFT, NUM ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION E( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSVDCT counts the number NUM of eigenvalues of a 2*N by 2*N *> tridiagonal matrix T which are less than or equal to SHIFT. T is @@ -37,11 +37,10 @@ *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal *> Matrix", Report CS41, Computer Science Dept., Stanford University, *> July 21, 1966 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -72,10 +71,9 @@ *> NUM is INTEGER *> The number of eigenvalues of T less than or equal to SHIFT. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsxt1.f b/TESTING/EIG/dsxt1.f index 61815162..0ad55cbc 100644 --- a/TESTING/EIG/dsxt1.f +++ b/TESTING/EIG/dsxt1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSXT1( IJOB, D1, N1, D2, N2, ABSTOL, * ULP, UNFL ) @@ -19,11 +19,11 @@ * DOUBLE PRECISION D1( * ), D2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSXT1 computes the difference between a set of eigenvalues. *> The result is returned as the function value. @@ -34,11 +34,10 @@ *> IJOB = 2: Computes max { min | D1(i)-D2(j) | / *> i j *> ( ABSTOL + |D1(i)|*ULP ) } -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -90,10 +89,9 @@ *> The smallest positive number whose reciprocal does not *> overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsyt21.f b/TESTING/EIG/dsyt21.f index c6ee194a..d05a6f9a 100644 --- a/TESTING/EIG/dsyt21.f +++ b/TESTING/EIG/dsyt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYT21( ITYPE, UPLO, N, KBAND, A, LDA, D, E, U, LDU, V, * LDV, TAU, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYT21 generally checks a decomposition of the form *> @@ -55,11 +55,10 @@ *> V = H(1)...H(n-2), where H(j) = I - tau(j) v(j) v(j)' and each *> vector v(j) has its first j elements 0 and the remaining n-j elements *> stored in V(j+1:n,j). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -189,10 +188,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/dsyt22.f b/TESTING/EIG/dsyt22.f index dc0e5ba4..c6978715 100644 --- a/TESTING/EIG/dsyt22.f +++ b/TESTING/EIG/dsyt22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYT22( ITYPE, UPLO, N, M, KBAND, A, LDA, D, E, U, LDU, * V, LDV, TAU, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYT22 generally checks a decomposition of the form *> @@ -42,11 +42,10 @@ *> Specifically, if ITYPE=1, then: *> *> RESULT(1) = | U' A U - S | / ( |A| m ulp ) *andC> RESULT(2) = | I - U'U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> ITYPE INTEGER @@ -139,10 +138,9 @@ *> if LDU is at least N. *> Modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ilaenv.f b/TESTING/EIG/ilaenv.f index 09b45a99..10ad76df 100644 --- a/TESTING/EIG/ilaenv.f +++ b/TESTING/EIG/ilaenv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILAENV( ISPEC, NAME, OPTS, N1, N2, N3, * N4 ) @@ -16,11 +16,11 @@ * INTEGER ISPEC, N1, N2, N3, N4 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ILAENV returns problem-dependent parameters for the local *> environment. See ISPEC for a description of the parameters. @@ -29,11 +29,10 @@ *> the integer array IPARMS in the common block CLAENV and the value *> with index ISPEC is copied to ILAENV. This version of ILAENV is *> to be used in conjunction with XLAENV in TESTING and TIMING. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ISPEC *> \verbatim @@ -114,10 +113,9 @@ *> >= 0: the value of the parameter specified by ISPEC *> < 0: if ILAENV = -k, the k-th argument had an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -128,10 +126,9 @@ * *> \ingroup aux_eig * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The following conventions have been used when calling ILAENV from the @@ -150,7 +147,6 @@ *> *> NB = ILAENV( 1, 'STRTRI', UPLO // DIAG, N, -1, -1, -1 ) *> IF( NB.LE.1 ) NB = MAX( 1, N ) -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/EIG/sbdt01.f b/TESTING/EIG/sbdt01.f index 66d47ad2..1a85fab7 100644 --- a/TESTING/EIG/sbdt01.f +++ b/TESTING/EIG/sbdt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, * RESID ) @@ -20,11 +20,11 @@ * $ Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SBDT01 reconstructs a general matrix A from its bidiagonal form *> A = Q * B * P' @@ -34,11 +34,10 @@ *> The test ratio to test the reduction is *> RESID = norm( A - Q * B * PT ) / ( n * norm(A) * EPS ) *> where PT = P' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,9 @@ *> RESID is REAL *> The test ratio: norm(A - Q * B * P') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sbdt02.f b/TESTING/EIG/sbdt02.f index 55629e77..10885e01 100644 --- a/TESTING/EIG/sbdt02.f +++ b/TESTING/EIG/sbdt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SBDT02( M, N, B, LDB, C, LDC, U, LDU, WORK, RESID ) * @@ -19,11 +19,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SBDT02 tests the change of basis C = U' * B by computing the residual *> @@ -31,11 +31,10 @@ *> *> where B and C are M by N matrices, U is an M by M orthogonal matrix, *> and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -96,10 +95,9 @@ *> RESID is REAL *> RESID = norm( B - U * C ) / ( max(m,n) * norm(B) * EPS ), *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sbdt03.f b/TESTING/EIG/sbdt03.f index 4578ea1e..ac842720 100644 --- a/TESTING/EIG/sbdt03.f +++ b/TESTING/EIG/sbdt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SBDT03( UPLO, N, KD, D, E, U, LDU, S, VT, LDVT, WORK, * RESID ) @@ -21,11 +21,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SBDT03 reconstructs a bidiagonal matrix B from its SVD: *> S = U' * B * V @@ -34,11 +34,10 @@ *> The test ratio to test the singular value decomposition is *> RESID = norm( B - U * S * VT ) / ( n * norm(B) * EPS ) *> where VT = V' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> RESID is REAL *> The test ratio: norm(B - U * S * V') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkbb.f b/TESTING/EIG/schkbb.f index 59292703..749f60d2 100644 --- a/TESTING/EIG/schkbb.f +++ b/TESTING/EIG/schkbb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKBB( NSIZES, MVAL, NVAL, NWDTHS, KK, NTYPES, DOTYPE, * NRHS, ISEED, THRESH, NOUNIT, A, LDA, AB, LDAB, @@ -26,11 +26,11 @@ * $ Q( LDQ, * ), RESULT( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKBB tests the reduction of a general real rectangular band *> matrix to bidiagonal form. @@ -96,11 +96,10 @@ *> (13) Rectangular matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -337,10 +336,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkbd.f b/TESTING/EIG/schkbd.f index 831c6679..2b5df0d4 100644 --- a/TESTING/EIG/schkbd.f +++ b/TESTING/EIG/schkbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKBD( NSIZES, MVAL, NVAL, NTYPES, DOTYPE, NRHS, * ISEED, THRESH, A, LDA, BD, BE, S1, S2, X, LDX, @@ -27,11 +27,11 @@ * $ Y( LDX, * ), Z( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKBD checks the singular value decomposition (SVD) routines. *> @@ -174,11 +174,10 @@ *> *> A subset of the full set of matrix types may be selected through *> the logical array DOTYPE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -418,10 +417,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkbk.f b/TESTING/EIG/schkbk.f index ebffb637..13afc105 100644 --- a/TESTING/EIG/schkbk.f +++ b/TESTING/EIG/schkbk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKBK( NIN, NOUT ) * @@ -14,20 +14,19 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKBK tests SGEBAK, a routine for backward transformation of *> the computed right or left eigenvectors if the orginal matrix *> was preprocessed by balance subroutine SGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -40,10 +39,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkbl.f b/TESTING/EIG/schkbl.f index a8e2e53d..44c216f3 100644 --- a/TESTING/EIG/schkbl.f +++ b/TESTING/EIG/schkbl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKBL( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKBL tests SGEBAL, a routine for balancing a general real *> matrix and isolating some of its eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkec.f b/TESTING/EIG/schkec.f index c60fede3..2fd78afc 100644 --- a/TESTING/EIG/schkec.f +++ b/TESTING/EIG/schkec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKEC( THRESH, TSTERR, NIN, NOUT ) * @@ -16,11 +16,11 @@ * REAL THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKEC tests eigen- condition estimation routines *> SLALN2, SLASY2, SLANV2, SLAQTR, SLAEXC, @@ -31,11 +31,10 @@ *> results to a threshold THRESH. In addition, STREXC, STRSNA and STRSEN *> are tested by reading in precomputed examples from a file (on input *> unit NIN). Output is written to output unit NOUT. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -61,10 +60,9 @@ *> NOUT is INTEGER *> The logical unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkee.f b/TESTING/EIG/schkee.f index 73dd3bb4..860eca47 100644 --- a/TESTING/EIG/schkee.f +++ b/TESTING/EIG/schkee.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM SCHKEE * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKEE tests the REAL LAPACK subroutines for the matrix *> eigenvalue problem. The test paths in this version are @@ -1018,15 +1018,14 @@ *> precomputed examples, and LWORK = NMAX*(5*NMAX+5)+1 in the parameter *> statements below. For SVD, we assume NRHS may be as big as N. The *> parameter NEED is set to 14 to allow for 14 N-by-N matrices for SGG. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -1037,8 +1036,7 @@ * *> \ingroup single_eig * -* ===================================================================== - PROGRAM SCHKEE +* ===================================================================== PROGRAM SCHKEE * * -- LAPACK test routine (version 3.1.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/EIG/schkgg.f b/TESTING/EIG/schkgg.f index e458510f..50a8ede4 100644 --- a/TESTING/EIG/schkgg.f +++ b/TESTING/EIG/schkgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * TSTDIF, THRSHN, NOUNIT, A, LDA, B, H, T, S1, @@ -32,11 +32,11 @@ * $ Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKGG checks the nonsymmetric generalized eigenvalue problem *> routines. @@ -216,11 +216,10 @@ *> *> (26) U ( T1, T2 ) V where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -492,10 +491,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkgk.f b/TESTING/EIG/schkgk.f index b52eace4..919adff9 100644 --- a/TESTING/EIG/schkgk.f +++ b/TESTING/EIG/schkgk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKGK( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKGK tests SGGBAK, a routine for backward balancing of *> a matrix pair (A, B). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkgl.f b/TESTING/EIG/schkgl.f index b82ccb4f..e943a065 100644 --- a/TESTING/EIG/schkgl.f +++ b/TESTING/EIG/schkgl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKGL( NIN, NOUT ) * @@ -14,18 +14,17 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKGL tests SGGBAL, a routine for balancing a matrix pair (A, B). +*> \verbatim *> -*>\endverbatim +*> SCHKGL tests SGGBAL, a routine for balancing a matrix pair (A, B). +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -38,10 +37,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkhs.f b/TESTING/EIG/schkhs.f index 47b6a079..0b43a7ab 100644 --- a/TESTING/EIG/schkhs.f +++ b/TESTING/EIG/schkhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKHS( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, T1, T2, U, LDU, Z, UZ, WR1, @@ -30,11 +30,11 @@ * $ WR3( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKHS checks the nonsymmetric eigenvalue problem routines. *> @@ -155,11 +155,10 @@ *> (19) Nonsymmetric matrix with random entries chosen from (-1,1). *> (20) Same as (19), but multiplied by SQRT( overflow threshold ) *> (21) Same as (19), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES - INTEGER @@ -386,10 +385,9 @@ *> KCONDS(j) Selects whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schksb.f b/TESTING/EIG/schksb.f index 2dafac47..bc1c003a 100644 --- a/TESTING/EIG/schksb.f +++ b/TESTING/EIG/schksb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKSB( NSIZES, NN, NWDTHS, KK, NTYPES, DOTYPE, ISEED, * THRESH, NOUNIT, A, LDA, SD, SE, U, LDU, WORK, @@ -24,11 +24,11 @@ * $ U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKSB tests the reduction of a symmetric band matrix to tridiagonal *> form, used with the symmetric eigenvalue problem. @@ -93,11 +93,10 @@ *> (13) Symmetric matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -276,10 +275,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/schkst.f b/TESTING/EIG/schkst.f index 1f516284..359e7aa8 100644 --- a/TESTING/EIG/schkst.f +++ b/TESTING/EIG/schkst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, AP, SD, SE, D1, D2, D3, D4, D5, @@ -28,11 +28,11 @@ * $ WA3( * ), WORK( * ), WR( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKST checks the symmetric eigenvalue problem routines. *> @@ -243,11 +243,10 @@ *> (20) Same as (16), but multiplied by SQRT( underflow threshold ) *> (21) A diagonally dominant tridiagonal matrix with geometrically *> spaced diagonal entries 1, ..., ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -573,10 +572,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sckcsd.f b/TESTING/EIG/sckcsd.f index e4281d14..94975032 100644 --- a/TESTING/EIG/sckcsd.f +++ b/TESTING/EIG/sckcsd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCKCSD( NM, MVAL, PVAL, QVAL, NMATS, ISEED, THRESH, * MMAX, X, XF, U1, U2, V1T, V2T, THETA, IWORK, @@ -24,20 +24,19 @@ * $ WORK( * ), X( * ), XF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCKCSD tests SORCSD: *> the CSD for an M-by-M orthogonal matrix X partitioned as *> [ X11 X12; X21 X22 ]. X11 is P-by-Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -167,10 +166,9 @@ *> > 0 : If SLAROR returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sckglm.f b/TESTING/EIG/sckglm.f index 2ce0b7a2..07c28159 100644 --- a/TESTING/EIG/sckglm.f +++ b/TESTING/EIG/sckglm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCKGLM( NN, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -22,19 +22,18 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCKGLM tests SGGGLM - subroutine for solving generalized linear *> model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -150,10 +149,9 @@ *> > 0 : If SLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sckgqr.f b/TESTING/EIG/sckgqr.f index ca543be0..50dcb0a9 100644 --- a/TESTING/EIG/sckgqr.f +++ b/TESTING/EIG/sckgqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCKGQR( NM, MVAL, NP, PVAL, NN, NVAL, NMATS, ISEED, * THRESH, NMAX, A, AF, AQ, AR, TAUA, B, BF, BZ, @@ -23,20 +23,19 @@ * $ RWORK( * ), TAUA( * ), TAUB( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCKGQR tests *> SGGQRF: GQR factorization for N-by-M matrix A and N-by-P matrix B, *> SGGRQF: GRQ factorization for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -193,10 +192,9 @@ *> > 0 : If SLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sckgsv.f b/TESTING/EIG/sckgsv.f index 20e6ca9c..f777a7ba 100644 --- a/TESTING/EIG/sckgsv.f +++ b/TESTING/EIG/sckgsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCKGSV( NM, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, U, V, Q, ALPHA, BETA, R, @@ -24,19 +24,18 @@ * $ V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCKGSV tests SGGSVD: *> the GSVD for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -181,10 +180,9 @@ *> > 0 : If SLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/scklse.f b/TESTING/EIG/scklse.f index e8a830b4..534bb461 100644 --- a/TESTING/EIG/scklse.f +++ b/TESTING/EIG/scklse.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCKLSE( NN, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -22,19 +22,18 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCKLSE tests SGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -150,10 +149,9 @@ *> > 0 : If SLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/scsdts.f b/TESTING/EIG/scsdts.f index 1a9ba8f7..a1aa2e98 100644 --- a/TESTING/EIG/scsdts.f +++ b/TESTING/EIG/scsdts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCSDTS( M, P, Q, X, XF, LDX, U1, LDU1, U2, LDU2, V1T, * LDV1T, V2T, LDV2T, THETA, IWORK, WORK, LWORK, @@ -23,11 +23,11 @@ * $ XF( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCSDTS tests SORCSD, which, given an M-by-M partitioned orthogonal *> matrix X, @@ -47,11 +47,10 @@ *> [ 0 0 0 | I 0 0 ] [ D21 D22 ] *> [ 0 S 0 | 0 C 0 ] *> [ 0 0 I | 0 0 0 ] -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,9 @@ *> = ULPINV otherwise. *> ( EPS2 = MAX( norm( I - X'*X ) / M, ULP ). ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrges.f b/TESTING/EIG/sdrges.f index 7fd779e1..79cca6ba 100644 --- a/TESTING/EIG/sdrges.f +++ b/TESTING/EIG/sdrges.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRGES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, ALPHAR, @@ -26,11 +26,11 @@ * $ WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRGES checks the nonsymmetric generalized eigenvalue (Schur form) *> problem driver SGGES. @@ -200,11 +200,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -385,10 +384,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrgev.f b/TESTING/EIG/sdrgev.f index 2adcd115..473ee089 100644 --- a/TESTING/EIG/sdrgev.f +++ b/TESTING/EIG/sdrgev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRGEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, QE, LDQE, @@ -28,11 +28,11 @@ * $ T( LDA, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRGEV checks the nonsymmetric generalized eigenvalue problem driver *> routine SGGEV. @@ -177,11 +177,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -390,10 +389,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrgsx.f b/TESTING/EIG/sdrgsx.f index b0e96a89..ff170ac6 100644 --- a/TESTING/EIG/sdrgsx.f +++ b/TESTING/EIG/sdrgsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, * AI, BI, Z, Q, ALPHAR, ALPHAI, BETA, C, LDC, S, @@ -26,11 +26,11 @@ * $ WORK( * ), Z( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRGSX checks the nonsymmetric generalized eigenvalue (Schur form) *> problem expert driver SGGESX. @@ -119,7 +119,7 @@ *> and DIF_l when testing the built-in test problems. *> *> Built-in Test Matrices -*> ====================== +* ====================== *> *> All built-in test matrices are the 2 by 2 block of triangular *> matrices @@ -178,11 +178,10 @@ *> | 1-d | *> and matrix B are chosen as identity matrices (see SLATM5). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -342,10 +341,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrgvx.f b/TESTING/EIG/sdrgvx.f index f1aad543..fdc6d479 100644 --- a/TESTING/EIG/sdrgvx.f +++ b/TESTING/EIG/sdrgvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRGVX( NSIZE, THRESH, NIN, NOUT, A, LDA, B, AI, BI, * ALPHAR, ALPHAI, BETA, VL, VR, ILO, IHI, LSCALE, @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRGVX checks the nonsymmetric generalized eigenvalue problem *> expert driver SGGEVX. @@ -102,11 +102,10 @@ *> *> a, b, x and y will have all values independently of each other from *> { sqrt(sqrt(ULP)), 0.1, 1, 10, 1/sqrt(sqrt(ULP)) }. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -283,10 +282,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvbd.f b/TESTING/EIG/sdrvbd.f index c03e343b..9ea2fc3f 100644 --- a/TESTING/EIG/sdrvbd.f +++ b/TESTING/EIG/sdrvbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVBD( NSIZES, MM, NN, NTYPES, DOTYPE, ISEED, THRESH, * A, LDA, U, LDU, VT, LDVT, ASAV, USAV, VTSAV, S, @@ -25,11 +25,11 @@ * $ VT( LDVT, * ), VTSAV( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVBD checks the singular value decomposition (SVD) drivers *> SGESVD, SGESDD, SGESVJ, and SGEJSV. @@ -126,11 +126,10 @@ *> on the diagonal. *> (4) Same as (3), but multiplied by the underflow-threshold / ULP. *> (5) Same as (3), but multiplied by the overflow-threshold * ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -302,10 +301,9 @@ *> If SLATMS, or SGESVD returns an error code, the *> absolute value of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrves.f b/TESTING/EIG/sdrves.f index f4cdd51c..f55e3db4 100644 --- a/TESTING/EIG/sdrves.f +++ b/TESTING/EIG/sdrves.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, HT, WR, WI, WRT, WIT, VS, @@ -24,11 +24,11 @@ * $ WORK( * ), WR( * ), WRT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVES checks the nonsymmetric eigenvalue (Schur form) problem *> driver SGEES. @@ -161,11 +161,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -371,10 +370,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvev.f b/TESTING/EIG/sdrvev.f index f75d43bc..1a1244d7 100644 --- a/TESTING/EIG/sdrvev.f +++ b/TESTING/EIG/sdrvev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, WR, WI, WR1, WI1, VL, LDVL, @@ -26,11 +26,11 @@ * $ WI( * ), WI1( * ), WORK( * ), WR( * ), WR1( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVEV checks the nonsymmetric eigenvalue problem driver SGEEV. *> @@ -162,11 +162,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -388,10 +387,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvgg.f b/TESTING/EIG/sdrvgg.f index 87cfaca6..549cd70a 100644 --- a/TESTING/EIG/sdrvgg.f +++ b/TESTING/EIG/sdrvgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * THRSHN, NOUNIT, A, LDA, B, S, T, S2, T2, Q, @@ -28,11 +28,11 @@ * $ VR( LDQ, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVGG checks the nonsymmetric generalized eigenvalue driver *> routines. @@ -188,11 +188,10 @@ *> *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -434,10 +433,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvsg.f b/TESTING/EIG/sdrvsg.f index 57703cdc..0e77162a 100644 --- a/TESTING/EIG/sdrvsg.f +++ b/TESTING/EIG/sdrvsg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVSG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, LDB, D, Z, LDZ, AB, BB, AP, @@ -25,11 +25,11 @@ * $ RESULT( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVSG checks the real symmetric generalized eigenproblem *> drivers. @@ -159,11 +159,10 @@ *> (19) Same as (8), but with KA = 3 and KB = 1 *> (20) Same as (8), but with KA = 3 and KB = 2 *> (21) Same as (8), but with KA = 3 and KB = 3 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -338,10 +337,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvst.f b/TESTING/EIG/sdrvst.f index cd554aff..8db4e1e1 100644 --- a/TESTING/EIG/sdrvst.f +++ b/TESTING/EIG/sdrvst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, D1, D2, D3, D4, EVEIGS, WA1, @@ -27,11 +27,11 @@ * $ WA3( * ), WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVST checks the symmetric eigenvalue problem drivers. *> @@ -140,11 +140,10 @@ *> with random signs. *> (17) Same as (16), but multiplied by SQRT( overflow threshold ) *> (18) Same as (16), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -435,10 +434,9 @@ *> 95= | I - U U' | / ( n ulp ) SSBEVR('L','V','V', ... ) *> 96= |D(with Z) - D(w/o Z)| / (|D| ulp) SSBEVR('L','N','V', ... ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvsx.f b/TESTING/EIG/sdrvsx.f index a1b98e18..81cdd05e 100644 --- a/TESTING/EIG/sdrvsx.f +++ b/TESTING/EIG/sdrvsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVSX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, HT, WR, WI, WRT, @@ -27,11 +27,11 @@ * $ WR( * ), WRT( * ), WRTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVSX checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver SGEESX. @@ -206,11 +206,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -436,10 +435,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sdrvvx.f b/TESTING/EIG/sdrvvx.f index 9b32d066..598dd0b2 100644 --- a/TESTING/EIG/sdrvvx.f +++ b/TESTING/EIG/sdrvvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVVX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, WR, WI, WR1, WI1, @@ -30,11 +30,11 @@ * $ WI1( * ), WORK( * ), WR( * ), WR1( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVVX checks the nonsymmetric eigenvalue problem expert driver *> SGEEVX. @@ -211,11 +211,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -501,10 +500,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/serrbd.f b/TESTING/EIG/serrbd.f index 3ce15374..a26e4a04 100644 --- a/TESTING/EIG/serrbd.f +++ b/TESTING/EIG/serrbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRBD( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRBD tests the error exits for SGEBRD, SORGBR, SORMBR, SBDSQR and *> SBDSDC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -40,10 +39,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/serrec.f b/TESTING/EIG/serrec.f index 539b417d..726c7aa4 100644 --- a/TESTING/EIG/serrec.f +++ b/TESTING/EIG/serrec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERREC( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERREC tests the error exits for the routines for eigen- condition *> estimation for REAL matrices: *> STRSYL, STREXC, STRSNA and STRSEN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/serred.f b/TESTING/EIG/serred.f index ab2845e7..7dc21929 100644 --- a/TESTING/EIG/serred.f +++ b/TESTING/EIG/serred.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRED( PATH, NUNIT ) * @@ -15,11 +15,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRED tests the error exits for the eigenvalue driver routines for *> REAL matrices: @@ -34,11 +34,10 @@ *> SGESDD compute SVD of an M-by-N matrix A (by divide and *> conquer) *> SGEJSV compute SVD of an M-by-N matrix A where M >= N -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -51,10 +50,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/serrgg.f b/TESTING/EIG/serrgg.f index fc55688b..58c05ec4 100644 --- a/TESTING/EIG/serrgg.f +++ b/TESTING/EIG/serrgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRGG( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRGG tests the error exits for SGGES, SGGESX, SGGEV, SGGEVX, *> SGGGLM, SGGHRD, SGGLSE, SGGQRF, SGGRQF, SGGSVD, SGGSVP, SHGEQZ, *> SORCSD, STGEVC, STGEXC, STGSEN, STGSJA, STGSNA, and STGSYL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/serrhs.f b/TESTING/EIG/serrhs.f index 677104a0..5a802a89 100644 --- a/TESTING/EIG/serrhs.f +++ b/TESTING/EIG/serrhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRHS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRHS tests the error exits for SGEBAK, SGEBAL, SGEHRD, SORGHR, *> SORMHR, SHSEQR, SHSEIN, and STREVC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -40,10 +39,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/serrst.f b/TESTING/EIG/serrst.f index 145a2c7e..b959f675 100644 --- a/TESTING/EIG/serrst.f +++ b/TESTING/EIG/serrst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRST( PATH, NUNIT ) * @@ -15,21 +15,20 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRST tests the error exits for SSYTRD, SORGTR, SORMTR, SSPTRD, *> SOPGTR, SOPMTR, SSTEQR, SSTERF, SSTEBZ, SSTEIN, SPTEQR, SSBTRD, *> SSYEV, SSYEVX, SSYEVD, SSBEV, SSBEVX, SSBEVD, *> SSPEV, SSPEVX, SSPEVD, SSTEV, SSTEVX, SSTEVD, and SSTEDC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -42,10 +41,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget02.f b/TESTING/EIG/sget02.f index 2dc6ab26..0b02e81b 100644 --- a/TESTING/EIG/sget02.f +++ b/TESTING/EIG/sget02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET02( TRANS, M, N, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET02 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -117,10 +116,9 @@ *> The maximum over the number of right hand sides of *> norm(B - A*X) / ( norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget10.f b/TESTING/EIG/sget10.f index 5925e481..c10582f9 100644 --- a/TESTING/EIG/sget10.f +++ b/TESTING/EIG/sget10.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET10( M, N, A, LDA, B, LDB, WORK, RESULT ) * @@ -18,19 +18,18 @@ * REAL A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET10 compares two matrices A and B and computes the ratio *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -78,10 +77,9 @@ *> RESULT is REAL *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget22.f b/TESTING/EIG/sget22.f index 7db0f4ac..b0d9af0d 100644 --- a/TESTING/EIG/sget22.f +++ b/TESTING/EIG/sget22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET22( TRANSA, TRANSE, TRANSW, N, A, LDA, E, LDE, WR, * WI, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET22 does an eigenvector check. *> @@ -58,11 +58,10 @@ *> To handle various schemes for storage of left eigenvectors, there are *> options to use A-transpose instead of A, E-transpose instead of E, *> and/or W-transpose instead of W. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -151,10 +150,9 @@ *> RESULT(1) = | A E - E W | / ( |A| |E| ulp ) *> RESULT(2) = max | m-norm(E(j)) - 1 | / ( n ulp ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget23.f b/TESTING/EIG/sget23.f index f614b5f2..b4b0d4c9 100644 --- a/TESTING/EIG/sget23.f +++ b/TESTING/EIG/sget23.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET23( COMP, BALANC, JTYPE, THRESH, ISEED, NOUNIT, N, * A, LDA, H, WR, WI, WR1, WI1, VL, LDVL, VR, @@ -31,11 +31,11 @@ * $ WI1( * ), WORK( * ), WR( * ), WR1( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET23 checks the nonsymmetric eigenvalue problem driver SGEEVX. *> If COMP = .FALSE., the first 8 of the following tests will be @@ -122,11 +122,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -359,10 +358,9 @@ *> If >0, SGEEVX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget24.f b/TESTING/EIG/sget24.f index 48c35b99..83a3ae75 100644 --- a/TESTING/EIG/sget24.f +++ b/TESTING/EIG/sget24.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET24( COMP, JTYPE, THRESH, ISEED, NOUNIT, N, A, LDA, * H, HT, WR, WI, WRT, WIT, WRTMP, WITMP, VS, @@ -27,11 +27,11 @@ * $ WR( * ), WRT( * ), WRTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET24 checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver SGEESX. @@ -117,11 +117,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -325,10 +324,9 @@ *> If >0, SGEESX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget31.f b/TESTING/EIG/sget31.f index f2a166f7..608b264f 100644 --- a/TESTING/EIG/sget31.f +++ b/TESTING/EIG/sget31.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET31( RMAX, LMAX, NINFO, KNT ) * @@ -18,11 +18,11 @@ * INTEGER NINFO( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET31 tests SLALN2, a routine for solving *> @@ -46,11 +46,10 @@ *> should be on the order of 1. Here, ulp is the machine precision. *> Also, it is verified that SCALE is less than or equal to 1, and that *> XNORM = infinity-norm(X). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -76,10 +75,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget32.f b/TESTING/EIG/sget32.f index 394323aa..dda9095e 100644 --- a/TESTING/EIG/sget32.f +++ b/TESTING/EIG/sget32.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET32( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * REAL RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET32 tests SLASY2, a routine for solving *> @@ -38,11 +38,10 @@ *> should be on the order of 1. Here, ulp is the machine precision. *> Also, it is verified that SCALE is less than or equal to 1, and *> that XNORM = infinity-norm(X). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -67,10 +66,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget33.f b/TESTING/EIG/sget33.f index 5777b65d..bc724eba 100644 --- a/TESTING/EIG/sget33.f +++ b/TESTING/EIG/sget33.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET33( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * REAL RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET33 tests SLANV2, a routine for putting 2 by 2 blocks into *> standard form. In other words, it computes a two by two rotation @@ -32,11 +32,10 @@ *> 1) T21=0 (real eigenvalues), or *> 2) T11=T22 and T21*T12<0 (complex conjugate eigenvalues). *> We also verify that the residual is small. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -61,10 +60,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget34.f b/TESTING/EIG/sget34.f index 74d646c4..06464284 100644 --- a/TESTING/EIG/sget34.f +++ b/TESTING/EIG/sget34.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET34( RMAX, LMAX, NINFO, KNT ) * @@ -18,11 +18,11 @@ * INTEGER NINFO( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET34 tests SLAEXC, a routine for swapping adjacent blocks (either *> 1 by 1 or 2 by 2) on the diagonal of a matrix in real Schur form. @@ -38,11 +38,10 @@ *> *> The test code verifies these last last assertions, as well as that *> the residual in the above equation is small. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -67,10 +66,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget35.f b/TESTING/EIG/sget35.f index b48b5335..d5a7c75d 100644 --- a/TESTING/EIG/sget35.f +++ b/TESTING/EIG/sget35.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET35( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * REAL RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET35 tests STRSYL, a routine for solving the Sylvester matrix *> equation @@ -34,11 +34,10 @@ *> *> norm(op(A)*X + ISGN*X*op(B) - scale*C) / *> (EPS*max(norm(A),norm(B))*norm(X)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -63,10 +62,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget36.f b/TESTING/EIG/sget36.f index e6cb609a..76bb5918 100644 --- a/TESTING/EIG/sget36.f +++ b/TESTING/EIG/sget36.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET36( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,11 +18,11 @@ * INTEGER NINFO( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET36 tests STREXC, a routine for moving blocks (either 1 by 1 or *> 2 by 2) on the diagonal of a matrix in real Schur form. Thus, SLAEXC @@ -38,11 +38,10 @@ *> ILST (within +-1). *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -73,10 +72,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget37.f b/TESTING/EIG/sget37.f index 63a1a3f9..2fe262b0 100644 --- a/TESTING/EIG/sget37.f +++ b/TESTING/EIG/sget37.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET37( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * REAL RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET37 tests STRSNA, a routine for estimating condition numbers of *> eigenvalues and/or right eigenvectors of a matrix. *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -75,10 +74,9 @@ *> NIN is INTEGER *> Input logical unit number *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget38.f b/TESTING/EIG/sget38.f index d89ca064..a34bf688 100644 --- a/TESTING/EIG/sget38.f +++ b/TESTING/EIG/sget38.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET38( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * REAL RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET38 tests STRSEN, a routine for estimating condition numbers of a *> cluster of eigenvalues and/or its associated right invariant subspace *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -76,10 +75,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget39.f b/TESTING/EIG/sget39.f index 8c23cbad..f67a097f 100644 --- a/TESTING/EIG/sget39.f +++ b/TESTING/EIG/sget39.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET39( RMAX, LMAX, NINFO, KNT ) * @@ -15,11 +15,11 @@ * REAL RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET39 tests SLAQTR, a routine for solving the real or *> special complex quasi upper triangular system @@ -59,11 +59,10 @@ *> *> (The (||T||+||B||)*smlnum/ulp term accounts for possible *> (gradual or nongradual) underflow in x1 and x2.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -88,10 +87,9 @@ *> KNT is INTEGER *> Total number of examples tested. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget51.f b/TESTING/EIG/sget51.f index 549d59b0..bf815c7c 100644 --- a/TESTING/EIG/sget51.f +++ b/TESTING/EIG/sget51.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET51( ITYPE, N, A, LDA, B, LDB, U, LDU, V, LDV, WORK, * RESULT ) @@ -20,11 +20,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET51 generally checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> If ITYPE=3, then: *> *> RESULT = | I - UU' | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -133,10 +132,9 @@ *> value is currently limited to 1/ulp, to avoid overflow. *> Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget52.f b/TESTING/EIG/sget52.f index a044fa4f..ba1520fb 100644 --- a/TESTING/EIG/sget52.f +++ b/TESTING/EIG/sget52.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET52( LEFT, N, A, LDA, B, LDB, E, LDE, ALPHAR, * ALPHAI, BETA, WORK, RESULT ) @@ -21,11 +21,11 @@ * $ RESULT( 2 ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET52 does an eigenvector check for the generalized eigenvalue *> problem. @@ -68,11 +68,10 @@ *> *> RESULT(2) = max | M(v(j)) - 1 | / ( n ulp ) *> eigenvectors v(j) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LEFT *> \verbatim @@ -183,10 +182,9 @@ *> B E is likely to overflow, then RESULT(1:2) is set to *> 10 / ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget53.f b/TESTING/EIG/sget53.f index c3fdd99d..391a6b30 100644 --- a/TESTING/EIG/sget53.f +++ b/TESTING/EIG/sget53.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET53( A, LDA, B, LDB, SCALE, WR, WI, RESULT, INFO ) * @@ -18,11 +18,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET53 checks the generalized eigenvalues computed by SLAG2. *> @@ -43,11 +43,10 @@ *> *> If these tests are not passed, then s and w are scaled and *> tested anyway, if this is possible. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -111,10 +110,9 @@ *> =3: same as INFO=2, but s and w could not be scaled so *> as to compute the test. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sget54.f b/TESTING/EIG/sget54.f index 0001fd85..27475403 100644 --- a/TESTING/EIG/sget54.f +++ b/TESTING/EIG/sget54.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET54( N, A, LDA, B, LDB, S, LDS, T, LDT, U, LDU, V, * LDV, WORK, RESULT ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET54 checks a generalized decomposition of the form *> @@ -36,11 +36,10 @@ *> Specifically, *> *> RESULT = ||( A - U*S*V', B - U*T*V' )|| / (||( A, B )||*n*ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -140,10 +139,9 @@ *> The value RESULT, It is currently limited to 1/ulp, to *> avoid overflow. Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sglmts.f b/TESTING/EIG/sglmts.f index 41655718..4a9b9d29 100644 --- a/TESTING/EIG/sglmts.f +++ b/TESTING/EIG/sglmts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGLMTS( N, M, P, A, AF, LDA, B, BF, LDB, D, DF, * X, U, WORK, LWORK, RWORK, RESULT ) @@ -20,19 +20,18 @@ * $ BF( LDB, * ), RWORK( * ), D( * ), DF( * ), * $ U( * ), WORK( LWORK ), X( * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGLMTS tests SGGGLM - a subroutine for solving the generalized *> linear model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -133,10 +132,9 @@ *> RESULT = ----------------------------------------- *> (norm(A)+norm(B))*(norm(x)+norm(u))*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sgqrts.f b/TESTING/EIG/sgqrts.f index 0fa14d47..fca6a1f4 100644 --- a/TESTING/EIG/sgqrts.f +++ b/TESTING/EIG/sgqrts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGQRTS( N, M, P, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ RWORK( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGQRTS tests SGGQRF, which computes the GQR factorization of an *> N-by-M matrix A and a N-by-P matrix B: A = Q*R and B = Q*T*Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( M*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sgrqts.f b/TESTING/EIG/sgrqts.f index aae24a0f..f1960b1e 100644 --- a/TESTING/EIG/sgrqts.f +++ b/TESTING/EIG/sgrqts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGRQTS( M, P, N, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -23,19 +23,18 @@ * $ RESULT( 4 ), RWORK( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGRQTS tests SGGRQF, which computes the GRQ factorization of an *> M-by-N matrix A and a P-by-N matrix B: A = R*Q and B = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -161,10 +160,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( N*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sgsvts.f b/TESTING/EIG/sgsvts.f index 7a74ca9b..a803849b 100644 --- a/TESTING/EIG/sgsvts.f +++ b/TESTING/EIG/sgsvts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGSVTS( M, P, N, A, AF, LDA, B, BF, LDB, U, LDU, V, * LDV, Q, LDQ, ALPHA, BETA, R, LDR, IWORK, WORK, @@ -24,20 +24,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGSVTS tests SGGSVD, which computes the GSVD of an M-by-N matrix A *> and a P-by-N matrix B: *> U'*A*Q = D1*R and V'*B*Q = D2*R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -193,10 +192,9 @@ *> RESULT(6) = 0 if ALPHA is in decreasing order; *> = ULPINV otherwise. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/shst01.f b/TESTING/EIG/shst01.f index a36ac4dd..fc987a6c 100644 --- a/TESTING/EIG/shst01.f +++ b/TESTING/EIG/shst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SHST01( N, ILO, IHI, A, LDA, H, LDH, Q, LDQ, WORK, * LWORK, RESULT ) @@ -19,11 +19,11 @@ * $ RESULT( 2 ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SHST01 tests the reduction of a general matrix A to upper Hessenberg *> form: A = Q*H*Q'. Two test ratios are computed; @@ -36,11 +36,10 @@ *> *> In this version, ILO and IHI are not used and are assumed to be 1 and *> N, respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> RESULT(1) = norm( A - Q*H*Q' ) / ( norm(A) * N * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( N * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slafts.f b/TESTING/EIG/slafts.f index 7e49023a..d2577496 100644 --- a/TESTING/EIG/slafts.f +++ b/TESTING/EIG/slafts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAFTS( TYPE, M, N, IMAT, NTESTS, RESULT, ISEED, * THRESH, IOUNIT, IE ) @@ -21,20 +21,19 @@ * REAL RESULT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAFTS tests the result vector against the threshold value to *> see which tests for this matrix type failed to pass the threshold. *> Output is to the file given by unit IOUNIT. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> TYPE - CHARACTER*3 @@ -83,10 +82,9 @@ *> failed to pass the threshold so far. *> Updated on exit if any of the ratios in RESULT also fail. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slahd2.f b/TESTING/EIG/slahd2.f index 2a09afc5..86601f9f 100644 --- a/TESTING/EIG/slahd2.f +++ b/TESTING/EIG/slahd2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAHD2( IOUNIT, PATH ) * @@ -15,18 +15,17 @@ * INTEGER IOUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SLAHD2 prints header information for the different test paths. +*> \verbatim *> -*>\endverbatim +*> SLAHD2 prints header information for the different test paths. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IOUNIT *> \verbatim @@ -50,10 +49,9 @@ *> These paths also are supplied in double precision (replace *> leading S by D and leading C by Z in path names). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slarfy.f b/TESTING/EIG/slarfy.f index 56b7b860..e48e5b3b 100644 --- a/TESTING/EIG/slarfy.f +++ b/TESTING/EIG/slarfy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARFY( UPLO, N, V, INCV, TAU, C, LDC, WORK ) * @@ -19,11 +19,11 @@ * REAL C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARFY applies an elementary reflector, or Householder matrix, H, *> to an n x n symmetric matrix C, from both the left and the right. @@ -35,11 +35,10 @@ *> where tau is a scalar and v is a vector. *> *> If tau is zero, then H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,9 @@ *> \verbatim *> WORK is REAL array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slarhs.f b/TESTING/EIG/slarhs.f index f6b1473d..c021b865 100644 --- a/TESTING/EIG/slarhs.f +++ b/TESTING/EIG/slarhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARHS( PATH, XTYPE, UPLO, TRANS, M, N, KL, KU, NRHS, * A, LDA, X, LDX, B, LDB, ISEED, INFO ) @@ -21,21 +21,20 @@ * REAL A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARHS chooses a set of NRHS random solution vectors and sets *> up the right hand sides for the linear system *> op( A ) * X = B, *> where op( A ) may be A or A' (transpose of A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -188,10 +187,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slasum.f b/TESTING/EIG/slasum.f index b2e22e15..3a1e8212 100644 --- a/TESTING/EIG/slasum.f +++ b/TESTING/EIG/slasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASUM( TYPE, IOUNIT, IE, NRUN ) * @@ -25,8 +25,8 @@ * * ===================================================================== * -* Authors -* ======= +* Authors: +* ======== * * \author Univ. of Tennessee * \author Univ. of California Berkeley diff --git a/TESTING/EIG/slatb9.f b/TESTING/EIG/slatb9.f index 7e6f2818..0206e047 100644 --- a/TESTING/EIG/slatb9.f +++ b/TESTING/EIG/slatb9.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATB9( PATH, IMAT, M, P, N, TYPE, KLA, KUA, * KLB, KUB, ANORM, BNORM, MODEA, MODEB, @@ -19,19 +19,18 @@ * REAL ANORM, BNORM, CNDNMA, CNDNMB * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATB9 sets parameters for the matrix generator based on the type of *> matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -153,10 +152,9 @@ *> The type of distribution to be used by the random number *> generator. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slatm4.f b/TESTING/EIG/slatm4.f index 757231a6..6409db79 100644 --- a/TESTING/EIG/slatm4.f +++ b/TESTING/EIG/slatm4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATM4( ITYPE, N, NZ1, NZ2, ISIGN, AMAGN, RCOND, * TRIANG, IDIST, ISEED, A, LDA ) @@ -20,11 +20,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM4 generates basic square matrices, which may later be *> multiplied by others in order to produce test matrices. It is @@ -35,11 +35,10 @@ *> according to the value of ITYPE, NZ1, NZ2, ISIGN, AMAGN, and RCOND. *> It then fills in the upper triangle with random numbers, if TRIANG is *> non-zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -159,10 +158,9 @@ *> LDA is INTEGER *> Leading dimension of A. Must be at least 1 and at least N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slctes.f b/TESTING/EIG/slctes.f index 44ecb89f..44679e91 100644 --- a/TESTING/EIG/slctes.f +++ b/TESTING/EIG/slctes.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION SLCTES( ZR, ZI, D ) * @@ -14,11 +14,11 @@ * REAL D, ZI, ZR * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLCTES returns .TRUE. if the eigenvalue (ZR/D) + sqrt(-1)*(ZI/D) *> is to be selected (specifically, in this subroutine, if the real @@ -27,11 +27,10 @@ *> *> It is used by the test routine SDRGES to test whether the driver *> routine SGGES succesfully sorts eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ZR *> \verbatim @@ -53,10 +52,9 @@ *> The denominator part of a complex eigenvalue *> (ZR/D) + i*(ZI/D). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slctsx.f b/TESTING/EIG/slctsx.f index 286bf183..22f43fd4 100644 --- a/TESTING/EIG/slctsx.f +++ b/TESTING/EIG/slctsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION SLCTSX( AR, AI, BETA ) * @@ -14,21 +14,20 @@ * REAL AI, AR, BETA * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This function is used to determine what eigenvalues will be *> selected. If this is part of the test driver SDRGSX, do not *> change the code UNLESS you are testing input examples and not *> using the built-in examples. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] AR *> \verbatim @@ -50,10 +49,9 @@ *> The denominator part of a complex eigenvalue *> (AR/BETA) + i*(AI/BETA). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/slsets.f b/TESTING/EIG/slsets.f index c58f2246..1068ef78 100644 --- a/TESTING/EIG/slsets.f +++ b/TESTING/EIG/slsets.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLSETS( M, P, N, A, AF, LDA, B, BF, LDB, C, CF, * D, DF, X, WORK, LWORK, RWORK, RESULT ) @@ -20,19 +20,18 @@ * $ C( * ), D( * ), CF( * ), DF( * ), * $ WORK( LWORK ), X( * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLSETS tests SGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -139,10 +138,9 @@ *> RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS *> RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sort01.f b/TESTING/EIG/sort01.f index ee279573..baa3ad2f 100644 --- a/TESTING/EIG/sort01.f +++ b/TESTING/EIG/sort01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORT01( ROWCOL, M, N, U, LDU, WORK, LWORK, RESID ) * @@ -19,11 +19,11 @@ * REAL U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORT01 checks that the matrix U is orthogonal by computing the ratio *> @@ -41,11 +41,10 @@ *> where EPS is the machine precision. ROWCOL is used only if m = n; *> if m > n, ROWCOL is assumed to be 'C', and if m < n, ROWCOL is *> assumed to be 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ROWCOL *> \verbatim @@ -101,10 +100,9 @@ *> RESID = norm( I - U * U' ) / ( n * EPS ), if ROWCOL = 'R', or *> RESID = norm( I - U' * U ) / ( m * EPS ), if ROWCOL = 'C'. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sort03.f b/TESTING/EIG/sort03.f index a7511bbd..a62e0095 100644 --- a/TESTING/EIG/sort03.f +++ b/TESTING/EIG/sort03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORT03( RC, MU, MV, N, K, U, LDU, V, LDV, WORK, LWORK, * RESULT, INFO ) @@ -20,11 +20,11 @@ * REAL U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORT03 compares two orthogonal matrices U and V to see if their *> corresponding rows or columns span the same spaces. The rows are @@ -42,11 +42,10 @@ *> *> where S is +-1 (chosen to minimize the expression), U(i) is the i-th *> row (column) of U, and V(i) is the i-th row (column) of V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RC *> \verbatim @@ -140,10 +139,9 @@ *> 0 indicates a successful exit *> -k indicates the k-th parameter had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssbt21.f b/TESTING/EIG/ssbt21.f index 3c67a170..4775f346 100644 --- a/TESTING/EIG/ssbt21.f +++ b/TESTING/EIG/ssbt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBT21( UPLO, N, KA, KS, A, LDA, D, E, U, LDU, WORK, * RESULT ) @@ -20,11 +20,11 @@ * $ U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBT21 generally checks a decomposition of the form *> @@ -37,11 +37,10 @@ *> Specifically: *> *> RESULT(1) = | A - U S U' | / ( |A| n ulp ) *andC> RESULT(2) = | I - UU' | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssgt01.f b/TESTING/EIG/ssgt01.f index c24d4484..91be638b 100644 --- a/TESTING/EIG/ssgt01.f +++ b/TESTING/EIG/ssgt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSGT01( ITYPE, UPLO, N, M, A, LDA, B, LDB, Z, LDZ, D, * WORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSGT01 checks a decomposition of the form *> @@ -42,11 +42,10 @@ *> ITYPE = 2: RESULT(1) = | A B Z - Z D | / ( |A| |Z| n ulp ) *> *> ITYPE = 3: RESULT(1) = | B A Z - Z D | / ( |A| |Z| n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -130,10 +129,9 @@ *> RESULT is REAL array, dimension (1) *> The test ratio as described above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sslect.f b/TESTING/EIG/sslect.f index 2114d6e7..8dd02970 100644 --- a/TESTING/EIG/sslect.f +++ b/TESTING/EIG/sslect.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION SSLECT( ZR, ZI ) * @@ -14,11 +14,11 @@ * REAL ZI, ZR * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSLECT returns .TRUE. if the eigenvalue ZR+sqrt(-1)*ZI is to be *> selected, and otherwise it returns .FALSE. @@ -30,11 +30,10 @@ *> and .FALSE. otherwise. *> If SELOPT is at least 1, SSLECT returns SELVAL(SELOPT) and adds 1 *> to SELOPT, cycling back to 1 at SELMAX. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ZR *> \verbatim @@ -47,10 +46,9 @@ *> ZI is REAL *> The imaginary part of a complex eigenvalue ZR + i*ZI. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sspt21.f b/TESTING/EIG/sspt21.f index dcbc4194..494b56ed 100644 --- a/TESTING/EIG/sspt21.f +++ b/TESTING/EIG/sspt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPT21( ITYPE, UPLO, N, KBAND, AP, D, E, U, LDU, VP, * TAU, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ U( LDU, * ), VP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPT21 generally checks a decomposition of the form *> @@ -83,11 +83,10 @@ *> and the first j elements of v(j) are 0, the (j+1)-st is 1, and the *> (j+2)-nd through n-th elements are stored in V(j+2:n,j) (i.e., *> in VP( (2*n-j)*(j-1)/2 + j+2 : (2*n-j)*(j-1)/2 + n ) .) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -203,10 +202,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sstech.f b/TESTING/EIG/sstech.f index bcaa3926..6de9465e 100644 --- a/TESTING/EIG/sstech.f +++ b/TESTING/EIG/sstech.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTECH( N, A, B, EIG, TOL, WORK, INFO ) * @@ -18,11 +18,11 @@ * REAL A( * ), B( * ), EIG( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Let T be the tridiagonal matrix with diagonal entries A(1) ,..., *> A(N) and offdiagonal entries B(1) ,..., B(N-1)). SSTECH checks to @@ -36,11 +36,10 @@ *> eigenvalue. If each interval contains the correct number of *> eigenvalues, INFO = 0 is returned, otherwise INFO is the index of *> the first eigenvalue in the first bad interval. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> >0 if the interval containing the INFO-th eigenvalue *> contains the incorrect number of eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sstect.f b/TESTING/EIG/sstect.f index f90232bc..e05aab49 100644 --- a/TESTING/EIG/sstect.f +++ b/TESTING/EIG/sstect.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTECT( N, A, B, SHIFT, NUM ) * @@ -18,11 +18,11 @@ * REAL A( * ), B( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTECT counts the number NUM of eigenvalues of a tridiagonal *> matrix T which are less than or equal to SHIFT. T has @@ -31,11 +31,10 @@ *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal *> Matrix", Report CS41, Computer Science Dept., Stanford *> University, July 21, 1966 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -67,10 +66,9 @@ *> The number of eigenvalues of T less than or equal *> to SHIFT. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sstt21.f b/TESTING/EIG/sstt21.f index 3fc0b571..ce49def5 100644 --- a/TESTING/EIG/sstt21.f +++ b/TESTING/EIG/sstt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTT21( N, KBAND, AD, AE, SD, SE, U, LDU, WORK, * RESULT ) @@ -19,11 +19,11 @@ * $ SE( * ), U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTT21 checks a decomposition of the form *> @@ -36,11 +36,10 @@ *> RESULT(1) = | A - U S U' | / ( |A| n ulp ) *> *> RESULT(2) = | I - UU' | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,9 @@ *> values are currently limited to 1/ulp, to avoid overflow. *> RESULT(1) is always modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/sstt22.f b/TESTING/EIG/sstt22.f index 90f83cfe..22c9b05f 100644 --- a/TESTING/EIG/sstt22.f +++ b/TESTING/EIG/sstt22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTT22( N, M, KBAND, AD, AE, SD, SE, U, LDU, WORK, * LDWORK, RESULT ) @@ -19,11 +19,11 @@ * $ SE( * ), U( LDU, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTT22 checks a set of M eigenvalues and eigenvectors, *> @@ -36,11 +36,10 @@ *> RESULT(1) = | U' A U - S | / ( |A| m ulp ) *> *> RESULT(2) = | I - U'U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -123,10 +122,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssvdch.f b/TESTING/EIG/ssvdch.f index 6de9e393..7ce4d408 100644 --- a/TESTING/EIG/ssvdch.f +++ b/TESTING/EIG/ssvdch.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSVDCH( N, S, E, SVD, TOL, INFO ) * @@ -18,11 +18,11 @@ * REAL E( * ), S( * ), SVD( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSVDCH checks to see if SVD(1) ,..., SVD(N) are accurate singular *> values of the bidiagonal matrix B with diagonal entries @@ -37,11 +37,10 @@ *> contains the correct number of singular values, INFO = 0 is returned, *> otherwise INFO is the index of the first singular value in the first *> bad interval. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -82,10 +81,9 @@ *> >0 if the interval containing the INFO-th singular value *> contains the incorrect number of singular values. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssvdct.f b/TESTING/EIG/ssvdct.f index 89232692..b09cae3c 100644 --- a/TESTING/EIG/ssvdct.f +++ b/TESTING/EIG/ssvdct.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSVDCT( N, S, E, SHIFT, NUM ) * @@ -18,11 +18,11 @@ * REAL E( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSVDCT counts the number NUM of eigenvalues of a 2*N by 2*N *> tridiagonal matrix T which are less than or equal to SHIFT. T is @@ -37,11 +37,10 @@ *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal *> Matrix", Report CS41, Computer Science Dept., Stanford University, *> July 21, 1966 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -72,10 +71,9 @@ *> NUM is INTEGER *> The number of eigenvalues of T less than or equal to SHIFT. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssxt1.f b/TESTING/EIG/ssxt1.f index 853d30b1..37372af1 100644 --- a/TESTING/EIG/ssxt1.f +++ b/TESTING/EIG/ssxt1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SSXT1( IJOB, D1, N1, D2, N2, ABSTOL, * ULP, UNFL ) @@ -19,11 +19,11 @@ * REAL D1( * ), D2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSXT1 computes the difference between a set of eigenvalues. *> The result is returned as the function value. @@ -34,11 +34,10 @@ *> IJOB = 2: Computes max { min | D1(i)-D2(j) | / *> i j *> ( ABSTOL + |D1(i)|*ULP ) } -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -90,10 +89,9 @@ *> The smallest positive number whose reciprocal does not *> overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssyt21.f b/TESTING/EIG/ssyt21.f index 5fbde6a1..b8d80fa8 100644 --- a/TESTING/EIG/ssyt21.f +++ b/TESTING/EIG/ssyt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYT21( ITYPE, UPLO, N, KBAND, A, LDA, D, E, U, LDU, V, * LDV, TAU, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYT21 generally checks a decomposition of the form *> @@ -55,11 +55,10 @@ *> V = H(1)...H(n-2), where H(j) = I - tau(j) v(j) v(j)' and each *> vector v(j) has its first j elements 0 and the remaining n-j elements *> stored in V(j+1:n,j). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -189,10 +188,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/ssyt22.f b/TESTING/EIG/ssyt22.f index 7abdea83..3ffd3e70 100644 --- a/TESTING/EIG/ssyt22.f +++ b/TESTING/EIG/ssyt22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYT22( ITYPE, UPLO, N, M, KBAND, A, LDA, D, E, U, LDU, * V, LDV, TAU, WORK, RESULT ) @@ -20,11 +20,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYT22 generally checks a decomposition of the form *> @@ -42,11 +42,10 @@ *> Specifically, if ITYPE=1, then: *> *> RESULT(1) = | U' A U - S | / ( |A| m ulp ) *andC> RESULT(2) = | I - U'U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> ITYPE INTEGER @@ -139,10 +138,9 @@ *> if LDU is at least N. *> Modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/xerbla.f b/TESTING/EIG/xerbla.f index fcce9e6b..a404d015 100644 --- a/TESTING/EIG/xerbla.f +++ b/TESTING/EIG/xerbla.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE XERBLA( SRNAME, INFO ) * @@ -15,21 +15,20 @@ * INTEGER INFO * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This is a special version of XERBLA to be used only as part of *> the test program for testing error exits from the LAPACK routines. *> Error messages are printed if INFO.NE.INFOT or if SRNAME.NE.SRNAMT, *> where INFOT and SRNAMT are values stored in COMMON. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SRNAME *> \verbatim @@ -44,10 +43,9 @@ *> The error return code from the calling subroutine. INFO *> should equal the COMMON variable INFOT. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -58,10 +56,9 @@ * *> \ingroup aux_eig * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The following variables are passed via the common blocks INFOC and @@ -73,7 +70,6 @@ *> SRNAME = SRNAMT, otherwise set to .FALSE. *> LERR LOGICAL Set to .TRUE., indicating that XERBLA was called *> SRNAMT CHARACTER*(*) Expected name of calling subroutine -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/EIG/xlaenv.f b/TESTING/EIG/xlaenv.f index 6389fabf..49088be7 100644 --- a/TESTING/EIG/xlaenv.f +++ b/TESTING/EIG/xlaenv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE XLAENV( ISPEC, NVALUE ) * @@ -14,19 +14,18 @@ * INTEGER ISPEC, NVALUE * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> XLAENV sets certain machine- and problem-dependent quantities *> which will later be retrieved by ILAENV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ISPEC *> \verbatim @@ -66,10 +65,9 @@ *> NVALUE is INTEGER *> The value of the parameter specified by ISPEC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zbdt01.f b/TESTING/EIG/zbdt01.f index 10eb6016..572ac56a 100644 --- a/TESTING/EIG/zbdt01.f +++ b/TESTING/EIG/zbdt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, * RWORK, RESID ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZBDT01 reconstructs a general matrix A from its bidiagonal form *> A = Q * B * P' @@ -35,11 +35,10 @@ *> The test ratio to test the reduction is *> RESID = norm( A - Q * B * PT ) / ( n * norm(A) * EPS ) *> where PT = P' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -130,10 +129,9 @@ *> RESID is DOUBLE PRECISION *> The test ratio: norm(A - Q * B * P') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zbdt02.f b/TESTING/EIG/zbdt02.f index 0a0bea2a..46071868 100644 --- a/TESTING/EIG/zbdt02.f +++ b/TESTING/EIG/zbdt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZBDT02( M, N, B, LDB, C, LDC, U, LDU, WORK, RWORK, * RESID ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZBDT02 tests the change of basis C = U' * B by computing the residual *> @@ -33,11 +33,10 @@ *> *> where B and C are M by N matrices, U is an M by M orthogonal matrix, *> and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,9 @@ *> RESID is DOUBLE PRECISION *> RESID = norm( B - U * C ) / ( max(m,n) * norm(B) * EPS ), *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zbdt03.f b/TESTING/EIG/zbdt03.f index 3827761c..392bc47c 100644 --- a/TESTING/EIG/zbdt03.f +++ b/TESTING/EIG/zbdt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZBDT03( UPLO, N, KD, D, E, U, LDU, S, VT, LDVT, WORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 U( LDU, * ), VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZBDT03 reconstructs a bidiagonal matrix B from its SVD: *> S = U' * B * V @@ -34,11 +34,10 @@ *> The test ratio to test the singular value decomposition is *> RESID = norm( B - U * S * VT ) / ( n * norm(B) * EPS ) *> where VT = V' and EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> RESID is DOUBLE PRECISION *> The test ratio: norm(B - U * S * V') / ( n * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkbb.f b/TESTING/EIG/zchkbb.f index 51636112..3563f5fd 100644 --- a/TESTING/EIG/zchkbb.f +++ b/TESTING/EIG/zchkbb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKBB( NSIZES, MVAL, NVAL, NWDTHS, KK, NTYPES, DOTYPE, * NRHS, ISEED, THRESH, NOUNIT, A, LDA, AB, LDAB, @@ -27,11 +27,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKBB tests the reduction of a general complex rectangular band *> matrix to real bidiagonal form. @@ -97,11 +97,10 @@ *> (13) Rectangular matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -343,10 +342,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkbd.f b/TESTING/EIG/zchkbd.f index 376d53f1..3d5bc1f8 100644 --- a/TESTING/EIG/zchkbd.f +++ b/TESTING/EIG/zchkbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKBD( NSIZES, MVAL, NVAL, NTYPES, DOTYPE, NRHS, * ISEED, THRESH, A, LDA, BD, BE, S1, S2, X, LDX, @@ -27,11 +27,11 @@ * $ X( LDX, * ), Y( LDX, * ), Z( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKBD checks the singular value decomposition (SVD) routines. *> @@ -152,11 +152,10 @@ *> *> A subset of the full set of matrix types may be selected through *> the logical array DOTYPE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -397,10 +396,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkbk.f b/TESTING/EIG/zchkbk.f index 7960e136..ea4b12d1 100644 --- a/TESTING/EIG/zchkbk.f +++ b/TESTING/EIG/zchkbk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKBK( NIN, NOUT ) * @@ -14,20 +14,19 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKBK tests ZGEBAK, a routine for backward transformation of *> the computed right or left eigenvectors if the orginal matrix *> was preprocessed by balance subroutine ZGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -40,10 +39,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkbl.f b/TESTING/EIG/zchkbl.f index a6aa0705..a216568b 100644 --- a/TESTING/EIG/zchkbl.f +++ b/TESTING/EIG/zchkbl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKBL( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKBL tests ZGEBAL, a routine for balancing a general complex *> matrix and isolating some of its eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkec.f b/TESTING/EIG/zchkec.f index 3cad2834..c8c25740 100644 --- a/TESTING/EIG/zchkec.f +++ b/TESTING/EIG/zchkec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKEC( THRESH, TSTERR, NIN, NOUT ) * @@ -16,11 +16,11 @@ * DOUBLE PRECISION THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKEC tests eigen- condition estimation routines *> ZTRSYL, CTREXC, CTRSNA, CTRSEN @@ -30,11 +30,10 @@ *> results to a threshold THRESH. In addition, ZTRSNA and CTRSEN are *> tested by reading in precomputed examples from a file (on input unit *> NIN). Output is written to output unit NOUT. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -60,10 +59,9 @@ *> NOUT is INTEGER *> The logical unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkee.f b/TESTING/EIG/zchkee.f index 49f59a59..dbd04ee0 100644 --- a/TESTING/EIG/zchkee.f +++ b/TESTING/EIG/zchkee.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZCHKEE * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKEE tests the COMPLEX*16 LAPACK subroutines for the matrix *> eigenvalue problem. The test paths in this version are @@ -1012,15 +1012,14 @@ *> precomputed examples, and LWORK = NMAX*(5*NMAX+20) in the parameter *> statements below. For SVD, we assume NRHS may be as big as N. The *> parameter NEED is set to 14 to allow for 14 N-by-N matrices for ZGG. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -1031,8 +1030,7 @@ * *> \ingroup complex16_eig * -* ===================================================================== - PROGRAM ZCHKEE +* ===================================================================== PROGRAM ZCHKEE * * -- LAPACK test routine (version 3.3.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/EIG/zchkgg.f b/TESTING/EIG/zchkgg.f index 3ea100f0..47bd0189 100644 --- a/TESTING/EIG/zchkgg.f +++ b/TESTING/EIG/zchkgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * TSTDIF, THRSHN, NOUNIT, A, LDA, B, H, T, S1, @@ -32,11 +32,11 @@ * $ WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKGG checks the nonsymmetric generalized eigenvalue problem *> routines. @@ -216,11 +216,10 @@ *> *> (26) U ( T1, T2 ) V where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -484,10 +483,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkgk.f b/TESTING/EIG/zchkgk.f index c4f19220..21e82069 100644 --- a/TESTING/EIG/zchkgk.f +++ b/TESTING/EIG/zchkgk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKGK( NIN, NOUT ) * @@ -14,19 +14,18 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKGK tests ZGGBAK, a routine for backward balancing of *> a matrix pair (A, B). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkgl.f b/TESTING/EIG/zchkgl.f index 71bbe0cd..b58e1cc1 100644 --- a/TESTING/EIG/zchkgl.f +++ b/TESTING/EIG/zchkgl.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKGL( NIN, NOUT ) * @@ -14,18 +14,17 @@ * INTEGER NIN, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKGL tests ZGGBAL, a routine for balancing a matrix pair (A, B). +*> \verbatim *> -*>\endverbatim +*> ZCHKGL tests ZGGBAL, a routine for balancing a matrix pair (A, B). +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NIN *> \verbatim @@ -38,10 +37,9 @@ *> NOUT is INTEGER *> The logical unit number for output. NOUT > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkhb.f b/TESTING/EIG/zchkhb.f index 6e879f1f..9f8a0c39 100644 --- a/TESTING/EIG/zchkhb.f +++ b/TESTING/EIG/zchkhb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKHB( NSIZES, NN, NWDTHS, KK, NTYPES, DOTYPE, ISEED, * THRESH, NOUNIT, A, LDA, SD, SE, U, LDU, WORK, @@ -24,11 +24,11 @@ * COMPLEX*16 A( LDA, * ), U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKHB tests the reduction of a Hermitian band matrix to tridiagonal *> from, used with the Hermitian eigenvalue problem. @@ -93,11 +93,10 @@ *> (13) Hermitian matrix with random entries chosen from (-1,1). *> (14) Same as (13), but multiplied by SQRT( overflow threshold ) *> (15) Same as (13), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -281,10 +280,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkhs.f b/TESTING/EIG/zchkhs.f index b6afc0a8..3a689c47 100644 --- a/TESTING/EIG/zchkhs.f +++ b/TESTING/EIG/zchkhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKHS( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, T1, T2, U, LDU, Z, UZ, W1, @@ -30,11 +30,11 @@ * $ WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKHS checks the nonsymmetric eigenvalue problem routines. *> @@ -165,11 +165,10 @@ *> (19) Nonsymmetric matrix with random entries chosen from |z| < 1 *> (20) Same as (19), but multiplied by SQRT( overflow threshold ) *> (21) Same as (19), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES - INTEGER @@ -393,10 +392,9 @@ *> KCONDS(j) Selects whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zchkst.f b/TESTING/EIG/zchkst.f index a0f2a8b8..922542f7 100644 --- a/TESTING/EIG/zchkst.f +++ b/TESTING/EIG/zchkst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, AP, SD, SE, D1, D2, D3, D4, D5, @@ -29,11 +29,11 @@ * $ V( LDU, * ), VP( * ), WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKST checks the Hermitian eigenvalue problem routines. *> @@ -244,11 +244,10 @@ *> (20) Same as (16), but multiplied by SQRT( underflow threshold ) *> (21) A diagonally dominant tridiagonal matrix with geometrically *> spaced diagonal entries 1, ..., ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -585,10 +584,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zckcsd.f b/TESTING/EIG/zckcsd.f index 8506da67..71df397f 100644 --- a/TESTING/EIG/zckcsd.f +++ b/TESTING/EIG/zckcsd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCKCSD( NM, MVAL, PVAL, QVAL, NMATS, ISEED, THRESH, * MMAX, X, XF, U1, U2, V1T, V2T, THETA, IWORK, @@ -24,20 +24,19 @@ * $ WORK( * ), X( * ), XF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCKCSD tests ZUNCSD: *> the CSD for an M-by-M unitary matrix X partitioned as *> [ X11 X12; X21 X22 ]. X11 is P-by-Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -167,10 +166,9 @@ *> > 0 : If ZLAROR returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zckglm.f b/TESTING/EIG/zckglm.f index 9ceca677..455d7d7e 100644 --- a/TESTING/EIG/zckglm.f +++ b/TESTING/EIG/zckglm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCKGLM( NN, NVAL, MVAL, PVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -23,19 +23,18 @@ * $ X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCKGLM tests ZGGGLM - subroutine for solving generalized linear *> model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -151,10 +150,9 @@ *> > 0 : If ZLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zckgqr.f b/TESTING/EIG/zckgqr.f index 1d7a07c0..1bf2cd00 100644 --- a/TESTING/EIG/zckgqr.f +++ b/TESTING/EIG/zckgqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCKGQR( NM, MVAL, NP, PVAL, NN, NVAL, NMATS, ISEED, * THRESH, NMAX, A, AF, AQ, AR, TAUA, B, BF, BZ, @@ -24,20 +24,19 @@ * $ TAUB( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCKGQR tests *> ZGGQRF: GQR factorization for N-by-M matrix A and N-by-P matrix B, *> ZGGRQF: GRQ factorization for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -194,10 +193,9 @@ *> > 0 : If ZLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zckgsv.f b/TESTING/EIG/zckgsv.f index 3d42a7e0..c8fa16a6 100644 --- a/TESTING/EIG/zckgsv.f +++ b/TESTING/EIG/zckgsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCKGSV( NM, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, U, V, Q, ALPHA, BETA, R, @@ -24,19 +24,18 @@ * $ R( * ), U( * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCKGSV tests ZGGSVD: *> the GSVD for M-by-N matrix A and P-by-N matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NM *> \verbatim @@ -181,10 +180,9 @@ *> > 0 : If ZLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zcklse.f b/TESTING/EIG/zcklse.f index c8151977..44dbd7a2 100644 --- a/TESTING/EIG/zcklse.f +++ b/TESTING/EIG/zcklse.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCKLSE( NN, MVAL, PVAL, NVAL, NMATS, ISEED, THRESH, * NMAX, A, AF, B, BF, X, WORK, RWORK, NIN, NOUT, @@ -23,19 +23,18 @@ * $ X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCKLSE tests ZGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NN *> \verbatim @@ -151,10 +150,9 @@ *> > 0 : If ZLATMS returns an error code, the absolute value *> of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zcsdts.f b/TESTING/EIG/zcsdts.f index d336b50b..a26ca957 100644 --- a/TESTING/EIG/zcsdts.f +++ b/TESTING/EIG/zcsdts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCSDTS( M, P, Q, X, XF, LDX, U1, LDU1, U2, LDU2, V1T, * LDV1T, V2T, LDV2T, THETA, IWORK, WORK, LWORK, @@ -23,11 +23,11 @@ * $ XF( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCSDTS tests ZUNCSD, which, given an M-by-M partitioned unitary *> matrix X, @@ -47,11 +47,10 @@ *> [ 0 0 0 | I 0 0 ] [ D21 D22 ] *> [ 0 S 0 | 0 C 0 ] *> [ 0 0 I | 0 0 0 ] -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,9 @@ *> = ULPINV otherwise. *> ( EPS2 = MAX( norm( I - X'*X ) / M, ULP ). ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrges.f b/TESTING/EIG/zdrges.f index dd9c57aa..0573e38e 100644 --- a/TESTING/EIG/zdrges.f +++ b/TESTING/EIG/zdrges.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRGES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, ALPHA, @@ -25,11 +25,11 @@ * $ T( LDA, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRGES checks the nonsymmetric generalized eigenvalue (Schur form) *> problem driver ZGGES. @@ -182,11 +182,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -364,10 +363,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrgev.f b/TESTING/EIG/zdrgev.f index 166b8489..887f5ccb 100644 --- a/TESTING/EIG/zdrgev.f +++ b/TESTING/EIG/zdrgev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRGEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, S, T, Q, LDQ, Z, QE, LDQE, @@ -28,11 +28,11 @@ * $ T( LDA, * ), WORK( * ), Z( LDQ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRGEV checks the nonsymmetric generalized eigenvalue problem driver *> routine ZGGEV. @@ -177,11 +177,10 @@ *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -381,10 +380,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrgsx.f b/TESTING/EIG/zdrgsx.f index 60fd6760..35831d94 100644 --- a/TESTING/EIG/zdrgsx.f +++ b/TESTING/EIG/zdrgsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, AI, * BI, Z, Q, ALPHA, BETA, C, LDC, S, WORK, LWORK, @@ -27,11 +27,11 @@ * $ Z( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRGSX checks the nonsymmetric generalized eigenvalue (Schur form) *> problem expert driver ZGGESX. @@ -109,7 +109,7 @@ *> and DIF_l when testing the built-in test problems. *> *> Built-in Test Matrices -*> ====================== +* ====================== *> *> All built-in test matrices are the 2 by 2 block of triangular *> matrices @@ -168,11 +168,10 @@ *> | 1-d | *> and matrix B are chosen as identity matrices (see DLATM5). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -332,10 +331,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrgvx.f b/TESTING/EIG/zdrgvx.f index 4e4d2f46..8571fd13 100644 --- a/TESTING/EIG/zdrgvx.f +++ b/TESTING/EIG/zdrgvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRGVX( NSIZE, THRESH, NIN, NOUT, A, LDA, B, AI, BI, * ALPHA, BETA, VL, VR, ILO, IHI, LSCALE, RSCALE, @@ -28,11 +28,11 @@ * $ VL( LDA, * ), VR( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRGVX checks the nonsymmetric generalized eigenvalue problem *> expert driver ZGGEVX. @@ -98,11 +98,10 @@ *> *> a, b, x and y will have all values independently of each other from *> { sqrt(sqrt(ULP)), 0.1, 1, 10, 1/sqrt(sqrt(ULP)) }. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZE *> \verbatim @@ -279,10 +278,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: A routine returned an error code. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvbd.f b/TESTING/EIG/zdrvbd.f index d88ceb0b..43c0a3b8 100644 --- a/TESTING/EIG/zdrvbd.f +++ b/TESTING/EIG/zdrvbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVBD( NSIZES, MM, NN, NTYPES, DOTYPE, ISEED, THRESH, * A, LDA, U, LDU, VT, LDVT, ASAV, USAV, VTSAV, S, @@ -27,11 +27,11 @@ * $ VTSAV( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVBD checks the singular value decomposition (SVD) driver ZGESVD *> and ZGESDD. @@ -105,11 +105,10 @@ *> on the diagonal. *> (4) Same as (3), but multiplied by the underflow-threshold / ULP. *> (5) Same as (3), but multiplied by the overflow-threshold * ULP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -313,10 +312,9 @@ *> If ZLATMS, or ZGESVD returns an error code, the *> absolute value of it is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrves.f b/TESTING/EIG/zdrves.f index 034f5040..0d6b213f 100644 --- a/TESTING/EIG/zdrves.f +++ b/TESTING/EIG/zdrves.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVES( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, HT, W, WT, VS, LDVS, RESULT, @@ -24,11 +24,11 @@ * $ VS( LDVS, * ), W( * ), WORK( * ), WT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVES checks the nonsymmetric eigenvalue (Schur form) problem *> driver ZGEES. @@ -161,11 +161,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -361,10 +360,9 @@ *> KCONDS(j) Select whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvev.f b/TESTING/EIG/zdrvev.f index af692d5c..28aac460 100644 --- a/TESTING/EIG/zdrvev.f +++ b/TESTING/EIG/zdrvev.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVEV( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, H, W, W1, VL, LDVL, VR, LDVR, @@ -27,11 +27,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVEV checks the nonsymmetric eigenvalue problem driver ZGEEV. *> @@ -153,11 +153,10 @@ *> near the overflow threshold *> (21) Same as (19), but multiplied by a constant *> near the underflow threshold -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -373,10 +372,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvgg.f b/TESTING/EIG/zdrvgg.f index 88577740..de657013 100644 --- a/TESTING/EIG/zdrvgg.f +++ b/TESTING/EIG/zdrvgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVGG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * THRSHN, NOUNIT, A, LDA, B, S, T, S2, T2, Q, @@ -19,11 +19,11 @@ * .. * .. Array Arguments .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVGG checks the nonsymmetric generalized eigenvalue driver *> routines. @@ -168,11 +168,10 @@ *> *> (26) Q ( T1, T2 ) Z where T1 and T2 are random upper-triangular *> matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -404,10 +403,9 @@ *> > 0: A routine returned an error code. INFO is the *> absolute value of the INFO value returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvsg.f b/TESTING/EIG/zdrvsg.f index d7734bf9..1d2c0efe 100644 --- a/TESTING/EIG/zdrvsg.f +++ b/TESTING/EIG/zdrvsg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVSG( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, B, LDB, D, Z, LDZ, AB, BB, AP, @@ -27,11 +27,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVSG checks the complex Hermitian generalized eigenproblem *> drivers. @@ -161,11 +161,10 @@ *> (19) Same as (8), but with KA = 3 and KB = 1 *> (20) Same as (8), but with KA = 3 and KB = 2 *> (21) Same as (8), but with KA = 3 and KB = 3 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -352,10 +351,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvst.f b/TESTING/EIG/zdrvst.f index 923322b2..f6074915 100644 --- a/TESTING/EIG/zdrvst.f +++ b/TESTING/EIG/zdrvst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVST( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NOUNIT, A, LDA, D1, D2, D3, WA1, WA2, WA3, U, @@ -27,11 +27,11 @@ * $ V( LDU, * ), WORK( * ), Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVST checks the Hermitian eigenvalue problem drivers. *> @@ -130,11 +130,10 @@ *> with random signs. *> (17) Same as (16), but multiplied by SQRT( overflow threshold ) *> (18) Same as (16), but multiplied by SQRT( underflow threshold ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NSIZES INTEGER @@ -320,10 +319,9 @@ *> KMAGN(j) The order of magnitude ( O(1), *> O(overflow^(1/2) ), O(underflow^(1/2) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvsx.f b/TESTING/EIG/zdrvsx.f index 39e51dd4..8a25fd0b 100644 --- a/TESTING/EIG/zdrvsx.f +++ b/TESTING/EIG/zdrvsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVSX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, HT, W, WT, WTMP, VS, @@ -27,11 +27,11 @@ * $ WORK( * ), WT( * ), WTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVSX checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver ZGEESX. @@ -206,11 +206,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -417,10 +416,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zdrvvx.f b/TESTING/EIG/zdrvvx.f index 9b3763d4..e042a0c1 100644 --- a/TESTING/EIG/zdrvvx.f +++ b/TESTING/EIG/zdrvvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVVX( NSIZES, NN, NTYPES, DOTYPE, ISEED, THRESH, * NIUNIT, NOUNIT, A, LDA, H, W, W1, VL, LDVL, VR, @@ -31,11 +31,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVVX checks the nonsymmetric eigenvalue problem expert driver *> ZGEEVX. @@ -202,11 +202,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NSIZES *> \verbatim @@ -477,10 +476,9 @@ *> KCONDS(j) Selectw whether CONDS is to be 1 or *> 1/sqrt(ulp). (0 means irrelevant.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zerrbd.f b/TESTING/EIG/zerrbd.f index 2ad1b3bd..1fddce48 100644 --- a/TESTING/EIG/zerrbd.f +++ b/TESTING/EIG/zerrbd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRBD( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZERRBD tests the error exits for ZGEBRD, ZUNGBR, ZUNMBR, and ZBDSQR. +*> \verbatim *> -*>\endverbatim +*> ZERRBD tests the error exits for ZGEBRD, ZUNGBR, ZUNMBR, and ZBDSQR. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -39,10 +38,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zerrec.f b/TESTING/EIG/zerrec.f index a2dee08a..84dafc9e 100644 --- a/TESTING/EIG/zerrec.f +++ b/TESTING/EIG/zerrec.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERREC( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERREC tests the error exits for the routines for eigen- condition *> estimation for DOUBLE PRECISION matrices: *> ZTRSYL, CTREXC, CTRSNA and CTRSEN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zerred.f b/TESTING/EIG/zerred.f index 48faa5ad..e52e1eb0 100644 --- a/TESTING/EIG/zerred.f +++ b/TESTING/EIG/zerred.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRED( PATH, NUNIT ) * @@ -15,11 +15,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRED tests the error exits for the eigenvalue driver routines for *> DOUBLE PRECISION matrices: @@ -33,11 +33,10 @@ *> ZBD ZGESVD compute SVD of an M-by-N matrix A *> ZGESDD compute SVD of an M-by-N matrix A(by divide and *> conquer) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -50,10 +49,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zerrgg.f b/TESTING/EIG/zerrgg.f index 2ba2a848..85f61959 100644 --- a/TESTING/EIG/zerrgg.f +++ b/TESTING/EIG/zerrgg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRGG( PATH, NUNIT ) * @@ -15,20 +15,19 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRGG tests the error exits for ZGGES, ZGGESX, ZGGEV, ZGGEVX, *> ZGGGLM, ZGGHRD, ZGGLSE, ZGGQRF, ZGGRQF, ZGGSVD, ZGGSVP, ZHGEQZ, *> ZTGEVC, ZTGEXC, ZTGSEN, ZTGSJA, ZTGSNA, ZTGSYL, and ZUNCSD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -41,10 +40,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zerrhs.f b/TESTING/EIG/zerrhs.f index 815c16fc..b47fbc17 100644 --- a/TESTING/EIG/zerrhs.f +++ b/TESTING/EIG/zerrhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRHS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRHS tests the error exits for ZGEBAK, CGEBAL, CGEHRD, ZUNGHR, *> ZUNMHR, ZHSEQR, CHSEIN, and ZTREVC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -40,10 +39,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zerrst.f b/TESTING/EIG/zerrst.f index 1f7c2fe2..19404a9b 100644 --- a/TESTING/EIG/zerrst.f +++ b/TESTING/EIG/zerrst.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRST( PATH, NUNIT ) * @@ -15,21 +15,20 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRST tests the error exits for ZHETRD, ZUNGTR, CUNMTR, ZHPTRD, *> ZUNGTR, ZUPMTR, ZSTEQR, CSTEIN, ZPTEQR, ZHBTRD, *> ZHEEV, CHEEVX, CHEEVD, ZHBEV, CHBEVX, CHBEVD, *> ZHPEV, CHPEVX, CHPEVD, and ZSTEDC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -42,10 +41,9 @@ *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget02.f b/TESTING/EIG/zget02.f index 118c4a04..e7f2736f 100644 --- a/TESTING/EIG/zget02.f +++ b/TESTING/EIG/zget02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET02( TRANS, M, N, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET02 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -117,10 +116,9 @@ *> The maximum over the number of right hand sides of *> norm(B - A*X) / ( norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget10.f b/TESTING/EIG/zget10.f index f4582d59..2cdcb844 100644 --- a/TESTING/EIG/zget10.f +++ b/TESTING/EIG/zget10.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET10( M, N, A, LDA, B, LDB, WORK, RWORK, RESULT ) * @@ -19,19 +19,18 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET10 compares two matrices A and B and computes the ratio *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -84,10 +83,9 @@ *> RESULT is DOUBLE PRECISION *> RESULT = norm( A - B ) / ( norm(A) * M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget22.f b/TESTING/EIG/zget22.f index 9f2f1cb7..8ab14580 100644 --- a/TESTING/EIG/zget22.f +++ b/TESTING/EIG/zget22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET22( TRANSA, TRANSE, TRANSW, N, A, LDA, E, LDE, W, * WORK, RWORK, RESULT ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), E( LDE, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET22 does an eigenvector check. *> @@ -40,11 +40,10 @@ *> where E(j) is the j-th eigenvector, and m-norm is the max-norm of a *> vector. The max-norm of a complex n-vector x in this case is the *> maximum of |re(x(i)| + |im(x(i)| over i = 1, ..., n. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -127,10 +126,9 @@ *> RESULT(1) = | A E - E W | / ( |A| |E| ulp ) *> RESULT(2) = max | m-norm(E(j)) - 1 | / ( n ulp ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget23.f b/TESTING/EIG/zget23.f index 4a5682e7..2afd601a 100644 --- a/TESTING/EIG/zget23.f +++ b/TESTING/EIG/zget23.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET23( COMP, ISRT, BALANC, JTYPE, THRESH, ISEED, * NOUNIT, N, A, LDA, H, W, W1, VL, LDVL, VR, @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET23 checks the nonsymmetric eigenvalue problem driver CGEEVX. *> If COMP = .FALSE., the first 8 of the following tests will be @@ -113,11 +113,10 @@ *> of RCONDE, and takes errors in computing RCONDE into account, *> so that the resulting quantity should be O(ULP). cond(RCONDE) *> is essentially given by norm(A)/RCONDV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -349,10 +348,9 @@ *> If >0, ZGEEVX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget24.f b/TESTING/EIG/zget24.f index b68b008b..f5fae0fe 100644 --- a/TESTING/EIG/zget24.f +++ b/TESTING/EIG/zget24.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET24( COMP, JTYPE, THRESH, ISEED, NOUNIT, N, A, LDA, * H, HT, W, WT, WTMP, VS, LDVS, VS1, RCDEIN, @@ -28,11 +28,11 @@ * $ WORK( * ), WT( * ), WTMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET24 checks the nonsymmetric eigenvalue (Schur form) problem *> expert driver ZGEESX. @@ -118,11 +118,10 @@ *> number of RCONDV, and takes errors in computing RCONDV into *> account, so that the resulting quantity should be O(ULP). *> cond(RCONDV) is essentially given by norm(A)/RCONDE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMP *> \verbatim @@ -317,10 +316,9 @@ *> If >0, ZGEESX returned an error code, the absolute *> value of which is returned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget35.f b/TESTING/EIG/zget35.f index d89cf547..65fda916 100644 --- a/TESTING/EIG/zget35.f +++ b/TESTING/EIG/zget35.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET35( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -15,11 +15,11 @@ * DOUBLE PRECISION RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET35 tests ZTRSYL, a routine for solving the Sylvester matrix *> equation @@ -34,11 +34,10 @@ *> *> norm(op(A)*X + ISGN*X*op(B) - scale*C) / *> (EPS*max(norm(A),norm(B))*norm(X)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -69,10 +68,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget36.f b/TESTING/EIG/zget36.f index d4628fae..f5fc5fca 100644 --- a/TESTING/EIG/zget36.f +++ b/TESTING/EIG/zget36.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET36( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -15,11 +15,11 @@ * DOUBLE PRECISION RMAX * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET36 tests ZTREXC, a routine for reordering diagonal entries of a *> matrix in complex Schur form. Thus, ZLAEXC computes a unitary matrix @@ -35,11 +35,10 @@ *> ILST. *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -70,10 +69,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget37.f b/TESTING/EIG/zget37.f index eeffa46d..aaac85e8 100644 --- a/TESTING/EIG/zget37.f +++ b/TESTING/EIG/zget37.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET37( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET37 tests ZTRSNA, a routine for estimating condition numbers of *> eigenvalues and/or right eigenvectors of a matrix. *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -75,10 +74,9 @@ *> NIN is INTEGER *> Input logical unit number *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget38.f b/TESTING/EIG/zget38.f index d7573d72..9156b127 100644 --- a/TESTING/EIG/zget38.f +++ b/TESTING/EIG/zget38.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET38( RMAX, LMAX, NINFO, KNT, NIN ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION RMAX( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET38 tests ZTRSEN, a routine for estimating condition numbers of a *> cluster of eigenvalues and/or its associated right invariant subspace *> *> The test matrices are read from a file with logical unit number NIN. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] RMAX *> \verbatim @@ -76,10 +75,9 @@ *> NIN is INTEGER *> Input logical unit number. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget51.f b/TESTING/EIG/zget51.f index abc858ab..cf5bcdb0 100644 --- a/TESTING/EIG/zget51.f +++ b/TESTING/EIG/zget51.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET51( ITYPE, N, A, LDA, B, LDB, U, LDU, V, LDV, WORK, * RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET51 generally checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> If ITYPE=3, then: *> *> RESULT = | I - UU* | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -138,10 +137,9 @@ *> value is currently limited to 1/ulp, to avoid overflow. *> Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget52.f b/TESTING/EIG/zget52.f index be83c5f7..850204fa 100644 --- a/TESTING/EIG/zget52.f +++ b/TESTING/EIG/zget52.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET52( LEFT, N, A, LDA, B, LDB, E, LDE, ALPHA, BETA, * WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ BETA( * ), E( LDE, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET52 does an eigenvector check for the generalized eigenvalue *> problem. @@ -54,11 +54,10 @@ *> RESULT(2) = max | M(v(i)) - 1 | / ( n ulp ) *> eigenvectors v(i) *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LEFT *> \verbatim @@ -146,10 +145,9 @@ *> B E is likely to overflow, then RESULT(1:2) is set to *> 10 / ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zget54.f b/TESTING/EIG/zget54.f index 4b84c52a..c87bbc4a 100644 --- a/TESTING/EIG/zget54.f +++ b/TESTING/EIG/zget54.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET54( N, A, LDA, B, LDB, S, LDS, T, LDT, U, LDU, V, * LDV, WORK, RESULT ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET54 checks a generalized decomposition of the form *> @@ -36,11 +36,10 @@ *> Specifically, *> *> RESULT = ||( A - U*S*V', B - U*T*V' )|| / (||( A, B )||*n*ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -140,10 +139,9 @@ *> The value RESULT, It is currently limited to 1/ulp, to *> avoid overflow. Errors are flagged by RESULT=10/ulp. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zglmts.f b/TESTING/EIG/zglmts.f index fce74816..77b4e596 100644 --- a/TESTING/EIG/zglmts.f +++ b/TESTING/EIG/zglmts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGLMTS( N, M, P, A, AF, LDA, B, BF, LDB, D, DF, X, U, * WORK, LWORK, RWORK, RESULT ) @@ -17,19 +17,18 @@ * .. * .. Array Arguments .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGLMTS tests ZGGGLM - a subroutine for solving the generalized *> linear model problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -130,10 +129,9 @@ *> RESULT = ----------------------------------------- *> (norm(A)+norm(B))*(norm(x)+norm(u))*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zgqrts.f b/TESTING/EIG/zgqrts.f index 3cac1673..19879626 100644 --- a/TESTING/EIG/zgqrts.f +++ b/TESTING/EIG/zgqrts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGQRTS( N, M, P, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ WORK( LWORK ), Z( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGQRTS tests ZGGQRF, which computes the GQR factorization of an *> N-by-M matrix A and a N-by-P matrix B: A = Q*R and B = Q*T*Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( M*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zgrqts.f b/TESTING/EIG/zgrqts.f index 18bd7816..5d571caa 100644 --- a/TESTING/EIG/zgrqts.f +++ b/TESTING/EIG/zgrqts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGRQTS( M, P, N, A, AF, Q, R, LDA, TAUA, B, BF, Z, T, * BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT ) @@ -22,19 +22,18 @@ * $ WORK( LWORK ), Z( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGRQTS tests ZGGRQF, which computes the GRQ factorization of an *> M-by-N matrix A and a P-by-N matrix B: A = R*Q and B = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -160,10 +159,9 @@ *> RESULT(3) = norm( I - Q'*Q ) / ( N*ULP ) *> RESULT(4) = norm( I - Z'*Z ) / ( P*ULP ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zgsvts.f b/TESTING/EIG/zgsvts.f index bd099c6b..03b7ade5 100644 --- a/TESTING/EIG/zgsvts.f +++ b/TESTING/EIG/zgsvts.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGSVTS( M, P, N, A, AF, LDA, B, BF, LDB, U, LDU, V, * LDV, Q, LDQ, ALPHA, BETA, R, LDR, IWORK, WORK, @@ -23,20 +23,19 @@ * $ U( LDU, * ), V( LDV, * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGSVTS tests ZGGSVD, which computes the GSVD of an M-by-N matrix A *> and a P-by-N matrix B: *> U'*A*Q = D1*R and V'*B*Q = D2*R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -192,10 +191,9 @@ *> RESULT(6) = 0 if ALPHA is in decreasing order; *> = ULPINV otherwise. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zhbt21.f b/TESTING/EIG/zhbt21.f index 3be21b5a..56fbb77f 100644 --- a/TESTING/EIG/zhbt21.f +++ b/TESTING/EIG/zhbt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBT21( UPLO, N, KA, KS, A, LDA, D, E, U, LDU, WORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBT21 generally checks a decomposition of the form *> @@ -36,11 +36,10 @@ *> Specifically: *> *> RESULT(1) = | A - U S U* | / ( |A| n ulp ) *andC> RESULT(2) = | I - UU* | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -134,10 +133,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zhet21.f b/TESTING/EIG/zhet21.f index b86d05df..22c2aeba 100644 --- a/TESTING/EIG/zhet21.f +++ b/TESTING/EIG/zhet21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHET21( ITYPE, UPLO, N, KBAND, A, LDA, D, E, U, LDU, V, * LDV, TAU, WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHET21 generally checks a decomposition of the form *> @@ -56,11 +56,10 @@ *> V = H(1)...H(n-2), where H(j) = I - tau(j) v(j) v(j)C> and each *> vector v(j) has its first j elements 0 and the remaining n-j elements *> stored in V(j+1:n,j). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -195,10 +194,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zhet22.f b/TESTING/EIG/zhet22.f index 36affd02..0742a6c2 100644 --- a/TESTING/EIG/zhet22.f +++ b/TESTING/EIG/zhet22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHET22( ITYPE, UPLO, N, M, KBAND, A, LDA, D, E, U, LDU, * V, LDV, TAU, WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHET22 generally checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> Specifically, if ITYPE=1, then: *> *> RESULT(1) = | U' A U - S | / ( |A| m ulp ) *andC> RESULT(2) = | I - U'U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> ITYPE INTEGER @@ -143,10 +142,9 @@ *> if LDU is at least N. *> Modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zhpt21.f b/TESTING/EIG/zhpt21.f index 08bf2594..9daa8494 100644 --- a/TESTING/EIG/zhpt21.f +++ b/TESTING/EIG/zhpt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPT21( ITYPE, UPLO, N, KBAND, AP, D, E, U, LDU, VP, * TAU, WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPT21 generally checks a decomposition of the form *> @@ -81,11 +81,10 @@ *> and the first j elements of v(j) are 0, the (j+1)-st is 1, and the *> (j+2)-nd through n-th elements are stored in V(j+2:n,j) (i.e., *> in VP( (2*n-j)*(j-1)/2 + j+2 : (2*n-j)*(j-1)/2 + n ) .) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -207,10 +206,9 @@ *> RESULT(1) is always modified. RESULT(2) is modified only *> if ITYPE=1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zhst01.f b/TESTING/EIG/zhst01.f index ed356665..0ca05b17 100644 --- a/TESTING/EIG/zhst01.f +++ b/TESTING/EIG/zhst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHST01( N, ILO, IHI, A, LDA, H, LDH, Q, LDQ, WORK, * LWORK, RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHST01 tests the reduction of a general matrix A to upper Hessenberg *> form: A = Q*H*Q'. Two test ratios are computed; @@ -37,11 +37,10 @@ *> *> In this version, ILO and IHI are not used, but they could be used *> to save some work if this is desired. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -124,10 +123,9 @@ *> RESULT(1) = norm( A - Q*H*Q' ) / ( norm(A) * N * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( N * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zlarfy.f b/TESTING/EIG/zlarfy.f index abcef80b..10f8c634 100644 --- a/TESTING/EIG/zlarfy.f +++ b/TESTING/EIG/zlarfy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARFY( UPLO, N, V, INCV, TAU, C, LDC, WORK ) * @@ -19,11 +19,11 @@ * COMPLEX*16 C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARFY applies an elementary reflector, or Householder matrix, H, *> to an n x n Hermitian matrix C, from both the left and the right. @@ -35,11 +35,10 @@ *> where tau is a scalar and v is a vector. *> *> If tau is zero, then H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,9 @@ *> \verbatim *> WORK is COMPLEX*16 array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zlarhs.f b/TESTING/EIG/zlarhs.f index 330a9af7..89cc7c8b 100644 --- a/TESTING/EIG/zlarhs.f +++ b/TESTING/EIG/zlarhs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARHS( PATH, XTYPE, UPLO, TRANS, M, N, KL, KU, NRHS, * A, LDA, X, LDX, B, LDB, ISEED, INFO ) @@ -21,22 +21,21 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARHS chooses a set of NRHS random solution vectors and sets *> up the right hand sides for the linear system *> op( A ) * X = B, *> where op( A ) may be A, A**T (transpose of A), or A**H (conjugate *> transpose of A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -193,10 +192,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zlatm4.f b/TESTING/EIG/zlatm4.f index 3fb07fcf..33a27e62 100644 --- a/TESTING/EIG/zlatm4.f +++ b/TESTING/EIG/zlatm4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATM4( ITYPE, N, NZ1, NZ2, RSIGN, AMAGN, RCOND, * TRIANG, IDIST, ISEED, A, LDA ) @@ -21,11 +21,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATM4 generates basic square matrices, which may later be *> multiplied by others in order to produce test matrices. It is @@ -36,11 +36,10 @@ *> according to the value of ITYPE, NZ1, NZ2, RSIGN, AMAGN, and RCOND. *> It then fills in the upper triangle with random numbers, if TRIANG is *> non-zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -155,10 +154,9 @@ *> LDA is INTEGER *> Leading dimension of A. Must be at least 1 and at least N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zlctes.f b/TESTING/EIG/zlctes.f index 239abe40..9755a0cb 100644 --- a/TESTING/EIG/zlctes.f +++ b/TESTING/EIG/zlctes.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION ZLCTES( Z, D ) * @@ -14,11 +14,11 @@ * COMPLEX*16 D, Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLCTES returns .TRUE. if the eigenvalue Z/D is to be selected *> (specifically, in this subroutine, if the real part of the @@ -26,11 +26,10 @@ *> *> It is used by the test routine ZDRGES to test whether the driver *> routine ZGGES succesfully sorts eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] Z *> \verbatim @@ -43,10 +42,9 @@ *> D is COMPLEX*16 *> The denominator part of a complex eigenvalue Z/D. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zlctsx.f b/TESTING/EIG/zlctsx.f index ea5c268e..ac067489 100644 --- a/TESTING/EIG/zlctsx.f +++ b/TESTING/EIG/zlctsx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION ZLCTSX( ALPHA, BETA ) * @@ -14,21 +14,20 @@ * COMPLEX*16 ALPHA, BETA * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This function is used to determine what eigenvalues will be *> selected. If this is part of the test driver ZDRGSX, do not *> change the code UNLESS you are testing input examples and not *> using the built-in examples. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ALPHA *> \verbatim @@ -42,10 +41,9 @@ *> parameters to decide whether the pair (ALPHA, BETA) is *> selected. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zlsets.f b/TESTING/EIG/zlsets.f index c86895f4..e924dc54 100644 --- a/TESTING/EIG/zlsets.f +++ b/TESTING/EIG/zlsets.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLSETS( M, P, N, A, AF, LDA, B, BF, LDB, C, CF, D, DF, * X, WORK, LWORK, RWORK, RESULT ) @@ -16,19 +16,18 @@ * .. * .. Array Arguments .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLSETS tests ZGGLSE - a subroutine for solving linear equality *> constrained least square problem (LSE). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -135,10 +134,9 @@ *> RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS *> RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zsbmv.f b/TESTING/EIG/zsbmv.f index 3f4adcf6..f26f3cda 100644 --- a/TESTING/EIG/zsbmv.f +++ b/TESTING/EIG/zsbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSBMV( UPLO, N, K, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSBMV performs the matrix-vector operation *> @@ -32,11 +32,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric band matrix, with k super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -136,10 +135,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zsgt01.f b/TESTING/EIG/zsgt01.f index c863d770..9d03261d 100644 --- a/TESTING/EIG/zsgt01.f +++ b/TESTING/EIG/zsgt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSGT01( ITYPE, UPLO, N, M, A, LDA, B, LDB, Z, LDZ, D, * WORK, RWORK, RESULT ) @@ -21,11 +21,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDGT01 checks a decomposition of the form *> @@ -43,11 +43,10 @@ *> ITYPE = 2: RESULT(1) = | A B Z - Z D | / ( |A| |Z| n ulp ) *> *> ITYPE = 3: RESULT(1) = | B A Z - Z D | / ( |A| |Z| n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -136,10 +135,9 @@ *> RESULT is DOUBLE PRECISION array, dimension (1) *> The test ratio as described above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zslect.f b/TESTING/EIG/zslect.f index 386c1c37..b7971f6c 100644 --- a/TESTING/EIG/zslect.f +++ b/TESTING/EIG/zslect.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION ZSLECT( Z ) * @@ -14,11 +14,11 @@ * COMPLEX*16 Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSLECT returns .TRUE. if the eigenvalue Z is to be selected, *> otherwise it returns .FALSE. @@ -30,21 +30,19 @@ *> zero, and .FALSE. otherwise. *> If SELOPT is at least 1, ZSLECT returns SELVAL(SELOPT) and adds 1 *> to SELOPT, cycling back to 1 at SELMAX. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] Z *> \verbatim *> Z is COMPLEX*16 *> The eigenvalue Z. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zstt21.f b/TESTING/EIG/zstt21.f index 02f4dd77..046283a6 100644 --- a/TESTING/EIG/zstt21.f +++ b/TESTING/EIG/zstt21.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTT21( N, KBAND, AD, AE, SD, SE, U, LDU, WORK, RWORK, * RESULT ) @@ -20,11 +20,11 @@ * COMPLEX*16 U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTT21 checks a decomposition of the form *> @@ -36,11 +36,10 @@ *> RESULT(1) = | A - U S U* | / ( |A| n ulp ) *> *> RESULT(2) = | I - UU* | / ( n ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -116,10 +115,9 @@ *> values are currently limited to 1/ulp, to avoid overflow. *> RESULT(1) is always modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zstt22.f b/TESTING/EIG/zstt22.f index b123c8b1..f5dbaecd 100644 --- a/TESTING/EIG/zstt22.f +++ b/TESTING/EIG/zstt22.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTT22( N, M, KBAND, AD, AE, SD, SE, U, LDU, WORK, * LDWORK, RWORK, RESULT ) @@ -20,11 +20,11 @@ * COMPLEX*16 U( LDU, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTT22 checks a set of M eigenvalues and eigenvectors, *> @@ -37,11 +37,10 @@ *> RESULT(1) = | U* A U - S | / ( |A| m ulp ) *> *> RESULT(2) = | I - U*U | / ( m ulp ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -129,10 +128,9 @@ *> The values computed by the two tests described above. The *> values are currently limited to 1/ulp, to avoid overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zunt01.f b/TESTING/EIG/zunt01.f index eb2b7fd7..dcf16d7a 100644 --- a/TESTING/EIG/zunt01.f +++ b/TESTING/EIG/zunt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNT01( ROWCOL, M, N, U, LDU, WORK, LWORK, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 U( LDU, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNT01 checks that the matrix U is unitary by computing the ratio *> @@ -43,11 +43,10 @@ *> where EPS is the machine precision. ROWCOL is used only if m = n; *> if m > n, ROWCOL is assumed to be 'C', and if m < n, ROWCOL is *> assumed to be 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ROWCOL *> \verbatim @@ -110,10 +109,9 @@ *> RESID = norm( I - U * U' ) / ( n * EPS ), if ROWCOL = 'R', or *> RESID = norm( I - U' * U ) / ( m * EPS ), if ROWCOL = 'C'. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/EIG/zunt03.f b/TESTING/EIG/zunt03.f index a03a2a23..215fd273 100644 --- a/TESTING/EIG/zunt03.f +++ b/TESTING/EIG/zunt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNT03( RC, MU, MV, N, K, U, LDU, V, LDV, WORK, LWORK, * RWORK, RESULT, INFO ) @@ -21,11 +21,11 @@ * COMPLEX*16 U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNT03 compares two unitary matrices U and V to see if their *> corresponding rows or columns span the same spaces. The rows are @@ -43,11 +43,10 @@ *> *> where abs(S) = 1 (chosen to minimize the expression), U(i) is the *> i-th row (column) of U, and V(i) is the i-th row (column) of V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RC *> \verbatim @@ -146,10 +145,9 @@ *> 0 indicates a successful exit *> -k indicates the k-th parameter had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley |