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 | |
| parent | d5c30c90bdecf38da1064e2ed52583634573e741 (diff) | |
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')
1056 files changed, 11657 insertions, 13795 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 diff --git a/TESTING/LIN/aladhd.f b/TESTING/LIN/aladhd.f index 4669c9a5..5ab46f3f 100644 --- a/TESTING/LIN/aladhd.f +++ b/TESTING/LIN/aladhd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALADHD( IOUNIT, PATH ) * @@ -15,18 +15,17 @@ * INTEGER IOUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALADHD prints header information for the driver routines test paths. +*> \verbatim *> -*>\endverbatim +*> ALADHD prints header information for the driver routines test paths. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IOUNIT *> \verbatim @@ -55,10 +54,9 @@ *> The first character must be one of S, D, C, or Z (C or Z only *> if complex). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/alaerh.f b/TESTING/LIN/alaerh.f index 0b310346..ac9b115b 100644 --- a/TESTING/LIN/alaerh.f +++ b/TESTING/LIN/alaerh.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALAERH( PATH, SUBNAM, INFO, INFOE, OPTS, M, N, KL, KU, * N5, IMAT, NFAIL, NERRS, NOUT ) @@ -19,22 +19,21 @@ * $ NFAIL, NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ALAERH is an error handler for the LAPACK routines. It prints the *> header if this is the first error message and prints the error code *> and form of recovery, if any. The character evaluations in this *> routine may make it slow, but it should not be called once the LAPACK *> routines are fully debugged. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -131,10 +130,9 @@ *> NOUT is INTEGER *> The unit number on which results are to be printed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/alaesm.f b/TESTING/LIN/alaesm.f index c8c5b916..dcb46feb 100644 --- a/TESTING/LIN/alaesm.f +++ b/TESTING/LIN/alaesm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALAESM( PATH, OK, NOUT ) * @@ -16,18 +16,17 @@ * INTEGER NOUT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALAESM prints a summary of results from one of the -ERR- routines. +*> \verbatim *> -*>\endverbatim +*> ALAESM prints a summary of results from one of the -ERR- routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -48,10 +47,9 @@ *> The unit number on which results are to be printed. *> NOUT >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/alahd.f b/TESTING/LIN/alahd.f index 07dd4a9b..055457a8 100644 --- a/TESTING/LIN/alahd.f +++ b/TESTING/LIN/alahd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ALAHD( IOUNIT, PATH ) * @@ -15,18 +15,17 @@ * INTEGER IOUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ALAHD prints header information for the different test paths. +*> \verbatim *> -*>\endverbatim +*> ALAHD prints header information for the different test paths. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IOUNIT *> \verbatim @@ -68,10 +67,9 @@ *> The first character must be one of S, D, C, or Z (C or Z only *> if complex). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/alareq.f b/TESTING/LIN/alareq.f index 6acaed1f..6f911621 100644 --- a/TESTING/LIN/alareq.f +++ b/TESTING/LIN/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/LIN/alasum.f b/TESTING/LIN/alasum.f index e0159d15..e800e8a5 100644 --- a/TESTING/LIN/alasum.f +++ b/TESTING/LIN/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/LIN/alasvm.f b/TESTING/LIN/alasvm.f index 17adf186..589b0952 100644 --- a/TESTING/LIN/alasvm.f +++ b/TESTING/LIN/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/LIN/cchkaa.f b/TESTING/LIN/cchkaa.f index 9220fb34..c334876d 100644 --- a/TESTING/LIN/cchkaa.f +++ b/TESTING/LIN/cchkaa.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM CCHKAA * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKAA is the main test program for the COMPLEX linear equation *> routines. @@ -64,11 +64,10 @@ *> CTZ 3 List types on next line if 0 < NTYPES < 3 *> CLS 6 List types on next line if 0 < NTYPES < 6 *> CEQ -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NMAX INTEGER @@ -87,10 +86,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,8 +99,7 @@ * *> \ingroup complex_lin * -* ===================================================================== - PROGRAM CCHKAA +* ===================================================================== PROGRAM CCHKAA * * -- LAPACK test routine (version 3.1.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/cchkeq.f b/TESTING/LIN/cchkeq.f index 3c03f70c..904c5de7 100644 --- a/TESTING/LIN/cchkeq.f +++ b/TESTING/LIN/cchkeq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKEQ( THRESH, NOUT ) * @@ -15,18 +15,17 @@ * REAL THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKEQ tests CGEEQU, CGBEQU, CPOEQU, CPPEQU and CPBEQU +*> \verbatim *> -*>\endverbatim +*> CCHKEQ tests CGEEQU, CGBEQU, CPOEQU, CPPEQU and CPBEQU +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkgb.f b/TESTING/LIN/cchkgb.f index c5185a5e..a57081fd 100644 --- a/TESTING/LIN/cchkgb.f +++ b/TESTING/LIN/cchkgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKGB( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, A, LA, AFAC, LAFAC, B, @@ -26,18 +26,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKGB tests CGBTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKGB tests CGBTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -174,10 +173,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkge.f b/TESTING/LIN/cchkge.f index 679e133e..36a877a2 100644 --- a/TESTING/LIN/cchkge.f +++ b/TESTING/LIN/cchkge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKGE( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, NMAX, A, AFAC, AINV, B, @@ -26,18 +26,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKGE tests CGETRF, -TRI, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> CCHKGE tests CGETRF, -TRI, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -169,10 +168,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkgt.f b/TESTING/LIN/cchkgt.f index 83d67d36..aaae1541 100644 --- a/TESTING/LIN/cchkgt.f +++ b/TESTING/LIN/cchkgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKGT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, AF, B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKGT tests CGTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKGT tests CGTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -131,10 +130,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkhe.f b/TESTING/LIN/cchkhe.f index 59682376..25dfe39a 100644 --- a/TESTING/LIN/cchkhe.f +++ b/TESTING/LIN/cchkhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKHE( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKHE tests CHETRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> CCHKHE tests CHETRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -156,10 +155,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkhp.f b/TESTING/LIN/cchkhp.f index b7a6970f..74cce0ff 100644 --- a/TESTING/LIN/cchkhp.f +++ b/TESTING/LIN/cchkhp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKHP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKHP tests CHPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKHP tests CHPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchklq.f b/TESTING/LIN/cchklq.f index 0c520ff7..b1a069c6 100644 --- a/TESTING/LIN/cchklq.f +++ b/TESTING/LIN/cchklq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKLQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKLQ tests CGELQF, CUNGLQ and CUNMLQ. +*> \verbatim *> -*>\endverbatim +*> CCHKLQ tests CGELQF, CUNGLQ and CUNMLQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkpb.f b/TESTING/LIN/cchkpb.f index 2bc160f0..99cb4819 100644 --- a/TESTING/LIN/cchkpb.f +++ b/TESTING/LIN/cchkpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKPB( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKPB tests CPBTRF, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> CCHKPB tests CPBTRF, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -151,10 +150,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkpo.f b/TESTING/LIN/cchkpo.f index cdd91879..9484171d 100644 --- a/TESTING/LIN/cchkpo.f +++ b/TESTING/LIN/cchkpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKPO( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKPO tests CPOTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKPO tests CPOTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -151,10 +150,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkpp.f b/TESTING/LIN/cchkpp.f index 078f6a7b..31455dbe 100644 --- a/TESTING/LIN/cchkpp.f +++ b/TESTING/LIN/cchkpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKPP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKPP tests CPPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKPP tests CPPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkps.f b/TESTING/LIN/cchkps.f index 935635ae..4768d347 100644 --- a/TESTING/LIN/cchkps.f +++ b/TESTING/LIN/cchkps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKPS( DOTYPE, NN, NVAL, NNB, NBVAL, NRANK, RANKVAL, * THRESH, TSTERR, NMAX, A, AFAC, PERM, PIV, WORK, @@ -24,18 +24,17 @@ * LOGICAL DOTYPE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKPS tests CPSTRF. +*> \verbatim *> -*>\endverbatim +*> CCHKPS tests CPSTRF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkpt.f b/TESTING/LIN/cchkpt.f index 3b509226..c53e7abe 100644 --- a/TESTING/LIN/cchkpt.f +++ b/TESTING/LIN/cchkpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKPT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, D, E, B, X, XACT, WORK, RWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKPT tests CPTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKPT tests CPTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -131,10 +130,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkq3.f b/TESTING/LIN/cchkq3.f index 446c6514..750efce8 100644 --- a/TESTING/LIN/cchkq3.f +++ b/TESTING/LIN/cchkq3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKQ3( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * THRESH, A, COPYA, S, TAU, WORK, RWORK, @@ -24,18 +24,17 @@ * COMPLEX A( * ), COPYA( * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKQ3 tests CGEQP3. +*> \verbatim *> -*>\endverbatim +*> CCHKQ3 tests CGEQP3. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -141,10 +140,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkql.f b/TESTING/LIN/cchkql.f index cfdc804f..cf2401cc 100644 --- a/TESTING/LIN/cchkql.f +++ b/TESTING/LIN/cchkql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKQL( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKQL tests CGEQLF, CUNGQL and CUNMQL. +*> \verbatim *> -*>\endverbatim +*> CCHKQL tests CGEQLF, CUNGQL and CUNMQL. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkqp.f b/TESTING/LIN/cchkqp.f index 5414edc2..6819c0fd 100644 --- a/TESTING/LIN/cchkqp.f +++ b/TESTING/LIN/cchkqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKQP( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * COMPLEX A( * ), COPYA( * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKQP tests CGEQPF. +*> \verbatim *> -*>\endverbatim +*> CCHKQP tests CGEQPF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -127,10 +126,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkqr.f b/TESTING/LIN/cchkqr.f index 703c7bfe..8695182c 100644 --- a/TESTING/LIN/cchkqr.f +++ b/TESTING/LIN/cchkqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKQR( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKQR tests CGEQRF, CUNGQR and CUNMQR. +*> \verbatim *> -*>\endverbatim +*> CCHKQR tests CGEQRF, CUNGQR and CUNMQR. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchkrfp.f b/TESTING/LIN/cchkrfp.f index 814a18af..c35ebab7 100644 --- a/TESTING/LIN/cchkrfp.f +++ b/TESTING/LIN/cchkrfp.f @@ -5,25 +5,24 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM CCHKRFP * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CCHKRFP is the main test program for the COMPLEX linear equation *> routines with RFP storage format *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> MAXIN INTEGER @@ -44,10 +43,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -58,8 +56,7 @@ * *> \ingroup complex_lin * -* ===================================================================== - PROGRAM CCHKRFP +* ===================================================================== PROGRAM CCHKRFP * * -- LAPACK test routine (version 3.2.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/cchkrq.f b/TESTING/LIN/cchkrq.f index 5ae501b0..d3b4707f 100644 --- a/TESTING/LIN/cchkrq.f +++ b/TESTING/LIN/cchkrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKRQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKRQ tests CGERQF, CUNGRQ and CUNMRQ. +*> \verbatim *> -*>\endverbatim +*> CCHKRQ tests CGERQF, CUNGRQ and CUNMRQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchksp.f b/TESTING/LIN/cchksp.f index a377e683..dbdc9a03 100644 --- a/TESTING/LIN/cchksp.f +++ b/TESTING/LIN/cchksp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKSP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKSP tests CSPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> CCHKSP tests CSPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchksy.f b/TESTING/LIN/cchksy.f index 112f0a40..5a402fc6 100644 --- a/TESTING/LIN/cchksy.f +++ b/TESTING/LIN/cchksy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKSY( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKSY tests CSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> CCHKSY tests CSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -156,10 +155,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchktb.f b/TESTING/LIN/cchktb.f index 45385165..0b218018 100644 --- a/TESTING/LIN/cchktb.f +++ b/TESTING/LIN/cchktb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKTB( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AB, AINV, B, X, XACT, WORK, RWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKTB tests CTBTRS, -RFS, and -CON, and CLATBS. +*> \verbatim *> -*>\endverbatim +*> CCHKTB tests CTBTRS, -RFS, and -CON, and CLATBS. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -133,10 +132,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchktp.f b/TESTING/LIN/cchktp.f index 55493115..808fe5ac 100644 --- a/TESTING/LIN/cchktp.f +++ b/TESTING/LIN/cchktp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKTP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AP, AINVP, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKTP tests CTPTRI, -TRS, -RFS, and -CON, and CLATPS +*> \verbatim *> -*>\endverbatim +*> CCHKTP tests CTPTRI, -TRS, -RFS, and -CON, and CLATPS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -134,10 +133,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchktr.f b/TESTING/LIN/cchktr.f index ae0af63b..b830bd85 100644 --- a/TESTING/LIN/cchktr.f +++ b/TESTING/LIN/cchktr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKTR( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AINV, B, X, XACT, @@ -25,18 +25,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKTR tests CTRTRI, -TRS, -RFS, and -CON, and CLATRS +*> \verbatim *> -*>\endverbatim +*> CCHKTR tests CTRTRI, -TRS, -RFS, and -CON, and CLATRS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -146,10 +145,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cchktz.f b/TESTING/LIN/cchktz.f index 60f78378..a4fc8fc5 100644 --- a/TESTING/LIN/cchktz.f +++ b/TESTING/LIN/cchktz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCHKTZ( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, RWORK, NOUT ) @@ -23,18 +23,17 @@ * COMPLEX A( * ), COPYA( * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCHKTZ tests CTZRQF and CTZRZF. +*> \verbatim *> -*>\endverbatim +*> CCHKTZ tests CTZRQF and CTZRZF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -121,10 +120,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvgb.f b/TESTING/LIN/cdrvgb.f index a5e671a6..5b5329c6 100644 --- a/TESTING/LIN/cdrvgb.f +++ b/TESTING/LIN/cdrvgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVGB tests the driver routines CGBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVGB tests the driver routines CGBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvgbx.f b/TESTING/LIN/cdrvgbx.f index 6d130a94..d726301d 100644 --- a/TESTING/LIN/cdrvgbx.f +++ b/TESTING/LIN/cdrvgbx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVGB tests the driver routines CGBSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cdrvgb.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -158,10 +157,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvge.f b/TESTING/LIN/cdrvge.f index b932d2b9..ab5d3483 100644 --- a/TESTING/LIN/cdrvge.f +++ b/TESTING/LIN/cdrvge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVGE tests the driver routines CGESV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVGE tests the driver routines CGESV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvgex.f b/TESTING/LIN/cdrvgex.f index 7823aa38..1cb11cda 100644 --- a/TESTING/LIN/cdrvgex.f +++ b/TESTING/LIN/cdrvgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVGE tests the driver routines CGESV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cdrvge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvgt.f b/TESTING/LIN/cdrvgt.f index 7b671f41..1300d368 100644 --- a/TESTING/LIN/cdrvgt.f +++ b/TESTING/LIN/cdrvgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVGT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, AF, * B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVGT tests CGTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVGT tests CGTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -123,10 +122,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvhe.f b/TESTING/LIN/cdrvhe.f index a02091b2..a2521c02 100644 --- a/TESTING/LIN/cdrvhe.f +++ b/TESTING/LIN/cdrvhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVHE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVHE tests the driver routines CHESV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVHE tests the driver routines CHESV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvhex.f b/TESTING/LIN/cdrvhex.f index 613306db..f2034ef4 100644 --- a/TESTING/LIN/cdrvhex.f +++ b/TESTING/LIN/cdrvhex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVHE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,21 +25,20 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVHE tests the driver routines CHESV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cdrvhe.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvhp.f b/TESTING/LIN/cdrvhp.f index 44fb6543..d08dae4e 100644 --- a/TESTING/LIN/cdrvhp.f +++ b/TESTING/LIN/cdrvhp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVHP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVHP tests the driver routines CHPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVHP tests the driver routines CHPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvls.f b/TESTING/LIN/cdrvls.f index 045f434f..59539974 100644 --- a/TESTING/LIN/cdrvls.f +++ b/TESTING/LIN/cdrvls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVLS( DOTYPE, NM, MVAL, NN, NVAL, NNS, NSVAL, NNB, * NBVAL, NXVAL, THRESH, TSTERR, A, COPYA, B, @@ -27,19 +27,18 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVLS tests the least squares driver routines CGELS, CGELSX, CGELSS, *> CGELSY and CGELSD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -193,10 +192,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvpb.f b/TESTING/LIN/cdrvpb.f index 6760fb12..f7311adc 100644 --- a/TESTING/LIN/cdrvpb.f +++ b/TESTING/LIN/cdrvpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVPB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVPB tests the driver routines CPBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVPB tests the driver routines CPBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvpo.f b/TESTING/LIN/cdrvpo.f index 877d0be4..960a623b 100644 --- a/TESTING/LIN/cdrvpo.f +++ b/TESTING/LIN/cdrvpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVPO tests the driver routines CPOSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVPO tests the driver routines CPOSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvpox.f b/TESTING/LIN/cdrvpox.f index 52da5006..3868e438 100644 --- a/TESTING/LIN/cdrvpox.f +++ b/TESTING/LIN/cdrvpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVPO tests the driver routines CPOSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cdrvpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -145,10 +144,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvpp.f b/TESTING/LIN/cdrvpp.f index b352665a..504e6b27 100644 --- a/TESTING/LIN/cdrvpp.f +++ b/TESTING/LIN/cdrvpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVPP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVPP tests the driver routines CPPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVPP tests the driver routines CPPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvpt.f b/TESTING/LIN/cdrvpt.f index 677c1892..1393c92a 100644 --- a/TESTING/LIN/cdrvpt.f +++ b/TESTING/LIN/cdrvpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, D, * E, B, X, XACT, WORK, RWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVPT tests CPTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVPT tests CPTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -124,10 +123,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvrf1.f b/TESTING/LIN/cdrvrf1.f index c01020b7..a748715e 100644 --- a/TESTING/LIN/cdrvrf1.f +++ b/TESTING/LIN/cdrvrf1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVRF1( NOUT, NN, NVAL, THRESH, A, LDA, ARF, WORK ) * @@ -20,19 +20,18 @@ * COMPLEX A( LDA, * ), ARF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVRF1 tests the LAPACK RFP routines: *> CLANHF.F -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -80,10 +79,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvrf2.f b/TESTING/LIN/cdrvrf2.f index 92942e7a..a74d3404 100644 --- a/TESTING/LIN/cdrvrf2.f +++ b/TESTING/LIN/cdrvrf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVRF2( NOUT, NN, NVAL, A, LDA, ARF, AP, ASAV ) * @@ -18,18 +18,17 @@ * COMPLEX A( LDA, * ), ARF( * ), AP(*), ASAV( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVRF2 tests the LAPACK RFP convertion routines. +*> \verbatim *> -*>\endverbatim +*> CDRVRF2 tests the LAPACK RFP convertion routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -74,10 +73,9 @@ *> \verbatim *> ASAV is COMPLEX6 array, dimension (LDA,NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvrf3.f b/TESTING/LIN/cdrvrf3.f index 2ebaa61f..65e8d24b 100644 --- a/TESTING/LIN/cdrvrf3.f +++ b/TESTING/LIN/cdrvrf3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVRF3( NOUT, NN, NVAL, THRESH, A, LDA, ARF, B1, B2, * + S_WORK_CLANGE, C_WORK_CGEQRF, TAU ) @@ -23,19 +23,18 @@ * COMPLEX C_WORK_CGEQRF( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVRF3 tests the LAPACK RFP routines: *> CTFSM -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -103,10 +102,9 @@ *> \verbatim *> TAU is COMPLEX array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvrf4.f b/TESTING/LIN/cdrvrf4.f index 2aa2bc9b..a09b874c 100644 --- a/TESTING/LIN/cdrvrf4.f +++ b/TESTING/LIN/cdrvrf4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVRF4( NOUT, NN, NVAL, THRESH, C1, C2, LDC, CRF, A, * + LDA, S_WORK_CLANGE ) @@ -22,19 +22,18 @@ * + CRF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVRF4 tests the LAPACK RFP routines: *> CHFRK -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -98,10 +97,9 @@ *> \verbatim *> S_WORK_CLANGE is REAL array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvrfp.f b/TESTING/LIN/cdrvrfp.f index 1831004c..6c5ef9f9 100644 --- a/TESTING/LIN/cdrvrfp.f +++ b/TESTING/LIN/cdrvrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVRFP( NOUT, NN, NVAL, NNS, NSVAL, NNT, NTVAL, * + THRESH, A, ASAV, AFAC, AINV, B, @@ -41,11 +41,11 @@ * REAL S_WORK_CPOT03( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVRFP tests the LAPACK RFP routines: *> CPFTRF, CPFTRS, and CPFTRI. @@ -79,11 +79,10 @@ *> norm( . ) the 1-norm for (1,2,3) and the inf-norm for (4). *> Errors occur when INFO parameter is not as expected. Failures occur when *> a test ratios is greater than THRES. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -224,10 +223,9 @@ *> \verbatim *> S_WORK_CPOT03 is REAL array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvsp.f b/TESTING/LIN/cdrvsp.f index 7764c0a6..52fea000 100644 --- a/TESTING/LIN/cdrvsp.f +++ b/TESTING/LIN/cdrvsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVSP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVSP tests the driver routines CSPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVSP tests the driver routines CSPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvsy.f b/TESTING/LIN/cdrvsy.f index b3aa3993..5bd319ee 100644 --- a/TESTING/LIN/cdrvsy.f +++ b/TESTING/LIN/cdrvsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDRVSY tests the driver routines CSYSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> CDRVSY tests the driver routines CSYSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cdrvsyx.f b/TESTING/LIN/cdrvsyx.f index e70c0c34..4700d658 100644 --- a/TESTING/LIN/cdrvsyx.f +++ b/TESTING/LIN/cdrvsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,21 +25,20 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CDRVSY tests the driver routines CSYSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cdrvsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cebchvxx.f b/TESTING/LIN/cebchvxx.f index 4c2096f4..283ffe3d 100644 --- a/TESTING/LIN/cebchvxx.f +++ b/TESTING/LIN/cebchvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CEBCHVXX( THRESH, PATH ) * @@ -18,8 +18,9 @@ * Purpose * ====== * -*>\details \b Purpose: -*>\verbatim +*> \details \b Purpose: +*> \verbatim +*> *> CEBCHVXX will run CGESVXX on a series of Hilbert matrices and then *> compare the error bounds returned by CGESVXX to see if the returned *> answer indeed falls within those bounds. @@ -79,10 +80,9 @@ *> type used plus one, which is 24 for single precision. *> NMAX should be 6 for single and 11 for double. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cerrge.f b/TESTING/LIN/cerrge.f index 863f7f09..f1c421af 100644 --- a/TESTING/LIN/cerrge.f +++ b/TESTING/LIN/cerrge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRGE( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRGE tests the error exits for the COMPLEX routines *> for general matrices. -*> -*>\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/LIN/cerrgex.f b/TESTING/LIN/cerrgex.f index c0a62912..2a2d9744 100644 --- a/TESTING/LIN/cerrgex.f +++ b/TESTING/LIN/cerrgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRGE( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRGE tests the error exits for the COMPLEX routines *> for general matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cerrge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/cerrgt.f b/TESTING/LIN/cerrgt.f index 69ea9f3c..8d31e16a 100644 --- a/TESTING/LIN/cerrgt.f +++ b/TESTING/LIN/cerrgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRGT( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRGT tests the error exits for the COMPLEX tridiagonal *> routines. -*> -*>\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/LIN/cerrhe.f b/TESTING/LIN/cerrhe.f index 63f24c48..949ad3ed 100644 --- a/TESTING/LIN/cerrhe.f +++ b/TESTING/LIN/cerrhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRHE( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRHE tests the error exits for the COMPLEX routines *> for Hermitian indefinite matrices. -*> -*>\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/LIN/cerrhex.f b/TESTING/LIN/cerrhex.f index b6db76aa..2ca798d5 100644 --- a/TESTING/LIN/cerrhex.f +++ b/TESTING/LIN/cerrhex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRHE( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRHE tests the error exits for the COMPLEX routines *> for Hermitian indefinite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cerrhe.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/cerrlq.f b/TESTING/LIN/cerrlq.f index b64dfa26..8b6065b6 100644 --- a/TESTING/LIN/cerrlq.f +++ b/TESTING/LIN/cerrlq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRLQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRLQ tests the error exits for the COMPLEX routines *> that use the LQ decomposition of a general matrix. -*> -*>\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/LIN/cerrls.f b/TESTING/LIN/cerrls.f index b28c9932..ea565391 100644 --- a/TESTING/LIN/cerrls.f +++ b/TESTING/LIN/cerrls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRLS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRLS tests the error exits for the COMPLEX least squares *> driver routines (CGELS, CGELSS, CGELSX, CGELSY, CGELSD). -*> -*>\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/LIN/cerrpo.f b/TESTING/LIN/cerrpo.f index 5b7c884b..7aa4ea8a 100644 --- a/TESTING/LIN/cerrpo.f +++ b/TESTING/LIN/cerrpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRPO( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRPO tests the error exits for the COMPLEX routines *> for Hermitian positive definite matrices. -*> -*>\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/LIN/cerrpox.f b/TESTING/LIN/cerrpox.f index 099d08e4..64082601 100644 --- a/TESTING/LIN/cerrpox.f +++ b/TESTING/LIN/cerrpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRPO( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRPO tests the error exits for the COMPLEX routines *> for Hermitian positive definite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cerrpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/cerrps.f b/TESTING/LIN/cerrps.f index e7581d3e..0cb047d7 100644 --- a/TESTING/LIN/cerrps.f +++ b/TESTING/LIN/cerrps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRPS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRPS tests the error exits for the COMPLEX routines *> for CPSTRF.. -*> -*>\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/LIN/cerrql.f b/TESTING/LIN/cerrql.f index 8ab24599..7adbd52a 100644 --- a/TESTING/LIN/cerrql.f +++ b/TESTING/LIN/cerrql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRQL( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRQL tests the error exits for the COMPLEX routines *> that use the QL decomposition of a general matrix. -*> -*>\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/LIN/cerrqp.f b/TESTING/LIN/cerrqp.f index 38d97e30..0b682030 100644 --- a/TESTING/LIN/cerrqp.f +++ b/TESTING/LIN/cerrqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRQP( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CERRQP tests the error exits for CGEQPF and CGEQP3. +*> \verbatim *> -*>\endverbatim +*> CERRQP tests the error exits for CGEQPF and CGEQP3. +*> \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/LIN/cerrqr.f b/TESTING/LIN/cerrqr.f index a02a62b9..3c5dca03 100644 --- a/TESTING/LIN/cerrqr.f +++ b/TESTING/LIN/cerrqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRQR( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRQR tests the error exits for the COMPLEX routines *> that use the QR decomposition of a general matrix. -*> -*>\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/LIN/cerrrfp.f b/TESTING/LIN/cerrrfp.f index a0a182a0..9559e8d8 100644 --- a/TESTING/LIN/cerrrfp.f +++ b/TESTING/LIN/cerrrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRRFP( NUNIT ) * @@ -14,11 +14,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRRFP tests the error exits for the COMPLEX driver routines *> for solving linear systems of equations. @@ -26,21 +26,19 @@ *> CDRVRFP tests the COMPLEX LAPACK RFP routines: *> CTFSM, CTFTRI, CHFRK, CTFTTP, CTFTTR, CPFTRF, CPFTRS, CTPTTF, *> CTPTTR, CTRTTF, and CTRTTP -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cerrrq.f b/TESTING/LIN/cerrrq.f index e9139db3..98a030f2 100644 --- a/TESTING/LIN/cerrrq.f +++ b/TESTING/LIN/cerrrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRRQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRRQ tests the error exits for the COMPLEX routines *> that use the RQ decomposition of a general matrix. -*> -*>\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/LIN/cerrsy.f b/TESTING/LIN/cerrsy.f index 20fa4be4..5ab8390c 100644 --- a/TESTING/LIN/cerrsy.f +++ b/TESTING/LIN/cerrsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRSY( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRSY tests the error exits for the COMPLEX routines *> for symmetric indefinite matrices. -*> -*>\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/LIN/cerrsyx.f b/TESTING/LIN/cerrsyx.f index 9dbca81a..47c8f927 100644 --- a/TESTING/LIN/cerrsyx.f +++ b/TESTING/LIN/cerrsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRSY( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRSY tests the error exits for the COMPLEX routines *> for symmetric indefinite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise cerrsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/cerrtr.f b/TESTING/LIN/cerrtr.f index 264c56bd..39d33b4b 100644 --- a/TESTING/LIN/cerrtr.f +++ b/TESTING/LIN/cerrtr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRTR( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CERRTR tests the error exits for the COMPLEX triangular routines. +*> \verbatim *> -*>\endverbatim +*> CERRTR tests the error exits for the COMPLEX triangular routines. +*> \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/LIN/cerrtz.f b/TESTING/LIN/cerrtz.f index 47ec90c6..6704d104 100644 --- a/TESTING/LIN/cerrtz.f +++ b/TESTING/LIN/cerrtz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRTZ( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CERRTZ tests the error exits for CTZRQF and CTZRZF. +*> \verbatim *> -*>\endverbatim +*> CERRTZ tests the error exits for CTZRQF and CTZRZF. +*> \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/LIN/cerrvx.f b/TESTING/LIN/cerrvx.f index 42753c97..75ee91ef 100644 --- a/TESTING/LIN/cerrvx.f +++ b/TESTING/LIN/cerrvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRVX tests the error exits for the COMPLEX driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/cerrvxx.f b/TESTING/LIN/cerrvxx.f index 1ca1f6c7..d15eca3a 100644 --- a/TESTING/LIN/cerrvxx.f +++ b/TESTING/LIN/cerrvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CERRVX tests the error exits for the COMPLEX driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/cgbt01.f b/TESTING/LIN/cgbt01.f index 5abb6f47..d5c0ac38 100644 --- a/TESTING/LIN/cgbt01.f +++ b/TESTING/LIN/cgbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBT01( M, N, KL, KU, A, LDA, AFAC, LDAFAC, IPIV, WORK, * RESID ) @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), AFAC( LDAFAC, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBT01 reconstructs a band matrix A from its L*U factorization and *> computes the residual: @@ -33,11 +33,10 @@ *> *> The expression L*U - A is computed one column at a time, so A and *> AFAC are not modified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESID is REAL *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cgbt02.f b/TESTING/LIN/cgbt02.f index bb35c1b7..92477dfe 100644 --- a/TESTING/LIN/cgbt02.f +++ b/TESTING/LIN/cgbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBT02( TRANS, M, N, KL, KU, NRHS, A, LDA, X, LDX, B, * LDB, RESID ) @@ -20,21 +20,20 @@ * COMPLEX A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBT02 computes the residual for a solution of a banded system of *> equations A*x = b or A'*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS). *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -123,10 +122,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/LIN/cgbt05.f b/TESTING/LIN/cgbt05.f index fbcf837b..3adc5ba4 100644 --- a/TESTING/LIN/cgbt05.f +++ b/TESTING/LIN/cgbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBT05( TRANS, N, KL, KU, NRHS, AB, LDAB, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -160,10 +159,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cgelqs.f b/TESTING/LIN/cgelqs.f index 41d6a05d..cf4d1847 100644 --- a/TESTING/LIN/cgelqs.f +++ b/TESTING/LIN/cgelqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the LQ factorization *> A = L*Q *> computed by CGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/cgennd.f b/TESTING/LIN/cgennd.f index c56ca7b9..6e4679b2 100644 --- a/TESTING/LIN/cgennd.f +++ b/TESTING/LIN/cgennd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION CGENND (M, N, A, LDA) * @@ -17,18 +17,17 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CGENND tests that its argument has a real, non-negative diagonal. +*> \verbatim *> -*>\endverbatim +*> CGENND tests that its argument has a real, non-negative diagonal. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -53,10 +52,9 @@ *> LDA is INTEGER *> Leading dimension of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cgeqls.f b/TESTING/LIN/cgeqls.f index efa05b42..6df8e273 100644 --- a/TESTING/LIN/cgeqls.f +++ b/TESTING/LIN/cgeqls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQLS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QL factorization *> A = Q*L *> computed by CGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/cgeqrs.f b/TESTING/LIN/cgeqrs.f index 887c708e..b09d04ac 100644 --- a/TESTING/LIN/cgeqrs.f +++ b/TESTING/LIN/cgeqrs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQRS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QR factorization *> A = Q*R *> computed by CGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/cgerqs.f b/TESTING/LIN/cgerqs.f index 92eea1e6..2c82357c 100644 --- a/TESTING/LIN/cgerqs.f +++ b/TESTING/LIN/cgerqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the RQ factorization *> A = R*Q *> computed by CGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/cget01.f b/TESTING/LIN/cget01.f index d22946d0..139bce10 100644 --- a/TESTING/LIN/cget01.f +++ b/TESTING/LIN/cget01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET01( M, N, A, LDA, AFAC, LDAFAC, IPIV, RWORK, * RESID ) @@ -21,21 +21,20 @@ * COMPLEX A( LDA, * ), AFAC( LDAFAC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET01 reconstructs a matrix A from its L*U factorization and *> computes the residual *> norm(L*U - A) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,9 @@ *> RESID is REAL *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cget02.f b/TESTING/LIN/cget02.f index 4b2679c5..a489b66d 100644 --- a/TESTING/LIN/cget02.f +++ b/TESTING/LIN/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/LIN/cget03.f b/TESTING/LIN/cget03.f index 7421618d..d5ece9ce 100644 --- a/TESTING/LIN/cget03.f +++ b/TESTING/LIN/cget03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET03( N, A, LDA, AINV, LDAINV, WORK, LDWORK, RWORK, * RCOND, RESID ) @@ -21,20 +21,19 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET03 computes the residual for a general matrix times its inverse: *> norm( I - AINV*A ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,9 @@ *> RESID is REAL *> norm(I - AINV*A) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cget04.f b/TESTING/LIN/cget04.f index 52e9afad..be416789 100644 --- a/TESTING/LIN/cget04.f +++ b/TESTING/LIN/cget04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET04( N, NRHS, X, LDX, XACT, LDXACT, RCOND, RESID ) * @@ -18,11 +18,11 @@ * COMPLEX X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET04 computes the difference between a computed solution and the *> true solution to a system of linear equations. @@ -30,11 +30,10 @@ *> RESID = ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ), *> where RCOND is the reciprocal of the condition number and EPS is the *> machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> The maximum over the NRHS solution vectors of *> ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cget07.f b/TESTING/LIN/cget07.f index d45c248b..12392fe3 100644 --- a/TESTING/LIN/cget07.f +++ b/TESTING/LIN/cget07.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGET07( TRANS, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, CHKFERR, BERR, RESLTS ) @@ -22,11 +22,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGET07 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -40,11 +40,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -150,10 +149,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cgtt01.f b/TESTING/LIN/cgtt01.f index 43a93546..23a281a7 100644 --- a/TESTING/LIN/cgtt01.f +++ b/TESTING/LIN/cgtt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTT01( N, DL, D, DU, DLF, DF, DUF, DU2, IPIV, WORK, * LDWORK, RWORK, RESID ) @@ -22,21 +22,20 @@ * $ DU2( * ), DUF( * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTT01 reconstructs a tridiagonal matrix A from its LU factorization *> and computes the residual *> norm(L*U - A) / ( norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> RESID is REAL *> The scaled residual: norm(L*U - A) / (norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cgtt02.f b/TESTING/LIN/cgtt02.f index e57d97ec..8ffcc037 100644 --- a/TESTING/LIN/cgtt02.f +++ b/TESTING/LIN/cgtt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTT02( TRANS, N, NRHS, DL, D, DU, X, LDX, B, LDB, * RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTT02 computes the residual for the solution to a tridiagonal *> system of equations: *> RESID = norm(B - op(A)*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -108,10 +107,9 @@ *> RESID is REAL *> norm(B - op(A)*X) / (norm(A) * norm(X) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cgtt05.f b/TESTING/LIN/cgtt05.f index 7c27801d..92655988 100644 --- a/TESTING/LIN/cgtt05.f +++ b/TESTING/LIN/cgtt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTT05( TRANS, N, NRHS, DL, D, DU, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/chet01.f b/TESTING/LIN/chet01.f index 8725f6f0..77d02dcf 100644 --- a/TESTING/LIN/chet01.f +++ b/TESTING/LIN/chet01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHET01( UPLO, N, A, LDA, AFAC, LDAFAC, IPIV, C, LDC, * RWORK, RESID ) @@ -22,11 +22,11 @@ * COMPLEX A( LDA, * ), AFAC( LDAFAC, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHET01 reconstructs a Hermitian indefinite matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual @@ -34,11 +34,10 @@ *> where C is the reconstructed matrix, EPS is the machine epsilon, *> L' is the conjugate transpose of L, and U' is the conjugate transpose *> of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/chkxer.f b/TESTING/LIN/chkxer.f index 0231f757..85f0cb15 100644 --- a/TESTING/LIN/chkxer.f +++ b/TESTING/LIN/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 ) * @@ -33,19 +33,19 @@ * End of CHKXER. * * END -* 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/LIN/chpt01.f b/TESTING/LIN/chpt01.f index d3ae6e0a..189e9728 100644 --- a/TESTING/LIN/chpt01.f +++ b/TESTING/LIN/chpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPT01( UPLO, N, A, AFAC, IPIV, C, LDC, RWORK, RESID ) * @@ -21,11 +21,11 @@ * COMPLEX A( * ), AFAC( * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPT01 reconstructs a Hermitian indefinite packed matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual @@ -33,11 +33,10 @@ *> where C is the reconstructed matrix, EPS is the machine epsilon, *> L' is the conjugate transpose of L, and U' is the conjugate transpose *> of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -98,10 +97,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clahilb.f b/TESTING/LIN/clahilb.f index d140b3b0..81169490 100644 --- a/TESTING/LIN/clahilb.f +++ b/TESTING/LIN/clahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, * INFO, PATH) @@ -19,11 +19,11 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -43,11 +43,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> PATH is CHARACTER*3 *> The LAPACK path name. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/claipd.f b/TESTING/LIN/claipd.f index 4e8f4616..a4979d01 100644 --- a/TESTING/LIN/claipd.f +++ b/TESTING/LIN/claipd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAIPD( N, A, INDA, VINDA ) * @@ -17,21 +17,20 @@ * COMPLEX A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAIPD sets the imaginary part of the diagonal elements of a complex *> matrix A to a large value. This is used to test LAPACK routines for *> complex Hermitian matrices, which are not supposed to access or use *> the imaginary parts of the diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -68,10 +67,9 @@ *> = 1: packed upper triangular matrix *> = -1: packed lower triangular matrix *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/claptm.f b/TESTING/LIN/claptm.f index a0761216..a5d70c51 100644 --- a/TESTING/LIN/claptm.f +++ b/TESTING/LIN/claptm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAPTM( UPLO, N, NRHS, ALPHA, D, E, X, LDX, BETA, B, * LDB ) @@ -21,11 +21,11 @@ * COMPLEX B( LDB, * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAPTM multiplies an N by NRHS matrix X by a Hermitian tridiagonal *> matrix A and stores the result in a matrix B. The operation has the @@ -34,11 +34,10 @@ *> B := alpha * A * X + beta * B *> *> where alpha may be either 1. or -1. and beta may be 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -113,10 +112,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(N,1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clarhs.f b/TESTING/LIN/clarhs.f index 7fc6d382..744f79a0 100644 --- a/TESTING/LIN/clarhs.f +++ b/TESTING/LIN/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 = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clatb4.f b/TESTING/LIN/clatb4.f index e6acabd6..cf9dbaee 100644 --- a/TESTING/LIN/clatb4.f +++ b/TESTING/LIN/clatb4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATB4( PATH, IMAT, M, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * REAL ANORM, CNDNUM * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATB4 sets parameters for the matrix generator based on the type of *> matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -104,10 +103,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/LIN/clatb5.f b/TESTING/LIN/clatb5.f index 015169b7..b0de2bf4 100644 --- a/TESTING/LIN/clatb5.f +++ b/TESTING/LIN/clatb5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATB5( PATH, IMAT, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATB5 sets parameters for the matrix generator based on the type *> of matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -98,10 +97,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/LIN/clatsp.f b/TESTING/LIN/clatsp.f index f0c25071..7289b471 100644 --- a/TESTING/LIN/clatsp.f +++ b/TESTING/LIN/clatsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATSP( UPLO, N, X, ISEED ) * @@ -19,11 +19,11 @@ * COMPLEX X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATSP generates a special test matrix for the complex symmetric *> (indefinite) factorization for packed matrices. The pivot blocks of @@ -33,11 +33,10 @@ *> 2x2 pivot block, diagonalizable *> (cycle repeats) *> A row interchange is required for each non-diagonalizable 2x2 block. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -69,10 +68,9 @@ *> On entry, the seed for the random number generator. The last *> of the four integers must be odd. (modified on exit) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clatsy.f b/TESTING/LIN/clatsy.f index efd251dc..218b776e 100644 --- a/TESTING/LIN/clatsy.f +++ b/TESTING/LIN/clatsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATSY( UPLO, N, X, LDX, ISEED ) * @@ -19,11 +19,11 @@ * COMPLEX X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATSY generates a special test matrix for the complex symmetric *> (indefinite) factorization. The pivot blocks of the generated matrix @@ -33,11 +33,10 @@ *> 2x2 pivot block, diagonalizable *> (cycle repeats) *> A row interchange is required for each non-diagonalizable 2x2 block. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -74,10 +73,9 @@ *> On entry, the seed for the random number generator. The last *> of the four integers must be odd. (modified on exit) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clattb.f b/TESTING/LIN/clattb.f index baf28cff..6bdd9f9a 100644 --- a/TESTING/LIN/clattb.f +++ b/TESTING/LIN/clattb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATTB( IMAT, UPLO, TRANS, DIAG, ISEED, N, KD, AB, * LDAB, B, WORK, RWORK, INFO ) @@ -21,20 +21,19 @@ * COMPLEX AB( LDAB, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATTB generates a triangular test matrix in 2-dimensional storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -125,10 +124,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/LIN/clattp.f b/TESTING/LIN/clattp.f index 4768e5bb..8b1293a7 100644 --- a/TESTING/LIN/clattp.f +++ b/TESTING/LIN/clattp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATTP( IMAT, UPLO, TRANS, DIAG, ISEED, N, AP, B, WORK, * RWORK, INFO ) @@ -21,20 +21,19 @@ * COMPLEX AP( * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATTP generates a triangular test matrix in packed storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array AP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -115,10 +114,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/LIN/clattr.f b/TESTING/LIN/clattr.f index 290542c1..c182bfa9 100644 --- a/TESTING/LIN/clattr.f +++ b/TESTING/LIN/clattr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATTR( IMAT, UPLO, TRANS, DIAG, ISEED, N, A, LDA, B, * WORK, RWORK, INFO ) @@ -21,20 +21,19 @@ * COMPLEX A( LDA, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATTR generates a triangular test matrix in 2-dimensional storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -122,10 +121,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/LIN/clavhe.f b/TESTING/LIN/clavhe.f index 53c32c8b..a75306a3 100644 --- a/TESTING/LIN/clavhe.f +++ b/TESTING/LIN/clavhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAVHE( UPLO, TRANS, DIAG, N, NRHS, A, LDA, IPIV, B, * LDB, INFO ) @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAVHE performs one of the matrix-vector operations *> x := A*x or x := A^H*x, @@ -44,11 +44,10 @@ *> (or L or L * D). *> If TRANS = 'C' or 'c', CLAVHE multiplies either by U^H or D * U^H *> (or L^H or D * L^H ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -122,10 +121,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clavhp.f b/TESTING/LIN/clavhp.f index fdd28d60..e940bc4c 100644 --- a/TESTING/LIN/clavhp.f +++ b/TESTING/LIN/clavhp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAVHP( UPLO, TRANS, DIAG, N, NRHS, A, IPIV, B, LDB, * INFO ) @@ -20,11 +20,11 @@ * COMPLEX A( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAVHP performs one of the matrix-vector operations *> x := A*x or x := A^H*x, @@ -43,11 +43,10 @@ *> (or L or L * D). *> If TRANS = 'C' or 'c', CLAVHP multiplies either by U^H or D * U^H *> (or L^H or D * L^H ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -115,10 +114,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clavsp.f b/TESTING/LIN/clavsp.f index f241512e..14b90401 100644 --- a/TESTING/LIN/clavsp.f +++ b/TESTING/LIN/clavsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAVSP( UPLO, TRANS, DIAG, N, NRHS, A, IPIV, B, LDB, * INFO ) @@ -20,11 +20,11 @@ * COMPLEX A( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAVSP performs one of the matrix-vector operations *> x := A*x or x := A^T*x, @@ -43,11 +43,10 @@ *> (or L or L * D). *> If TRANS = 'C' or 'c', CLAVSP multiplies either by U^T or D * U^T *> (or L^T or D * L^T ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -115,10 +114,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clavsy.f b/TESTING/LIN/clavsy.f index ef7011e3..92b29162 100644 --- a/TESTING/LIN/clavsy.f +++ b/TESTING/LIN/clavsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAVSY( UPLO, TRANS, DIAG, N, NRHS, A, LDA, IPIV, B, * LDB, INFO ) @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAVSY performs one of the matrix-vector operations *> x := A*x or x := A'*x, @@ -44,11 +44,10 @@ *> (or L or L * D). *> If TRANS = 'T' or 't', CLAVSY multiplies either by U' or D * U' *> (or L' or D * L' ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -122,10 +121,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/clqt01.f b/TESTING/LIN/clqt01.f index abeeb2e4..cbf1fe35 100644 --- a/TESTING/LIN/clqt01.f +++ b/TESTING/LIN/clqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLQT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLQT01 tests CGELQF, which computes the LQ factorization of an m-by-n *> matrix A, and partially tests CUNGLQ which forms the n-by-n *> orthogonal matrix Q. *> *> CLQT01 compares L with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/clqt02.f b/TESTING/LIN/clqt02.f index c2ccbdff..11e85f2f 100644 --- a/TESTING/LIN/clqt02.f +++ b/TESTING/LIN/clqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLQT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLQT02 tests CUNGLQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> rows of A; it compares L(1:k,1:m) with A(1:k,1:n)*Q(1:m,1:n)', and *> checks that the rows of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/clqt03.f b/TESTING/LIN/clqt03.f index 6c8ec356..965133fe 100644 --- a/TESTING/LIN/clqt03.f +++ b/TESTING/LIN/clqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLQT03 tests CUNMLQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> CLQT03 compares the results of a call to CUNMLQ with the results of *> forming Q explicitly by a call to CUNGLQ and then performing matrix *> multiplication by a call to CGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cpbt01.f b/TESTING/LIN/cpbt01.f index 3fcf08f9..671e317d 100644 --- a/TESTING/LIN/cpbt01.f +++ b/TESTING/LIN/cpbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBT01( UPLO, N, KD, A, LDA, AFAC, LDAFAC, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX A( LDA, * ), AFAC( LDAFAC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBT01 reconstructs a Hermitian positive definite band matrix A from *> its L*L' or U'*U factorization and computes the residual @@ -33,11 +33,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of *> L, and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -104,10 +103,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cpbt02.f b/TESTING/LIN/cpbt02.f index de13ff0a..7f76f2c2 100644 --- a/TESTING/LIN/cpbt02.f +++ b/TESTING/LIN/cpbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBT02( UPLO, N, KD, 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 *> *> CPBT02 computes the residual for a solution of a Hermitian banded *> system of equations A*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS) *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,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/LIN/cpbt05.f b/TESTING/LIN/cpbt05.f index 10a91a70..70b1d965 100644 --- a/TESTING/LIN/cpbt05.f +++ b/TESTING/LIN/cpbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBT05( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cpot01.f b/TESTING/LIN/cpot01.f index d2f7835a..8cee9648 100644 --- a/TESTING/LIN/cpot01.f +++ b/TESTING/LIN/cpot01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOT01( UPLO, N, A, LDA, AFAC, LDAFAC, RWORK, RESID ) * @@ -20,11 +20,11 @@ * COMPLEX A( LDA, * ), AFAC( LDAFAC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOT01 reconstructs a Hermitian positive definite matrix A from *> its L*L' or U'*U factorization and computes the residual @@ -32,11 +32,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of L, *> and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -91,10 +90,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cpot02.f b/TESTING/LIN/cpot02.f index 91ed1b0f..ee3c34e2 100644 --- a/TESTING/LIN/cpot02.f +++ b/TESTING/LIN/cpot02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOT02( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOT02 computes the residual for the solution of a Hermitian system *> of linear equations A*x = b: @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/cpot03.f b/TESTING/LIN/cpot03.f index 4793394b..28d576b5 100644 --- a/TESTING/LIN/cpot03.f +++ b/TESTING/LIN/cpot03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOT03( UPLO, N, A, LDA, AINV, LDAINV, WORK, LDWORK, * RWORK, RCOND, RESID ) @@ -22,21 +22,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOT03 computes the residual for a Hermitian matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> RESID is REAL *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cpot05.f b/TESTING/LIN/cpot05.f index b54a2e6f..20335e27 100644 --- a/TESTING/LIN/cpot05.f +++ b/TESTING/LIN/cpot05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOT05( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cppt01.f b/TESTING/LIN/cppt01.f index 0b7e1915..8e16e0aa 100644 --- a/TESTING/LIN/cppt01.f +++ b/TESTING/LIN/cppt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPT01( UPLO, N, A, AFAC, RWORK, RESID ) * @@ -20,11 +20,11 @@ * COMPLEX A( * ), AFAC( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPT01 reconstructs a Hermitian positive definite packed matrix A *> from its L*L' or U'*U factorization and computes the residual @@ -32,11 +32,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of *> L, and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -80,10 +79,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cppt02.f b/TESTING/LIN/cppt02.f index 3c1e0ad2..c3e2886f 100644 --- a/TESTING/LIN/cppt02.f +++ b/TESTING/LIN/cppt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPT02( UPLO, N, NRHS, A, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX A( * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPT02 computes the residual in the solution of a Hermitian system *> of linear equations A*x = b when packed storage is used for the @@ -34,11 +34,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS), *> *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -107,10 +106,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/LIN/cppt03.f b/TESTING/LIN/cppt03.f index 257d03dc..92a4ea0d 100644 --- a/TESTING/LIN/cppt03.f +++ b/TESTING/LIN/cppt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPT03( UPLO, N, A, AINV, WORK, LDWORK, RWORK, RCOND, * RESID ) @@ -21,21 +21,20 @@ * COMPLEX A( * ), AINV( * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPT03 computes the residual for a Hermitian packed matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is REAL *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cppt05.f b/TESTING/LIN/cppt05.f index cf2e605f..8cacf669 100644 --- a/TESTING/LIN/cppt05.f +++ b/TESTING/LIN/cppt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPT05( UPLO, N, NRHS, AP, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cpst01.f b/TESTING/LIN/cpst01.f index 7bef530b..e3e355c7 100644 --- a/TESTING/LIN/cpst01.f +++ b/TESTING/LIN/cpst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPST01( UPLO, N, A, LDA, AFAC, LDAFAC, PERM, LDPERM, * PIV, RWORK, RESID, RANK ) @@ -23,11 +23,11 @@ * INTEGER PIV( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPST01 reconstructs an Hermitian positive semidefinite matrix A *> from its L or U factors and the permutation matrix P and computes @@ -36,11 +36,10 @@ *> norm( P*U'*U*P' - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of L, *> and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> RANK is INTEGER *> number of nonzero singular values of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cptt01.f b/TESTING/LIN/cptt01.f index 70375bbc..afc22838 100644 --- a/TESTING/LIN/cptt01.f +++ b/TESTING/LIN/cptt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTT01( N, D, E, DF, EF, WORK, RESID ) * @@ -19,21 +19,20 @@ * COMPLEX E( * ), EF( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTT01 reconstructs a tridiagonal matrix A from its L*D*L' *> factorization and computes the residual *> norm(L*D*L' - A) / ( n * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -77,10 +76,9 @@ *> RESID is REAL *> norm(L*D*L' - A) / (n * norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cptt02.f b/TESTING/LIN/cptt02.f index 4fb6b749..28d5df35 100644 --- a/TESTING/LIN/cptt02.f +++ b/TESTING/LIN/cptt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTT02( UPLO, N, NRHS, D, E, X, LDX, B, LDB, RESID ) * @@ -20,21 +20,20 @@ * COMPLEX B( LDB, * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTT02 computes the residual for the solution to a symmetric *> tridiagonal system of equations: *> RESID = norm(B - A*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,9 @@ *> RESID is REAL *> 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/LIN/cptt05.f b/TESTING/LIN/cptt05.f index 0004ab3b..a632b0fd 100644 --- a/TESTING/LIN/cptt05.f +++ b/TESTING/LIN/cptt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTT05( N, NRHS, D, E, B, LDB, X, LDX, XACT, LDXACT, * FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -134,10 +133,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqlt01.f b/TESTING/LIN/cqlt01.f index 78873f6d..c565ff23 100644 --- a/TESTING/LIN/cqlt01.f +++ b/TESTING/LIN/cqlt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQLT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQLT01 tests CGEQLF, which computes the QL factorization of an m-by-n *> matrix A, and partially tests CUNGQL which forms the m-by-m *> orthogonal matrix Q. *> *> CQLT01 compares L with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqlt02.f b/TESTING/LIN/cqlt02.f index 68b8e8aa..fef50431 100644 --- a/TESTING/LIN/cqlt02.f +++ b/TESTING/LIN/cqlt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQLT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQLT02 tests CUNGQL, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> columns of A; it compares L(m-n+1:m,n-k+1:n) with *> Q(1:m,m-n+1:m)'*A(1:m,n-k+1:n), and checks that the columns of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqlt03.f b/TESTING/LIN/cqlt03.f index 162601b3..17d7f5cc 100644 --- a/TESTING/LIN/cqlt03.f +++ b/TESTING/LIN/cqlt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQLT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQLT03 tests CUNMQL, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> CQLT03 compares the results of a call to CUNMQL with the results of *> forming Q explicitly by a call to CUNGQL and then performing matrix *> multiplication by a call to CGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqpt01.f b/TESTING/LIN/cqpt01.f index 30b44745..78c40bec 100644 --- a/TESTING/LIN/cqpt01.f +++ b/TESTING/LIN/cqpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CQPT01( M, N, K, A, AF, LDA, TAU, JPVT, * WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQPT01 tests the QR-factorization with pivoting of a matrix A. The *> array AF contains the (possibly partial) QR-factorization of A, where @@ -34,11 +34,10 @@ *> matrix. *> *> This function returns ||A*P - Q*R||/(||norm(A)||*eps*M) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -104,10 +103,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*N+N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt01.f b/TESTING/LIN/cqrt01.f index 79e0f45a..7341a405 100644 --- a/TESTING/LIN/cqrt01.f +++ b/TESTING/LIN/cqrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT01 tests CGEQRF, which computes the QR factorization of an m-by-n *> matrix A, and partially tests CUNGQR which forms the m-by-m *> orthogonal matrix Q. *> *> CQRT01 compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt01p.f b/TESTING/LIN/cqrt01p.f index 2ace0e99..f2c5b3a2 100644 --- a/TESTING/LIN/cqrt01p.f +++ b/TESTING/LIN/cqrt01p.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT01P( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT01P tests CGEQRFP, which computes the QR factorization of an m-by-n *> matrix A, and partially tests CUNGQR which forms the m-by-m *> orthogonal matrix Q. *> *> CQRT01P compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt02.f b/TESTING/LIN/cqrt02.f index 54db03da..3a937c24 100644 --- a/TESTING/LIN/cqrt02.f +++ b/TESTING/LIN/cqrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT02 tests CUNGQR, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> columns of A; it compares R(1:n,1:k) with Q(1:m,1:n)'*A(1:m,1:k), *> and checks that the columns of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt03.f b/TESTING/LIN/cqrt03.f index a66a0fdd..b7b9dc0e 100644 --- a/TESTING/LIN/cqrt03.f +++ b/TESTING/LIN/cqrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT03 tests CUNMQR, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> CQRT03 compares the results of a call to CUNMQR with the results of *> forming Q explicitly by a call to CUNGQR and then performing matrix *> multiplication by a call to CGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt04.f b/TESTING/LIN/cqrt04.f index ccf1ce3c..760b24e7 100644 --- a/TESTING/LIN/cqrt04.f +++ b/TESTING/LIN/cqrt04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT04(M,N,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * REAL RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CQRT04 tests CGEQRT and CGEMQRT. +*> \verbatim *> -*>\endverbatim +*> CQRT04 tests CGEQRT and CGEMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -58,10 +57,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt05.f b/TESTING/LIN/cqrt05.f index b2398a58..5383a783 100644 --- a/TESTING/LIN/cqrt05.f +++ b/TESTING/LIN/cqrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT05(M,N,L,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * REAL RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CQRT05 tests CTPQRT and CTPMQRT. +*> \verbatim *> -*>\endverbatim +*> CQRT05 tests CTPQRT and CTPMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -65,10 +64,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt11.f b/TESTING/LIN/cqrt11.f index 92a5a3c5..32a6dd2a 100644 --- a/TESTING/LIN/cqrt11.f +++ b/TESTING/LIN/cqrt11.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CQRT11( M, K, A, LDA, TAU, WORK, LWORK ) * @@ -17,11 +17,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT11 computes the test ratio *> @@ -35,11 +35,10 @@ *> where tau(k) is stored in TAU(k) and v(k) is an m-vector of the form *> [ 0 ... 0 1 x(k) ]', where x(k) is a vector of length m-k stored *> in A(k+1:m,k). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -83,10 +82,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*M + M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt12.f b/TESTING/LIN/cqrt12.f index 3e3bb202..ad5c985b 100644 --- a/TESTING/LIN/cqrt12.f +++ b/TESTING/LIN/cqrt12.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CQRT12( M, N, A, LDA, S, WORK, LWORK, * RWORK ) @@ -19,21 +19,20 @@ * COMPLEX A( LDA, * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT12 computes the singular values `svlues' of the upper trapezoid *> of A(1:M,1:N) and returns the ratio *> *> || s - svlues||/(||svlues||*eps*max(M,N)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -81,10 +80,9 @@ *> \verbatim *> RWORK is REAL array, dimension (4*min(M,N)) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt13.f b/TESTING/LIN/cqrt13.f index 54efa725..0e37d641 100644 --- a/TESTING/LIN/cqrt13.f +++ b/TESTING/LIN/cqrt13.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT13( SCALE, M, N, A, LDA, NORMA, ISEED ) * @@ -19,19 +19,18 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT13 generates a full-rank matrix that may be scaled to have large *> or small norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -76,10 +75,9 @@ *> ISEED is integer array, dimension (4) *> Seed for random number generator *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt14.f b/TESTING/LIN/cqrt14.f index 09bca3c8..6215ee36 100644 --- a/TESTING/LIN/cqrt14.f +++ b/TESTING/LIN/cqrt14.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CQRT14( TRANS, M, N, NRHS, A, LDA, X, * LDX, WORK, LWORK ) @@ -19,11 +19,11 @@ * COMPLEX A( LDA, * ), WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT14 checks whether X is in the row space of A or A'. It does so *> by scaling both X and A such that their norms are in the range @@ -31,11 +31,10 @@ *> (if TRANS = 'C') or an LQ factorization of [A',X]' (if TRANS = 'N'), *> and returning the norm of the trailing triangle, scaled by *> MAX(M,N,NRHS)*eps. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -100,10 +99,9 @@ *> If TRANS = 'N', LWORK >= (M+NRHS)*(N+2); *> if TRANS = 'C', LWORK >= (N+NRHS)*(M+2). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt15.f b/TESTING/LIN/cqrt15.f index a925aa57..5e78f140 100644 --- a/TESTING/LIN/cqrt15.f +++ b/TESTING/LIN/cqrt15.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT15( SCALE, RKSEL, M, N, NRHS, A, LDA, B, LDB, S, * RANK, NORMA, NORMB, ISEED, WORK, LWORK ) @@ -21,19 +21,18 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT15 generates a matrix with full or deficient rank and of various *> norms. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -133,10 +132,9 @@ *> length of work space required. *> LWORK >= MAX(M+MIN(M,N),NRHS*MIN(M,N),2*N+M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt16.f b/TESTING/LIN/cqrt16.f index 871b00f3..46d72126 100644 --- a/TESTING/LIN/cqrt16.f +++ b/TESTING/LIN/cqrt16.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CQRT16( 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 *> *> CQRT16 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( max(m,n) * 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) / ( max(m,n) * norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cqrt17.f b/TESTING/LIN/cqrt17.f index cd1abf6e..ee098f7b 100644 --- a/TESTING/LIN/cqrt17.f +++ b/TESTING/LIN/cqrt17.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CQRT17( TRANS, IRESID, M, N, NRHS, A, * LDA, X, LDX, B, LDB, C, WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CQRT17 computes the ratio *> @@ -34,11 +34,10 @@ *> *> alpha = ||B|| if IRESID = 1 (zero-residual problem) *> alpha = ||R|| if IRESID = 2 (otherwise). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -134,10 +133,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= NRHS*(M+N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/crqt01.f b/TESTING/LIN/crqt01.f index 7669e58d..93657e5b 100644 --- a/TESTING/LIN/crqt01.f +++ b/TESTING/LIN/crqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CRQT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CRQT01 tests CGERQF, which computes the RQ factorization of an m-by-n *> matrix A, and partially tests CUNGRQ which forms the n-by-n *> orthogonal matrix Q. *> *> CRQT01 compares R with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/crqt02.f b/TESTING/LIN/crqt02.f index 2f520e34..988400d7 100644 --- a/TESTING/LIN/crqt02.f +++ b/TESTING/LIN/crqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CRQT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CRQT02 tests CUNGRQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> rows of A; it compares R(m-k+1:m,n-m+1:n) with *> A(m-k+1:m,1:n)*Q(n-m+1:n,1:n)', and checks that the rows of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/crqt03.f b/TESTING/LIN/crqt03.f index 3484d8ac..ad5d9287 100644 --- a/TESTING/LIN/crqt03.f +++ b/TESTING/LIN/crqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CRQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CRQT03 tests CUNMRQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> CRQT03 compares the results of a call to CUNMRQ with the results of *> forming Q explicitly by a call to CUNGRQ and then performing matrix *> multiplication by a call to CGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/crzt01.f b/TESTING/LIN/crzt01.f index f55e8ff4..814dfad1 100644 --- a/TESTING/LIN/crzt01.f +++ b/TESTING/LIN/crzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CRZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CRZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with CTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/crzt02.f b/TESTING/LIN/crzt02.f index 9d4cd5cd..6d3da4f4 100644 --- a/TESTING/LIN/crzt02.f +++ b/TESTING/LIN/crzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CRZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * COMPLEX AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CRZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by CTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> Length of WORK array. LWORK >= N*N+N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/csbmv.f b/TESTING/LIN/csbmv.f index 4e143ccc..17ab3d60 100644 --- a/TESTING/LIN/csbmv.f +++ b/TESTING/LIN/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/LIN/cspt01.f b/TESTING/LIN/cspt01.f index 41ae25ad..ce971d08 100644 --- a/TESTING/LIN/cspt01.f +++ b/TESTING/LIN/cspt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPT01( UPLO, N, A, AFAC, IPIV, C, LDC, RWORK, RESID ) * @@ -21,22 +21,21 @@ * COMPLEX A( * ), AFAC( * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPT01 reconstructs a symmetric indefinite packed matrix A from its *> diagonal pivoting factorization A = U*D*U' or A = L*D*L' and computes *> the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/cspt02.f b/TESTING/LIN/cspt02.f index 674164ea..3b010f92 100644 --- a/TESTING/LIN/cspt02.f +++ b/TESTING/LIN/cspt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPT02( UPLO, N, NRHS, A, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX A( * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPT02 computes the residual in the solution of a complex symmetric *> system of linear equations A*x = b when packed storage is used for @@ -34,11 +34,10 @@ *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS). *> *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -107,10 +106,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/LIN/cspt03.f b/TESTING/LIN/cspt03.f index bd3d727e..de7ac37a 100644 --- a/TESTING/LIN/cspt03.f +++ b/TESTING/LIN/cspt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPT03( UPLO, N, A, AINV, WORK, LDW, RWORK, RCOND, * RESID ) @@ -21,21 +21,20 @@ * COMPLEX A( * ), AINV( * ), WORK( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPT03 computes the residual for a complex symmetric packed matrix *> times its inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is REAL *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/csyt01.f b/TESTING/LIN/csyt01.f index f5d314a9..840642c1 100644 --- a/TESTING/LIN/csyt01.f +++ b/TESTING/LIN/csyt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYT01( UPLO, N, A, LDA, AFAC, LDAFAC, IPIV, C, LDC, * RWORK, RESID ) @@ -22,22 +22,21 @@ * COMPLEX A( LDA, * ), AFAC( LDAFAC, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYT01 reconstructs a complex symmetric indefinite matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix, EPS is the machine epsilon, *> L' is the transpose of L, and U' is the transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/csyt02.f b/TESTING/LIN/csyt02.f index ca115603..cbba9e62 100644 --- a/TESTING/LIN/csyt02.f +++ b/TESTING/LIN/csyt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYT02( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYT02 computes the residual for a solution to a complex symmetric *> system of linear equations A*x = b: @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/csyt03.f b/TESTING/LIN/csyt03.f index a733d57c..44b4ee67 100644 --- a/TESTING/LIN/csyt03.f +++ b/TESTING/LIN/csyt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYT03( UPLO, N, A, LDA, AINV, LDAINV, WORK, LDWORK, * RWORK, RCOND, RESID ) @@ -22,21 +22,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYT03 computes the residual for a complex symmetric matrix times *> its inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ) *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> RESID is REAL *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctbt02.f b/TESTING/LIN/ctbt02.f index 056af1ea..6b6f9d6f 100644 --- a/TESTING/LIN/ctbt02.f +++ b/TESTING/LIN/ctbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBT02( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, X, * LDX, B, LDB, WORK, RWORK, RESID ) @@ -22,11 +22,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b, A**T *x = b, or @@ -36,11 +36,10 @@ *> the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -145,10 +144,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctbt03.f b/TESTING/LIN/ctbt03.f index f6f5ff95..72f4ed0b 100644 --- a/TESTING/LIN/ctbt03.f +++ b/TESTING/LIN/ctbt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBT03( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, * SCALE, CNORM, TSCAL, X, LDX, B, LDB, WORK, @@ -23,11 +23,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b, A**T *x = s*b, or A**H *x = s*b @@ -37,11 +37,10 @@ *> the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -160,10 +159,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctbt05.f b/TESTING/LIN/ctbt05.f index 7a3efcb8..66163564 100644 --- a/TESTING/LIN/ctbt05.f +++ b/TESTING/LIN/ctbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBT05( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -173,10 +172,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctbt06.f b/TESTING/LIN/ctbt06.f index db34b675..0dde07b6 100644 --- a/TESTING/LIN/ctbt06.f +++ b/TESTING/LIN/ctbt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBT06( RCOND, RCONDC, UPLO, DIAG, N, KD, AB, LDAB, * RWORK, RAT ) @@ -21,22 +21,21 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by CTBCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -110,10 +109,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctpt01.f b/TESTING/LIN/ctpt01.f index e32d3cb1..83498460 100644 --- a/TESTING/LIN/ctpt01.f +++ b/TESTING/LIN/ctpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPT01( UPLO, DIAG, N, AP, AINVP, RCOND, RWORK, RESID ) * @@ -20,21 +20,20 @@ * COMPLEX AINVP( * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPT01 computes the residual for a triangular matrix A times its *> inverse when A is stored in packed format: *> RESID = norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is REAL *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctpt02.f b/TESTING/LIN/ctpt02.f index 4e1d4916..6e271398 100644 --- a/TESTING/LIN/ctpt02.f +++ b/TESTING/LIN/ctpt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPT02( UPLO, TRANS, DIAG, N, NRHS, AP, X, LDX, B, LDB, * WORK, RWORK, RESID ) @@ -21,11 +21,11 @@ * COMPLEX AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b, A**T *x = b, or @@ -36,11 +36,10 @@ *> the maximum over the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -133,10 +132,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctpt03.f b/TESTING/LIN/ctpt03.f index 33fb4441..59e16b47 100644 --- a/TESTING/LIN/ctpt03.f +++ b/TESTING/LIN/ctpt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPT03( UPLO, TRANS, DIAG, N, NRHS, AP, SCALE, CNORM, * TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * COMPLEX AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b, A**T *x = s*b, or A**H *x = s*b, @@ -35,11 +35,10 @@ *> is the maximum over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -146,10 +145,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctpt05.f b/TESTING/LIN/ctpt05.f index 79d1eaa8..12fa9868 100644 --- a/TESTING/LIN/ctpt05.f +++ b/TESTING/LIN/ctpt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPT05( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,10 +158,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctpt06.f b/TESTING/LIN/ctpt06.f index 217946c5..9755d441 100644 --- a/TESTING/LIN/ctpt06.f +++ b/TESTING/LIN/ctpt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPT06( RCOND, RCONDC, UPLO, DIAG, N, AP, RWORK, RAT ) * @@ -20,22 +20,21 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of the triangular matrix A) and RCONDC, the estimate *> computed by CTPCON. Information about the triangular matrix is used *> if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -97,10 +96,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctrt01.f b/TESTING/LIN/ctrt01.f index 75950e35..7b0d50fb 100644 --- a/TESTING/LIN/ctrt01.f +++ b/TESTING/LIN/ctrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRT01( UPLO, DIAG, N, A, LDA, AINV, LDAINV, RCOND, * RWORK, RESID ) @@ -21,21 +21,20 @@ * COMPLEX A( LDA, * ), AINV( LDAINV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRT01 computes the residual for a triangular matrix A times its *> inverse: *> RESID = norm( A*AINV - I ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> RESID is REAL *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctrt02.f b/TESTING/LIN/ctrt02.f index 1e774b7f..0fe694e0 100644 --- a/TESTING/LIN/ctrt02.f +++ b/TESTING/LIN/ctrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRT02( UPLO, TRANS, DIAG, N, NRHS, A, LDA, X, LDX, B, * LDB, WORK, RWORK, RESID ) @@ -22,11 +22,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b, A**T *x = b, @@ -36,11 +36,10 @@ *> hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctrt03.f b/TESTING/LIN/ctrt03.f index a80081d4..26071370 100644 --- a/TESTING/LIN/ctrt03.f +++ b/TESTING/LIN/ctrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRT03( UPLO, TRANS, DIAG, N, NRHS, A, LDA, SCALE, * CNORM, TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -22,11 +22,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b, A**T *x = s*b, or A**H *x = s*b. @@ -36,11 +36,10 @@ *> right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctrt05.f b/TESTING/LIN/ctrt05.f index 16d0415f..1a12ed53 100644 --- a/TESTING/LIN/ctrt05.f +++ b/TESTING/LIN/ctrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRT05( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctrt06.f b/TESTING/LIN/ctrt06.f index 1bf01627..cf209786 100644 --- a/TESTING/LIN/ctrt06.f +++ b/TESTING/LIN/ctrt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRT06( RCOND, RCONDC, UPLO, DIAG, N, A, LDA, RWORK, * RAT ) @@ -21,22 +21,21 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by CTRCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -106,10 +105,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctzt01.f b/TESTING/LIN/ctzt01.f index 8ecfcad1..59f12eaf 100644 --- a/TESTING/LIN/ctzt01.f +++ b/TESTING/LIN/ctzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CTZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with CTZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ctzt02.f b/TESTING/LIN/ctzt02.f index 371a584e..b99ba131 100644 --- a/TESTING/LIN/ctzt02.f +++ b/TESTING/LIN/ctzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CTZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * COMPLEX AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by CTZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> length of WORK array. Must be >= N*N+N *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkaa.f b/TESTING/LIN/dchkaa.f index dd781f1b..567425f5 100644 --- a/TESTING/LIN/dchkaa.f +++ b/TESTING/LIN/dchkaa.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DCHKAA * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKAA is the main test program for the DOUBLE PRECISION LAPACK *> linear equation routines @@ -62,11 +62,10 @@ *> DTZ 3 List types on next line if 0 < NTYPES < 3 *> DLS 6 List types on next line if 0 < NTYPES < 6 *> DEQ -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NMAX INTEGER @@ -85,10 +84,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -99,8 +97,7 @@ * *> \ingroup double_lin * -* ===================================================================== - PROGRAM DCHKAA +* ===================================================================== PROGRAM DCHKAA * * -- LAPACK test routine (version 3.1.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/dchkab.f b/TESTING/LIN/dchkab.f index 8b5c765c..2ef8cb2a 100644 --- a/TESTING/LIN/dchkab.f +++ b/TESTING/LIN/dchkab.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DCHKAB * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKAB is the test program for the DOUBLE PRECISION LAPACK *> DSGESV/DSPOSV routine @@ -35,11 +35,10 @@ *> T Put T to test the error exits *> DGE 11 List types on next line if 0 < NTYPES < 11 *> DPO 9 List types on next line if 0 < NTYPES < 9 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NMAX INTEGER @@ -58,10 +57,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -72,8 +70,7 @@ * *> \ingroup double_lin * -* ===================================================================== - PROGRAM DCHKAB +* ===================================================================== PROGRAM DCHKAB * * -- LAPACK test routine (version 3.2.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/dchkeq.f b/TESTING/LIN/dchkeq.f index 9963c91a..6f3bab7b 100644 --- a/TESTING/LIN/dchkeq.f +++ b/TESTING/LIN/dchkeq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKEQ( THRESH, NOUT ) * @@ -15,18 +15,17 @@ * DOUBLE PRECISION THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKEQ tests DGEEQU, DGBEQU, DPOEQU, DPPEQU and DPBEQU +*> \verbatim *> -*>\endverbatim +*> DCHKEQ tests DGEEQU, DGBEQU, DPOEQU, DPPEQU and DPBEQU +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkgb.f b/TESTING/LIN/dchkgb.f index bf90ad50..b978d380 100644 --- a/TESTING/LIN/dchkgb.f +++ b/TESTING/LIN/dchkgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKGB( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, A, LA, AFAC, LAFAC, B, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKGB tests DGBTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> DCHKGB tests DGBTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -174,10 +173,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkge.f b/TESTING/LIN/dchkge.f index 27ae0af4..120a7581 100644 --- a/TESTING/LIN/dchkge.f +++ b/TESTING/LIN/dchkge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKGE( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, NMAX, A, AFAC, AINV, B, @@ -25,18 +25,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKGE tests DGETRF, -TRI, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> DCHKGE tests DGETRF, -TRI, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -168,10 +167,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkgt.f b/TESTING/LIN/dchkgt.f index 91dfbc6c..81ad71cb 100644 --- a/TESTING/LIN/dchkgt.f +++ b/TESTING/LIN/dchkgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKGT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, AF, B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -23,18 +23,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKGT tests DGTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> DCHKGT tests DGTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -130,10 +129,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchklq.f b/TESTING/LIN/dchklq.f index 5a09592a..bed63b9c 100644 --- a/TESTING/LIN/dchklq.f +++ b/TESTING/LIN/dchklq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKLQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKLQ tests DGELQF, DORGLQ and DORMLQ. +*> \verbatim *> -*>\endverbatim +*> DCHKLQ tests DGELQF, DORGLQ and DORMLQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkpb.f b/TESTING/LIN/dchkpb.f index 509d792d..78649507 100644 --- a/TESTING/LIN/dchkpb.f +++ b/TESTING/LIN/dchkpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKPB( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKPB tests DPBTRF, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> DCHKPB tests DPBTRF, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkpo.f b/TESTING/LIN/dchkpo.f index 746dc640..890b3d2f 100644 --- a/TESTING/LIN/dchkpo.f +++ b/TESTING/LIN/dchkpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKPO( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKPO tests DPOTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> DCHKPO tests DPOTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkpp.f b/TESTING/LIN/dchkpp.f index e498575f..4c891478 100644 --- a/TESTING/LIN/dchkpp.f +++ b/TESTING/LIN/dchkpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKPP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKPP tests DPPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> DCHKPP tests DPPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -146,10 +145,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkps.f b/TESTING/LIN/dchkps.f index 9b956223..1a192f06 100644 --- a/TESTING/LIN/dchkps.f +++ b/TESTING/LIN/dchkps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKPS( DOTYPE, NN, NVAL, NNB, NBVAL, NRANK, RANKVAL, * THRESH, TSTERR, NMAX, A, AFAC, PERM, PIV, WORK, @@ -24,18 +24,17 @@ * LOGICAL DOTYPE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKPS tests DPSTRF. +*> \verbatim *> -*>\endverbatim +*> DCHKPS tests DPSTRF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkpt.f b/TESTING/LIN/dchkpt.f index cf58d019..c2af2de8 100644 --- a/TESTING/LIN/dchkpt.f +++ b/TESTING/LIN/dchkpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKPT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, D, E, B, X, XACT, WORK, RWORK, NOUT ) @@ -23,18 +23,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKPT tests DPTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> DCHKPT tests DPTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -130,10 +129,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkq3.f b/TESTING/LIN/dchkq3.f index 1895f524..9998acd4 100644 --- a/TESTING/LIN/dchkq3.f +++ b/TESTING/LIN/dchkq3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKQ3( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * THRESH, A, COPYA, S, TAU, WORK, IWORK, @@ -24,18 +24,17 @@ * $ TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKQ3 tests DGEQP3. +*> \verbatim *> -*>\endverbatim +*> DCHKQ3 tests DGEQP3. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -136,10 +135,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkql.f b/TESTING/LIN/dchkql.f index d4d20277..4b3739ac 100644 --- a/TESTING/LIN/dchkql.f +++ b/TESTING/LIN/dchkql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKQL( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKQL tests DGEQLF, DORGQL and DORMQL. +*> \verbatim *> -*>\endverbatim +*> DCHKQL tests DGEQLF, DORGQL and DORMQL. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkqp.f b/TESTING/LIN/dchkqp.f index e4520422..646ae62c 100644 --- a/TESTING/LIN/dchkqp.f +++ b/TESTING/LIN/dchkqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKQP( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, IWORK, NOUT ) @@ -23,18 +23,17 @@ * $ TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKQP tests DGEQPF. +*> \verbatim *> -*>\endverbatim +*> DCHKQP tests DGEQPF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -121,10 +120,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkqr.f b/TESTING/LIN/dchkqr.f index 1b709b5b..88d07f02 100644 --- a/TESTING/LIN/dchkqr.f +++ b/TESTING/LIN/dchkqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKQR( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKQR tests DGEQRF, DORGQR and DORMQR. +*> \verbatim *> -*>\endverbatim +*> DCHKQR tests DGEQRF, DORGQR and DORMQR. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchkrfp.f b/TESTING/LIN/dchkrfp.f index 2aa394ba..78accfa9 100644 --- a/TESTING/LIN/dchkrfp.f +++ b/TESTING/LIN/dchkrfp.f @@ -5,25 +5,24 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DCHKRFP * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCHKRFP is the main test program for the DOUBLE PRECISION linear *> equation routines with RFP storage format *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> MAXIN INTEGER @@ -44,10 +43,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -58,8 +56,7 @@ * *> \ingroup double_lin * -* ===================================================================== - PROGRAM DCHKRFP +* ===================================================================== PROGRAM DCHKRFP * * -- LAPACK test routine (version 3.2.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/dchkrq.f b/TESTING/LIN/dchkrq.f index 4f8729af..67b4a89c 100644 --- a/TESTING/LIN/dchkrq.f +++ b/TESTING/LIN/dchkrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKRQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKRQ tests DGERQF, DORGRQ and DORMRQ. +*> \verbatim *> -*>\endverbatim +*> DCHKRQ tests DGERQF, DORGRQ and DORMRQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchksp.f b/TESTING/LIN/dchksp.f index c56153f3..8b4e4a5b 100644 --- a/TESTING/LIN/dchksp.f +++ b/TESTING/LIN/dchksp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKSP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKSP tests DSPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> DCHKSP tests DSPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -146,10 +145,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchksy.f b/TESTING/LIN/dchksy.f index 62cc07c7..6699c5eb 100644 --- a/TESTING/LIN/dchksy.f +++ b/TESTING/LIN/dchksy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKSY( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKSY tests DSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> DCHKSY tests DSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchktb.f b/TESTING/LIN/dchktb.f index 0d1f5f88..d107323b 100644 --- a/TESTING/LIN/dchktb.f +++ b/TESTING/LIN/dchktb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKTB( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AB, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKTB tests DTBTRS, -RFS, and -CON, and DLATBS. +*> \verbatim *> -*>\endverbatim +*> DCHKTB tests DTBTRS, -RFS, and -CON, and DLATBS. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -138,10 +137,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchktp.f b/TESTING/LIN/dchktp.f index ded8b6a1..eefd6b64 100644 --- a/TESTING/LIN/dchktp.f +++ b/TESTING/LIN/dchktp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKTP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AP, AINVP, B, X, XACT, WORK, RWORK, @@ -24,18 +24,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKTP tests DTPTRI, -TRS, -RFS, and -CON, and DLATPS +*> \verbatim *> -*>\endverbatim +*> DCHKTP tests DTPTRI, -TRS, -RFS, and -CON, and DLATPS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchktr.f b/TESTING/LIN/dchktr.f index 9b648e7b..95bebcc3 100644 --- a/TESTING/LIN/dchktr.f +++ b/TESTING/LIN/dchktr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKTR( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AINV, B, X, XACT, @@ -24,18 +24,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKTR tests DTRTRI, -TRS, -RFS, and -CON, and DLATRS +*> \verbatim *> -*>\endverbatim +*> DCHKTR tests DTRTRI, -TRS, -RFS, and -CON, and DLATRS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dchktz.f b/TESTING/LIN/dchktz.f index ffef2589..6d438558 100644 --- a/TESTING/LIN/dchktz.f +++ b/TESTING/LIN/dchktz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCHKTZ( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, NOUT ) @@ -23,18 +23,17 @@ * $ TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCHKTZ tests DTZRQF and STZRZF. +*> \verbatim *> -*>\endverbatim +*> DCHKTZ tests DTZRQF and STZRZF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -116,10 +115,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvab.f b/TESTING/LIN/ddrvab.f index 5c425084..4be4b43b 100644 --- a/TESTING/LIN/ddrvab.f +++ b/TESTING/LIN/ddrvab.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVAB( DOTYPE, NM, MVAL, NNS, * NSVAL, THRESH, NMAX, A, AFAC, B, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVAB tests DSGESV +*> \verbatim *> -*>\endverbatim +*> DDRVAB tests DSGESV +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -134,10 +133,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvac.f b/TESTING/LIN/ddrvac.f index 952b84ff..1b5a956f 100644 --- a/TESTING/LIN/ddrvac.f +++ b/TESTING/LIN/ddrvac.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVAC( DOTYPE, NM, MVAL, NNS, NSVAL, THRESH, NMAX, * A, AFAC, B, X, WORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVAC tests DSPOSV. +*> \verbatim *> -*>\endverbatim +*> DDRVAC tests DSPOSV. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -127,10 +126,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvgb.f b/TESTING/LIN/ddrvgb.f index e6d49c46..3cb97b30 100644 --- a/TESTING/LIN/ddrvgb.f +++ b/TESTING/LIN/ddrvgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVGB tests the driver routines DGBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVGB tests the driver routines DGBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvgbx.f b/TESTING/LIN/ddrvgbx.f index f0699535..3ee51071 100644 --- a/TESTING/LIN/ddrvgbx.f +++ b/TESTING/LIN/ddrvgbx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVGB tests the driver routines DGBSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise ddrvgb.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -158,10 +157,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvge.f b/TESTING/LIN/ddrvge.f index b4b648cc..15048c0b 100644 --- a/TESTING/LIN/ddrvge.f +++ b/TESTING/LIN/ddrvge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVGE tests the driver routines DGESV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVGE tests the driver routines DGESV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvgex.f b/TESTING/LIN/ddrvgex.f index 4eb3c1db..abd15e44 100644 --- a/TESTING/LIN/ddrvgex.f +++ b/TESTING/LIN/ddrvgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVGE tests the driver routines DGESV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise ddrvge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvgt.f b/TESTING/LIN/ddrvgt.f index 4820cb6d..f47d3dea 100644 --- a/TESTING/LIN/ddrvgt.f +++ b/TESTING/LIN/ddrvgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVGT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, AF, * B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -23,18 +23,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVGT tests DGTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVGT tests DGTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -123,10 +122,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvls.f b/TESTING/LIN/ddrvls.f index 99cb26de..607c4521 100644 --- a/TESTING/LIN/ddrvls.f +++ b/TESTING/LIN/ddrvls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVLS( DOTYPE, NM, MVAL, NN, NVAL, NNS, NSVAL, NNB, * NBVAL, NXVAL, THRESH, TSTERR, A, COPYA, B, @@ -25,19 +25,18 @@ * $ COPYS( * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVLS tests the least squares driver routines DGELS, DGELSS, DGELSX, *> DGELSY and DGELSD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -186,10 +185,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvpb.f b/TESTING/LIN/ddrvpb.f index 01676fb4..b7758289 100644 --- a/TESTING/LIN/ddrvpb.f +++ b/TESTING/LIN/ddrvpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVPB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVPB tests the driver routines DPBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVPB tests the driver routines DPBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvpo.f b/TESTING/LIN/ddrvpo.f index 314571e7..3ee7a4d9 100644 --- a/TESTING/LIN/ddrvpo.f +++ b/TESTING/LIN/ddrvpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVPO tests the driver routines DPOSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVPO tests the driver routines DPOSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvpox.f b/TESTING/LIN/ddrvpox.f index 5a0d4f2e..316e27e8 100644 --- a/TESTING/LIN/ddrvpox.f +++ b/TESTING/LIN/ddrvpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVPO tests the driver routines DPOSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise ddrvpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvpp.f b/TESTING/LIN/ddrvpp.f index 94cba42e..ee553f9b 100644 --- a/TESTING/LIN/ddrvpp.f +++ b/TESTING/LIN/ddrvpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVPP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVPP tests the driver routines DPPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVPP tests the driver routines DPPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvpt.f b/TESTING/LIN/ddrvpt.f index cbc38517..b0e44571 100644 --- a/TESTING/LIN/ddrvpt.f +++ b/TESTING/LIN/ddrvpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, D, * E, B, X, XACT, WORK, RWORK, NOUT ) @@ -23,18 +23,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVPT tests DPTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVPT tests DPTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -124,10 +123,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvrf1.f b/TESTING/LIN/ddrvrf1.f index a393a555..238317cb 100644 --- a/TESTING/LIN/ddrvrf1.f +++ b/TESTING/LIN/ddrvrf1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVRF1( NOUT, NN, NVAL, THRESH, A, LDA, ARF, WORK ) * @@ -19,19 +19,18 @@ * DOUBLE PRECISION A( LDA, * ), ARF( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVRF1 tests the LAPACK RFP routines: *> DLANSF -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -79,10 +78,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvrf2.f b/TESTING/LIN/ddrvrf2.f index ecdf27bd..6e86b608 100644 --- a/TESTING/LIN/ddrvrf2.f +++ b/TESTING/LIN/ddrvrf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVRF2( NOUT, NN, NVAL, A, LDA, ARF, AP, ASAV ) * @@ -18,18 +18,17 @@ * DOUBLE PRECISION A( LDA, * ), ARF( * ), AP(*), ASAV( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVRF2 tests the LAPACK RFP convertion routines. +*> \verbatim *> -*>\endverbatim +*> DDRVRF2 tests the LAPACK RFP convertion routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -74,10 +73,9 @@ *> \verbatim *> ASAV is DOUBLE PRECISION array, dimension (LDA,NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvrf3.f b/TESTING/LIN/ddrvrf3.f index e9cf1719..97a2cd07 100644 --- a/TESTING/LIN/ddrvrf3.f +++ b/TESTING/LIN/ddrvrf3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVRF3( NOUT, NN, NVAL, THRESH, A, LDA, ARF, B1, B2, * + D_WORK_DLANGE, D_WORK_DGEQRF, TAU ) @@ -22,19 +22,18 @@ * + D_WORK_DLANGE( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVRF3 tests the LAPACK RFP routines: *> DTFSM -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -102,10 +101,9 @@ *> \verbatim *> TAU is DOUBLE PRECISION array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvrf4.f b/TESTING/LIN/ddrvrf4.f index 0a409c68..b4166729 100644 --- a/TESTING/LIN/ddrvrf4.f +++ b/TESTING/LIN/ddrvrf4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVRF4( NOUT, NN, NVAL, THRESH, C1, C2, LDC, CRF, A, * + LDA, D_WORK_DLANGE ) @@ -21,19 +21,18 @@ * + CRF( * ), D_WORK_DLANGE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVRF4 tests the LAPACK RFP routines: *> DSFRK -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -102,10 +101,9 @@ *> \verbatim *> D_WORK_DLANGE is DOUBLE PRECISION array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvrfp.f b/TESTING/LIN/ddrvrfp.f index 665209ef..7f83d92b 100644 --- a/TESTING/LIN/ddrvrfp.f +++ b/TESTING/LIN/ddrvrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVRFP( NOUT, NN, NVAL, NNS, NSVAL, NNT, NTVAL, * + THRESH, A, ASAV, AFAC, AINV, B, @@ -40,11 +40,11 @@ * DOUBLE PRECISION D_WORK_DPOT03( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVRFP tests the LAPACK RFP routines: *> DPFTRF, DPFTRS, and DPFTRI. @@ -78,11 +78,10 @@ *> norm( . ) the 1-norm for (1,2,3) and the inf-norm for (4). *> Errors occur when INFO parameter is not as expected. Failures occur when *> a test ratios is greater than THRES. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -223,10 +222,9 @@ *> \verbatim *> D_WORK_DPOT03 is DOUBLE PRECISION array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvsp.f b/TESTING/LIN/ddrvsp.f index 7df5446e..7a942d8f 100644 --- a/TESTING/LIN/ddrvsp.f +++ b/TESTING/LIN/ddrvsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVSP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVSP tests the driver routines DSPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVSP tests the driver routines DSPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -139,10 +138,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvsy.f b/TESTING/LIN/ddrvsy.f index a1a78fea..5791dacf 100644 --- a/TESTING/LIN/ddrvsy.f +++ b/TESTING/LIN/ddrvsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DDRVSY tests the driver routines DSYSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> DDRVSY tests the driver routines DSYSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -136,10 +135,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ddrvsyx.f b/TESTING/LIN/ddrvsyx.f index 7dca8149..8a656939 100644 --- a/TESTING/LIN/ddrvsyx.f +++ b/TESTING/LIN/ddrvsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,21 +24,20 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDRVSY tests the driver routines DSYSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise ddrvsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -139,10 +138,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/debchvxx.f b/TESTING/LIN/debchvxx.f index 69bf58c7..6e954b8d 100644 --- a/TESTING/LIN/debchvxx.f +++ b/TESTING/LIN/debchvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DEBCHVXX( THRESH, PATH ) * @@ -15,11 +15,12 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> DEBCHVXX will run D**SVXX on a series of Hilbert matrices and then *> compare the error bounds returned by D**SVXX to see if the returned *> answer indeed falls within those bounds. @@ -79,10 +80,9 @@ *> type used plus one, which is 24 for single precision. *> NMAX should be 6 for single and 11 for double. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/derrab.f b/TESTING/LIN/derrab.f index 9584d623..3edf4027 100644 --- a/TESTING/LIN/derrab.f +++ b/TESTING/LIN/derrab.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRAB( NUNIT ) * @@ -14,28 +14,26 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DERRAB tests the error exits for DSGESV. +*> \verbatim *> -*>\endverbatim +*> DERRAB tests the error exits for DSGESV. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/derrac.f b/TESTING/LIN/derrac.f index 745c8929..17b4ea65 100644 --- a/TESTING/LIN/derrac.f +++ b/TESTING/LIN/derrac.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRAC( NUNIT ) * @@ -14,28 +14,26 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DERRAC tests the error exits for DSPOSV. +*> \verbatim *> -*>\endverbatim +*> DERRAC tests the error exits for DSPOSV. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/derrge.f b/TESTING/LIN/derrge.f index 1059939f..3dff4cc3 100644 --- a/TESTING/LIN/derrge.f +++ b/TESTING/LIN/derrge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRGE( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRGE tests the error exits for the DOUBLE PRECISION routines *> for general matrices. -*> -*>\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/LIN/derrgex.f b/TESTING/LIN/derrgex.f index 0cf9bacf..4bbb8d0a 100644 --- a/TESTING/LIN/derrgex.f +++ b/TESTING/LIN/derrgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRGE( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRGE tests the error exits for the DOUBLE PRECISION routines *> for general matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise derrge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/derrgt.f b/TESTING/LIN/derrgt.f index 4931f6c5..6edde156 100644 --- a/TESTING/LIN/derrgt.f +++ b/TESTING/LIN/derrgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRGT( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRGT tests the error exits for the DOUBLE PRECISION tridiagonal *> routines. -*> -*>\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/LIN/derrlq.f b/TESTING/LIN/derrlq.f index 2bba18ff..f3d138d9 100644 --- a/TESTING/LIN/derrlq.f +++ b/TESTING/LIN/derrlq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRLQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRLQ tests the error exits for the DOUBLE PRECISION routines *> that use the LQ decomposition of a general matrix. -*> -*>\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/LIN/derrls.f b/TESTING/LIN/derrls.f index 72395788..21306a67 100644 --- a/TESTING/LIN/derrls.f +++ b/TESTING/LIN/derrls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRLS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRLS tests the error exits for the DOUBLE PRECISION least squares *> driver routines (DGELS, SGELSS, SGELSX, SGELSY, SGELSD). -*> -*>\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/LIN/derrpo.f b/TESTING/LIN/derrpo.f index a8eddaf7..30ff5ef6 100644 --- a/TESTING/LIN/derrpo.f +++ b/TESTING/LIN/derrpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRPO( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRPO tests the error exits for the DOUBLE PRECISION routines *> for symmetric positive definite matrices. -*> -*>\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/LIN/derrpox.f b/TESTING/LIN/derrpox.f index f7112687..a679f887 100644 --- a/TESTING/LIN/derrpox.f +++ b/TESTING/LIN/derrpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRPO( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRPO tests the error exits for the DOUBLE PRECISION routines *> for symmetric positive definite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise derrpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/derrps.f b/TESTING/LIN/derrps.f index 7ab3177f..598bd909 100644 --- a/TESTING/LIN/derrps.f +++ b/TESTING/LIN/derrps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRPS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRPS tests the error exits for the DOUBLE PRECISION routines *> for DPSTRF. -*> -*>\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/LIN/derrql.f b/TESTING/LIN/derrql.f index d53520fd..27d09726 100644 --- a/TESTING/LIN/derrql.f +++ b/TESTING/LIN/derrql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRQL( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRQL tests the error exits for the DOUBLE PRECISION routines *> that use the QL decomposition of a general matrix. -*> -*>\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/LIN/derrqp.f b/TESTING/LIN/derrqp.f index 853171ee..ef1e7813 100644 --- a/TESTING/LIN/derrqp.f +++ b/TESTING/LIN/derrqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRQP( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DERRQP tests the error exits for DGEQPF and DGEQP3. +*> \verbatim *> -*>\endverbatim +*> DERRQP tests the error exits for DGEQPF and DGEQP3. +*> \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/LIN/derrqr.f b/TESTING/LIN/derrqr.f index 21ab5e1f..8057c1cb 100644 --- a/TESTING/LIN/derrqr.f +++ b/TESTING/LIN/derrqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRQR( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRQR tests the error exits for the DOUBLE PRECISION routines *> that use the QR decomposition of a general matrix. -*> -*>\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/LIN/derrrfp.f b/TESTING/LIN/derrrfp.f index 91ca81f5..6d9d3494 100644 --- a/TESTING/LIN/derrrfp.f +++ b/TESTING/LIN/derrrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRRFP( NUNIT ) * @@ -14,11 +14,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRRFP tests the error exits for the DOUBLE PRECISION driver routines *> for solving linear systems of equations. @@ -26,21 +26,19 @@ *> DDRVRFP tests the DOUBLE PRECISION LAPACK RFP routines: *> DTFSM, DTFTRI, DSFRK, DTFTTP, DTFTTR, DPFTRF, DPFTRS, DTPTTF, *> DTPTTR, DTRTTF, and DTRTTP -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/derrrq.f b/TESTING/LIN/derrrq.f index 3033f3b3..19ceb482 100644 --- a/TESTING/LIN/derrrq.f +++ b/TESTING/LIN/derrrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRRQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRRQ tests the error exits for the DOUBLE PRECISION routines *> that use the RQ decomposition of a general matrix. -*> -*>\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/LIN/derrsy.f b/TESTING/LIN/derrsy.f index 62ae4c2a..cb854a37 100644 --- a/TESTING/LIN/derrsy.f +++ b/TESTING/LIN/derrsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRSY( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRSY tests the error exits for the DOUBLE PRECISION routines *> for symmetric indefinite matrices. -*> -*>\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/LIN/derrsyx.f b/TESTING/LIN/derrsyx.f index 47750888..4e2f07f4 100644 --- a/TESTING/LIN/derrsyx.f +++ b/TESTING/LIN/derrsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRSY( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRSY tests the error exits for the DOUBLE PRECISION routines *> for symmetric indefinite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise derrsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/derrtr.f b/TESTING/LIN/derrtr.f index 9da8bd89..bb6b4fa3 100644 --- a/TESTING/LIN/derrtr.f +++ b/TESTING/LIN/derrtr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRTR( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRTR tests the error exits for the DOUBLE PRECISION triangular *> routines. -*> -*>\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/LIN/derrtz.f b/TESTING/LIN/derrtz.f index e426ed9a..c7d34e17 100644 --- a/TESTING/LIN/derrtz.f +++ b/TESTING/LIN/derrtz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRTZ( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DERRTZ tests the error exits for DTZRQF and STZRZF. +*> \verbatim *> -*>\endverbatim +*> DERRTZ tests the error exits for DTZRQF and STZRZF. +*> \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/LIN/derrvx.f b/TESTING/LIN/derrvx.f index 163c0cdb..dfa5525c 100644 --- a/TESTING/LIN/derrvx.f +++ b/TESTING/LIN/derrvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRVX tests the error exits for the DOUBLE PRECISION driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/derrvxx.f b/TESTING/LIN/derrvxx.f index 75680d1e..90f3f1e4 100644 --- a/TESTING/LIN/derrvxx.f +++ b/TESTING/LIN/derrvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DERRVX tests the error exits for the DOUBLE PRECISION driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/dgbt01.f b/TESTING/LIN/dgbt01.f index 0fc7a151..aaf0b80c 100644 --- a/TESTING/LIN/dgbt01.f +++ b/TESTING/LIN/dgbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBT01( M, N, KL, KU, A, LDA, AFAC, LDAFAC, IPIV, WORK, * RESID ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( LDA, * ), AFAC( LDAFAC, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBT01 reconstructs a band matrix A from its L*U factorization and *> computes the residual: @@ -33,11 +33,10 @@ *> *> The expression L*U - A is computed one column at a time, so A and *> AFAC are not modified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESID is DOUBLE PRECISION *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dgbt02.f b/TESTING/LIN/dgbt02.f index 819ea0e6..2f4ac73a 100644 --- a/TESTING/LIN/dgbt02.f +++ b/TESTING/LIN/dgbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBT02( TRANS, M, N, KL, KU, NRHS, A, LDA, X, LDX, B, * LDB, RESID ) @@ -20,21 +20,20 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBT02 computes the residual for a solution of a banded system of *> equations A*x = b or A'*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS). *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -123,10 +122,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/LIN/dgbt05.f b/TESTING/LIN/dgbt05.f index a8f134e2..eec17a67 100644 --- a/TESTING/LIN/dgbt05.f +++ b/TESTING/LIN/dgbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBT05( TRANS, N, KL, KU, NRHS, AB, LDAB, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -160,10 +159,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dgelqs.f b/TESTING/LIN/dgelqs.f index 34a60b5f..17b8263d 100644 --- a/TESTING/LIN/dgelqs.f +++ b/TESTING/LIN/dgelqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the LQ factorization *> A = L*Q *> computed by DGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/dgennd.f b/TESTING/LIN/dgennd.f index be290990..445d279a 100644 --- a/TESTING/LIN/dgennd.f +++ b/TESTING/LIN/dgennd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION DGENND (M, N, A, LDA) * @@ -17,18 +17,17 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DGENND tests that its argument has a non-negative diagonal. +*> \verbatim *> -*>\endverbatim +*> DGENND tests that its argument has a non-negative diagonal. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -53,10 +52,9 @@ *> LDA is INTEGER *> Leading dimension of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dgeqls.f b/TESTING/LIN/dgeqls.f index be07f98b..16c8eeec 100644 --- a/TESTING/LIN/dgeqls.f +++ b/TESTING/LIN/dgeqls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQLS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QL factorization *> A = Q*L *> computed by DGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/dgeqrs.f b/TESTING/LIN/dgeqrs.f index e313753e..cafd5759 100644 --- a/TESTING/LIN/dgeqrs.f +++ b/TESTING/LIN/dgeqrs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQRS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QR factorization *> A = Q*R *> computed by DGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/dgerqs.f b/TESTING/LIN/dgerqs.f index ecc6e738..e58dabfe 100644 --- a/TESTING/LIN/dgerqs.f +++ b/TESTING/LIN/dgerqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGERQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the RQ factorization *> A = R*Q *> computed by DGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/dget01.f b/TESTING/LIN/dget01.f index cde04a31..d908bf36 100644 --- a/TESTING/LIN/dget01.f +++ b/TESTING/LIN/dget01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET01( M, N, A, LDA, AFAC, LDAFAC, IPIV, RWORK, * RESID ) @@ -20,21 +20,20 @@ * DOUBLE PRECISION A( LDA, * ), AFAC( LDAFAC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET01 reconstructs a matrix A from its L*U factorization and *> computes the residual *> norm(L*U - A) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -91,10 +90,9 @@ *> RESID is DOUBLE PRECISION *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dget02.f b/TESTING/LIN/dget02.f index 21fb6728..52c7b68d 100644 --- a/TESTING/LIN/dget02.f +++ b/TESTING/LIN/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/LIN/dget03.f b/TESTING/LIN/dget03.f index fc8fbaf6..ea864b22 100644 --- a/TESTING/LIN/dget03.f +++ b/TESTING/LIN/dget03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET03( N, A, LDA, AINV, LDAINV, WORK, LDWORK, RWORK, * RCOND, RESID ) @@ -20,20 +20,19 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET03 computes the residual for a general matrix times its inverse: *> norm( I - AINV*A ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - AINV*A) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dget04.f b/TESTING/LIN/dget04.f index c65d1455..0f5ca18c 100644 --- a/TESTING/LIN/dget04.f +++ b/TESTING/LIN/dget04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET04( N, NRHS, X, LDX, XACT, LDXACT, RCOND, RESID ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET04 computes the difference between a computed solution and the *> true solution to a system of linear equations. @@ -30,11 +30,10 @@ *> RESID = ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ), *> where RCOND is the reciprocal of the condition number and EPS is the *> machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> The maximum over the NRHS solution vectors of *> ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dget06.f b/TESTING/LIN/dget06.f index e4d98330..b638f2a7 100644 --- a/TESTING/LIN/dget06.f +++ b/TESTING/LIN/dget06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DGET06( RCOND, RCONDC ) * @@ -14,18 +14,17 @@ * DOUBLE PRECISION RCOND, RCONDC * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DGET06 computes a test ratio to compare two values for RCOND. +*> \verbatim *> -*>\endverbatim +*> DGET06 computes a test ratio to compare two values for RCOND. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -40,10 +39,9 @@ *> The reciprocal of the condition number of A, computed as *> ( 1/norm(A) ) / norm(inv(A)). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dget07.f b/TESTING/LIN/dget07.f index ccbad30c..382c39c3 100644 --- a/TESTING/LIN/dget07.f +++ b/TESTING/LIN/dget07.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET07( TRANS, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, CHKFERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGET07 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dget08.f b/TESTING/LIN/dget08.f index 7cd83030..bdfec6c2 100644 --- a/TESTING/LIN/dget08.f +++ b/TESTING/LIN/dget08.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGET08( 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 *> *> DGET08 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X,inf) / ( norm(A,inf) * norm(X,inf) * 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/LIN/dgtt01.f b/TESTING/LIN/dgtt01.f index 6fc036c0..928c0901 100644 --- a/TESTING/LIN/dgtt01.f +++ b/TESTING/LIN/dgtt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTT01( N, DL, D, DU, DLF, DF, DUF, DU2, IPIV, WORK, * LDWORK, RWORK, RESID ) @@ -22,21 +22,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTT01 reconstructs a tridiagonal matrix A from its LU factorization *> and computes the residual *> norm(L*U - A) / ( norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> RESID is DOUBLE PRECISION *> The scaled residual: norm(L*U - A) / (norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dgtt02.f b/TESTING/LIN/dgtt02.f index 7a62fe6e..99633b01 100644 --- a/TESTING/LIN/dgtt02.f +++ b/TESTING/LIN/dgtt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTT02( TRANS, N, NRHS, DL, D, DU, X, LDX, B, LDB, * RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTT02 computes the residual for the solution to a tridiagonal *> system of equations: *> RESID = norm(B - op(A)*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -108,10 +107,9 @@ *> RESID is DOUBLE PRECISION *> norm(B - op(A)*X) / (norm(A) * norm(X) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dgtt05.f b/TESTING/LIN/dgtt05.f index 453999c4..46fd8a66 100644 --- a/TESTING/LIN/dgtt05.f +++ b/TESTING/LIN/dgtt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTT05( TRANS, N, NRHS, DL, D, DU, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlahilb.f b/TESTING/LIN/dlahilb.f index a4922e8a..b965b831 100644 --- a/TESTING/LIN/dlahilb.f +++ b/TESTING/LIN/dlahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * @@ -16,11 +16,11 @@ * DOUBLE PRECISION A(LDA, N), X(LDX, NRHS), B(LDB, NRHS), WORK(N) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -40,11 +40,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> be not exact. *> < 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/LIN/dlaord.f b/TESTING/LIN/dlaord.f index a05057f1..729d37d3 100644 --- a/TESTING/LIN/dlaord.f +++ b/TESTING/LIN/dlaord.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAORD( JOB, N, X, INCX ) * @@ -18,19 +18,18 @@ * DOUBLE PRECISION X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAORD sorts the elements of a vector x in increasing or decreasing *> order. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -58,10 +57,9 @@ *> INCX is INTEGER *> The spacing between successive elements of X. INCX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlaptm.f b/TESTING/LIN/dlaptm.f index dc40b5f4..92fbe8cb 100644 --- a/TESTING/LIN/dlaptm.f +++ b/TESTING/LIN/dlaptm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAPTM( N, NRHS, ALPHA, D, E, X, LDX, BETA, B, LDB ) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAPTM multiplies an N by NRHS matrix X by a symmetric tridiagonal *> matrix A and stores the result in a matrix B. The operation has the @@ -31,11 +31,10 @@ *> B := alpha * A * X + beta * B *> *> where alpha may be either 1. or -1. and beta may be 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -101,10 +100,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(N,1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlarhs.f b/TESTING/LIN/dlarhs.f index e8800f4a..88764996 100644 --- a/TESTING/LIN/dlarhs.f +++ b/TESTING/LIN/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/LIN/dlatb4.f b/TESTING/LIN/dlatb4.f index c7ba8eba..5fa23693 100644 --- a/TESTING/LIN/dlatb4.f +++ b/TESTING/LIN/dlatb4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATB4( PATH, IMAT, M, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * DOUBLE PRECISION ANORM, CNDNUM * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATB4 sets parameters for the matrix generator based on the type of *> matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -104,10 +103,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/LIN/dlatb5.f b/TESTING/LIN/dlatb5.f index eafdb415..29b47a4b 100644 --- a/TESTING/LIN/dlatb5.f +++ b/TESTING/LIN/dlatb5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATB5( PATH, IMAT, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATB5 sets parameters for the matrix generator based on the type *> of matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -98,10 +97,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/LIN/dlattb.f b/TESTING/LIN/dlattb.f index 61c77bc0..a567d279 100644 --- a/TESTING/LIN/dlattb.f +++ b/TESTING/LIN/dlattb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATTB( IMAT, UPLO, TRANS, DIAG, ISEED, N, KD, AB, * LDAB, B, WORK, INFO ) @@ -20,20 +20,19 @@ * DOUBLE PRECISION AB( LDAB, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATTB generates a triangular test matrix in 2-dimensional storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -119,10 +118,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlattp.f b/TESTING/LIN/dlattp.f index 15cfab1b..e842ba0d 100644 --- a/TESTING/LIN/dlattp.f +++ b/TESTING/LIN/dlattp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATTP( IMAT, UPLO, TRANS, DIAG, ISEED, N, A, B, WORK, * INFO ) @@ -20,20 +20,19 @@ * DOUBLE PRECISION A( * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATTP generates a triangular test matrix in packed storage. *> IMAT and UPLO uniquely specify the properties of the test *> matrix, which is returned in the array AP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -109,10 +108,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlattr.f b/TESTING/LIN/dlattr.f index 9de42fcf..fc8c5b27 100644 --- a/TESTING/LIN/dlattr.f +++ b/TESTING/LIN/dlattr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATTR( IMAT, UPLO, TRANS, DIAG, ISEED, N, A, LDA, B, * WORK, INFO ) @@ -20,20 +20,19 @@ * DOUBLE PRECISION A( LDA, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATTR generates a triangular test matrix. *> IMAT and UPLO uniquely specify the properties of the test *> matrix, which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -117,10 +116,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlavsp.f b/TESTING/LIN/dlavsp.f index 236da3d0..126da503 100644 --- a/TESTING/LIN/dlavsp.f +++ b/TESTING/LIN/dlavsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAVSP( UPLO, TRANS, DIAG, N, NRHS, A, IPIV, B, LDB, * INFO ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAVSP performs one of the matrix-vector operations *> x := A*x or x := A'*x, @@ -34,11 +34,10 @@ *> If TRANS = 'N', multiplies by U or U * D (or L or L * D) *> If TRANS = 'T', multiplies by U' or D * U' (or L' or D * L' ) *> If TRANS = 'C', multiplies by U' or D * U' (or L' or D * L' ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlavsy.f b/TESTING/LIN/dlavsy.f index bda8a61e..f574acd7 100644 --- a/TESTING/LIN/dlavsy.f +++ b/TESTING/LIN/dlavsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAVSY( UPLO, TRANS, DIAG, N, NRHS, A, LDA, IPIV, B, * LDB, INFO ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAVSY performs one of the matrix-vector operations *> x := A*x or x := A'*x, @@ -34,11 +34,10 @@ *> If TRANS = 'N', multiplies by U or U * D (or L or L * D) *> If TRANS = 'T', multiplies by U' or D * U' (or L' or D * L') *> If TRANS = 'C', multiplies by U' or D * U' (or L' or D * L') -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dlqt01.f b/TESTING/LIN/dlqt01.f index 16c81780..62f68e0d 100644 --- a/TESTING/LIN/dlqt01.f +++ b/TESTING/LIN/dlqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLQT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLQT01 tests DGELQF, which computes the LQ factorization of an m-by-n *> matrix A, and partially tests DORGLQ which forms the n-by-n *> orthogonal matrix Q. *> *> DLQT01 compares L with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/dlqt02.f b/TESTING/LIN/dlqt02.f index 827fa6a8..2e08c3df 100644 --- a/TESTING/LIN/dlqt02.f +++ b/TESTING/LIN/dlqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLQT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLQT02 tests DORGLQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> rows of A; it compares L(1:k,1:m) with A(1:k,1:n)*Q(1:m,1:n)', and *> checks that the rows of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/dlqt03.f b/TESTING/LIN/dlqt03.f index dc3d6517..9f9a2efd 100644 --- a/TESTING/LIN/dlqt03.f +++ b/TESTING/LIN/dlqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLQT03 tests DORMLQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> DLQT03 compares the results of a call to DORMLQ with the results of *> forming Q explicitly by a call to DORGLQ and then performing matrix *> multiplication by a call to DGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpbt01.f b/TESTING/LIN/dpbt01.f index 34a846f1..e0109d1c 100644 --- a/TESTING/LIN/dpbt01.f +++ b/TESTING/LIN/dpbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBT01( UPLO, N, KD, A, LDA, AFAC, LDAFAC, RWORK, * RESID ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( LDA, * ), AFAC( LDAFAC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBT01 reconstructs a symmetric positive definite band matrix A from *> its L*L' or U'*U factorization and computes the residual @@ -32,11 +32,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of *> L, and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpbt02.f b/TESTING/LIN/dpbt02.f index 8bac818a..f14ad80e 100644 --- a/TESTING/LIN/dpbt02.f +++ b/TESTING/LIN/dpbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBT02( UPLO, N, KD, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBT02 computes the residual for a solution of a symmetric banded *> system of equations A*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS) *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,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/LIN/dpbt05.f b/TESTING/LIN/dpbt05.f index ba53b142..b90decdf 100644 --- a/TESTING/LIN/dpbt05.f +++ b/TESTING/LIN/dpbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBT05( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpot01.f b/TESTING/LIN/dpot01.f index a44f2a22..4175106e 100644 --- a/TESTING/LIN/dpot01.f +++ b/TESTING/LIN/dpot01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOT01( UPLO, N, A, LDA, AFAC, LDAFAC, RWORK, RESID ) * @@ -19,22 +19,21 @@ * DOUBLE PRECISION A( LDA, * ), AFAC( LDAFAC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOT01 reconstructs a symmetric positive definite matrix A from *> its L*L' or U'*U factorization and computes the residual *> norm( L*L' - A ) / ( N * norm(A) * EPS ) or *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpot02.f b/TESTING/LIN/dpot02.f index 638e4ec0..065bb4f4 100644 --- a/TESTING/LIN/dpot02.f +++ b/TESTING/LIN/dpot02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOT02( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOT02 computes the residual for the solution of a symmetric system *> of linear equations A*x = b: @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/dpot03.f b/TESTING/LIN/dpot03.f index 1024066e..77ff85d8 100644 --- a/TESTING/LIN/dpot03.f +++ b/TESTING/LIN/dpot03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOT03( UPLO, N, A, LDA, AINV, LDAINV, WORK, LDWORK, * RWORK, RCOND, RESID ) @@ -21,21 +21,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOT03 computes the residual for a symmetric matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpot05.f b/TESTING/LIN/dpot05.f index 7b8e4f94..01d43759 100644 --- a/TESTING/LIN/dpot05.f +++ b/TESTING/LIN/dpot05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOT05( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -148,10 +147,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpot06.f b/TESTING/LIN/dpot06.f index 1741912f..d1ff7a20 100644 --- a/TESTING/LIN/dpot06.f +++ b/TESTING/LIN/dpot06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOT06( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOT06 computes the residual for a solution of a system of linear *> equations A*x = b : *> RESID = norm(B - A*X,inf) / ( norm(A,inf) * norm(X,inf) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/dppt01.f b/TESTING/LIN/dppt01.f index 0841395b..ec3e9b20 100644 --- a/TESTING/LIN/dppt01.f +++ b/TESTING/LIN/dppt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPT01( UPLO, N, A, AFAC, RWORK, RESID ) * @@ -19,22 +19,21 @@ * DOUBLE PRECISION A( * ), AFAC( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPT01 reconstructs a symmetric positive definite packed matrix A *> from its L*L' or U'*U factorization and computes the residual *> norm( L*L' - A ) / ( N * norm(A) * EPS ) or *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -78,10 +77,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dppt02.f b/TESTING/LIN/dppt02.f index 52cbee5f..735181f1 100644 --- a/TESTING/LIN/dppt02.f +++ b/TESTING/LIN/dppt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPT02( UPLO, N, NRHS, A, X, LDX, B, LDB, RWORK, * RESID ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( * ), B( LDB, * ), RWORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPT02 computes the residual in the solution of a symmetric system *> of linear equations A*x = b when packed storage is used for the @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS), *> *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +105,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/LIN/dppt03.f b/TESTING/LIN/dppt03.f index fb76ef63..3f06bfa7 100644 --- a/TESTING/LIN/dppt03.f +++ b/TESTING/LIN/dppt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPT03( UPLO, N, A, AINV, WORK, LDWORK, RWORK, RCOND, * RESID ) @@ -21,21 +21,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPT03 computes the residual for a symmetric packed matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dppt05.f b/TESTING/LIN/dppt05.f index 191dc15a..c3d212d4 100644 --- a/TESTING/LIN/dppt05.f +++ b/TESTING/LIN/dppt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPT05( UPLO, N, NRHS, AP, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -140,10 +139,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dpst01.f b/TESTING/LIN/dpst01.f index 252fe64f..1e2f3102 100644 --- a/TESTING/LIN/dpst01.f +++ b/TESTING/LIN/dpst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPST01( UPLO, N, A, LDA, AFAC, LDAFAC, PERM, LDPERM, * PIV, RWORK, RESID, RANK ) @@ -22,11 +22,11 @@ * INTEGER PIV( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPST01 reconstructs a symmetric positive semidefinite matrix A *> from its L or U factors and the permutation matrix P and computes @@ -34,11 +34,10 @@ *> norm( P*L*L'*P' - A ) / ( N * norm(A) * EPS ) or *> norm( P*U'*U*P' - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -118,10 +117,9 @@ *> RANK is INTEGER *> number of nonzero singular values of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dptt01.f b/TESTING/LIN/dptt01.f index 33302be1..391bdddc 100644 --- a/TESTING/LIN/dptt01.f +++ b/TESTING/LIN/dptt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTT01( N, D, E, DF, EF, WORK, RESID ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION D( * ), DF( * ), E( * ), EF( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTT01 reconstructs a tridiagonal matrix A from its L*D*L' *> factorization and computes the residual *> norm(L*D*L' - A) / ( n * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -76,10 +75,9 @@ *> RESID is DOUBLE PRECISION *> norm(L*D*L' - A) / (n * norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dptt02.f b/TESTING/LIN/dptt02.f index dd547782..bd5b82e3 100644 --- a/TESTING/LIN/dptt02.f +++ b/TESTING/LIN/dptt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTT02( N, NRHS, D, E, X, LDX, B, LDB, RESID ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTT02 computes the residual for the solution to a symmetric *> tridiagonal system of equations: *> RESID = norm(B - A*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> RESID is DOUBLE PRECISION *> 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/LIN/dptt05.f b/TESTING/LIN/dptt05.f index 8d5e9910..54e0facc 100644 --- a/TESTING/LIN/dptt05.f +++ b/TESTING/LIN/dptt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTT05( N, NRHS, D, E, B, LDB, X, LDX, XACT, LDXACT, * FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -134,10 +133,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqlt01.f b/TESTING/LIN/dqlt01.f index a65c63b8..16848e26 100644 --- a/TESTING/LIN/dqlt01.f +++ b/TESTING/LIN/dqlt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQLT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQLT01 tests DGEQLF, which computes the QL factorization of an m-by-n *> matrix A, and partially tests DORGQL which forms the m-by-m *> orthogonal matrix Q. *> *> DQLT01 compares L with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqlt02.f b/TESTING/LIN/dqlt02.f index 51338f50..a07ebc84 100644 --- a/TESTING/LIN/dqlt02.f +++ b/TESTING/LIN/dqlt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQLT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQLT02 tests DORGQL, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> columns of A; it compares L(m-n+1:m,n-k+1:n) with *> Q(1:m,m-n+1:m)'*A(1:m,n-k+1:n), and checks that the columns of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqlt03.f b/TESTING/LIN/dqlt03.f index b823a056..82983852 100644 --- a/TESTING/LIN/dqlt03.f +++ b/TESTING/LIN/dqlt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQLT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQLT03 tests DORMQL, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> DQLT03 compares the results of a call to DORMQL with the results of *> forming Q explicitly by a call to DORGQL and then performing matrix *> multiplication by a call to DGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqpt01.f b/TESTING/LIN/dqpt01.f index 22838a6d..0676cda9 100644 --- a/TESTING/LIN/dqpt01.f +++ b/TESTING/LIN/dqpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DQPT01( M, N, K, A, AF, LDA, TAU, JPVT, * WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQPT01 tests the QR-factorization with pivoting of a matrix A. The *> array AF contains the (possibly partial) QR-factorization of A, where @@ -34,11 +34,10 @@ *> matrix. *> *> This function returns ||A*P - Q*R||/(||norm(A)||*eps*M) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -104,10 +103,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*N+N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt01.f b/TESTING/LIN/dqrt01.f index 80e55f48..3499d14d 100644 --- a/TESTING/LIN/dqrt01.f +++ b/TESTING/LIN/dqrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT01 tests DGEQRF, which computes the QR factorization of an m-by-n *> matrix A, and partially tests DORGQR which forms the m-by-m *> orthogonal matrix Q. *> *> DQRT01 compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt01p.f b/TESTING/LIN/dqrt01p.f index 7f4f1ac9..53a409f8 100644 --- a/TESTING/LIN/dqrt01p.f +++ b/TESTING/LIN/dqrt01p.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT01P( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT01P tests DGEQRFP, which computes the QR factorization of an m-by-n *> matrix A, and partially tests DORGQR which forms the m-by-m *> orthogonal matrix Q. *> *> DQRT01P compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt02.f b/TESTING/LIN/dqrt02.f index a5dd4881..8b8cd8ef 100644 --- a/TESTING/LIN/dqrt02.f +++ b/TESTING/LIN/dqrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT02 tests DORGQR, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> columns of A; it compares R(1:n,1:k) with Q(1:m,1:n)'*A(1:m,1:k), *> and checks that the columns of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt03.f b/TESTING/LIN/dqrt03.f index 2ffbbe2c..61b79648 100644 --- a/TESTING/LIN/dqrt03.f +++ b/TESTING/LIN/dqrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT03 tests DORMQR, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> DQRT03 compares the results of a call to DORMQR with the results of *> forming Q explicitly by a call to DORGQR and then performing matrix *> multiplication by a call to DGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt04.f b/TESTING/LIN/dqrt04.f index bb5cdb20..ab9cd682 100644 --- a/TESTING/LIN/dqrt04.f +++ b/TESTING/LIN/dqrt04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT04(M,N,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * DOUBLE PRECISION RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DQRT04 tests DGEQRT and DGEMQRT. +*> \verbatim *> -*>\endverbatim +*> DQRT04 tests DGEQRT and DGEMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -58,10 +57,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt05.f b/TESTING/LIN/dqrt05.f index 8b8777b0..5931fdde 100644 --- a/TESTING/LIN/dqrt05.f +++ b/TESTING/LIN/dqrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT05(M,N,L,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * DOUBLE PRECISION RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DQRT05 tests DTPQRT and DTPMQRT. +*> \verbatim *> -*>\endverbatim +*> DQRT05 tests DTPQRT and DTPMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -65,10 +64,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt11.f b/TESTING/LIN/dqrt11.f index 6eb3c59c..96369bfe 100644 --- a/TESTING/LIN/dqrt11.f +++ b/TESTING/LIN/dqrt11.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DQRT11( M, K, A, LDA, TAU, WORK, LWORK ) * @@ -17,11 +17,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT11 computes the test ratio *> @@ -35,11 +35,10 @@ *> where tau(k) is stored in TAU(k) and v(k) is an m-vector of the form *> [ 0 ... 0 1 x(k) ]', where x(k) is a vector of length m-k stored *> in A(k+1:m,k). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -83,10 +82,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*M + M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt12.f b/TESTING/LIN/dqrt12.f index d180a486..33ee7ab7 100644 --- a/TESTING/LIN/dqrt12.f +++ b/TESTING/LIN/dqrt12.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DQRT12( M, N, A, LDA, S, WORK, LWORK ) * @@ -17,21 +17,20 @@ * DOUBLE PRECISION A( LDA, * ), S( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT12 computes the singular values `svlues' of the upper trapezoid *> of A(1:M,1:N) and returns the ratio *> *> || s - svlues||/(||svlues||*eps*max(M,N)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -74,10 +73,9 @@ *> The length of the array WORK. LWORK >= max(M*N + 4*min(M,N) + *> max(M,N), M*N+2*MIN( M, N )+4*N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt13.f b/TESTING/LIN/dqrt13.f index 4023c4d6..5ae66c09 100644 --- a/TESTING/LIN/dqrt13.f +++ b/TESTING/LIN/dqrt13.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT13( SCALE, M, N, A, LDA, NORMA, ISEED ) * @@ -19,19 +19,18 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT13 generates a full-rank matrix that may be scaled to have large *> or small norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -76,10 +75,9 @@ *> ISEED is integer array, dimension (4) *> Seed for random number generator *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt14.f b/TESTING/LIN/dqrt14.f index a61543ca..b191f6fc 100644 --- a/TESTING/LIN/dqrt14.f +++ b/TESTING/LIN/dqrt14.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DQRT14( TRANS, M, N, NRHS, A, LDA, X, * LDX, WORK, LWORK ) @@ -19,11 +19,11 @@ * DOUBLE PRECISION A( LDA, * ), WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT14 checks whether X is in the row space of A or A'. It does so *> by scaling both X and A such that their norms are in the range @@ -31,11 +31,10 @@ *> (if TRANS = 'T') or an LQ factorization of [A',X]' (if TRANS = 'N'), *> and returning the norm of the trailing triangle, scaled by *> MAX(M,N,NRHS)*eps. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -100,10 +99,9 @@ *> If TRANS = 'N', LWORK >= (M+NRHS)*(N+2); *> if TRANS = 'T', LWORK >= (N+NRHS)*(M+2). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt15.f b/TESTING/LIN/dqrt15.f index 76030a81..ee47073c 100644 --- a/TESTING/LIN/dqrt15.f +++ b/TESTING/LIN/dqrt15.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT15( SCALE, RKSEL, M, N, NRHS, A, LDA, B, LDB, S, * RANK, NORMA, NORMB, ISEED, WORK, LWORK ) @@ -20,19 +20,18 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT15 generates a matrix with full or deficient rank and of various *> norms. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -132,10 +131,9 @@ *> length of work space required. *> LWORK >= MAX(M+MIN(M,N),NRHS*MIN(M,N),2*N+M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt16.f b/TESTING/LIN/dqrt16.f index 26c451af..73544a8c 100644 --- a/TESTING/LIN/dqrt16.f +++ b/TESTING/LIN/dqrt16.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DQRT16( 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 *> *> DQRT16 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( max(m,n) * 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) / ( max(m,n) * norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dqrt17.f b/TESTING/LIN/dqrt17.f index b4f93d30..64fdbe35 100644 --- a/TESTING/LIN/dqrt17.f +++ b/TESTING/LIN/dqrt17.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DQRT17( TRANS, IRESID, M, N, NRHS, A, * LDA, X, LDX, B, LDB, C, WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DQRT17 computes the ratio *> @@ -34,11 +34,10 @@ *> *> alpha = ||B|| if IRESID = 1 (zero-residual problem) *> alpha = ||R|| if IRESID = 2 (otherwise). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -134,10 +133,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= NRHS*(M+N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/drqt01.f b/TESTING/LIN/drqt01.f index 25aca390..0af88741 100644 --- a/TESTING/LIN/drqt01.f +++ b/TESTING/LIN/drqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DRQT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DRQT01 tests DGERQF, which computes the RQ factorization of an m-by-n *> matrix A, and partially tests DORGRQ which forms the n-by-n *> orthogonal matrix Q. *> *> DRQT01 compares R with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/drqt02.f b/TESTING/LIN/drqt02.f index c990c5a0..2fc88f8d 100644 --- a/TESTING/LIN/drqt02.f +++ b/TESTING/LIN/drqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DRQT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DRQT02 tests DORGRQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> rows of A; it compares R(m-k+1:m,n-m+1:n) with *> A(m-k+1:m,1:n)*Q(n-m+1:n,1:n)', and checks that the rows of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/drqt03.f b/TESTING/LIN/drqt03.f index f3afbdda..ed91b7b2 100644 --- a/TESTING/LIN/drqt03.f +++ b/TESTING/LIN/drqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DRQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DRQT03 tests DORMRQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> DRQT03 compares the results of a call to DORMRQ with the results of *> forming Q explicitly by a call to DORGRQ and then performing matrix *> multiplication by a call to DGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/drzt01.f b/TESTING/LIN/drzt01.f index cb98f793..9390d493 100644 --- a/TESTING/LIN/drzt01.f +++ b/TESTING/LIN/drzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DRZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DRZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with DTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m*nb. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/drzt02.f b/TESTING/LIN/drzt02.f index af785e1b..9c1dc444 100644 --- a/TESTING/LIN/drzt02.f +++ b/TESTING/LIN/drzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DRZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * DOUBLE PRECISION AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DRZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by DTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> length of WORK array. LWORK >= N*N+N*NB. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dspt01.f b/TESTING/LIN/dspt01.f index 6941630a..f8929580 100644 --- a/TESTING/LIN/dspt01.f +++ b/TESTING/LIN/dspt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPT01( UPLO, N, A, AFAC, IPIV, C, LDC, RWORK, RESID ) * @@ -20,21 +20,20 @@ * DOUBLE PRECISION A( * ), AFAC( * ), C( LDC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPT01 reconstructs a symmetric indefinite packed matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dsyt01.f b/TESTING/LIN/dsyt01.f index 585101cb..bf7f9bd0 100644 --- a/TESTING/LIN/dsyt01.f +++ b/TESTING/LIN/dsyt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYT01( UPLO, N, A, LDA, AFAC, LDAFAC, IPIV, C, LDC, * RWORK, RESID ) @@ -22,21 +22,20 @@ * $ RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYT01 reconstructs a symmetric indefinite matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtbt02.f b/TESTING/LIN/dtbt02.f index 5229dbee..93b00add 100644 --- a/TESTING/LIN/dtbt02.f +++ b/TESTING/LIN/dtbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBT02( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, X, * LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b or A' *x = b when @@ -34,11 +34,10 @@ *> the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -138,10 +137,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtbt03.f b/TESTING/LIN/dtbt03.f index 69e5d0bc..1feba881 100644 --- a/TESTING/LIN/dtbt03.f +++ b/TESTING/LIN/dtbt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBT03( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, * SCALE, CNORM, TSCAL, X, LDX, B, LDB, WORK, @@ -22,11 +22,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b or A'*x = s*b when A is a @@ -35,11 +35,10 @@ *> over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -158,10 +157,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtbt05.f b/TESTING/LIN/dtbt05.f index e7dda82a..c34ccbc5 100644 --- a/TESTING/LIN/dtbt05.f +++ b/TESTING/LIN/dtbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBT05( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -173,10 +172,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtbt06.f b/TESTING/LIN/dtbt06.f index b98e4cdd..e14da188 100644 --- a/TESTING/LIN/dtbt06.f +++ b/TESTING/LIN/dtbt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBT06( RCOND, RCONDC, UPLO, DIAG, N, KD, AB, LDAB, * WORK, RAT ) @@ -20,22 +20,21 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by DTBCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -109,10 +108,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtpt01.f b/TESTING/LIN/dtpt01.f index 1d22172d..6d46c498 100644 --- a/TESTING/LIN/dtpt01.f +++ b/TESTING/LIN/dtpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPT01( UPLO, DIAG, N, AP, AINVP, RCOND, WORK, RESID ) * @@ -19,21 +19,20 @@ * DOUBLE PRECISION AINVP( * ), AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPT01 computes the residual for a triangular matrix A times its *> inverse when A is stored in packed format: *> RESID = norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,9 @@ *> RESID is DOUBLE PRECISION *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtpt02.f b/TESTING/LIN/dtpt02.f index 9048e947..24c7d017 100644 --- a/TESTING/LIN/dtpt02.f +++ b/TESTING/LIN/dtpt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPT02( UPLO, TRANS, DIAG, N, NRHS, AP, X, LDX, B, LDB, * WORK, RESID ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b or A'*x = b when @@ -33,11 +33,10 @@ *> the maximum over the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtpt03.f b/TESTING/LIN/dtpt03.f index bc7e9bff..5e4563a4 100644 --- a/TESTING/LIN/dtpt03.f +++ b/TESTING/LIN/dtpt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPT03( UPLO, TRANS, DIAG, N, NRHS, AP, SCALE, CNORM, * TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b or A'*x = s*b when the triangular @@ -34,11 +34,10 @@ *> the maximum over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -145,10 +144,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtpt05.f b/TESTING/LIN/dtpt05.f index 00a1f248..9c53bfad 100644 --- a/TESTING/LIN/dtpt05.f +++ b/TESTING/LIN/dtpt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPT05( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -158,10 +157,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtpt06.f b/TESTING/LIN/dtpt06.f index 163d9faf..089a632a 100644 --- a/TESTING/LIN/dtpt06.f +++ b/TESTING/LIN/dtpt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPT06( RCOND, RCONDC, UPLO, DIAG, N, AP, WORK, RAT ) * @@ -19,22 +19,21 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by DTPCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -96,10 +95,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtrt01.f b/TESTING/LIN/dtrt01.f index f96c12f1..fc480769 100644 --- a/TESTING/LIN/dtrt01.f +++ b/TESTING/LIN/dtrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRT01( UPLO, DIAG, N, A, LDA, AINV, LDAINV, RCOND, * WORK, RESID ) @@ -20,21 +20,20 @@ * DOUBLE PRECISION A( LDA, * ), AINV( LDAINV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRT01 computes the residual for a triangular matrix A times its *> inverse: *> RESID = norm( A*AINV - I ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,9 @@ *> RESID is DOUBLE PRECISION *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtrt02.f b/TESTING/LIN/dtrt02.f index 7a9b0796..c3372493 100644 --- a/TESTING/LIN/dtrt02.f +++ b/TESTING/LIN/dtrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRT02( UPLO, TRANS, DIAG, N, NRHS, A, LDA, X, LDX, B, * LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b or A'*x = b. @@ -34,11 +34,10 @@ *> number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -134,10 +133,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtrt03.f b/TESTING/LIN/dtrt03.f index 8259c287..7c900267 100644 --- a/TESTING/LIN/dtrt03.f +++ b/TESTING/LIN/dtrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRT03( UPLO, TRANS, DIAG, N, NRHS, A, LDA, SCALE, * CNORM, TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b or A'*x = s*b. @@ -34,11 +34,10 @@ *> maximum over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -153,10 +152,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtrt05.f b/TESTING/LIN/dtrt05.f index bf38ab0b..268fbb84 100644 --- a/TESTING/LIN/dtrt05.f +++ b/TESTING/LIN/dtrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRT05( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,10 +164,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtrt06.f b/TESTING/LIN/dtrt06.f index 2102bfaa..124355a7 100644 --- a/TESTING/LIN/dtrt06.f +++ b/TESTING/LIN/dtrt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRT06( RCOND, RCONDC, UPLO, DIAG, N, A, LDA, WORK, * RAT ) @@ -20,22 +20,21 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by DTRCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -105,10 +104,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtzt01.f b/TESTING/LIN/dtzt01.f index 2880854c..b927a2cf 100644 --- a/TESTING/LIN/dtzt01.f +++ b/TESTING/LIN/dtzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DTZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with DTZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/dtzt02.f b/TESTING/LIN/dtzt02.f index 9b4a62d5..b4c8060e 100644 --- a/TESTING/LIN/dtzt02.f +++ b/TESTING/LIN/dtzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DTZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * DOUBLE PRECISION AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by DTZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> length of WORK array. Must be >= N*N+N *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/icopy.f b/TESTING/LIN/icopy.f index c08a57dd..a125103a 100644 --- a/TESTING/LIN/icopy.f +++ b/TESTING/LIN/icopy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ICOPY( N, SX, INCX, SY, INCY ) * @@ -17,19 +17,18 @@ * INTEGER SX( * ), SY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ICOPY copies an integer vector x to an integer vector y. *> Uses unrolled loops for increments equal to 1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -60,10 +59,9 @@ *> INCY is INTEGER *> The spacing between consecutive elements of SY. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ilaenv.f b/TESTING/LIN/ilaenv.f index 6f9b3099..a9291d63 100644 --- a/TESTING/LIN/ilaenv.f +++ b/TESTING/LIN/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 @@ -111,10 +110,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 @@ -125,10 +123,9 @@ * *> \ingroup aux_lin * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The following conventions have been used when calling ILAENV from the @@ -147,7 +144,6 @@ *> *> NB = ILAENV( 1, 'STRTRI', UPLO // DIAG, N, -1, -1, -1 ) *> IF( NB.LE.1 ) NB = MAX( 1, N ) -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/LIN/schkaa.f b/TESTING/LIN/schkaa.f index b9e22ce6..57ecd781 100644 --- a/TESTING/LIN/schkaa.f +++ b/TESTING/LIN/schkaa.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM SCHKAA * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKAA is the main test program for the REAL LAPACK *> linear equation routines @@ -62,11 +62,10 @@ *> STZ 3 List types on next line if 0 < NTYPES < 3 *> SLS 6 List types on next line if 0 < NTYPES < 6 *> SEQ -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NMAX INTEGER @@ -85,10 +84,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -99,8 +97,7 @@ * *> \ingroup single_lin * -* ===================================================================== - PROGRAM SCHKAA +* ===================================================================== PROGRAM SCHKAA * * -- LAPACK test routine (version 3.1.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/schkeq.f b/TESTING/LIN/schkeq.f index ea70c63e..1ba67bc6 100644 --- a/TESTING/LIN/schkeq.f +++ b/TESTING/LIN/schkeq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKEQ( THRESH, NOUT ) * @@ -15,18 +15,17 @@ * REAL THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKEQ tests SGEEQU, SGBEQU, SPOEQU, SPPEQU and SPBEQU +*> \verbatim *> -*>\endverbatim +*> SCHKEQ tests SGEEQU, SGBEQU, SPOEQU, SPPEQU and SPBEQU +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkgb.f b/TESTING/LIN/schkgb.f index b0b0384b..38a336bc 100644 --- a/TESTING/LIN/schkgb.f +++ b/TESTING/LIN/schkgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKGB( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, A, LA, AFAC, LAFAC, B, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKGB tests SGBTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> SCHKGB tests SGBTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -174,10 +173,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkge.f b/TESTING/LIN/schkge.f index 4dbdc989..d124f3ab 100644 --- a/TESTING/LIN/schkge.f +++ b/TESTING/LIN/schkge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKGE( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, NMAX, A, AFAC, AINV, B, @@ -25,18 +25,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKGE tests SGETRF, -TRI, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> SCHKGE tests SGETRF, -TRI, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -168,10 +167,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkgt.f b/TESTING/LIN/schkgt.f index 3e0853cb..28d98a09 100644 --- a/TESTING/LIN/schkgt.f +++ b/TESTING/LIN/schkgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKGT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, AF, B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -23,18 +23,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKGT tests SGTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> SCHKGT tests SGTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -130,10 +129,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schklq.f b/TESTING/LIN/schklq.f index 7ee4d9a2..961f6475 100644 --- a/TESTING/LIN/schklq.f +++ b/TESTING/LIN/schklq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKLQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKLQ tests SGELQF, SORGLQ and SORMLQ. +*> \verbatim *> -*>\endverbatim +*> SCHKLQ tests SGELQF, SORGLQ and SORMLQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkpb.f b/TESTING/LIN/schkpb.f index 27ef7197..3d65dd5c 100644 --- a/TESTING/LIN/schkpb.f +++ b/TESTING/LIN/schkpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKPB( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKPB tests SPBTRF, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> SCHKPB tests SPBTRF, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkpo.f b/TESTING/LIN/schkpo.f index 8390d22a..381f6ec6 100644 --- a/TESTING/LIN/schkpo.f +++ b/TESTING/LIN/schkpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKPO( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKPO tests SPOTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> SCHKPO tests SPOTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkpp.f b/TESTING/LIN/schkpp.f index f607fe01..62d31583 100644 --- a/TESTING/LIN/schkpp.f +++ b/TESTING/LIN/schkpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKPP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKPP tests SPPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> SCHKPP tests SPPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -146,10 +145,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkps.f b/TESTING/LIN/schkps.f index ff510b76..7cc487f5 100644 --- a/TESTING/LIN/schkps.f +++ b/TESTING/LIN/schkps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKPS( DOTYPE, NN, NVAL, NNB, NBVAL, NRANK, RANKVAL, * THRESH, TSTERR, NMAX, A, AFAC, PERM, PIV, WORK, @@ -24,18 +24,17 @@ * LOGICAL DOTYPE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKPS tests SPSTRF. +*> \verbatim *> -*>\endverbatim +*> SCHKPS tests SPSTRF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkpt.f b/TESTING/LIN/schkpt.f index c902670f..cf2f1787 100644 --- a/TESTING/LIN/schkpt.f +++ b/TESTING/LIN/schkpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKPT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, D, E, B, X, XACT, WORK, RWORK, NOUT ) @@ -23,18 +23,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKPT tests SPTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> SCHKPT tests SPTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -130,10 +129,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkq3.f b/TESTING/LIN/schkq3.f index 1e6dd9c4..50b53159 100644 --- a/TESTING/LIN/schkq3.f +++ b/TESTING/LIN/schkq3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKQ3( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * THRESH, A, COPYA, S, TAU, WORK, IWORK, @@ -24,18 +24,17 @@ * $ TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKQ3 tests SGEQP3. +*> \verbatim *> -*>\endverbatim +*> SCHKQ3 tests SGEQP3. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -136,10 +135,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkql.f b/TESTING/LIN/schkql.f index 4fd50db2..9711e558 100644 --- a/TESTING/LIN/schkql.f +++ b/TESTING/LIN/schkql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKQL( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKQL tests SGEQLF, SORGQL and SORMQL. +*> \verbatim *> -*>\endverbatim +*> SCHKQL tests SGEQLF, SORGQL and SORMQL. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkqp.f b/TESTING/LIN/schkqp.f index 8c307d09..1521d111 100644 --- a/TESTING/LIN/schkqp.f +++ b/TESTING/LIN/schkqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKQP( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, IWORK, NOUT ) @@ -23,18 +23,17 @@ * $ TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKQP tests SGEQPF. +*> \verbatim *> -*>\endverbatim +*> SCHKQP tests SGEQPF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -121,10 +120,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkqr.f b/TESTING/LIN/schkqr.f index 6ebbb10a..75b48436 100644 --- a/TESTING/LIN/schkqr.f +++ b/TESTING/LIN/schkqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKQR( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKQR tests SGEQRF, SORGQR and SORMQR. +*> \verbatim *> -*>\endverbatim +*> SCHKQR tests SGEQRF, SORGQR and SORMQR. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schkrfp.f b/TESTING/LIN/schkrfp.f index 4cefd28d..9da8546d 100644 --- a/TESTING/LIN/schkrfp.f +++ b/TESTING/LIN/schkrfp.f @@ -5,25 +5,24 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM SCHKRFP * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCHKRFP is the main test program for the REAL linear *> equation routines with RFP storage format *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> MAXIN INTEGER @@ -44,10 +43,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -58,8 +56,7 @@ * *> \ingroup single_lin * -* ===================================================================== - PROGRAM SCHKRFP +* ===================================================================== PROGRAM SCHKRFP * * -- LAPACK test routine (version 3.2.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/schkrq.f b/TESTING/LIN/schkrq.f index c863eeec..67df3d9f 100644 --- a/TESTING/LIN/schkrq.f +++ b/TESTING/LIN/schkrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKRQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKRQ tests SGERQF, SORGRQ and SORMRQ. +*> \verbatim *> -*>\endverbatim +*> SCHKRQ tests SGERQF, SORGRQ and SORMRQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schksp.f b/TESTING/LIN/schksp.f index fa1222e5..f46ee24b 100644 --- a/TESTING/LIN/schksp.f +++ b/TESTING/LIN/schksp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKSP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKSP tests SSPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> SCHKSP tests SSPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -146,10 +145,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schksy.f b/TESTING/LIN/schksy.f index 6c6abcac..669b0c74 100644 --- a/TESTING/LIN/schksy.f +++ b/TESTING/LIN/schksy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKSY( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKSY tests SSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> SCHKSY tests SSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schktb.f b/TESTING/LIN/schktb.f index d68dae69..52ee8e33 100644 --- a/TESTING/LIN/schktb.f +++ b/TESTING/LIN/schktb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKTB( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AB, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKTB tests STBTRS, -RFS, and -CON, and SLATBS. +*> \verbatim *> -*>\endverbatim +*> SCHKTB tests STBTRS, -RFS, and -CON, and SLATBS. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -138,10 +137,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schktp.f b/TESTING/LIN/schktp.f index 10274779..ee52affa 100644 --- a/TESTING/LIN/schktp.f +++ b/TESTING/LIN/schktp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKTP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AP, AINVP, B, X, XACT, WORK, RWORK, @@ -24,18 +24,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKTP tests STPTRI, -TRS, -RFS, and -CON, and SLATPS +*> \verbatim *> -*>\endverbatim +*> SCHKTP tests STPTRI, -TRS, -RFS, and -CON, and SLATPS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schktr.f b/TESTING/LIN/schktr.f index e050fe7c..6713a3b6 100644 --- a/TESTING/LIN/schktr.f +++ b/TESTING/LIN/schktr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKTR( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AINV, B, X, XACT, @@ -24,18 +24,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKTR tests STRTRI, -TRS, -RFS, and -CON, and SLATRS +*> \verbatim *> -*>\endverbatim +*> SCHKTR tests STRTRI, -TRS, -RFS, and -CON, and SLATRS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/schktz.f b/TESTING/LIN/schktz.f index 5a51a827..7c550100 100644 --- a/TESTING/LIN/schktz.f +++ b/TESTING/LIN/schktz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCHKTZ( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, NOUT ) @@ -23,18 +23,17 @@ * $ TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCHKTZ tests STZRQF and STZRZF. +*> \verbatim *> -*>\endverbatim +*> SCHKTZ tests STZRQF and STZRZF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -116,10 +115,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvgb.f b/TESTING/LIN/sdrvgb.f index 74fc713b..a1f6590f 100644 --- a/TESTING/LIN/sdrvgb.f +++ b/TESTING/LIN/sdrvgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVGB tests the driver routines SGBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVGB tests the driver routines SGBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvgbx.f b/TESTING/LIN/sdrvgbx.f index 1062b33a..ad2756a8 100644 --- a/TESTING/LIN/sdrvgbx.f +++ b/TESTING/LIN/sdrvgbx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVGB tests the driver routines SGBSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise sdrvgb.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -158,10 +157,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvge.f b/TESTING/LIN/sdrvge.f index 25dcf547..58441fcb 100644 --- a/TESTING/LIN/sdrvge.f +++ b/TESTING/LIN/sdrvge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVGE tests the driver routines SGESV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVGE tests the driver routines SGESV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvgex.f b/TESTING/LIN/sdrvgex.f index 31b165b3..46d47391 100644 --- a/TESTING/LIN/sdrvgex.f +++ b/TESTING/LIN/sdrvgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVGE tests the driver routines SGESV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise sdrvge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvgt.f b/TESTING/LIN/sdrvgt.f index f46a42a9..70b16a2d 100644 --- a/TESTING/LIN/sdrvgt.f +++ b/TESTING/LIN/sdrvgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVGT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, AF, * B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -23,18 +23,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVGT tests SGTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVGT tests SGTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -123,10 +122,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvls.f b/TESTING/LIN/sdrvls.f index 78e852f8..347f5fd4 100644 --- a/TESTING/LIN/sdrvls.f +++ b/TESTING/LIN/sdrvls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVLS( DOTYPE, NM, MVAL, NN, NVAL, NNS, NSVAL, NNB, * NBVAL, NXVAL, THRESH, TSTERR, A, COPYA, B, @@ -25,19 +25,18 @@ * $ COPYS( * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVLS tests the least squares driver routines SGELS, SGELSS, SGELSX, *> SGELSY and SGELSD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -186,10 +185,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvpb.f b/TESTING/LIN/sdrvpb.f index 9a6e2c88..3b4fa72d 100644 --- a/TESTING/LIN/sdrvpb.f +++ b/TESTING/LIN/sdrvpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVPB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVPB tests the driver routines SPBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVPB tests the driver routines SPBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvpo.f b/TESTING/LIN/sdrvpo.f index f07360d2..d099867e 100644 --- a/TESTING/LIN/sdrvpo.f +++ b/TESTING/LIN/sdrvpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVPO tests the driver routines SPOSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVPO tests the driver routines SPOSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvpox.f b/TESTING/LIN/sdrvpox.f index 813c7513..ed62f273 100644 --- a/TESTING/LIN/sdrvpox.f +++ b/TESTING/LIN/sdrvpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVPO tests the driver routines SPOSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise sdrvpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvpp.f b/TESTING/LIN/sdrvpp.f index 52497993..af2a0ca7 100644 --- a/TESTING/LIN/sdrvpp.f +++ b/TESTING/LIN/sdrvpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVPP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVPP tests the driver routines SPPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVPP tests the driver routines SPPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvpt.f b/TESTING/LIN/sdrvpt.f index 5c10751d..9ff28d4e 100644 --- a/TESTING/LIN/sdrvpt.f +++ b/TESTING/LIN/sdrvpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, D, * E, B, X, XACT, WORK, RWORK, NOUT ) @@ -23,18 +23,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVPT tests SPTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVPT tests SPTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -124,10 +123,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvrf1.f b/TESTING/LIN/sdrvrf1.f index 46d5d1d5..845caf3a 100644 --- a/TESTING/LIN/sdrvrf1.f +++ b/TESTING/LIN/sdrvrf1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVRF1( NOUT, NN, NVAL, THRESH, A, LDA, ARF, WORK ) * @@ -19,19 +19,18 @@ * REAL A( LDA, * ), ARF( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVRF1 tests the LAPACK RFP routines: *> SLANSF -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -79,10 +78,9 @@ *> \verbatim *> WORK is REAL array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvrf2.f b/TESTING/LIN/sdrvrf2.f index 024bb495..4e6a3aa6 100644 --- a/TESTING/LIN/sdrvrf2.f +++ b/TESTING/LIN/sdrvrf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVRF2( NOUT, NN, NVAL, A, LDA, ARF, AP, ASAV ) * @@ -18,18 +18,17 @@ * REAL A( LDA, * ), ARF( * ), AP(*), ASAV( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVRF2 tests the LAPACK RFP convertion routines. +*> \verbatim *> -*>\endverbatim +*> SDRVRF2 tests the LAPACK RFP convertion routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -74,10 +73,9 @@ *> \verbatim *> ASAV is REAL array, dimension (LDA,NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvrf3.f b/TESTING/LIN/sdrvrf3.f index 38dd4a2c..2ef93e5c 100644 --- a/TESTING/LIN/sdrvrf3.f +++ b/TESTING/LIN/sdrvrf3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVRF3( NOUT, NN, NVAL, THRESH, A, LDA, ARF, B1, B2, * + S_WORK_SLANGE, S_WORK_SGEQRF, TAU ) @@ -22,19 +22,18 @@ * + S_WORK_SLANGE( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVRF3 tests the LAPACK RFP routines: *> STFSM -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -102,10 +101,9 @@ *> \verbatim *> TAU is REAL array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvrf4.f b/TESTING/LIN/sdrvrf4.f index cfac8ba6..74dc4254 100644 --- a/TESTING/LIN/sdrvrf4.f +++ b/TESTING/LIN/sdrvrf4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVRF4( NOUT, NN, NVAL, THRESH, C1, C2, LDC, CRF, A, * + LDA, S_WORK_SLANGE ) @@ -21,19 +21,18 @@ * + CRF( * ), S_WORK_SLANGE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVRF4 tests the LAPACK RFP routines: *> SSFRK -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -102,10 +101,9 @@ *> \verbatim *> S_WORK_SLANGE is REAL array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvrfp.f b/TESTING/LIN/sdrvrfp.f index 136b4535..2190e77d 100644 --- a/TESTING/LIN/sdrvrfp.f +++ b/TESTING/LIN/sdrvrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVRFP( NOUT, NN, NVAL, NNS, NSVAL, NNT, NTVAL, * + THRESH, A, ASAV, AFAC, AINV, B, @@ -40,11 +40,11 @@ * REAL S_WORK_SPOT03( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVRFP tests the LAPACK RFP routines: *> SPFTRF, SPFTRS, and SPFTRI. @@ -78,11 +78,10 @@ *> norm( . ) the 1-norm for (1,2,3) and the inf-norm for (4). *> Errors occur when INFO parameter is not as expected. Failures occur when *> a test ratios is greater than THRES. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -223,10 +222,9 @@ *> \verbatim *> S_WORK_SPOT03 is REAL array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvsp.f b/TESTING/LIN/sdrvsp.f index 96076856..35945fae 100644 --- a/TESTING/LIN/sdrvsp.f +++ b/TESTING/LIN/sdrvsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVSP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVSP tests the driver routines SSPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVSP tests the driver routines SSPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -139,10 +138,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvsy.f b/TESTING/LIN/sdrvsy.f index ea33425b..294d8aab 100644 --- a/TESTING/LIN/sdrvsy.f +++ b/TESTING/LIN/sdrvsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SDRVSY tests the driver routines SSYSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> SDRVSY tests the driver routines SSYSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -136,10 +135,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sdrvsyx.f b/TESTING/LIN/sdrvsyx.f index 9092c100..d841ef7e 100644 --- a/TESTING/LIN/sdrvsyx.f +++ b/TESTING/LIN/sdrvsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -24,21 +24,20 @@ * $ RWORK( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDRVSY tests the driver routines SSYSV, -SVX, and -SVXX *> *> Note that this file is used only when the XBLAS are available, *> otherwise sdrvsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -139,10 +138,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sebchvxx.f b/TESTING/LIN/sebchvxx.f index b29e17c2..9fa72df2 100644 --- a/TESTING/LIN/sebchvxx.f +++ b/TESTING/LIN/sebchvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SEBCHVXX( THRESH, PATH ) * @@ -15,11 +15,12 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> SEBCHVXX will run S**SVXX on a series of Hilbert matrices and then *> compare the error bounds returned by SGESVXX to see if the returned *> answer indeed falls within those bounds. @@ -79,10 +80,9 @@ *> type used plus one, which is 24 for single precision. *> NMAX should be 6 for single and 11 for double. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/serrge.f b/TESTING/LIN/serrge.f index aaa05194..54122ad2 100644 --- a/TESTING/LIN/serrge.f +++ b/TESTING/LIN/serrge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRGE( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRGE tests the error exits for the REAL routines *> for general matrices. -*> -*>\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/LIN/serrgex.f b/TESTING/LIN/serrgex.f index 5534100c..84fcc9be 100644 --- a/TESTING/LIN/serrgex.f +++ b/TESTING/LIN/serrgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRGE( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRGE tests the error exits for the REAL routines *> for general matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise serrge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/serrgt.f b/TESTING/LIN/serrgt.f index 78e332a1..4e78847d 100644 --- a/TESTING/LIN/serrgt.f +++ b/TESTING/LIN/serrgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRGT( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRGT tests the error exits for the REAL tridiagonal *> routines. -*> -*>\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/LIN/serrlq.f b/TESTING/LIN/serrlq.f index 28bd4cc0..2fadff1c 100644 --- a/TESTING/LIN/serrlq.f +++ b/TESTING/LIN/serrlq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRLQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRLQ tests the error exits for the REAL routines *> that use the LQ decomposition of a general matrix. -*> -*>\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/LIN/serrls.f b/TESTING/LIN/serrls.f index bea2f991..fa0e9c06 100644 --- a/TESTING/LIN/serrls.f +++ b/TESTING/LIN/serrls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRLS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRLS tests the error exits for the REAL least squares *> driver routines (SGELS, SGELSS, SGELSX, SGELSY, SGELSD). -*> -*>\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/LIN/serrpo.f b/TESTING/LIN/serrpo.f index 3e36cfd0..cc9543da 100644 --- a/TESTING/LIN/serrpo.f +++ b/TESTING/LIN/serrpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRPO( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRPO tests the error exits for the REAL routines *> for symmetric positive definite matrices. -*> -*>\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/LIN/serrpox.f b/TESTING/LIN/serrpox.f index 225c1add..4ad9d58c 100644 --- a/TESTING/LIN/serrpox.f +++ b/TESTING/LIN/serrpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRPO( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRPO tests the error exits for the REAL routines *> for symmetric positive definite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise serrpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/serrps.f b/TESTING/LIN/serrps.f index 44c33ebd..0fefa3af 100644 --- a/TESTING/LIN/serrps.f +++ b/TESTING/LIN/serrps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRPS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRPS tests the error exits for the REAL routines *> for SPSTRF.. -*> -*>\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/LIN/serrql.f b/TESTING/LIN/serrql.f index 6be4b60d..f4d85f6d 100644 --- a/TESTING/LIN/serrql.f +++ b/TESTING/LIN/serrql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRQL( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRQL tests the error exits for the REAL routines *> that use the QL decomposition of a general matrix. -*> -*>\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/LIN/serrqp.f b/TESTING/LIN/serrqp.f index 51268e0b..7bb88b44 100644 --- a/TESTING/LIN/serrqp.f +++ b/TESTING/LIN/serrqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRQP( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SERRQP tests the error exits for SGEQPF and SGEQP3. +*> \verbatim *> -*>\endverbatim +*> SERRQP tests the error exits for SGEQPF and SGEQP3. +*> \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/LIN/serrqr.f b/TESTING/LIN/serrqr.f index 4e0811cf..ee70deff 100644 --- a/TESTING/LIN/serrqr.f +++ b/TESTING/LIN/serrqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRQR( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRQR tests the error exits for the REAL routines *> that use the QR decomposition of a general matrix. -*> -*>\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/LIN/serrrfp.f b/TESTING/LIN/serrrfp.f index 1695b6a4..f14c9ce9 100644 --- a/TESTING/LIN/serrrfp.f +++ b/TESTING/LIN/serrrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRRFP( NUNIT ) * @@ -14,11 +14,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRRFP tests the error exits for the REAL driver routines *> for solving linear systems of equations. @@ -26,21 +26,19 @@ *> SDRVRFP tests the REAL LAPACK RFP routines: *> STFSM, STFTRI, SSFRK, STFTTP, STFTTR, SPFTRF, SPFTRS, STPTTF, *> STPTTR, STRTTF, and STRTTP -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/serrrq.f b/TESTING/LIN/serrrq.f index fbcbe56d..ad567c17 100644 --- a/TESTING/LIN/serrrq.f +++ b/TESTING/LIN/serrrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRRQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRRQ tests the error exits for the REAL routines *> that use the RQ decomposition of a general matrix. -*> -*>\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/LIN/serrsy.f b/TESTING/LIN/serrsy.f index 905aad43..7fa45fab 100644 --- a/TESTING/LIN/serrsy.f +++ b/TESTING/LIN/serrsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRSY( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRSY tests the error exits for the REAL routines *> for symmetric indefinite matrices. -*> -*>\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/LIN/serrsyx.f b/TESTING/LIN/serrsyx.f index 440b2a79..c45cfeed 100644 --- a/TESTING/LIN/serrsyx.f +++ b/TESTING/LIN/serrsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRSY( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRSY tests the error exits for the REAL routines *> for symmetric indefinite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise serrsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/serrtr.f b/TESTING/LIN/serrtr.f index 4e72dc09..be2fa7cb 100644 --- a/TESTING/LIN/serrtr.f +++ b/TESTING/LIN/serrtr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRTR( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRTR tests the error exits for the REAL triangular *> routines. -*> -*>\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/LIN/serrtz.f b/TESTING/LIN/serrtz.f index ab031f2f..fcf30837 100644 --- a/TESTING/LIN/serrtz.f +++ b/TESTING/LIN/serrtz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRTZ( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SERRTZ tests the error exits for STZRQF and STZRZF. +*> \verbatim *> -*>\endverbatim +*> SERRTZ tests the error exits for STZRQF and STZRZF. +*> \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/LIN/serrvx.f b/TESTING/LIN/serrvx.f index 135b95b1..f80d057b 100644 --- a/TESTING/LIN/serrvx.f +++ b/TESTING/LIN/serrvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRVX tests the error exits for the REAL driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/serrvxx.f b/TESTING/LIN/serrvxx.f index 2e67c67f..00a10333 100644 --- a/TESTING/LIN/serrvxx.f +++ b/TESTING/LIN/serrvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SERRVX tests the error exits for the REAL driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/sgbt01.f b/TESTING/LIN/sgbt01.f index c0269889..abc675ce 100644 --- a/TESTING/LIN/sgbt01.f +++ b/TESTING/LIN/sgbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBT01( M, N, KL, KU, A, LDA, AFAC, LDAFAC, IPIV, WORK, * RESID ) @@ -20,11 +20,11 @@ * REAL A( LDA, * ), AFAC( LDAFAC, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBT01 reconstructs a band matrix A from its L*U factorization and *> computes the residual: @@ -33,11 +33,10 @@ *> *> The expression L*U - A is computed one column at a time, so A and *> AFAC are not modified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESID is REAL *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sgbt02.f b/TESTING/LIN/sgbt02.f index f49181f6..4f18a3b3 100644 --- a/TESTING/LIN/sgbt02.f +++ b/TESTING/LIN/sgbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBT02( TRANS, M, N, KL, KU, NRHS, A, LDA, X, LDX, B, * LDB, RESID ) @@ -20,21 +20,20 @@ * REAL A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBT02 computes the residual for a solution of a banded system of *> equations A*x = b or A'*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS). *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -123,10 +122,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/LIN/sgbt05.f b/TESTING/LIN/sgbt05.f index b8184d85..0f3382d2 100644 --- a/TESTING/LIN/sgbt05.f +++ b/TESTING/LIN/sgbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBT05( TRANS, N, KL, KU, NRHS, AB, LDAB, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -160,10 +159,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sgelqs.f b/TESTING/LIN/sgelqs.f index 0e0184ae..6926c375 100644 --- a/TESTING/LIN/sgelqs.f +++ b/TESTING/LIN/sgelqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the LQ factorization *> A = L*Q *> computed by SGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/sgennd.f b/TESTING/LIN/sgennd.f index 877b10c3..c7798e4b 100644 --- a/TESTING/LIN/sgennd.f +++ b/TESTING/LIN/sgennd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION SGENND (M, N, A, LDA) * @@ -17,18 +17,17 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SGENND tests that its argument has a non-negative diagonal. +*> \verbatim *> -*>\endverbatim +*> SGENND tests that its argument has a non-negative diagonal. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -53,10 +52,9 @@ *> LDA is INTEGER *> Leading dimension of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sgeqls.f b/TESTING/LIN/sgeqls.f index 1b214ad7..3e4c9eb7 100644 --- a/TESTING/LIN/sgeqls.f +++ b/TESTING/LIN/sgeqls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQLS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QL factorization *> A = Q*L *> computed by SGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/sgeqrs.f b/TESTING/LIN/sgeqrs.f index 110bbf1d..a3f6dea4 100644 --- a/TESTING/LIN/sgeqrs.f +++ b/TESTING/LIN/sgeqrs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQRS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QR factorization *> A = Q*R *> computed by SGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/sgerqs.f b/TESTING/LIN/sgerqs.f index a774a432..499b0deb 100644 --- a/TESTING/LIN/sgerqs.f +++ b/TESTING/LIN/sgerqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGERQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the RQ factorization *> A = R*Q *> computed by SGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/sget01.f b/TESTING/LIN/sget01.f index 63a41fb7..226f8825 100644 --- a/TESTING/LIN/sget01.f +++ b/TESTING/LIN/sget01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET01( M, N, A, LDA, AFAC, LDAFAC, IPIV, RWORK, * RESID ) @@ -20,21 +20,20 @@ * REAL A( LDA, * ), AFAC( LDAFAC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET01 reconstructs a matrix A from its L*U factorization and *> computes the residual *> norm(L*U - A) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -91,10 +90,9 @@ *> RESID is REAL *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sget02.f b/TESTING/LIN/sget02.f index 44976ff4..ea103a16 100644 --- a/TESTING/LIN/sget02.f +++ b/TESTING/LIN/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/LIN/sget03.f b/TESTING/LIN/sget03.f index 27d0efe8..818352d7 100644 --- a/TESTING/LIN/sget03.f +++ b/TESTING/LIN/sget03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET03( N, A, LDA, AINV, LDAINV, WORK, LDWORK, RWORK, * RCOND, RESID ) @@ -20,20 +20,19 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET03 computes the residual for a general matrix times its inverse: *> norm( I - AINV*A ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> RESID is REAL *> norm(I - AINV*A) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sget04.f b/TESTING/LIN/sget04.f index a27d9484..bdd76fb0 100644 --- a/TESTING/LIN/sget04.f +++ b/TESTING/LIN/sget04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET04( N, NRHS, X, LDX, XACT, LDXACT, RCOND, RESID ) * @@ -18,11 +18,11 @@ * REAL X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET04 computes the difference between a computed solution and the *> true solution to a system of linear equations. @@ -30,11 +30,10 @@ *> RESID = ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ), *> where RCOND is the reciprocal of the condition number and EPS is the *> machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> The maximum over the NRHS solution vectors of *> ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sget06.f b/TESTING/LIN/sget06.f index e3b33eff..10f4c6a7 100644 --- a/TESTING/LIN/sget06.f +++ b/TESTING/LIN/sget06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SGET06( RCOND, RCONDC ) * @@ -14,18 +14,17 @@ * REAL RCOND, RCONDC * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SGET06 computes a test ratio to compare two values for RCOND. +*> \verbatim *> -*>\endverbatim +*> SGET06 computes a test ratio to compare two values for RCOND. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -40,10 +39,9 @@ *> The reciprocal of the condition number of A, computed as *> ( 1/norm(A) ) / norm(inv(A)). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sget07.f b/TESTING/LIN/sget07.f index 1ba42349..aabcb446 100644 --- a/TESTING/LIN/sget07.f +++ b/TESTING/LIN/sget07.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGET07( TRANS, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, CHKFERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGET07 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sgtt01.f b/TESTING/LIN/sgtt01.f index c2f8e714..86af460b 100644 --- a/TESTING/LIN/sgtt01.f +++ b/TESTING/LIN/sgtt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTT01( N, DL, D, DU, DLF, DF, DUF, DU2, IPIV, WORK, * LDWORK, RWORK, RESID ) @@ -22,21 +22,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTT01 reconstructs a tridiagonal matrix A from its LU factorization *> and computes the residual *> norm(L*U - A) / ( norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> RESID is REAL *> The scaled residual: norm(L*U - A) / (norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sgtt02.f b/TESTING/LIN/sgtt02.f index 193d037f..dd95605e 100644 --- a/TESTING/LIN/sgtt02.f +++ b/TESTING/LIN/sgtt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTT02( TRANS, N, NRHS, DL, D, DU, X, LDX, B, LDB, * RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTT02 computes the residual for the solution to a tridiagonal *> system of equations: *> RESID = norm(B - op(A)*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -108,10 +107,9 @@ *> RESID is REAL *> norm(B - op(A)*X) / (norm(A) * norm(X) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sgtt05.f b/TESTING/LIN/sgtt05.f index 8e4fd8bc..34951066 100644 --- a/TESTING/LIN/sgtt05.f +++ b/TESTING/LIN/sgtt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTT05( TRANS, N, NRHS, DL, D, DU, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slahilb.f b/TESTING/LIN/slahilb.f index 7ced82fb..a66af5d4 100644 --- a/TESTING/LIN/slahilb.f +++ b/TESTING/LIN/slahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * @@ -16,11 +16,11 @@ * REAL A(LDA, N), X(LDX, NRHS), B(LDB, NRHS), WORK(N) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -40,11 +40,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> be not exact. *> < 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/LIN/slaord.f b/TESTING/LIN/slaord.f index 1828ec1f..ba3e09f5 100644 --- a/TESTING/LIN/slaord.f +++ b/TESTING/LIN/slaord.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAORD( JOB, N, X, INCX ) * @@ -18,19 +18,18 @@ * REAL X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAORD sorts the elements of a vector x in increasing or decreasing *> order. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -58,10 +57,9 @@ *> INCX is INTEGER *> The spacing between successive elements of X. INCX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slaptm.f b/TESTING/LIN/slaptm.f index b5f77cbb..4a6c2669 100644 --- a/TESTING/LIN/slaptm.f +++ b/TESTING/LIN/slaptm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAPTM( N, NRHS, ALPHA, D, E, X, LDX, BETA, B, LDB ) * @@ -18,11 +18,11 @@ * REAL B( LDB, * ), D( * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAPTM multiplies an N by NRHS matrix X by a symmetric tridiagonal *> matrix A and stores the result in a matrix B. The operation has the @@ -31,11 +31,10 @@ *> B := alpha * A * X + beta * B *> *> where alpha may be either 1. or -1. and beta may be 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -101,10 +100,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(N,1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slarhs.f b/TESTING/LIN/slarhs.f index dabce94a..68b7cad5 100644 --- a/TESTING/LIN/slarhs.f +++ b/TESTING/LIN/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/LIN/slatb4.f b/TESTING/LIN/slatb4.f index 837410f1..45a2a153 100644 --- a/TESTING/LIN/slatb4.f +++ b/TESTING/LIN/slatb4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATB4( PATH, IMAT, M, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * REAL ANORM, CNDNUM * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATB4 sets parameters for the matrix generator based on the type of *> matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -104,10 +103,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/LIN/slatb5.f b/TESTING/LIN/slatb5.f index 1ac8b019..b7964fb5 100644 --- a/TESTING/LIN/slatb5.f +++ b/TESTING/LIN/slatb5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATB5( PATH, IMAT, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATB5 sets parameters for the matrix generator based on the type *> of matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -98,10 +97,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/LIN/slattb.f b/TESTING/LIN/slattb.f index 18f2feb5..f81460af 100644 --- a/TESTING/LIN/slattb.f +++ b/TESTING/LIN/slattb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATTB( IMAT, UPLO, TRANS, DIAG, ISEED, N, KD, AB, * LDAB, B, WORK, INFO ) @@ -20,20 +20,19 @@ * REAL AB( LDAB, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATTB generates a triangular test matrix in 2-dimensional storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -119,10 +118,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slattp.f b/TESTING/LIN/slattp.f index a60a548b..bde1883d 100644 --- a/TESTING/LIN/slattp.f +++ b/TESTING/LIN/slattp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATTP( IMAT, UPLO, TRANS, DIAG, ISEED, N, A, B, WORK, * INFO ) @@ -20,20 +20,19 @@ * REAL A( * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATTP generates a triangular test matrix in packed storage. *> IMAT and UPLO uniquely specify the properties of the test *> matrix, which is returned in the array AP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -109,10 +108,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slattr.f b/TESTING/LIN/slattr.f index 682871d7..4e8766d2 100644 --- a/TESTING/LIN/slattr.f +++ b/TESTING/LIN/slattr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATTR( IMAT, UPLO, TRANS, DIAG, ISEED, N, A, LDA, B, * WORK, INFO ) @@ -20,20 +20,19 @@ * REAL A( LDA, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATTR generates a triangular test matrix. *> IMAT and UPLO uniquely specify the properties of the test *> matrix, which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -117,10 +116,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slavsp.f b/TESTING/LIN/slavsp.f index 791d44f0..e3c2c3c1 100644 --- a/TESTING/LIN/slavsp.f +++ b/TESTING/LIN/slavsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAVSP( UPLO, TRANS, DIAG, N, NRHS, A, IPIV, B, LDB, * INFO ) @@ -20,11 +20,11 @@ * REAL A( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAVSP performs one of the matrix-vector operations *> x := A*x or x := A'*x, @@ -34,11 +34,10 @@ *> If TRANS = 'N', multiplies by U or U * D (or L or L * D) *> If TRANS = 'T', multiplies by U' or D * U' (or L' or D * L' ) *> If TRANS = 'C', multiplies by U' or D * U' (or L' or D * L' ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slavsy.f b/TESTING/LIN/slavsy.f index e0d37827..bf041a4f 100644 --- a/TESTING/LIN/slavsy.f +++ b/TESTING/LIN/slavsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAVSY( UPLO, TRANS, DIAG, N, NRHS, A, LDA, IPIV, B, * LDB, INFO ) @@ -20,11 +20,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAVSY performs one of the matrix-vector operations *> x := A*x or x := A'*x, @@ -34,11 +34,10 @@ *> If TRANS = 'N', multiplies by U or U * D (or L or L * D) *> If TRANS = 'T', multiplies by U' or D * U' (or L' or D * L') *> If TRANS = 'C', multiplies by U' or D * U' (or L' or D * L') -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> = 0: successful exit *> < 0: if INFO = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/slqt01.f b/TESTING/LIN/slqt01.f index 9d8c91f6..cfcff0cc 100644 --- a/TESTING/LIN/slqt01.f +++ b/TESTING/LIN/slqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLQT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLQT01 tests SGELQF, which computes the LQ factorization of an m-by-n *> matrix A, and partially tests SORGLQ which forms the n-by-n *> orthogonal matrix Q. *> *> SLQT01 compares L with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/slqt02.f b/TESTING/LIN/slqt02.f index 427675f8..317af704 100644 --- a/TESTING/LIN/slqt02.f +++ b/TESTING/LIN/slqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLQT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLQT02 tests SORGLQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> rows of A; it compares L(1:k,1:m) with A(1:k,1:n)*Q(1:m,1:n)', and *> checks that the rows of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/slqt03.f b/TESTING/LIN/slqt03.f index d0da6fd8..391aee9e 100644 --- a/TESTING/LIN/slqt03.f +++ b/TESTING/LIN/slqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLQT03 tests SORMLQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> SLQT03 compares the results of a call to SORMLQ with the results of *> forming Q explicitly by a call to SORGLQ and then performing matrix *> multiplication by a call to SGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/spbt01.f b/TESTING/LIN/spbt01.f index 96a8c445..1d508234 100644 --- a/TESTING/LIN/spbt01.f +++ b/TESTING/LIN/spbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBT01( UPLO, N, KD, A, LDA, AFAC, LDAFAC, RWORK, * RESID ) @@ -20,11 +20,11 @@ * REAL A( LDA, * ), AFAC( LDAFAC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBT01 reconstructs a symmetric positive definite band matrix A from *> its L*L' or U'*U factorization and computes the residual @@ -32,11 +32,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of *> L, and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/spbt02.f b/TESTING/LIN/spbt02.f index 144994ba..4f4a4ae7 100644 --- a/TESTING/LIN/spbt02.f +++ b/TESTING/LIN/spbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBT02( UPLO, N, KD, NRHS, A, LDA, X, LDX, B, LDB, * RWORK, RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBT02 computes the residual for a solution of a symmetric banded *> system of equations A*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS) *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,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/LIN/spbt05.f b/TESTING/LIN/spbt05.f index 8a0124c0..034c7a9b 100644 --- a/TESTING/LIN/spbt05.f +++ b/TESTING/LIN/spbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBT05( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/spot01.f b/TESTING/LIN/spot01.f index 5a0e5226..07c682ad 100644 --- a/TESTING/LIN/spot01.f +++ b/TESTING/LIN/spot01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOT01( UPLO, N, A, LDA, AFAC, LDAFAC, RWORK, RESID ) * @@ -19,22 +19,21 @@ * REAL A( LDA, * ), AFAC( LDAFAC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOT01 reconstructs a symmetric positive definite matrix A from *> its L*L' or U'*U factorization and computes the residual *> norm( L*L' - A ) / ( N * norm(A) * EPS ) or *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/spot02.f b/TESTING/LIN/spot02.f index e7694f56..e8d8718f 100644 --- a/TESTING/LIN/spot02.f +++ b/TESTING/LIN/spot02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOT02( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOT02 computes the residual for the solution of a symmetric system *> of linear equations A*x = b: @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/spot03.f b/TESTING/LIN/spot03.f index b0cd0f81..1e29094b 100644 --- a/TESTING/LIN/spot03.f +++ b/TESTING/LIN/spot03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOT03( UPLO, N, A, LDA, AINV, LDAINV, WORK, LDWORK, * RWORK, RCOND, RESID ) @@ -21,21 +21,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOT03 computes the residual for a symmetric matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> RESID is REAL *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/spot05.f b/TESTING/LIN/spot05.f index 04f7aa8b..b255a817 100644 --- a/TESTING/LIN/spot05.f +++ b/TESTING/LIN/spot05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOT05( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -148,10 +147,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sppt01.f b/TESTING/LIN/sppt01.f index ada465c9..c29f2638 100644 --- a/TESTING/LIN/sppt01.f +++ b/TESTING/LIN/sppt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPT01( UPLO, N, A, AFAC, RWORK, RESID ) * @@ -19,22 +19,21 @@ * REAL A( * ), AFAC( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPT01 reconstructs a symmetric positive definite packed matrix A *> from its L*L' or U'*U factorization and computes the residual *> norm( L*L' - A ) / ( N * norm(A) * EPS ) or *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -78,10 +77,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sppt02.f b/TESTING/LIN/sppt02.f index 323b056b..29641b04 100644 --- a/TESTING/LIN/sppt02.f +++ b/TESTING/LIN/sppt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPT02( UPLO, N, NRHS, A, X, LDX, B, LDB, RWORK, * RESID ) @@ -20,11 +20,11 @@ * REAL A( * ), B( LDB, * ), RWORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPT02 computes the residual in the solution of a symmetric system *> of linear equations A*x = b when packed storage is used for the @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS), *> *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +105,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/LIN/sppt03.f b/TESTING/LIN/sppt03.f index d2fe15d3..4806f6a5 100644 --- a/TESTING/LIN/sppt03.f +++ b/TESTING/LIN/sppt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPT03( UPLO, N, A, AINV, WORK, LDWORK, RWORK, RCOND, * RESID ) @@ -21,21 +21,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPT03 computes the residual for a symmetric packed matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is REAL *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sppt05.f b/TESTING/LIN/sppt05.f index d7f9cb8b..ce54be26 100644 --- a/TESTING/LIN/sppt05.f +++ b/TESTING/LIN/sppt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPT05( UPLO, N, NRHS, AP, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -140,10 +139,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/spst01.f b/TESTING/LIN/spst01.f index 01e4b690..d963fc84 100644 --- a/TESTING/LIN/spst01.f +++ b/TESTING/LIN/spst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPST01( UPLO, N, A, LDA, AFAC, LDAFAC, PERM, LDPERM, * PIV, RWORK, RESID, RANK ) @@ -22,11 +22,11 @@ * INTEGER PIV( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPST01 reconstructs a symmetric positive semidefinite matrix A *> from its L or U factors and the permutation matrix P and computes @@ -34,11 +34,10 @@ *> norm( P*L*L'*P' - A ) / ( N * norm(A) * EPS ) or *> norm( P*U'*U*P' - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -118,10 +117,9 @@ *> RANK is INTEGER *> number of nonzero singular values of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sptt01.f b/TESTING/LIN/sptt01.f index 928e23bd..f78b0973 100644 --- a/TESTING/LIN/sptt01.f +++ b/TESTING/LIN/sptt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTT01( N, D, E, DF, EF, WORK, RESID ) * @@ -18,21 +18,20 @@ * REAL D( * ), DF( * ), E( * ), EF( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTT01 reconstructs a tridiagonal matrix A from its L*D*L' *> factorization and computes the residual *> norm(L*D*L' - A) / ( n * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -76,10 +75,9 @@ *> RESID is REAL *> norm(L*D*L' - A) / (n * norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sptt02.f b/TESTING/LIN/sptt02.f index 5381c76c..ed8f1d6a 100644 --- a/TESTING/LIN/sptt02.f +++ b/TESTING/LIN/sptt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTT02( N, NRHS, D, E, X, LDX, B, LDB, RESID ) * @@ -18,21 +18,20 @@ * REAL B( LDB, * ), D( * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTT02 computes the residual for the solution to a symmetric *> tridiagonal system of equations: *> RESID = norm(B - A*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> RESID is REAL *> 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/LIN/sptt05.f b/TESTING/LIN/sptt05.f index 26ecf66b..8a533f66 100644 --- a/TESTING/LIN/sptt05.f +++ b/TESTING/LIN/sptt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTT05( N, NRHS, D, E, B, LDB, X, LDX, XACT, LDXACT, * FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -134,10 +133,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqlt01.f b/TESTING/LIN/sqlt01.f index 9056fc81..365bdf86 100644 --- a/TESTING/LIN/sqlt01.f +++ b/TESTING/LIN/sqlt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQLT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQLT01 tests SGEQLF, which computes the QL factorization of an m-by-n *> matrix A, and partially tests SORGQL which forms the m-by-m *> orthogonal matrix Q. *> *> SQLT01 compares L with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqlt02.f b/TESTING/LIN/sqlt02.f index 139346a9..6d59e3b8 100644 --- a/TESTING/LIN/sqlt02.f +++ b/TESTING/LIN/sqlt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQLT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQLT02 tests SORGQL, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> columns of A; it compares L(m-n+1:m,n-k+1:n) with *> Q(1:m,m-n+1:m)'*A(1:m,n-k+1:n), and checks that the columns of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqlt03.f b/TESTING/LIN/sqlt03.f index 2881f1bb..6cfb1ad8 100644 --- a/TESTING/LIN/sqlt03.f +++ b/TESTING/LIN/sqlt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQLT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQLT03 tests SORMQL, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> SQLT03 compares the results of a call to SORMQL with the results of *> forming Q explicitly by a call to SORGQL and then performing matrix *> multiplication by a call to SGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqpt01.f b/TESTING/LIN/sqpt01.f index 11d57dac..a2198e8d 100644 --- a/TESTING/LIN/sqpt01.f +++ b/TESTING/LIN/sqpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SQPT01( M, N, K, A, AF, LDA, TAU, JPVT, * WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQPT01 tests the QR-factorization with pivoting of a matrix A. The *> array AF contains the (possibly partial) QR-factorization of A, where @@ -34,11 +34,10 @@ *> matrix. *> *> This function returns ||A*P - Q*R||/(||norm(A)||*eps*M) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -104,10 +103,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*N+N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt01.f b/TESTING/LIN/sqrt01.f index 5808ceb7..89a7ea20 100644 --- a/TESTING/LIN/sqrt01.f +++ b/TESTING/LIN/sqrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT01 tests SGEQRF, which computes the QR factorization of an m-by-n *> matrix A, and partially tests SORGQR which forms the m-by-m *> orthogonal matrix Q. *> *> SQRT01 compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt01p.f b/TESTING/LIN/sqrt01p.f index 81c08996..ff215a98 100644 --- a/TESTING/LIN/sqrt01p.f +++ b/TESTING/LIN/sqrt01p.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT01P( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT01P tests SGEQRFP, which computes the QR factorization of an m-by-n *> matrix A, and partially tests SORGQR which forms the m-by-m *> orthogonal matrix Q. *> *> SQRT01P compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt02.f b/TESTING/LIN/sqrt02.f index 52e8e23a..6449d68f 100644 --- a/TESTING/LIN/sqrt02.f +++ b/TESTING/LIN/sqrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT02 tests SORGQR, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> columns of A; it compares R(1:n,1:k) with Q(1:m,1:n)'*A(1:m,1:k), *> and checks that the columns of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt03.f b/TESTING/LIN/sqrt03.f index a7ff1395..8ee6783b 100644 --- a/TESTING/LIN/sqrt03.f +++ b/TESTING/LIN/sqrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT03 tests SORMQR, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> SQRT03 compares the results of a call to SORMQR with the results of *> forming Q explicitly by a call to SORGQR and then performing matrix *> multiplication by a call to SGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt04.f b/TESTING/LIN/sqrt04.f index 402de36e..8dec71dd 100644 --- a/TESTING/LIN/sqrt04.f +++ b/TESTING/LIN/sqrt04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT04(M,N,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * REAL RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SQRT04 tests SGEQRT and SGEMQRT. +*> \verbatim *> -*>\endverbatim +*> SQRT04 tests SGEQRT and SGEMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -58,10 +57,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt05.f b/TESTING/LIN/sqrt05.f index 6997b36b..d6331336 100644 --- a/TESTING/LIN/sqrt05.f +++ b/TESTING/LIN/sqrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT05(M,N,L,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * REAL RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SQRT05 tests STPQRT and STPMQRT. +*> \verbatim *> -*>\endverbatim +*> SQRT05 tests STPQRT and STPMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -65,10 +64,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt11.f b/TESTING/LIN/sqrt11.f index db37b43d..b089e035 100644 --- a/TESTING/LIN/sqrt11.f +++ b/TESTING/LIN/sqrt11.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SQRT11( M, K, A, LDA, TAU, WORK, LWORK ) * @@ -17,11 +17,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT11 computes the test ratio *> @@ -35,11 +35,10 @@ *> where tau(k) is stored in TAU(k) and v(k) is an m-vector of the form *> [ 0 ... 0 1 x(k) ]', where x(k) is a vector of length m-k stored *> in A(k+1:m,k). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -83,10 +82,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*M + M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt12.f b/TESTING/LIN/sqrt12.f index bdc48076..76a3078b 100644 --- a/TESTING/LIN/sqrt12.f +++ b/TESTING/LIN/sqrt12.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SQRT12( M, N, A, LDA, S, WORK, LWORK ) * @@ -17,21 +17,20 @@ * REAL A( LDA, * ), S( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT12 computes the singular values `svlues' of the upper trapezoid *> of A(1:M,1:N) and returns the ratio *> *> || s - svlues||/(||svlues||*eps*max(M,N)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -74,10 +73,9 @@ *> The length of the array WORK. LWORK >= max(M*N + 4*min(M,N) + *> max(M,N), M*N+2*MIN( M, N )+4*N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt13.f b/TESTING/LIN/sqrt13.f index dbf805bc..7fa1ec8b 100644 --- a/TESTING/LIN/sqrt13.f +++ b/TESTING/LIN/sqrt13.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT13( SCALE, M, N, A, LDA, NORMA, ISEED ) * @@ -19,19 +19,18 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT13 generates a full-rank matrix that may be scaled to have large *> or small norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -76,10 +75,9 @@ *> ISEED is integer array, dimension (4) *> Seed for random number generator *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt14.f b/TESTING/LIN/sqrt14.f index 25685b78..62330a1c 100644 --- a/TESTING/LIN/sqrt14.f +++ b/TESTING/LIN/sqrt14.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SQRT14( TRANS, M, N, NRHS, A, LDA, X, * LDX, WORK, LWORK ) @@ -19,11 +19,11 @@ * REAL A( LDA, * ), WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT14 checks whether X is in the row space of A or A'. It does so *> by scaling both X and A such that their norms are in the range @@ -31,11 +31,10 @@ *> (if TRANS = 'T') or an LQ factorization of [A',X]' (if TRANS = 'N'), *> and returning the norm of the trailing triangle, scaled by *> MAX(M,N,NRHS)*eps. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -100,10 +99,9 @@ *> If TRANS = 'N', LWORK >= (M+NRHS)*(N+2); *> if TRANS = 'T', LWORK >= (N+NRHS)*(M+2). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt15.f b/TESTING/LIN/sqrt15.f index 41c3a348..bdb16252 100644 --- a/TESTING/LIN/sqrt15.f +++ b/TESTING/LIN/sqrt15.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT15( SCALE, RKSEL, M, N, NRHS, A, LDA, B, LDB, S, * RANK, NORMA, NORMB, ISEED, WORK, LWORK ) @@ -20,19 +20,18 @@ * REAL A( LDA, * ), B( LDB, * ), S( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT15 generates a matrix with full or deficient rank and of various *> norms. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -132,10 +131,9 @@ *> length of work space required. *> LWORK >= MAX(M+MIN(M,N),NRHS*MIN(M,N),2*N+M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt16.f b/TESTING/LIN/sqrt16.f index 0d15b87e..be4b2bd6 100644 --- a/TESTING/LIN/sqrt16.f +++ b/TESTING/LIN/sqrt16.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SQRT16( 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 *> *> SQRT16 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( max(m,n) * 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) / ( max(m,n) * norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sqrt17.f b/TESTING/LIN/sqrt17.f index 77c2e095..30a937df 100644 --- a/TESTING/LIN/sqrt17.f +++ b/TESTING/LIN/sqrt17.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SQRT17( TRANS, IRESID, M, N, NRHS, A, * LDA, X, LDX, B, LDB, C, WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SQRT17 computes the ratio *> @@ -34,11 +34,10 @@ *> *> alpha = ||B|| if IRESID = 1 (zero-residual problem) *> alpha = ||R|| if IRESID = 2 (otherwise). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -134,10 +133,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= NRHS*(M+N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/srqt01.f b/TESTING/LIN/srqt01.f index eccc744e..8822002d 100644 --- a/TESTING/LIN/srqt01.f +++ b/TESTING/LIN/srqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SRQT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SRQT01 tests SGERQF, which computes the RQ factorization of an m-by-n *> matrix A, and partially tests SORGRQ which forms the n-by-n *> orthogonal matrix Q. *> *> SRQT01 compares R with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/srqt02.f b/TESTING/LIN/srqt02.f index 80e725db..3300848a 100644 --- a/TESTING/LIN/srqt02.f +++ b/TESTING/LIN/srqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SRQT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SRQT02 tests SORGRQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> rows of A; it compares R(m-k+1:m,n-m+1:n) with *> A(m-k+1:m,1:n)*Q(n-m+1:n,1:n)', and checks that the rows of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/srqt03.f b/TESTING/LIN/srqt03.f index 9165763e..d21f8d40 100644 --- a/TESTING/LIN/srqt03.f +++ b/TESTING/LIN/srqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SRQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SRQT03 tests SORMRQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> SRQT03 compares the results of a call to SORMRQ with the results of *> forming Q explicitly by a call to SORGRQ and then performing matrix *> multiplication by a call to SGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/srzt01.f b/TESTING/LIN/srzt01.f index 725988aa..7dfa8bd3 100644 --- a/TESTING/LIN/srzt01.f +++ b/TESTING/LIN/srzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SRZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SRZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with STZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m*nb. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/srzt02.f b/TESTING/LIN/srzt02.f index a2c89c1c..79c22053 100644 --- a/TESTING/LIN/srzt02.f +++ b/TESTING/LIN/srzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SRZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * REAL AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SRZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by STZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> length of WORK array. LWORK >= N*N+N*NB. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/sspt01.f b/TESTING/LIN/sspt01.f index ddb38a95..d58eeb71 100644 --- a/TESTING/LIN/sspt01.f +++ b/TESTING/LIN/sspt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPT01( UPLO, N, A, AFAC, IPIV, C, LDC, RWORK, RESID ) * @@ -20,21 +20,20 @@ * REAL A( * ), AFAC( * ), C( LDC, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPT01 reconstructs a symmetric indefinite packed matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ssyt01.f b/TESTING/LIN/ssyt01.f index bce84e66..c0fc4a60 100644 --- a/TESTING/LIN/ssyt01.f +++ b/TESTING/LIN/ssyt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYT01( UPLO, N, A, LDA, AFAC, LDAFAC, IPIV, C, LDC, * RWORK, RESID ) @@ -22,21 +22,20 @@ * $ RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYT01 reconstructs a symmetric indefinite matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stbt02.f b/TESTING/LIN/stbt02.f index 20b76b73..96d4c188 100644 --- a/TESTING/LIN/stbt02.f +++ b/TESTING/LIN/stbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBT02( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, X, * LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b or A' *x = b when @@ -34,11 +34,10 @@ *> the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -138,10 +137,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stbt03.f b/TESTING/LIN/stbt03.f index 996712a7..1681a70f 100644 --- a/TESTING/LIN/stbt03.f +++ b/TESTING/LIN/stbt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBT03( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, * SCALE, CNORM, TSCAL, X, LDX, B, LDB, WORK, @@ -22,11 +22,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b or A'*x = s*b when A is a @@ -35,11 +35,10 @@ *> over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -158,10 +157,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stbt05.f b/TESTING/LIN/stbt05.f index dfd6b73f..6d2ac1e0 100644 --- a/TESTING/LIN/stbt05.f +++ b/TESTING/LIN/stbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBT05( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -173,10 +172,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stbt06.f b/TESTING/LIN/stbt06.f index 721a7213..c102c197 100644 --- a/TESTING/LIN/stbt06.f +++ b/TESTING/LIN/stbt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBT06( RCOND, RCONDC, UPLO, DIAG, N, KD, AB, LDAB, * WORK, RAT ) @@ -20,22 +20,21 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by STBCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -109,10 +108,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stpt01.f b/TESTING/LIN/stpt01.f index 47ec1bf6..158d0923 100644 --- a/TESTING/LIN/stpt01.f +++ b/TESTING/LIN/stpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPT01( UPLO, DIAG, N, AP, AINVP, RCOND, WORK, RESID ) * @@ -19,21 +19,20 @@ * REAL AINVP( * ), AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPT01 computes the residual for a triangular matrix A times its *> inverse when A is stored in packed format: *> RESID = norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,9 @@ *> RESID is REAL *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stpt02.f b/TESTING/LIN/stpt02.f index eda3c533..e4c48ba1 100644 --- a/TESTING/LIN/stpt02.f +++ b/TESTING/LIN/stpt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPT02( UPLO, TRANS, DIAG, N, NRHS, AP, X, LDX, B, LDB, * WORK, RESID ) @@ -20,11 +20,11 @@ * REAL AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b or A'*x = b when @@ -33,11 +33,10 @@ *> the maximum over the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stpt03.f b/TESTING/LIN/stpt03.f index 5e726cd6..17a8c84c 100644 --- a/TESTING/LIN/stpt03.f +++ b/TESTING/LIN/stpt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPT03( UPLO, TRANS, DIAG, N, NRHS, AP, SCALE, CNORM, * TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b or A'*x = s*b when the triangular @@ -34,11 +34,10 @@ *> the maximum over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -145,10 +144,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stpt05.f b/TESTING/LIN/stpt05.f index 58ca7d76..cea96058 100644 --- a/TESTING/LIN/stpt05.f +++ b/TESTING/LIN/stpt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPT05( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -158,10 +157,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stpt06.f b/TESTING/LIN/stpt06.f index 6a4b5104..4e655083 100644 --- a/TESTING/LIN/stpt06.f +++ b/TESTING/LIN/stpt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPT06( RCOND, RCONDC, UPLO, DIAG, N, AP, WORK, RAT ) * @@ -19,22 +19,21 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by STPCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -96,10 +95,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/strt01.f b/TESTING/LIN/strt01.f index f15c101f..d3f409b6 100644 --- a/TESTING/LIN/strt01.f +++ b/TESTING/LIN/strt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRT01( UPLO, DIAG, N, A, LDA, AINV, LDAINV, RCOND, * WORK, RESID ) @@ -20,21 +20,20 @@ * REAL A( LDA, * ), AINV( LDAINV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRT01 computes the residual for a triangular matrix A times its *> inverse: *> RESID = norm( A*AINV - I ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,9 @@ *> RESID is REAL *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/strt02.f b/TESTING/LIN/strt02.f index 67a602ee..4b304a2b 100644 --- a/TESTING/LIN/strt02.f +++ b/TESTING/LIN/strt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRT02( UPLO, TRANS, DIAG, N, NRHS, A, LDA, X, LDX, B, * LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b or A'*x = b. @@ -34,11 +34,10 @@ *> number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -134,10 +133,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/strt03.f b/TESTING/LIN/strt03.f index df8de5be..ad1aaede 100644 --- a/TESTING/LIN/strt03.f +++ b/TESTING/LIN/strt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRT03( UPLO, TRANS, DIAG, N, NRHS, A, LDA, SCALE, * CNORM, TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b or A'*x = s*b. @@ -34,11 +34,10 @@ *> maximum over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A or A' and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -153,10 +152,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/strt05.f b/TESTING/LIN/strt05.f index d6b55e05..c28a615f 100644 --- a/TESTING/LIN/strt05.f +++ b/TESTING/LIN/strt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRT05( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ RESLTS( * ), X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -38,11 +38,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,10 +164,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/strt06.f b/TESTING/LIN/strt06.f index b510724d..1e463dad 100644 --- a/TESTING/LIN/strt06.f +++ b/TESTING/LIN/strt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRT06( RCOND, RCONDC, UPLO, DIAG, N, A, LDA, WORK, * RAT ) @@ -20,22 +20,21 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by STRCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -105,10 +104,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stzt01.f b/TESTING/LIN/stzt01.f index 81044f39..428726e3 100644 --- a/TESTING/LIN/stzt01.f +++ b/TESTING/LIN/stzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION STZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with STZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/stzt02.f b/TESTING/LIN/stzt02.f index 65a9f8ac..8ab22abc 100644 --- a/TESTING/LIN/stzt02.f +++ b/TESTING/LIN/stzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION STZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * REAL AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by STZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> length of WORK array. Must be >= N*N+N *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/xerbla.f b/TESTING/LIN/xerbla.f index fcce9e6b..a404d015 100644 --- a/TESTING/LIN/xerbla.f +++ b/TESTING/LIN/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/LIN/xlaenv.f b/TESTING/LIN/xlaenv.f index 210e798b..b6e955bb 100644 --- a/TESTING/LIN/xlaenv.f +++ b/TESTING/LIN/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 @@ -63,10 +62,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/LIN/zchkaa.f b/TESTING/LIN/zchkaa.f index 9cca7566..0f822ff5 100644 --- a/TESTING/LIN/zchkaa.f +++ b/TESTING/LIN/zchkaa.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZCHKAA * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKAA is the main test program for the COMPLEX*16 linear equation *> routines. @@ -64,11 +64,10 @@ *> ZTZ 3 List types on next line if 0 < NTYPES < 3 *> ZLS 6 List types on next line if 0 < NTYPES < 6 *> ZEQ -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NMAX INTEGER @@ -87,10 +86,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,8 +99,7 @@ * *> \ingroup complex16_lin * -* ===================================================================== - PROGRAM ZCHKAA +* ===================================================================== PROGRAM ZCHKAA * * -- LAPACK test routine (version 3.1.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/zchkab.f b/TESTING/LIN/zchkab.f index 960b7728..e6b86245 100644 --- a/TESTING/LIN/zchkab.f +++ b/TESTING/LIN/zchkab.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZCHKAB * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKAB is the test program for the COMPLEX*16 LAPACK *> ZCGESV/ZCPOSV routine @@ -35,11 +35,10 @@ *> T Put T to test the error exits *> DGE 11 List types on next line if 0 < NTYPES < 11 *> DPO 9 List types on next line if 0 < NTYPES < 9 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> NMAX INTEGER @@ -58,10 +57,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -72,8 +70,7 @@ * *> \ingroup complex16_lin * -* ===================================================================== - PROGRAM ZCHKAB +* ===================================================================== PROGRAM ZCHKAB * * -- LAPACK test routine (version 3.2.1) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/zchkeq.f b/TESTING/LIN/zchkeq.f index 38c04a05..7900f0ae 100644 --- a/TESTING/LIN/zchkeq.f +++ b/TESTING/LIN/zchkeq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKEQ( THRESH, NOUT ) * @@ -15,18 +15,17 @@ * DOUBLE PRECISION THRESH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKEQ tests ZGEEQU, ZGBEQU, ZPOEQU, ZPPEQU and ZPBEQU +*> \verbatim *> -*>\endverbatim +*> ZCHKEQ tests ZGEEQU, ZGBEQU, ZPOEQU, ZPPEQU and ZPBEQU +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] THRESH *> \verbatim @@ -39,10 +38,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkgb.f b/TESTING/LIN/zchkgb.f index 0fd52d55..aef1157e 100644 --- a/TESTING/LIN/zchkgb.f +++ b/TESTING/LIN/zchkgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKGB( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, A, LA, AFAC, LAFAC, B, @@ -26,18 +26,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKGB tests ZGBTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKGB tests ZGBTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -174,10 +173,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkge.f b/TESTING/LIN/zchkge.f index 8d5d970d..e349e4a0 100644 --- a/TESTING/LIN/zchkge.f +++ b/TESTING/LIN/zchkge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKGE( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NNS, * NSVAL, THRESH, TSTERR, NMAX, A, AFAC, AINV, B, @@ -26,18 +26,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKGE tests ZGETRF, -TRI, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> ZCHKGE tests ZGETRF, -TRI, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -169,10 +168,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkgt.f b/TESTING/LIN/zchkgt.f index c261cfc0..ae7ec6c6 100644 --- a/TESTING/LIN/zchkgt.f +++ b/TESTING/LIN/zchkgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKGT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, AF, B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKGT tests ZGTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKGT tests ZGTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -131,10 +130,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkhe.f b/TESTING/LIN/zchkhe.f index 2d18772b..b5e3af16 100644 --- a/TESTING/LIN/zchkhe.f +++ b/TESTING/LIN/zchkhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKHE( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKHE tests ZHETRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> ZCHKHE tests ZHETRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -156,10 +155,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkhp.f b/TESTING/LIN/zchkhp.f index b3618a35..397cb02e 100644 --- a/TESTING/LIN/zchkhp.f +++ b/TESTING/LIN/zchkhp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKHP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKHP tests ZHPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKHP tests ZHPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchklq.f b/TESTING/LIN/zchklq.f index d537296a..a8a7aad8 100644 --- a/TESTING/LIN/zchklq.f +++ b/TESTING/LIN/zchklq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKLQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKLQ tests ZGELQF, ZUNGLQ and CUNMLQ. +*> \verbatim *> -*>\endverbatim +*> ZCHKLQ tests ZGELQF, ZUNGLQ and CUNMLQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkpb.f b/TESTING/LIN/zchkpb.f index e2b23b2f..7221e7da 100644 --- a/TESTING/LIN/zchkpb.f +++ b/TESTING/LIN/zchkpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKPB( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKPB tests ZPBTRF, -TRS, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> ZCHKPB tests ZPBTRF, -TRS, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -151,10 +150,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkpo.f b/TESTING/LIN/zchkpo.f index cf32b065..17500534 100644 --- a/TESTING/LIN/zchkpo.f +++ b/TESTING/LIN/zchkpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKPO( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKPO tests ZPOTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKPO tests ZPOTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -151,10 +150,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkpp.f b/TESTING/LIN/zchkpp.f index cc27555a..4c647a87 100644 --- a/TESTING/LIN/zchkpp.f +++ b/TESTING/LIN/zchkpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKPP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKPP tests ZPPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKPP tests ZPPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkps.f b/TESTING/LIN/zchkps.f index 110c51e1..f721ecfa 100644 --- a/TESTING/LIN/zchkps.f +++ b/TESTING/LIN/zchkps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKPS( DOTYPE, NN, NVAL, NNB, NBVAL, NRANK, RANKVAL, * THRESH, TSTERR, NMAX, A, AFAC, PERM, PIV, WORK, @@ -24,18 +24,17 @@ * LOGICAL DOTYPE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKPS tests ZPSTRF. +*> \verbatim *> -*>\endverbatim +*> ZCHKPS tests ZPSTRF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkpt.f b/TESTING/LIN/zchkpt.f index b7a45fa8..b819aa8a 100644 --- a/TESTING/LIN/zchkpt.f +++ b/TESTING/LIN/zchkpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKPT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * A, D, E, B, X, XACT, WORK, RWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKPT tests ZPTTRF, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKPT tests ZPTTRF, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -131,10 +130,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkq3.f b/TESTING/LIN/zchkq3.f index 35fc8ce7..6251f397 100644 --- a/TESTING/LIN/zchkq3.f +++ b/TESTING/LIN/zchkq3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKQ3( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * THRESH, A, COPYA, S, TAU, WORK, RWORK, @@ -24,18 +24,17 @@ * COMPLEX*16 A( * ), COPYA( * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKQ3 tests ZGEQP3. +*> \verbatim *> -*>\endverbatim +*> ZCHKQ3 tests ZGEQP3. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -141,10 +140,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkql.f b/TESTING/LIN/zchkql.f index 76420c1b..512398ef 100644 --- a/TESTING/LIN/zchkql.f +++ b/TESTING/LIN/zchkql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKQL( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AL, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKQL tests ZGEQLF, ZUNGQL and CUNMQL. +*> \verbatim *> -*>\endverbatim +*> ZCHKQL tests ZGEQLF, ZUNGQL and CUNMQL. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -179,10 +178,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkqp.f b/TESTING/LIN/zchkqp.f index 7c5b4aed..052a3e9e 100644 --- a/TESTING/LIN/zchkqp.f +++ b/TESTING/LIN/zchkqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKQP( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, RWORK, IWORK, @@ -24,18 +24,17 @@ * COMPLEX*16 A( * ), COPYA( * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKQP tests ZGEQPF. +*> \verbatim *> -*>\endverbatim +*> ZCHKQP tests ZGEQPF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -127,10 +126,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkqr.f b/TESTING/LIN/zchkqr.f index d5f5d03e..9ebed682 100644 --- a/TESTING/LIN/zchkqr.f +++ b/TESTING/LIN/zchkqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKQR( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKQR tests ZGEQRF, ZUNGQR and CUNMQR. +*> \verbatim *> -*>\endverbatim +*> ZCHKQR tests ZGEQRF, ZUNGQR and CUNMQR. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchkrfp.f b/TESTING/LIN/zchkrfp.f index 3b4c382a..d963c4d3 100644 --- a/TESTING/LIN/zchkrfp.f +++ b/TESTING/LIN/zchkrfp.f @@ -5,25 +5,24 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZCHKRFP * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCHKRFP is the main test program for the COMPLEX*16 linear equation *> routines with RFP storage format *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> MAXIN INTEGER @@ -44,10 +43,9 @@ *> NOUT INTEGER *> The unit number for output *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -58,8 +56,7 @@ * *> \ingroup complex16_lin * -* ===================================================================== - PROGRAM ZCHKRFP +* ===================================================================== PROGRAM ZCHKRFP * * -- LAPACK test routine (version 3.2.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/zchkrq.f b/TESTING/LIN/zchkrq.f index 9fa1d42f..b1622e92 100644 --- a/TESTING/LIN/zchkrq.f +++ b/TESTING/LIN/zchkrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKRQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL, * NRHS, THRESH, TSTERR, NMAX, A, AF, AQ, AR, AC, @@ -26,18 +26,17 @@ * $ B( * ), TAU( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKRQ tests ZGERQF, ZUNGRQ and CUNMRQ. +*> \verbatim *> -*>\endverbatim +*> ZCHKRQ tests ZGERQF, ZUNGRQ and CUNMRQ. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -184,10 +183,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchksp.f b/TESTING/LIN/zchksp.f index 9ea060a4..8a8640f2 100644 --- a/TESTING/LIN/zchksp.f +++ b/TESTING/LIN/zchksp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKSP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, A, AFAC, AINV, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKSP tests ZSPTRF, -TRI, -TRS, -RFS, and -CON +*> \verbatim *> -*>\endverbatim +*> ZCHKSP tests ZSPTRF, -TRI, -TRS, -RFS, and -CON +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchksy.f b/TESTING/LIN/zchksy.f index d985b7e1..d2161452 100644 --- a/TESTING/LIN/zchksy.f +++ b/TESTING/LIN/zchksy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKSY( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AFAC, AINV, B, X, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKSY tests ZSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \verbatim *> -*>\endverbatim +*> ZCHKSY tests ZSYTRF, -TRI2, -TRS, -TRS2, -RFS, and -CON. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -156,10 +155,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchktb.f b/TESTING/LIN/zchktb.f index 88f7333d..c44f55ea 100644 --- a/TESTING/LIN/zchktb.f +++ b/TESTING/LIN/zchktb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKTB( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AB, AINV, B, X, XACT, WORK, RWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKTB tests ZTBTRS, -RFS, and -CON, and ZLATBS. +*> \verbatim *> -*>\endverbatim +*> ZCHKTB tests ZTBTRS, -RFS, and -CON, and ZLATBS. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -133,10 +132,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchktp.f b/TESTING/LIN/zchktp.f index 04aa67a6..f3d352c1 100644 --- a/TESTING/LIN/zchktp.f +++ b/TESTING/LIN/zchktp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKTP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR, * NMAX, AP, AINVP, B, X, XACT, WORK, RWORK, @@ -25,18 +25,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKTP tests ZTPTRI, -TRS, -RFS, and -CON, and ZLATPS +*> \verbatim *> -*>\endverbatim +*> ZCHKTP tests ZTPTRI, -TRS, -RFS, and -CON, and ZLATPS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -134,10 +133,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchktr.f b/TESTING/LIN/zchktr.f index 16fb8ed3..06432b78 100644 --- a/TESTING/LIN/zchktr.f +++ b/TESTING/LIN/zchktr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKTR( DOTYPE, NN, NVAL, NNB, NBVAL, NNS, NSVAL, * THRESH, TSTERR, NMAX, A, AINV, B, X, XACT, @@ -25,18 +25,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKTR tests ZTRTRI, -TRS, -RFS, and -CON, and ZLATRS +*> \verbatim *> -*>\endverbatim +*> ZCHKTR tests ZTRTRI, -TRS, -RFS, and -CON, and ZLATRS +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -146,10 +145,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zchktz.f b/TESTING/LIN/zchktz.f index a8810f9f..58e7b322 100644 --- a/TESTING/LIN/zchktz.f +++ b/TESTING/LIN/zchktz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCHKTZ( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR, A, * COPYA, S, TAU, WORK, RWORK, NOUT ) @@ -23,18 +23,17 @@ * COMPLEX*16 A( * ), COPYA( * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCHKTZ tests ZTZRQF and ZTZRZF. +*> \verbatim *> -*>\endverbatim +*> ZCHKTZ tests ZTZRQF and ZTZRZF. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -121,10 +120,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvab.f b/TESTING/LIN/zdrvab.f index 4bbe1aed..9be9ff57 100644 --- a/TESTING/LIN/zdrvab.f +++ b/TESTING/LIN/zdrvab.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVAB( DOTYPE, NM, MVAL, NNS, * NSVAL, THRESH, NMAX, A, AFAC, B, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVAB tests ZCGESV +*> \verbatim *> -*>\endverbatim +*> ZDRVAB tests ZCGESV +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -135,10 +134,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvac.f b/TESTING/LIN/zdrvac.f index d528cd18..8d14b188 100644 --- a/TESTING/LIN/zdrvac.f +++ b/TESTING/LIN/zdrvac.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVAC( DOTYPE, NM, MVAL, NNS, NSVAL, THRESH, NMAX, * A, AFAC, B, X, WORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVAC tests ZCPOSV. +*> \verbatim *> -*>\endverbatim +*> ZDRVAC tests ZCPOSV. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -128,10 +127,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvgb.f b/TESTING/LIN/zdrvgb.f index 9adea836..c2b93c5d 100644 --- a/TESTING/LIN/zdrvgb.f +++ b/TESTING/LIN/zdrvgb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVGB tests the driver routines ZGBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVGB tests the driver routines ZGBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -155,10 +154,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvgbx.f b/TESTING/LIN/zdrvgbx.f index 085ff4a5..4ed2ad37 100644 --- a/TESTING/LIN/zdrvgbx.f +++ b/TESTING/LIN/zdrvgbx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, LA, * AFB, LAFB, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVGB tests the driver routines ZGBSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zdrvgb.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -158,10 +157,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvge.f b/TESTING/LIN/zdrvge.f index 5e101348..f8d2eaa8 100644 --- a/TESTING/LIN/zdrvge.f +++ b/TESTING/LIN/zdrvge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVGE tests the driver routines ZGESV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVGE tests the driver routines ZGESV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -147,10 +146,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvgex.f b/TESTING/LIN/zdrvgex.f index 0b016572..042a2228 100644 --- a/TESTING/LIN/zdrvgex.f +++ b/TESTING/LIN/zdrvgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVGE tests the driver routines ZGESV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zdrvge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -150,10 +149,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvgt.f b/TESTING/LIN/zdrvgt.f index debecad2..0bca988e 100644 --- a/TESTING/LIN/zdrvgt.f +++ b/TESTING/LIN/zdrvgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVGT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, AF, * B, X, XACT, WORK, RWORK, IWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVGT tests ZGTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVGT tests ZGTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -123,10 +122,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvhe.f b/TESTING/LIN/zdrvhe.f index 0bbc1217..aecd807f 100644 --- a/TESTING/LIN/zdrvhe.f +++ b/TESTING/LIN/zdrvhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVHE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVHE tests the driver routines ZHESV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVHE tests the driver routines ZHESV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvhex.f b/TESTING/LIN/zdrvhex.f index 00d07d04..a9475384 100644 --- a/TESTING/LIN/zdrvhex.f +++ b/TESTING/LIN/zdrvhex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVHE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,21 +25,20 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVHE tests the driver routines ZHESV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zdrvhe.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvhp.f b/TESTING/LIN/zdrvhp.f index db261774..5f662c5d 100644 --- a/TESTING/LIN/zdrvhp.f +++ b/TESTING/LIN/zdrvhp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVHP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVHP tests the driver routines ZHPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVHP tests the driver routines ZHPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvls.f b/TESTING/LIN/zdrvls.f index a7455530..08f73a72 100644 --- a/TESTING/LIN/zdrvls.f +++ b/TESTING/LIN/zdrvls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVLS( DOTYPE, NM, MVAL, NN, NVAL, NNS, NSVAL, NNB, * NBVAL, NXVAL, THRESH, TSTERR, A, COPYA, B, @@ -26,19 +26,18 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVLS tests the least squares driver routines ZGELS, CGELSX, CGELSS, *> ZGELSY and CGELSD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -192,10 +191,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvpb.f b/TESTING/LIN/zdrvpb.f index 0ea61fb7..9e89ba0b 100644 --- a/TESTING/LIN/zdrvpb.f +++ b/TESTING/LIN/zdrvpb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVPB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVPB tests the driver routines ZPBSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVPB tests the driver routines ZPBSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvpo.f b/TESTING/LIN/zdrvpo.f index fb62dc74..5398a40a 100644 --- a/TESTING/LIN/zdrvpo.f +++ b/TESTING/LIN/zdrvpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVPO tests the driver routines ZPOSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVPO tests the driver routines ZPOSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvpox.f b/TESTING/LIN/zdrvpox.f index 3207a061..8e21e9bf 100644 --- a/TESTING/LIN/zdrvpox.f +++ b/TESTING/LIN/zdrvpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,21 +25,20 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVPO tests the driver routines ZPOSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zdrvpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -145,10 +144,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvpp.f b/TESTING/LIN/zdrvpp.f index 2299e4f4..38b7129d 100644 --- a/TESTING/LIN/zdrvpp.f +++ b/TESTING/LIN/zdrvpp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVPP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, ASAV, B, BSAV, X, XACT, S, WORK, @@ -25,18 +25,17 @@ * $ BSAV( * ), WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVPP tests the driver routines ZPPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVPP tests the driver routines ZPPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -142,10 +141,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvpt.f b/TESTING/LIN/zdrvpt.f index d9ffa4ae..1f91d246 100644 --- a/TESTING/LIN/zdrvpt.f +++ b/TESTING/LIN/zdrvpt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, D, * E, B, X, XACT, WORK, RWORK, NOUT ) @@ -24,18 +24,17 @@ * $ XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVPT tests ZPTSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVPT tests ZPTSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -124,10 +123,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvrf1.f b/TESTING/LIN/zdrvrf1.f index 18533d75..529c0a28 100644 --- a/TESTING/LIN/zdrvrf1.f +++ b/TESTING/LIN/zdrvrf1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVRF1( NOUT, NN, NVAL, THRESH, A, LDA, ARF, WORK ) * @@ -20,19 +20,18 @@ * COMPLEX*16 A( LDA, * ), ARF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVRF1 tests the LAPACK RFP routines: *> ZLANHF.F -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -80,10 +79,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvrf2.f b/TESTING/LIN/zdrvrf2.f index c6c0f200..5b50ebb2 100644 --- a/TESTING/LIN/zdrvrf2.f +++ b/TESTING/LIN/zdrvrf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVRF2( NOUT, NN, NVAL, A, LDA, ARF, AP, ASAV ) * @@ -18,18 +18,17 @@ * COMPLEX*16 A( LDA, * ), ARF( * ), AP(*), ASAV( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVRF2 tests the LAPACK RFP convertion routines. +*> \verbatim *> -*>\endverbatim +*> ZDRVRF2 tests the LAPACK RFP convertion routines. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -74,10 +73,9 @@ *> \verbatim *> ASAV is COMPLEX*16 array, dimension (LDA,NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvrf3.f b/TESTING/LIN/zdrvrf3.f index 7cff3319..b85456cb 100644 --- a/TESTING/LIN/zdrvrf3.f +++ b/TESTING/LIN/zdrvrf3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVRF3( NOUT, NN, NVAL, THRESH, A, LDA, ARF, B1, B2, * + D_WORK_ZLANGE, Z_WORK_ZGEQRF, TAU ) @@ -23,19 +23,18 @@ * COMPLEX*16 Z_WORK_ZGEQRF( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVRF3 tests the LAPACK RFP routines: *> ZTFSM -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -103,10 +102,9 @@ *> \verbatim *> TAU is COMPLEX*16 array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvrf4.f b/TESTING/LIN/zdrvrf4.f index 8e9d5ac5..2600b0b9 100644 --- a/TESTING/LIN/zdrvrf4.f +++ b/TESTING/LIN/zdrvrf4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVRF4( NOUT, NN, NVAL, THRESH, C1, C2, LDC, CRF, A, * + LDA, D_WORK_ZLANGE ) @@ -22,19 +22,18 @@ * + CRF( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVRF4 tests the LAPACK RFP routines: *> ZHFRK -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -98,10 +97,9 @@ *> \verbatim *> D_WORK_ZLANGE is DOUBLE PRECISION array, dimension (NMAX) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvrfp.f b/TESTING/LIN/zdrvrfp.f index 3ced47fe..50cebc7d 100644 --- a/TESTING/LIN/zdrvrfp.f +++ b/TESTING/LIN/zdrvrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVRFP( NOUT, NN, NVAL, NNS, NSVAL, NNT, NTVAL, * + THRESH, A, ASAV, AFAC, AINV, B, @@ -41,11 +41,11 @@ * DOUBLE PRECISION D_WORK_ZPOT03( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVRFP tests the LAPACK RFP routines: *> ZPFTRF, ZPFTRS, and ZPFTRI. @@ -79,11 +79,10 @@ *> norm( . ) the 1-norm for (1,2,3) and the inf-norm for (4). *> Errors occur when INFO parameter is not as expected. Failures occur when *> a test ratios is greater than THRES. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NOUT *> \verbatim @@ -224,10 +223,9 @@ *> \verbatim *> D_WORK_ZPOT03 is DOUBLE PRECISION array, dimension ( NMAX ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvsp.f b/TESTING/LIN/zdrvsp.f index 497a6e7e..7fcca091 100644 --- a/TESTING/LIN/zdrvsp.f +++ b/TESTING/LIN/zdrvsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVSP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVSP tests the driver routines ZSPSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVSP tests the driver routines ZSPSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvsy.f b/TESTING/LIN/zdrvsy.f index 6432e502..976ac6b3 100644 --- a/TESTING/LIN/zdrvsy.f +++ b/TESTING/LIN/zdrvsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,18 +25,17 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDRVSY tests the driver routines ZSYSV and -SVX. +*> \verbatim *> -*>\endverbatim +*> ZDRVSY tests the driver routines ZSYSV and -SVX. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -137,10 +136,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zdrvsyx.f b/TESTING/LIN/zdrvsyx.f index 9a1be837..98759e5d 100644 --- a/TESTING/LIN/zdrvsyx.f +++ b/TESTING/LIN/zdrvsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, NMAX, * A, AFAC, AINV, B, X, XACT, WORK, RWORK, IWORK, @@ -25,21 +25,20 @@ * $ WORK( * ), X( * ), XACT( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRVSY tests the driver routines ZSYSV, -SVX, and -SVXX. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zdrvsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DOTYPE *> \verbatim @@ -140,10 +139,9 @@ *> NOUT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zebchvxx.f b/TESTING/LIN/zebchvxx.f index 3410f067..9b955633 100644 --- a/TESTING/LIN/zebchvxx.f +++ b/TESTING/LIN/zebchvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZEBCHVXX( THRESH, PATH ) * @@ -18,8 +18,9 @@ * Purpose * ====== * -*>\details \b Purpose: -*>\verbatim +*> \details \b Purpose: +*> \verbatim +*> *> ZEBCHVXX will run Z**SVXX on a series of Hilbert matrices and then *> compare the error bounds returned by Z**SVXX to see if the returned *> answer indeed falls within those bounds. @@ -79,10 +80,9 @@ *> type used plus one, which is 24 for single precision. *> NMAX should be 6 for single and 11 for double. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zerrab.f b/TESTING/LIN/zerrab.f index 04dab879..60f132b2 100644 --- a/TESTING/LIN/zerrab.f +++ b/TESTING/LIN/zerrab.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRAB( NUNIT ) * @@ -14,28 +14,26 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DERRAB tests the error exits for ZCGESV. +*> \verbatim *> -*>\endverbatim +*> DERRAB tests the error exits for ZCGESV. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zerrac.f b/TESTING/LIN/zerrac.f index bec4d411..9666a4c8 100644 --- a/TESTING/LIN/zerrac.f +++ b/TESTING/LIN/zerrac.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRAC( NUNIT ) * @@ -14,28 +14,26 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZERRPX tests the error exits for ZCPOSV. +*> \verbatim *> -*>\endverbatim +*> ZERRPX tests the error exits for ZCPOSV. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zerrge.f b/TESTING/LIN/zerrge.f index 645bf9f3..9d6a269e 100644 --- a/TESTING/LIN/zerrge.f +++ b/TESTING/LIN/zerrge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRGE( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRGE tests the error exits for the COMPLEX*16 routines *> for general matrices. -*> -*>\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/LIN/zerrgex.f b/TESTING/LIN/zerrgex.f index 4c84b2bd..75fc82b4 100644 --- a/TESTING/LIN/zerrgex.f +++ b/TESTING/LIN/zerrgex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRGE( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRGE tests the error exits for the COMPLEX*16 routines *> for general matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zerrge.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/zerrgt.f b/TESTING/LIN/zerrgt.f index 253087ea..1e5c9dbc 100644 --- a/TESTING/LIN/zerrgt.f +++ b/TESTING/LIN/zerrgt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRGT( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRGT tests the error exits for the COMPLEX*16 tridiagonal *> routines. -*> -*>\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/LIN/zerrhe.f b/TESTING/LIN/zerrhe.f index 442bb29a..f354512c 100644 --- a/TESTING/LIN/zerrhe.f +++ b/TESTING/LIN/zerrhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRHE( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRHE tests the error exits for the COMPLEX*16 routines *> for Hermitian indefinite matrices. -*> -*>\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/LIN/zerrhex.f b/TESTING/LIN/zerrhex.f index 98f6cbff..4380f863 100644 --- a/TESTING/LIN/zerrhex.f +++ b/TESTING/LIN/zerrhex.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRHE( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRHE tests the error exits for the COMPLEX*16 routines *> for Hermitian indefinite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zerrhe.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/zerrlq.f b/TESTING/LIN/zerrlq.f index 128c71d1..67a6622e 100644 --- a/TESTING/LIN/zerrlq.f +++ b/TESTING/LIN/zerrlq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRLQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRLQ tests the error exits for the COMPLEX*16 routines *> that use the LQ decomposition of a general matrix. -*> -*>\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/LIN/zerrls.f b/TESTING/LIN/zerrls.f index f11f6d6e..3824eb0f 100644 --- a/TESTING/LIN/zerrls.f +++ b/TESTING/LIN/zerrls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRLS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRLS tests the error exits for the COMPLEX*16 least squares *> driver routines (ZGELS, CGELSS, CGELSX, CGELSY, CGELSD). -*> -*>\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/LIN/zerrpo.f b/TESTING/LIN/zerrpo.f index ef18ad92..77dce6bf 100644 --- a/TESTING/LIN/zerrpo.f +++ b/TESTING/LIN/zerrpo.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRPO( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRPO tests the error exits for the COMPLEX*16 routines *> for Hermitian positive definite matrices. -*> -*>\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/LIN/zerrpox.f b/TESTING/LIN/zerrpox.f index 346021b2..506883ae 100644 --- a/TESTING/LIN/zerrpox.f +++ b/TESTING/LIN/zerrpox.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRPO( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRPO tests the error exits for the COMPLEX*16 routines *> for Hermitian positive definite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zerrpo.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/zerrps.f b/TESTING/LIN/zerrps.f index 8ded02b7..d7a6aa0c 100644 --- a/TESTING/LIN/zerrps.f +++ b/TESTING/LIN/zerrps.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRPS( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRPS tests the error exits for the COMPLEX routines *> for ZPSTRF. -*> -*>\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/LIN/zerrql.f b/TESTING/LIN/zerrql.f index 3cfba85f..228b5a9f 100644 --- a/TESTING/LIN/zerrql.f +++ b/TESTING/LIN/zerrql.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRQL( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRQL tests the error exits for the COMPLEX*16 routines *> that use the QL decomposition of a general matrix. -*> -*>\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/LIN/zerrqp.f b/TESTING/LIN/zerrqp.f index 1cbf4bf2..44e592c1 100644 --- a/TESTING/LIN/zerrqp.f +++ b/TESTING/LIN/zerrqp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRQP( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZERRQP tests the error exits for ZGEQPF and CGEQP3. +*> \verbatim *> -*>\endverbatim +*> ZERRQP tests the error exits for ZGEQPF and CGEQP3. +*> \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/LIN/zerrqr.f b/TESTING/LIN/zerrqr.f index 4a20da54..1cc19755 100644 --- a/TESTING/LIN/zerrqr.f +++ b/TESTING/LIN/zerrqr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRQR( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRQR tests the error exits for the COMPLEX*16 routines *> that use the QR decomposition of a general matrix. -*> -*>\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/LIN/zerrrfp.f b/TESTING/LIN/zerrrfp.f index 3efda27d..b8bba408 100644 --- a/TESTING/LIN/zerrrfp.f +++ b/TESTING/LIN/zerrrfp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRRFP( NUNIT ) * @@ -14,11 +14,11 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRRFP tests the error exits for the COMPLEX*16 driver routines *> for solving linear systems of equations. @@ -26,21 +26,19 @@ *> ZDRVRFP tests the COMPLEX*16 LAPACK RFP routines: *> ZTFSM, ZTFTRI, ZHFRK, ZTFTTP, ZTFTTR, ZPFTRF, ZPFTRS, ZTPTTF, *> ZTPTTR, ZTRTTF, and ZTRTTP -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NUNIT *> \verbatim *> NUNIT is INTEGER *> The unit number for output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zerrrq.f b/TESTING/LIN/zerrrq.f index d5a1c1b3..16815852 100644 --- a/TESTING/LIN/zerrrq.f +++ b/TESTING/LIN/zerrrq.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRRQ( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRRQ tests the error exits for the COMPLEX*16 routines *> that use the RQ decomposition of a general matrix. -*> -*>\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/LIN/zerrsy.f b/TESTING/LIN/zerrsy.f index 4a3520ed..f5515db4 100644 --- a/TESTING/LIN/zerrsy.f +++ b/TESTING/LIN/zerrsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRSY( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRSY tests the error exits for the COMPLEX*16 routines *> for symmetric indefinite matrices. -*> -*>\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/LIN/zerrsyx.f b/TESTING/LIN/zerrsyx.f index 0766e847..8c71a4c3 100644 --- a/TESTING/LIN/zerrsyx.f +++ b/TESTING/LIN/zerrsyx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRSY( PATH, NUNIT ) * @@ -15,22 +15,21 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRSY tests the error exits for the COMPLEX*16 routines *> for symmetric indefinite matrices. *> *> Note that this file is used only when the XBLAS are available, *> otherwise zerrsy.f defines this subroutine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -43,10 +42,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/LIN/zerrtr.f b/TESTING/LIN/zerrtr.f index c0e71fe4..b05eaa34 100644 --- a/TESTING/LIN/zerrtr.f +++ b/TESTING/LIN/zerrtr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRTR( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZERRTR tests the error exits for the COMPLEX*16 triangular routines. +*> \verbatim *> -*>\endverbatim +*> ZERRTR tests the error exits for the COMPLEX*16 triangular routines. +*> \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/LIN/zerrtz.f b/TESTING/LIN/zerrtz.f index d2b30ce7..1cda22f1 100644 --- a/TESTING/LIN/zerrtz.f +++ b/TESTING/LIN/zerrtz.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRTZ( PATH, NUNIT ) * @@ -15,18 +15,17 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZERRTZ tests the error exits for ZTZRQF and ZTZRZF. +*> \verbatim *> -*>\endverbatim +*> ZERRTZ tests the error exits for ZTZRQF and ZTZRZF. +*> \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/LIN/zerrvx.f b/TESTING/LIN/zerrvx.f index 0f1c5f40..463e03e2 100644 --- a/TESTING/LIN/zerrvx.f +++ b/TESTING/LIN/zerrvx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRVX tests the error exits for the COMPLEX*16 driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/zerrvxx.f b/TESTING/LIN/zerrvxx.f index 4221665f..9eb86a9c 100644 --- a/TESTING/LIN/zerrvxx.f +++ b/TESTING/LIN/zerrvxx.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZERRVX( PATH, NUNIT ) * @@ -15,19 +15,18 @@ * INTEGER NUNIT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZERRVX tests the error exits for the COMPLEX*16 driver routines *> for solving linear systems of equations. -*> -*>\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/LIN/zgbt01.f b/TESTING/LIN/zgbt01.f index 41a61e5e..5ad7b747 100644 --- a/TESTING/LIN/zgbt01.f +++ b/TESTING/LIN/zgbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBT01( M, N, KL, KU, A, LDA, AFAC, LDAFAC, IPIV, WORK, * RESID ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBT01 reconstructs a band matrix A from its L*U factorization and *> computes the residual: @@ -33,11 +33,10 @@ *> *> The expression L*U - A is computed one column at a time, so A and *> AFAC are not modified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESID is DOUBLE PRECISION *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zgbt02.f b/TESTING/LIN/zgbt02.f index 08519467..a30befc7 100644 --- a/TESTING/LIN/zgbt02.f +++ b/TESTING/LIN/zgbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBT02( TRANS, M, N, KL, KU, NRHS, A, LDA, X, LDX, B, * LDB, RESID ) @@ -20,21 +20,20 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBT02 computes the residual for a solution of a banded system of *> equations A*x = b or A'*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS). *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -123,10 +122,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/LIN/zgbt05.f b/TESTING/LIN/zgbt05.f index abf8fe9d..d1c1cd8c 100644 --- a/TESTING/LIN/zgbt05.f +++ b/TESTING/LIN/zgbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBT05( TRANS, N, KL, KU, NRHS, AB, LDAB, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -160,10 +159,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zgelqs.f b/TESTING/LIN/zgelqs.f index 049df349..d0c92f7d 100644 --- a/TESTING/LIN/zgelqs.f +++ b/TESTING/LIN/zgelqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the LQ factorization *> A = L*Q *> computed by ZGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/zgennd.f b/TESTING/LIN/zgennd.f index 5b5d6812..5aaa6e8e 100644 --- a/TESTING/LIN/zgennd.f +++ b/TESTING/LIN/zgennd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION ZGENND (M, N, A, LDA) * @@ -17,18 +17,17 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZGENND tests that its argument has a real, non-negative diagonal. +*> \verbatim *> -*>\endverbatim +*> ZGENND tests that its argument has a real, non-negative diagonal. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -53,10 +52,9 @@ *> LDA is INTEGER *> Leading dimension of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zgeqls.f b/TESTING/LIN/zgeqls.f index 11f71db6..e20dac11 100644 --- a/TESTING/LIN/zgeqls.f +++ b/TESTING/LIN/zgeqls.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQLS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QL factorization *> A = Q*L *> computed by ZGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/zgeqrs.f b/TESTING/LIN/zgeqrs.f index 712fa3c3..60d2a3b3 100644 --- a/TESTING/LIN/zgeqrs.f +++ b/TESTING/LIN/zgeqrs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQRS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Solve the least squares problem *> min || A*X - B || *> using the QR factorization *> A = Q*R *> computed by ZGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -105,10 +104,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/LIN/zgerqs.f b/TESTING/LIN/zgerqs.f index c849bd2d..55fd7da6 100644 --- a/TESTING/LIN/zgerqs.f +++ b/TESTING/LIN/zgerqs.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, * INFO ) @@ -19,22 +19,21 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute a minimum-norm solution *> min || A*X - B || *> using the RQ factorization *> A = R*Q *> computed by ZGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -106,10 +105,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/LIN/zget01.f b/TESTING/LIN/zget01.f index a828b900..ff35367a 100644 --- a/TESTING/LIN/zget01.f +++ b/TESTING/LIN/zget01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET01( M, N, A, LDA, AFAC, LDAFAC, IPIV, RWORK, * RESID ) @@ -21,21 +21,20 @@ * COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET01 reconstructs a matrix A from its L*U factorization and *> computes the residual *> norm(L*U - A) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,9 @@ *> RESID is DOUBLE PRECISION *> norm(L*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zget02.f b/TESTING/LIN/zget02.f index 4e1b2445..217e7795 100644 --- a/TESTING/LIN/zget02.f +++ b/TESTING/LIN/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/LIN/zget03.f b/TESTING/LIN/zget03.f index 73ba9463..ef5c16cf 100644 --- a/TESTING/LIN/zget03.f +++ b/TESTING/LIN/zget03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET03( N, A, LDA, AINV, LDAINV, WORK, LDWORK, RWORK, * RCOND, RESID ) @@ -21,20 +21,19 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET03 computes the residual for a general matrix times its inverse: *> norm( I - AINV*A ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - AINV*A) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zget04.f b/TESTING/LIN/zget04.f index aeb008c3..ee577d39 100644 --- a/TESTING/LIN/zget04.f +++ b/TESTING/LIN/zget04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET04( N, NRHS, X, LDX, XACT, LDXACT, RCOND, RESID ) * @@ -18,11 +18,11 @@ * COMPLEX*16 X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET04 computes the difference between a computed solution and the *> true solution to a system of linear equations. @@ -30,11 +30,10 @@ *> RESID = ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ), *> where RCOND is the reciprocal of the condition number and EPS is the *> machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> The maximum over the NRHS solution vectors of *> ( norm(X-XACT) * RCOND ) / ( norm(XACT) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zget07.f b/TESTING/LIN/zget07.f index f314269a..b023b21d 100644 --- a/TESTING/LIN/zget07.f +++ b/TESTING/LIN/zget07.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET07( TRANS, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, CHKFERR, BERR, RESLTS ) @@ -22,11 +22,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGET07 tests the error bounds from iterative refinement for the *> computed solution to a system of equations op(A)*X = B, where A is a @@ -40,11 +40,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -150,10 +149,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zget08.f b/TESTING/LIN/zget08.f index 69558d32..0f187281 100644 --- a/TESTING/LIN/zget08.f +++ b/TESTING/LIN/zget08.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGET08( 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 *> *> ZGET08 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/LIN/zgtt01.f b/TESTING/LIN/zgtt01.f index 403c8c73..1e76e446 100644 --- a/TESTING/LIN/zgtt01.f +++ b/TESTING/LIN/zgtt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTT01( N, DL, D, DU, DLF, DF, DUF, DU2, IPIV, WORK, * LDWORK, RWORK, RESID ) @@ -22,21 +22,20 @@ * $ DU2( * ), DUF( * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTT01 reconstructs a tridiagonal matrix A from its LU factorization *> and computes the residual *> norm(L*U - A) / ( norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> RESID is DOUBLE PRECISION *> The scaled residual: norm(L*U - A) / (norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zgtt02.f b/TESTING/LIN/zgtt02.f index 2f1e0c2a..9fbd9688 100644 --- a/TESTING/LIN/zgtt02.f +++ b/TESTING/LIN/zgtt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTT02( TRANS, N, NRHS, DL, D, DU, X, LDX, B, LDB, * RESID ) @@ -21,21 +21,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTT02 computes the residual for the solution to a tridiagonal *> system of equations: *> RESID = norm(B - op(A)*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -108,10 +107,9 @@ *> RESID is DOUBLE PRECISION *> norm(B - op(A)*X) / (norm(A) * norm(X) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zgtt05.f b/TESTING/LIN/zgtt05.f index 1b3013a7..f07f2ee0 100644 --- a/TESTING/LIN/zgtt05.f +++ b/TESTING/LIN/zgtt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTT05( TRANS, N, NRHS, DL, D, DU, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ X( LDX, * ), XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -41,11 +41,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(op(A))*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zhet01.f b/TESTING/LIN/zhet01.f index 4f2a11f3..1e56ca67 100644 --- a/TESTING/LIN/zhet01.f +++ b/TESTING/LIN/zhet01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHET01( UPLO, N, A, LDA, AFAC, LDAFAC, IPIV, C, LDC, * RWORK, RESID ) @@ -22,11 +22,11 @@ * COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHET01 reconstructs a Hermitian indefinite matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual @@ -34,11 +34,10 @@ *> where C is the reconstructed matrix, EPS is the machine epsilon, *> L' is the conjugate transpose of L, and U' is the conjugate transpose *> of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zhpt01.f b/TESTING/LIN/zhpt01.f index 5224a42e..45a593c5 100644 --- a/TESTING/LIN/zhpt01.f +++ b/TESTING/LIN/zhpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPT01( UPLO, N, A, AFAC, IPIV, C, LDC, RWORK, RESID ) * @@ -21,11 +21,11 @@ * COMPLEX*16 A( * ), AFAC( * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPT01 reconstructs a Hermitian indefinite packed matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual @@ -33,11 +33,10 @@ *> where C is the reconstructed matrix, EPS is the machine epsilon, *> L' is the conjugate transpose of L, and U' is the conjugate transpose *> of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -98,10 +97,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlahilb.f b/TESTING/LIN/zlahilb.f index 8479b3b2..8b493726 100644 --- a/TESTING/LIN/zlahilb.f +++ b/TESTING/LIN/zlahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, * INFO, PATH) @@ -19,11 +19,11 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -43,11 +43,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> PATH is CHARACTER*3 *> The LAPACK path name. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlaipd.f b/TESTING/LIN/zlaipd.f index 61aafdda..f76e5d62 100644 --- a/TESTING/LIN/zlaipd.f +++ b/TESTING/LIN/zlaipd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAIPD( N, A, INDA, VINDA ) * @@ -17,21 +17,20 @@ * COMPLEX*16 A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAIPD sets the imaginary part of the diagonal elements of a complex *> matrix A to a large value. This is used to test LAPACK routines for *> complex Hermitian matrices, which are not supposed to access or use *> the imaginary parts of the diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -68,10 +67,9 @@ *> = 1: packed upper triangular matrix *> = -1: packed lower triangular matrix *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlaptm.f b/TESTING/LIN/zlaptm.f index 03c6243b..12a479fe 100644 --- a/TESTING/LIN/zlaptm.f +++ b/TESTING/LIN/zlaptm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAPTM( UPLO, N, NRHS, ALPHA, D, E, X, LDX, BETA, B, * LDB ) @@ -21,11 +21,11 @@ * COMPLEX*16 B( LDB, * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAPTM multiplies an N by NRHS matrix X by a Hermitian tridiagonal *> matrix A and stores the result in a matrix B. The operation has the @@ -34,11 +34,10 @@ *> B := alpha * A * X + beta * B *> *> where alpha may be either 1. or -1. and beta may be 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -113,10 +112,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(N,1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlarhs.f b/TESTING/LIN/zlarhs.f index 36953ea4..8fb16eb4 100644 --- a/TESTING/LIN/zlarhs.f +++ b/TESTING/LIN/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 = -k, the k-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlatb4.f b/TESTING/LIN/zlatb4.f index c8aade08..37b3a03f 100644 --- a/TESTING/LIN/zlatb4.f +++ b/TESTING/LIN/zlatb4.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATB4( PATH, IMAT, M, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * DOUBLE PRECISION ANORM, CNDNUM * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATB4 sets parameters for the matrix generator based on the type of *> matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -104,10 +103,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/LIN/zlatb5.f b/TESTING/LIN/zlatb5.f index 868de8fb..d94799bf 100644 --- a/TESTING/LIN/zlatb5.f +++ b/TESTING/LIN/zlatb5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATB5( PATH, IMAT, N, TYPE, KL, KU, ANORM, MODE, * CNDNUM, DIST ) @@ -18,19 +18,18 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATB5 sets parameters for the matrix generator based on the type *> of matrix to be generated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PATH *> \verbatim @@ -98,10 +97,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/LIN/zlatsp.f b/TESTING/LIN/zlatsp.f index 78c85af1..2638b0e7 100644 --- a/TESTING/LIN/zlatsp.f +++ b/TESTING/LIN/zlatsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATSP( UPLO, N, X, ISEED ) * @@ -19,11 +19,11 @@ * COMPLEX*16 X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATSP generates a special test matrix for the complex symmetric *> (indefinite) factorization for packed matrices. The pivot blocks of @@ -33,11 +33,10 @@ *> 2x2 pivot block, diagonalizable *> (cycle repeats) *> A row interchange is required for each non-diagonalizable 2x2 block. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -69,10 +68,9 @@ *> On entry, the seed for the random number generator. The last *> of the four integers must be odd. (modified on exit) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlatsy.f b/TESTING/LIN/zlatsy.f index 229887a6..5caead51 100644 --- a/TESTING/LIN/zlatsy.f +++ b/TESTING/LIN/zlatsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATSY( UPLO, N, X, LDX, ISEED ) * @@ -19,11 +19,11 @@ * COMPLEX*16 X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATSY generates a special test matrix for the complex symmetric *> (indefinite) factorization. The pivot blocks of the generated matrix @@ -33,11 +33,10 @@ *> 2x2 pivot block, diagonalizable *> (cycle repeats) *> A row interchange is required for each non-diagonalizable 2x2 block. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -74,10 +73,9 @@ *> On entry, the seed for the random number generator. The last *> of the four integers must be odd. (modified on exit) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlattb.f b/TESTING/LIN/zlattb.f index 63ecbbc3..1fa4a03e 100644 --- a/TESTING/LIN/zlattb.f +++ b/TESTING/LIN/zlattb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATTB( IMAT, UPLO, TRANS, DIAG, ISEED, N, KD, AB, * LDAB, B, WORK, RWORK, INFO ) @@ -21,20 +21,19 @@ * COMPLEX*16 AB( LDAB, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATTB generates a triangular test matrix in 2-dimensional storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -125,10 +124,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/LIN/zlattp.f b/TESTING/LIN/zlattp.f index c59385cc..14e0a068 100644 --- a/TESTING/LIN/zlattp.f +++ b/TESTING/LIN/zlattp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATTP( IMAT, UPLO, TRANS, DIAG, ISEED, N, AP, B, WORK, * RWORK, INFO ) @@ -21,20 +21,19 @@ * COMPLEX*16 AP( * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATTP generates a triangular test matrix in packed storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array AP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -115,10 +114,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/LIN/zlattr.f b/TESTING/LIN/zlattr.f index a22005bf..83a8f99e 100644 --- a/TESTING/LIN/zlattr.f +++ b/TESTING/LIN/zlattr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATTR( IMAT, UPLO, TRANS, DIAG, ISEED, N, A, LDA, B, * WORK, RWORK, INFO ) @@ -21,20 +21,19 @@ * COMPLEX*16 A( LDA, * ), B( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATTR generates a triangular test matrix in 2-dimensional storage. *> IMAT and UPLO uniquely specify the properties of the test matrix, *> which is returned in the array A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IMAT *> \verbatim @@ -122,10 +121,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/LIN/zlavhe.f b/TESTING/LIN/zlavhe.f index 43c59276..cfc0a757 100644 --- a/TESTING/LIN/zlavhe.f +++ b/TESTING/LIN/zlavhe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAVHE( UPLO, TRANS, DIAG, N, NRHS, A, LDA, IPIV, B, * LDB, INFO ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAVHE performs one of the matrix-vector operations *> x := A*x or x := A^H*x, @@ -44,11 +44,10 @@ *> (or L or L * D). *> If TRANS = 'C' or 'c', ZLAVHE multiplies either by U^H or D * U^H *> (or L^H or D * L^H ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -122,10 +121,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlavhp.f b/TESTING/LIN/zlavhp.f index 8fba5689..9aebbd05 100644 --- a/TESTING/LIN/zlavhp.f +++ b/TESTING/LIN/zlavhp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAVHP( UPLO, TRANS, DIAG, N, NRHS, A, IPIV, B, LDB, * INFO ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAVHP performs one of the matrix-vector operations *> x := A*x or x := A^H*x, @@ -43,11 +43,10 @@ *> (or L or L * D). *> If TRANS = 'C' or 'c', ZLAVHP multiplies either by U^H or D * U^H *> (or L^H or D * L^H ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -115,10 +114,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlavsp.f b/TESTING/LIN/zlavsp.f index ffa9eec9..010874ef 100644 --- a/TESTING/LIN/zlavsp.f +++ b/TESTING/LIN/zlavsp.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAVSP( UPLO, TRANS, DIAG, N, NRHS, A, IPIV, B, LDB, * INFO ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAVSP performs one of the matrix-vector operations *> x := A*x or x := A^T*x, @@ -43,11 +43,10 @@ *> (or L or L * D). *> If TRANS = 'C' or 'c', ZLAVSP multiplies either by U^T or D * U^T *> (or L^T or D * L^T ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -115,10 +114,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlavsy.f b/TESTING/LIN/zlavsy.f index 99613b49..435f23c1 100644 --- a/TESTING/LIN/zlavsy.f +++ b/TESTING/LIN/zlavsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAVSY( UPLO, TRANS, DIAG, N, NRHS, A, LDA, IPIV, B, * LDB, INFO ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAVSY performs one of the matrix-vector operations *> x := A*x or x := A'*x, @@ -44,11 +44,10 @@ *> (or L or L * D). *> If TRANS = 'T' or 't', ZLAVSY multiplies either by U' or D * U' *> (or L' or D * L' ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> UPLO - CHARACTER*1 @@ -122,10 +121,9 @@ *> A negative value, say -K, indicates that the K-th argument *> has an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zlqt01.f b/TESTING/LIN/zlqt01.f index 2bda0100..3ec25797 100644 --- a/TESTING/LIN/zlqt01.f +++ b/TESTING/LIN/zlqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLQT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLQT01 tests ZGELQF, which computes the LQ factorization of an m-by-n *> matrix A, and partially tests ZUNGLQ which forms the n-by-n *> orthogonal matrix Q. *> *> ZLQT01 compares L with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/zlqt02.f b/TESTING/LIN/zlqt02.f index 2908feef..9784f9a8 100644 --- a/TESTING/LIN/zlqt02.f +++ b/TESTING/LIN/zlqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLQT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLQT02 tests ZUNGLQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> rows of A; it compares L(1:k,1:m) with A(1:k,1:n)*Q(1:m,1:n)', and *> checks that the rows of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( L - A*Q' ) / ( N * norm(A) * 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/LIN/zlqt03.f b/TESTING/LIN/zlqt03.f index 4ebe3857..a39a1349 100644 --- a/TESTING/LIN/zlqt03.f +++ b/TESTING/LIN/zlqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLQT03 tests ZUNMLQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> ZLQT03 compares the results of a call to ZUNMLQ with the results of *> forming Q explicitly by a call to ZUNGLQ and then performing matrix *> multiplication by a call to ZGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpbt01.f b/TESTING/LIN/zpbt01.f index b96dde52..51e4e79e 100644 --- a/TESTING/LIN/zpbt01.f +++ b/TESTING/LIN/zpbt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBT01( UPLO, N, KD, A, LDA, AFAC, LDAFAC, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBT01 reconstructs a Hermitian positive definite band matrix A from *> its L*L' or U'*U factorization and computes the residual @@ -33,11 +33,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of *> L, and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -104,10 +103,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpbt02.f b/TESTING/LIN/zpbt02.f index ae70258d..6f5df20d 100644 --- a/TESTING/LIN/zpbt02.f +++ b/TESTING/LIN/zpbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBT02( UPLO, N, KD, 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 *> *> ZPBT02 computes the residual for a solution of a Hermitian banded *> system of equations A*x = b: *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS) *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,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/LIN/zpbt05.f b/TESTING/LIN/zpbt05.f index 2cdb26f2..945072d8 100644 --- a/TESTING/LIN/zpbt05.f +++ b/TESTING/LIN/zpbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBT05( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpot01.f b/TESTING/LIN/zpot01.f index e7e6e55d..13903904 100644 --- a/TESTING/LIN/zpot01.f +++ b/TESTING/LIN/zpot01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOT01( UPLO, N, A, LDA, AFAC, LDAFAC, RWORK, RESID ) * @@ -20,11 +20,11 @@ * COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOT01 reconstructs a Hermitian positive definite matrix A from *> its L*L' or U'*U factorization and computes the residual @@ -32,11 +32,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of L, *> and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -91,10 +90,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpot02.f b/TESTING/LIN/zpot02.f index 0ed93473..4cd25452 100644 --- a/TESTING/LIN/zpot02.f +++ b/TESTING/LIN/zpot02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOT02( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOT02 computes the residual for the solution of a Hermitian system *> of linear equations A*x = b: @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/zpot03.f b/TESTING/LIN/zpot03.f index 260a4331..76b55318 100644 --- a/TESTING/LIN/zpot03.f +++ b/TESTING/LIN/zpot03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOT03( UPLO, N, A, LDA, AINV, LDAINV, WORK, LDWORK, * RWORK, RCOND, RESID ) @@ -22,21 +22,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOT03 computes the residual for a Hermitian matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpot05.f b/TESTING/LIN/zpot05.f index 50db4db2..a2a6dd2a 100644 --- a/TESTING/LIN/zpot05.f +++ b/TESTING/LIN/zpot05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOT05( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -149,10 +148,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpot06.f b/TESTING/LIN/zpot06.f index b4751676..523481b2 100644 --- a/TESTING/LIN/zpot06.f +++ b/TESTING/LIN/zpot06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOT06( UPLO, 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 *> *> ZPOT06 computes the residual for a solution of a system of linear *> equations A*x = b : *> RESID = norm(B - A*X,inf) / ( norm(A,inf) * norm(X,inf) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/zppt01.f b/TESTING/LIN/zppt01.f index 05f9a978..ed8e8c79 100644 --- a/TESTING/LIN/zppt01.f +++ b/TESTING/LIN/zppt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPT01( UPLO, N, A, AFAC, RWORK, RESID ) * @@ -20,11 +20,11 @@ * COMPLEX*16 A( * ), AFAC( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPT01 reconstructs a Hermitian positive definite packed matrix A *> from its L*L' or U'*U factorization and computes the residual @@ -32,11 +32,10 @@ *> norm( U'*U - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of *> L, and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -80,10 +79,9 @@ *> If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zppt02.f b/TESTING/LIN/zppt02.f index db61b80d..e34d7393 100644 --- a/TESTING/LIN/zppt02.f +++ b/TESTING/LIN/zppt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPT02( UPLO, N, NRHS, A, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 A( * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPT02 computes the residual in the solution of a Hermitian system *> of linear equations A*x = b when packed storage is used for the @@ -34,11 +34,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS), *> *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -107,10 +106,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/LIN/zppt03.f b/TESTING/LIN/zppt03.f index d5b65fe3..f7a4e156 100644 --- a/TESTING/LIN/zppt03.f +++ b/TESTING/LIN/zppt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPT03( UPLO, N, A, AINV, WORK, LDWORK, RWORK, RCOND, * RESID ) @@ -21,21 +21,20 @@ * COMPLEX*16 A( * ), AINV( * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPT03 computes the residual for a Hermitian packed matrix times its *> inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zppt05.f b/TESTING/LIN/zppt05.f index 830c312a..dc88029a 100644 --- a/TESTING/LIN/zppt05.f +++ b/TESTING/LIN/zppt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPT05( UPLO, N, NRHS, AP, B, LDB, X, LDX, XACT, * LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zpst01.f b/TESTING/LIN/zpst01.f index bbedf4ae..b04b9c48 100644 --- a/TESTING/LIN/zpst01.f +++ b/TESTING/LIN/zpst01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPST01( UPLO, N, A, LDA, AFAC, LDAFAC, PERM, LDPERM, * PIV, RWORK, RESID, RANK ) @@ -23,11 +23,11 @@ * INTEGER PIV( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPST01 reconstructs an Hermitian positive semidefinite matrix A *> from its L or U factors and the permutation matrix P and computes @@ -36,11 +36,10 @@ *> norm( P*U'*U*P' - A ) / ( N * norm(A) * EPS ), *> where EPS is the machine epsilon, L' is the conjugate transpose of L, *> and U' is the conjugate transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> RANK is INTEGER *> number of nonzero singular values of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zptt01.f b/TESTING/LIN/zptt01.f index c132e5ba..0677c680 100644 --- a/TESTING/LIN/zptt01.f +++ b/TESTING/LIN/zptt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTT01( N, D, E, DF, EF, WORK, RESID ) * @@ -19,21 +19,20 @@ * COMPLEX*16 E( * ), EF( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTT01 reconstructs a tridiagonal matrix A from its L*D*L' *> factorization and computes the residual *> norm(L*D*L' - A) / ( n * norm(A) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -77,10 +76,9 @@ *> RESID is DOUBLE PRECISION *> norm(L*D*L' - A) / (n * norm(A) * EPS) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zptt02.f b/TESTING/LIN/zptt02.f index c436735e..92415563 100644 --- a/TESTING/LIN/zptt02.f +++ b/TESTING/LIN/zptt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTT02( UPLO, N, NRHS, D, E, X, LDX, B, LDB, RESID ) * @@ -20,21 +20,20 @@ * COMPLEX*16 B( LDB, * ), E( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTT02 computes the residual for the solution to a symmetric *> tridiagonal system of equations: *> RESID = norm(B - A*X) / (norm(A) * norm(X) * EPS), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,9 @@ *> RESID is DOUBLE PRECISION *> 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/LIN/zptt05.f b/TESTING/LIN/zptt05.f index 18ff57c5..18821d4d 100644 --- a/TESTING/LIN/zptt05.f +++ b/TESTING/LIN/zptt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTT05( N, NRHS, D, E, B, LDB, X, LDX, XACT, LDXACT, * FERR, BERR, RESLTS ) @@ -20,11 +20,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -134,10 +133,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqlt01.f b/TESTING/LIN/zqlt01.f index baa2521b..f96b7cf1 100644 --- a/TESTING/LIN/zqlt01.f +++ b/TESTING/LIN/zqlt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQLT01( M, N, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQLT01 tests ZGEQLF, which computes the QL factorization of an m-by-n *> matrix A, and partially tests ZUNGQL which forms the m-by-m *> orthogonal matrix Q. *> *> ZQLT01 compares L with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqlt02.f b/TESTING/LIN/zqlt02.f index aa8804e9..48a0a139 100644 --- a/TESTING/LIN/zqlt02.f +++ b/TESTING/LIN/zqlt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQLT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQLT02 tests ZUNGQL, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> columns of A; it compares L(m-n+1:m,n-k+1:n) with *> Q(1:m,m-n+1:m)'*A(1:m,n-k+1:n), and checks that the columns of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqlt03.f b/TESTING/LIN/zqlt03.f index a5285f2b..f0ad35b5 100644 --- a/TESTING/LIN/zqlt03.f +++ b/TESTING/LIN/zqlt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQLT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQLT03 tests ZUNMQL, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> ZQLT03 compares the results of a call to ZUNMQL with the results of *> forming Q explicitly by a call to ZUNGQL and then performing matrix *> multiplication by a call to ZGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqpt01.f b/TESTING/LIN/zqpt01.f index d953f8e8..ff074c8d 100644 --- a/TESTING/LIN/zqpt01.f +++ b/TESTING/LIN/zqpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZQPT01( M, N, K, A, AF, LDA, TAU, JPVT, * WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQPT01 tests the QR-factorization with pivoting of a matrix A. The *> array AF contains the (possibly partial) QR-factorization of A, where @@ -34,11 +34,10 @@ *> matrix. *> *> This function returns ||A*P - Q*R||/(||norm(A)||*eps*M) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -104,10 +103,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*N+N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt01.f b/TESTING/LIN/zqrt01.f index 8e3856cb..7ed13184 100644 --- a/TESTING/LIN/zqrt01.f +++ b/TESTING/LIN/zqrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT01 tests ZGEQRF, which computes the QR factorization of an m-by-n *> matrix A, and partially tests ZUNGQR which forms the m-by-m *> orthogonal matrix Q. *> *> ZQRT01 compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt01p.f b/TESTING/LIN/zqrt01p.f index 7fb1cc22..cfbbeb69 100644 --- a/TESTING/LIN/zqrt01p.f +++ b/TESTING/LIN/zqrt01p.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT01P( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT01P tests ZGEQRFP, which computes the QR factorization of an m-by-n *> matrix A, and partially tests ZUNGQR which forms the m-by-m *> orthogonal matrix Q. *> *> ZQRT01P compares R with Q'*A, and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt02.f b/TESTING/LIN/zqrt02.f index c3f7efc7..ca9abe3a 100644 --- a/TESTING/LIN/zqrt02.f +++ b/TESTING/LIN/zqrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT02 tests ZUNGQR, which generates an m-by-n matrix Q with *> orthonornmal columns that is defined as the product of k elementary @@ -34,11 +34,10 @@ *> the orthogonal matrix Q defined by the factorization of the first k *> columns of A; it compares R(1:n,1:k) with Q(1:m,1:n)'*A(1:m,1:k), *> and checks that the columns of Q are orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,9 @@ *> RESULT(1) = norm( R - Q'*A ) / ( M * norm(A) * EPS ) *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt03.f b/TESTING/LIN/zqrt03.f index 253555e1..c71e3595 100644 --- a/TESTING/LIN/zqrt03.f +++ b/TESTING/LIN/zqrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT03 tests ZUNMQR, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> ZQRT03 compares the results of a call to ZUNMQR with the results of *> forming Q explicitly by a call to ZUNGQR and then performing matrix *> multiplication by a call to ZGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( M * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( M * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt04.f b/TESTING/LIN/zqrt04.f index cbc51e5f..50d8b941 100644 --- a/TESTING/LIN/zqrt04.f +++ b/TESTING/LIN/zqrt04.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT04(M,N,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * DOUBLE PRECISION RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZQRT04 tests ZGEQRT and ZGEMQRT. +*> \verbatim *> -*>\endverbatim +*> ZQRT04 tests ZGEQRT and ZGEMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -58,10 +57,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt05.f b/TESTING/LIN/zqrt05.f index cb1f8930..eccf1284 100644 --- a/TESTING/LIN/zqrt05.f +++ b/TESTING/LIN/zqrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT05(M,N,L,NB,RESULT) * @@ -15,18 +15,17 @@ * .. Return values .. * DOUBLE PRECISION RESULT(6) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZQRT05 tests ZTPQRT and ZTPMQRT. +*> \verbatim *> -*>\endverbatim +*> ZQRT05 tests ZTPQRT and ZTPMQRT. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -65,10 +64,9 @@ *> RESULT(5) = | C Q - C Q | *> RESULT(6) = | C Q^H - C Q^H | *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt11.f b/TESTING/LIN/zqrt11.f index 9fb0c805..2888ea57 100644 --- a/TESTING/LIN/zqrt11.f +++ b/TESTING/LIN/zqrt11.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZQRT11( M, K, A, LDA, TAU, WORK, LWORK ) * @@ -17,11 +17,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT11 computes the test ratio *> @@ -35,11 +35,10 @@ *> where tau(k) is stored in TAU(k) and v(k) is an m-vector of the form *> [ 0 ... 0 1 x(k) ]', where x(k) is a vector of length m-k stored *> in A(k+1:m,k). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -83,10 +82,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= M*M + M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt12.f b/TESTING/LIN/zqrt12.f index 6ea350a8..1d81970a 100644 --- a/TESTING/LIN/zqrt12.f +++ b/TESTING/LIN/zqrt12.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZQRT12( M, N, A, LDA, S, WORK, LWORK, * RWORK ) @@ -19,21 +19,20 @@ * COMPLEX*16 A( LDA, * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT12 computes the singular values `svlues' of the upper trapezoid *> of A(1:M,1:N) and returns the ratio *> *> || s - svlues||/(||svlues||*eps*max(M,N)) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -81,10 +80,9 @@ *> \verbatim *> RWORK is DOUBLE PRECISION array, dimension (2*min(M,N)) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt13.f b/TESTING/LIN/zqrt13.f index bb580af7..fbee59e8 100644 --- a/TESTING/LIN/zqrt13.f +++ b/TESTING/LIN/zqrt13.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT13( SCALE, M, N, A, LDA, NORMA, ISEED ) * @@ -19,19 +19,18 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT13 generates a full-rank matrix that may be scaled to have large *> or small norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -76,10 +75,9 @@ *> ISEED is integer array, dimension (4) *> Seed for random number generator *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt14.f b/TESTING/LIN/zqrt14.f index ff80bf20..2dfe7367 100644 --- a/TESTING/LIN/zqrt14.f +++ b/TESTING/LIN/zqrt14.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZQRT14( TRANS, M, N, NRHS, A, LDA, X, * LDX, WORK, LWORK ) @@ -19,11 +19,11 @@ * COMPLEX*16 A( LDA, * ), WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT14 checks whether X is in the row space of A or A'. It does so *> by scaling both X and A such that their norms are in the range @@ -31,11 +31,10 @@ *> (if TRANS = 'C') or an LQ factorization of [A',X]' (if TRANS = 'N'), *> and returning the norm of the trailing triangle, scaled by *> MAX(M,N,NRHS)*eps. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -100,10 +99,9 @@ *> If TRANS = 'N', LWORK >= (M+NRHS)*(N+2); *> if TRANS = 'C', LWORK >= (N+NRHS)*(M+2). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt15.f b/TESTING/LIN/zqrt15.f index 193563e3..c187ea69 100644 --- a/TESTING/LIN/zqrt15.f +++ b/TESTING/LIN/zqrt15.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT15( SCALE, RKSEL, M, N, NRHS, A, LDA, B, LDB, S, * RANK, NORMA, NORMB, ISEED, WORK, LWORK ) @@ -21,19 +21,18 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT15 generates a matrix with full or deficient rank and of various *> norms. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SCALE *> \verbatim @@ -133,10 +132,9 @@ *> length of work space required. *> LWORK >= MAX(M+MIN(M,N),NRHS*MIN(M,N),2*N+M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt16.f b/TESTING/LIN/zqrt16.f index c1438c3a..2714ce70 100644 --- a/TESTING/LIN/zqrt16.f +++ b/TESTING/LIN/zqrt16.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZQRT16( 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 *> *> ZQRT16 computes the residual for a solution of a system of linear *> equations A*x = b or A'*x = b: *> RESID = norm(B - A*X) / ( max(m,n) * 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) / ( max(m,n) * norm(A) * norm(X) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zqrt17.f b/TESTING/LIN/zqrt17.f index 1206dd73..e88ddddc 100644 --- a/TESTING/LIN/zqrt17.f +++ b/TESTING/LIN/zqrt17.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZQRT17( TRANS, IRESID, M, N, NRHS, A, * LDA, X, LDX, B, LDB, C, WORK, LWORK ) @@ -20,11 +20,11 @@ * $ WORK( LWORK ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZQRT17 computes the ratio *> @@ -34,11 +34,10 @@ *> *> alpha = ||B|| if IRESID = 1 (zero-residual problem) *> alpha = ||R|| if IRESID = 2 (otherwise). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -134,10 +133,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= NRHS*(M+N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zrqt01.f b/TESTING/LIN/zrqt01.f index ec112717..8761b25f 100644 --- a/TESTING/LIN/zrqt01.f +++ b/TESTING/LIN/zrqt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZRQT01( M, N, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZRQT01 tests ZGERQF, which computes the RQ factorization of an m-by-n *> matrix A, and partially tests ZUNGRQ which forms the n-by-n *> orthogonal matrix Q. *> *> ZRQT01 compares R with A*Q', and checks that Q is orthogonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -110,10 +109,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/zrqt02.f b/TESTING/LIN/zrqt02.f index 264f3cf7..329e875a 100644 --- a/TESTING/LIN/zrqt02.f +++ b/TESTING/LIN/zrqt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZRQT02( M, N, K, A, AF, Q, R, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,11 +20,11 @@ * $ R( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZRQT02 tests ZUNGRQ, which generates an m-by-n matrix Q with *> orthonornmal rows that is defined as the product of k elementary @@ -35,11 +35,10 @@ *> rows of A; it compares R(m-k+1:m,n-m+1:n) with *> A(m-k+1:m,1:n)*Q(n-m+1:n,1:n)', and checks that the rows of Q are *> orthonormal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(1) = norm( R - A*Q' ) / ( N * norm(A) * 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/LIN/zrqt03.f b/TESTING/LIN/zrqt03.f index 2329bbec..8f2c978f 100644 --- a/TESTING/LIN/zrqt03.f +++ b/TESTING/LIN/zrqt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZRQT03( M, N, K, AF, C, CC, Q, LDA, TAU, WORK, LWORK, * RWORK, RESULT ) @@ -20,22 +20,21 @@ * $ Q( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZRQT03 tests ZUNMRQ, which computes Q*C, Q'*C, C*Q or C*Q'. *> *> ZRQT03 compares the results of a call to ZUNMRQ with the results of *> forming Q explicitly by a call to ZUNGRQ and then performing matrix *> multiplication by a call to ZGEMM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -120,10 +119,9 @@ *> RESULT(3) = norm( Q'*C - Q'*C )/ ( N * norm(C) * EPS ) *> RESULT(4) = norm( C*Q' - C*Q' )/ ( N * norm(C) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zrzt01.f b/TESTING/LIN/zrzt01.f index 2aaa3297..9b879878 100644 --- a/TESTING/LIN/zrzt01.f +++ b/TESTING/LIN/zrzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZRZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZRZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with ZTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zrzt02.f b/TESTING/LIN/zrzt02.f index 3a23c7c9..57a7a0a9 100644 --- a/TESTING/LIN/zrzt02.f +++ b/TESTING/LIN/zrzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZRZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * COMPLEX*16 AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZRZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by ZTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> Length of WORK array. LWORK >= N*N+N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zsbmv.f b/TESTING/LIN/zsbmv.f index 0cb22d9e..afe694fa 100644 --- a/TESTING/LIN/zsbmv.f +++ b/TESTING/LIN/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/LIN/zspt01.f b/TESTING/LIN/zspt01.f index 37e0b09f..318c67e7 100644 --- a/TESTING/LIN/zspt01.f +++ b/TESTING/LIN/zspt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPT01( UPLO, N, A, AFAC, IPIV, C, LDC, RWORK, RESID ) * @@ -21,22 +21,21 @@ * COMPLEX*16 A( * ), AFAC( * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPT01 reconstructs a symmetric indefinite packed matrix A from its *> diagonal pivoting factorization A = U*D*U' or A = L*D*L' and computes *> the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zspt02.f b/TESTING/LIN/zspt02.f index 929104ae..259931bd 100644 --- a/TESTING/LIN/zspt02.f +++ b/TESTING/LIN/zspt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPT02( UPLO, N, NRHS, A, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 A( * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPT02 computes the residual in the solution of a complex symmetric *> system of linear equations A*x = b when packed storage is used for @@ -34,11 +34,10 @@ *> RESID = norm( B - A*X ) / ( norm(A) * norm(X) * EPS). *> *> where EPS is the machine precision. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -107,10 +106,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/LIN/zspt03.f b/TESTING/LIN/zspt03.f index 2c3caf77..4e85c9e9 100644 --- a/TESTING/LIN/zspt03.f +++ b/TESTING/LIN/zspt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPT03( UPLO, N, A, AINV, WORK, LDW, RWORK, RCOND, * RESID ) @@ -21,21 +21,20 @@ * COMPLEX*16 A( * ), AINV( * ), WORK( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPT03 computes the residual for a complex symmetric packed matrix *> times its inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zsyt01.f b/TESTING/LIN/zsyt01.f index a676e438..319951dd 100644 --- a/TESTING/LIN/zsyt01.f +++ b/TESTING/LIN/zsyt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYT01( UPLO, N, A, LDA, AFAC, LDAFAC, IPIV, C, LDC, * RWORK, RESID ) @@ -22,22 +22,21 @@ * COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYT01 reconstructs a complex symmetric indefinite matrix A from its *> block L*D*L' or U*D*U' factorization and computes the residual *> norm( C - A ) / ( N * norm(A) * EPS ), *> where C is the reconstructed matrix, EPS is the machine epsilon, *> L' is the transpose of L, and U' is the transpose of U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> If UPLO = 'L', norm(L*D*L' - A) / ( N * norm(A) * EPS ) *> If UPLO = 'U', norm(U*D*U' - A) / ( N * norm(A) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/zsyt02.f b/TESTING/LIN/zsyt02.f index a3835c76..4aaf90c4 100644 --- a/TESTING/LIN/zsyt02.f +++ b/TESTING/LIN/zsyt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYT02( UPLO, N, NRHS, A, LDA, X, LDX, B, LDB, RWORK, * RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYT02 computes the residual for a solution to a complex symmetric *> system of linear equations A*x = b: @@ -33,11 +33,10 @@ *> RESID = norm(B - A*X) / ( norm(A) * norm(X) * EPS ), *> *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/LIN/zsyt03.f b/TESTING/LIN/zsyt03.f index af2058e4..6bb9ab3c 100644 --- a/TESTING/LIN/zsyt03.f +++ b/TESTING/LIN/zsyt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYT03( UPLO, N, A, LDA, AINV, LDAINV, WORK, LDWORK, * RWORK, RCOND, RESID ) @@ -22,21 +22,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYT03 computes the residual for a complex symmetric matrix times *> its inverse: *> norm( I - A*AINV ) / ( N * norm(A) * norm(AINV) * EPS ) *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> RESID is DOUBLE PRECISION *> norm(I - A*AINV) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztbt02.f b/TESTING/LIN/ztbt02.f index 6866235a..8b9c1ba8 100644 --- a/TESTING/LIN/ztbt02.f +++ b/TESTING/LIN/ztbt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBT02( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, X, * LDX, B, LDB, WORK, RWORK, RESID ) @@ -22,11 +22,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b, A**T *x = b, or @@ -36,11 +36,10 @@ *> the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -145,10 +144,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztbt03.f b/TESTING/LIN/ztbt03.f index 7a99191d..aa256749 100644 --- a/TESTING/LIN/ztbt03.f +++ b/TESTING/LIN/ztbt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBT03( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, * SCALE, CNORM, TSCAL, X, LDX, B, LDB, WORK, @@ -23,11 +23,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b, A**T *x = s*b, or A**H *x = s*b @@ -37,11 +37,10 @@ *> the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -160,10 +159,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztbt05.f b/TESTING/LIN/ztbt05.f index 65e95797..ac1e53bc 100644 --- a/TESTING/LIN/ztbt05.f +++ b/TESTING/LIN/ztbt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBT05( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -40,11 +40,10 @@ *> = the maximum of BERR / ( NZ*EPS + (*) ), where *> (*) = NZ*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) *> and NZ = max. number of nonzeros in any row of A, plus 1 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -173,10 +172,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( NZ*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztbt06.f b/TESTING/LIN/ztbt06.f index bc95da47..5bdcb5ba 100644 --- a/TESTING/LIN/ztbt06.f +++ b/TESTING/LIN/ztbt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBT06( RCOND, RCONDC, UPLO, DIAG, N, KD, AB, LDAB, * RWORK, RAT ) @@ -21,22 +21,21 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by ZTBCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -110,10 +109,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztpt01.f b/TESTING/LIN/ztpt01.f index 46b668f0..c6dd8815 100644 --- a/TESTING/LIN/ztpt01.f +++ b/TESTING/LIN/ztpt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPT01( UPLO, DIAG, N, AP, AINVP, RCOND, RWORK, RESID ) * @@ -20,21 +20,20 @@ * COMPLEX*16 AINVP( * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPT01 computes the residual for a triangular matrix A times its *> inverse when A is stored in packed format: *> RESID = norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> RESID is DOUBLE PRECISION *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztpt02.f b/TESTING/LIN/ztpt02.f index 356baf9f..0c8f28e5 100644 --- a/TESTING/LIN/ztpt02.f +++ b/TESTING/LIN/ztpt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPT02( UPLO, TRANS, DIAG, N, NRHS, AP, X, LDX, B, LDB, * WORK, RWORK, RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b, A**T *x = b, or @@ -36,11 +36,10 @@ *> the maximum over the number of right hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -133,10 +132,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztpt03.f b/TESTING/LIN/ztpt03.f index aeaf39a3..944ca4b4 100644 --- a/TESTING/LIN/ztpt03.f +++ b/TESTING/LIN/ztpt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPT03( UPLO, TRANS, DIAG, N, NRHS, AP, SCALE, CNORM, * TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -21,11 +21,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b, A**T *x = s*b, or A**H *x = s*b, @@ -35,11 +35,10 @@ *> is the maximum over the number of right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -146,10 +145,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztpt05.f b/TESTING/LIN/ztpt05.f index 005b85ea..9c31c450 100644 --- a/TESTING/LIN/ztpt05.f +++ b/TESTING/LIN/ztpt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPT05( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,10 +158,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztpt06.f b/TESTING/LIN/ztpt06.f index 766d456a..c008ab06 100644 --- a/TESTING/LIN/ztpt06.f +++ b/TESTING/LIN/ztpt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPT06( RCOND, RCONDC, UPLO, DIAG, N, AP, RWORK, RAT ) * @@ -20,22 +20,21 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of the triangular matrix A) and RCONDC, the estimate *> computed by ZTPCON. Information about the triangular matrix is used *> if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -97,10 +96,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztrt01.f b/TESTING/LIN/ztrt01.f index 6e76b0a4..355520de 100644 --- a/TESTING/LIN/ztrt01.f +++ b/TESTING/LIN/ztrt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRT01( UPLO, DIAG, N, A, LDA, AINV, LDAINV, RCOND, * RWORK, RESID ) @@ -21,21 +21,20 @@ * COMPLEX*16 A( LDA, * ), AINV( LDAINV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRT01 computes the residual for a triangular matrix A times its *> inverse: *> RESID = norm( A*AINV - I ) / ( N * norm(A) * norm(AINV) * EPS ), *> where EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> RESID is DOUBLE PRECISION *> norm(A*AINV - I) / ( N * norm(A) * norm(AINV) * EPS ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztrt02.f b/TESTING/LIN/ztrt02.f index c670efc4..bb2792d4 100644 --- a/TESTING/LIN/ztrt02.f +++ b/TESTING/LIN/ztrt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRT02( UPLO, TRANS, DIAG, N, NRHS, A, LDA, X, LDX, B, * LDB, WORK, RWORK, RESID ) @@ -22,11 +22,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRT02 computes the residual for the computed solution to a *> triangular system of linear equations A*x = b, A**T *x = b, @@ -36,11 +36,10 @@ *> hand sides of *> norm(b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztrt03.f b/TESTING/LIN/ztrt03.f index 8c878c27..6959a44d 100644 --- a/TESTING/LIN/ztrt03.f +++ b/TESTING/LIN/ztrt03.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRT03( UPLO, TRANS, DIAG, N, NRHS, A, LDA, SCALE, * CNORM, TSCAL, X, LDX, B, LDB, WORK, RESID ) @@ -22,11 +22,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRT03 computes the residual for the solution to a scaled triangular *> system of equations A*x = s*b, A**T *x = s*b, or A**H *x = s*b. @@ -36,11 +36,10 @@ *> right hand sides of *> norm(s*b - op(A)*x) / ( norm(op(A)) * norm(x) * EPS ), *> where op(A) denotes A, A**T, or A**H, and EPS is the machine epsilon. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> The maximum over the number of right hand sides of *> norm(op(A)*x - s*b) / ( norm(op(A)) * norm(x) * EPS ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztrt05.f b/TESTING/LIN/ztrt05.f index 094e7dc9..755ce17c 100644 --- a/TESTING/LIN/ztrt05.f +++ b/TESTING/LIN/ztrt05.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRT05( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, XACT, LDXACT, FERR, BERR, RESLTS ) @@ -21,11 +21,11 @@ * $ XACT( LDXACT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRT05 tests the error bounds from iterative refinement for the *> computed solution to a system of equations A*X = B, where A is a @@ -39,11 +39,10 @@ *> RESLTS(2) = residual from the iterative refinement routine *> = the maximum of BERR / ( (n+1)*EPS + (*) ), where *> (*) = (n+1)*UNFL / (min_i (abs(A)*abs(X) +abs(b))_i ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,9 @@ *> RESLTS(1) = norm(X - XACT) / ( norm(X) * FERR ) *> RESLTS(2) = BERR / ( (n+1)*EPS + (*) ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztrt06.f b/TESTING/LIN/ztrt06.f index 15164ad8..df799016 100644 --- a/TESTING/LIN/ztrt06.f +++ b/TESTING/LIN/ztrt06.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRT06( RCOND, RCONDC, UPLO, DIAG, N, A, LDA, RWORK, * RAT ) @@ -21,22 +21,21 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRT06 computes a test ratio comparing RCOND (the reciprocal *> condition number of a triangular matrix A) and RCONDC, the estimate *> computed by ZTRCON. Information about the triangular matrix A is *> used if one estimate is zero and the other is non-zero to decide if *> underflow in the estimate is justified. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RCOND *> \verbatim @@ -106,10 +105,9 @@ *> RAT = MAX( RCOND, RCONDC )/MIN( RCOND, RCONDC ) - 1. *> If RAT = 0, the two estimates are exactly the same. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztzt01.f b/TESTING/LIN/ztzt01.f index 0067ae17..61ec1098 100644 --- a/TESTING/LIN/ztzt01.f +++ b/TESTING/LIN/ztzt01.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZTZT01( M, N, A, AF, LDA, TAU, WORK, * LWORK ) @@ -19,20 +19,19 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTZT01 returns *> || A - R*Q || / ( M * eps * ||A|| ) *> for an upper trapezoidal A that was factored with ZTZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -82,10 +81,9 @@ *> LWORK is INTEGER *> The length of the array WORK. LWORK >= m*n + m. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/LIN/ztzt02.f b/TESTING/LIN/ztzt02.f index 9f835332..6d050909 100644 --- a/TESTING/LIN/ztzt02.f +++ b/TESTING/LIN/ztzt02.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZTZT02( M, N, AF, LDA, TAU, WORK, * LWORK ) @@ -18,21 +18,20 @@ * COMPLEX*16 AF( LDA, * ), TAU( * ), WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTZT02 returns *> || I - Q'*Q || / ( M * eps) *> where the matrix Q is defined by the Householder transformations *> generated by ZTZRQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LWORK is INTEGER *> length of WORK array. Must be >= N*N+N *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clagge.f b/TESTING/MATGEN/clagge.f index 36222571..0e6ba11c 100644 --- a/TESTING/MATGEN/clagge.f +++ b/TESTING/MATGEN/clagge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAGGE( M, N, KL, KU, D, A, LDA, ISEED, WORK, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAGGE generates a complex general m by n matrix A, by pre- and post- *> multiplying a real diagonal matrix D with random unitary matrices: *> A = U*D*V. The lower and upper bandwidths may then be reduced to *> kl and ku by additional unitary transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,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/MATGEN/claghe.f b/TESTING/MATGEN/claghe.f index 6cee2d60..339140c5 100644 --- a/TESTING/MATGEN/claghe.f +++ b/TESTING/MATGEN/claghe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAGHE( N, K, D, A, LDA, ISEED, WORK, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAGHE generates a complex hermitian matrix A, by pre- and post- *> multiplying a real diagonal matrix D with a random unitary matrix: *> A = U*D*U'. The semi-bandwidth may then be reduced to k by additional *> unitary transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,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/MATGEN/clagsy.f b/TESTING/MATGEN/clagsy.f index afa1d80c..f2cd78f3 100644 --- a/TESTING/MATGEN/clagsy.f +++ b/TESTING/MATGEN/clagsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAGSY( N, K, D, A, LDA, ISEED, WORK, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAGSY generates a complex symmetric matrix A, by pre- and post- *> multiplying a real diagonal matrix D with a random unitary matrix: *> A = U*D*U**T. The semi-bandwidth may then be reduced to k by *> additional unitary transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,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/MATGEN/clahilb.f b/TESTING/MATGEN/clahilb.f index 68661e5d..4f226131 100644 --- a/TESTING/MATGEN/clahilb.f +++ b/TESTING/MATGEN/clahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, * INFO, PATH) @@ -19,11 +19,11 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -43,11 +43,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> PATH is CHARACTER*3 *> The LAPACK path name. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -150,7 +148,6 @@ * .. * * ===================================================================== - * .. Local Scalars .. INTEGER TM, TI, R INTEGER M diff --git a/TESTING/MATGEN/clakf2.f b/TESTING/MATGEN/clakf2.f index 96819d07..79a15ab9 100644 --- a/TESTING/MATGEN/clakf2.f +++ b/TESTING/MATGEN/clakf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAKF2( M, N, A, LDA, B, D, E, Z, LDZ ) * @@ -18,11 +18,11 @@ * $ E( LDA, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Form the 2*M*N by 2*M*N matrix *> @@ -32,11 +32,10 @@ *> where In is the identity matrix of size n and X' is the transpose *> of X. kron(X, Y) is the Kronecker product between the matrices X *> and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,9 @@ *> LDZ is INTEGER *> The leading dimension of Z. ( LDZ >= 2*M*N ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clarge.f b/TESTING/MATGEN/clarge.f index 93b9ee8a..a59f813a 100644 --- a/TESTING/MATGEN/clarge.f +++ b/TESTING/MATGEN/clarge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARGE( N, A, LDA, ISEED, WORK, INFO ) * @@ -18,19 +18,18 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARGE pre- and post-multiplies a complex general n by n matrix A *> with a random unitary matrix: A = U*D*U'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -72,10 +71,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/MATGEN/clarnd.f b/TESTING/MATGEN/clarnd.f index 46fa07ac..c91a3fb8 100644 --- a/TESTING/MATGEN/clarnd.f +++ b/TESTING/MATGEN/clarnd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX FUNCTION CLARND( IDIST, ISEED ) * @@ -17,19 +17,18 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARND returns a random complex number from a uniform or normal *> distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -50,10 +49,9 @@ *> odd. *> On exit, the seed is updated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -64,16 +62,14 @@ * *> \ingroup complex_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine SLARAN to generate a random *> real number from a uniform (0,1) distribution. The Box-Muller method *> is used to transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/claror.f b/TESTING/MATGEN/claror.f index e2ad80e7..335eb4f4 100644 --- a/TESTING/MATGEN/claror.f +++ b/TESTING/MATGEN/claror.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAROR( SIDE, INIT, M, N, A, LDA, ISEED, X, INFO ) * @@ -19,11 +19,11 @@ * COMPLEX A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAROR pre- or post-multiplies an M by N matrix A by a random *> unitary matrix U, overwriting A. A may optionally be @@ -31,11 +31,10 @@ *> U is generated using the method of G.W. Stewart *> ( SIAM J. Numer. Anal. 17, 1980, pp. 403-409 ). *> (BLAS-2 version) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,9 @@ *> to M. *> -6 if LDA is less than M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clarot.f b/TESTING/MATGEN/clarot.f index 08045499..c8b8cae5 100644 --- a/TESTING/MATGEN/clarot.f +++ b/TESTING/MATGEN/clarot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAROT( LROWS, LLEFT, LRIGHT, NL, C, S, A, LDA, XLEFT, * XRIGHT ) @@ -20,11 +20,11 @@ * COMPLEX A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAROT applies a (Givens) rotation to two adjacent rows or *> columns, where one element of the first and/or last column/row @@ -125,11 +125,10 @@ *> *> . . . . . . *> A(1,i),LDA-1, XTOP, XBOTTM ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> LROWS - LOGICAL @@ -213,10 +212,9 @@ *> (if LROWS=.FALSE.). *> Read and modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatm1.f b/TESTING/MATGEN/clatm1.f index 86ea9370..4575f9eb 100644 --- a/TESTING/MATGEN/clatm1.f +++ b/TESTING/MATGEN/clatm1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATM1( MODE, COND, IRSIGN, IDIST, ISEED, D, N, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATM1 computes the entries of D(1..N) as specified by *> MODE, COND and IRSIGN. IDIST and ISEED determine the generation *> of random numbers. CLATM1 is called by CLATMR to generate *> random test matrices for LAPACK programs. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] MODE *> \verbatim @@ -122,10 +121,9 @@ *> -4 => if MODE equals 6 or -6 and IDIST not in range 1 to 4 *> -7 => if N negative *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatm2.f b/TESTING/MATGEN/clatm2.f index 76e053bf..64f0e78d 100644 --- a/TESTING/MATGEN/clatm2.f +++ b/TESTING/MATGEN/clatm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX FUNCTION CLATM2( M, N, I, J, KL, KU, IDIST, ISEED, D, * IGRADE, DL, DR, IPVTNG, IWORK, SPARSE ) @@ -23,11 +23,11 @@ * COMPLEX D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATM2 returns the (I,J) entry of a random matrix of dimension *> (M, N) described by the other paramters. It is called by the @@ -65,11 +65,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -196,10 +195,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatm3.f b/TESTING/MATGEN/clatm3.f index f2d9782a..e1746890 100644 --- a/TESTING/MATGEN/clatm3.f +++ b/TESTING/MATGEN/clatm3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX FUNCTION CLATM3( M, N, I, J, ISUB, JSUB, KL, KU, IDIST, * ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, @@ -25,11 +25,11 @@ * COMPLEX D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATM3 returns the (ISUB,JSUB) entry of a random matrix of *> dimension (M, N) described by the other paramters. (ISUB,JSUB) @@ -70,11 +70,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -212,10 +211,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatm5.f b/TESTING/MATGEN/clatm5.f index b49e5c91..f9b1dd16 100644 --- a/TESTING/MATGEN/clatm5.f +++ b/TESTING/MATGEN/clatm5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATM5( PRTYPE, M, N, A, LDA, B, LDB, C, LDC, D, LDD, * E, LDE, F, LDF, R, LDR, L, LDL, ALPHA, QBLCKA, @@ -23,11 +23,11 @@ * $ L( LDL, * ), R( LDR, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATM5 generates matrices involved in the Generalized Sylvester *> equation: @@ -40,11 +40,10 @@ *> [ I -L ] ( [ A -C ], [ D -F ] ) [ I R ] = ( [ A ], [ D ] ) *> [ I ] ( [ B ] [ E ] ) [ I ] ( [ B ] [ E ] ) *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PRTYPE *> \verbatim @@ -184,10 +183,9 @@ *> blocks on the diagonal in B. Otherwise, QBLCKB is not *> referenced. QBLCKB > 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -198,10 +196,9 @@ * *> \ingroup complex_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> PRTYPE = 1: A and B are Jordan blocks, D and E are identity matrices @@ -264,7 +261,6 @@ *> L, R specifies the right hand sides (C, F). *> *> PRTYPE = 5 special case common and/or close eigs. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/clatm6.f b/TESTING/MATGEN/clatm6.f index 71b83070..93e675ab 100644 --- a/TESTING/MATGEN/clatm6.f +++ b/TESTING/MATGEN/clatm6.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATM6( TYPE, N, A, LDA, B, X, LDX, Y, LDY, ALPHA, * BETA, WX, WY, S, DIF ) @@ -21,11 +21,11 @@ * $ Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATM6 generates test matrices for the generalized eigenvalue *> problem, their corresponding right and left eigenvector matrices, @@ -63,11 +63,10 @@ *> 0 0 0 0 1, 0 0 0 0 1 , where *> *> a, b, x and y will have all values independently of each other. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -158,10 +157,9 @@ *> DIF is REAL array, dimension (N) *> DIF(i) is the reciprocal condition number for eigenvector i. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatme.f b/TESTING/MATGEN/clatme.f index b2499c76..8c6f64fe 100644 --- a/TESTING/MATGEN/clatme.f +++ b/TESTING/MATGEN/clatme.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATME( N, DIST, ISEED, D, MODE, COND, DMAX, * RSIGN, @@ -26,11 +26,11 @@ * COMPLEX A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATME generates random non-symmetric square matrices with *> specified eigenvalues for testing LAPACK programs. @@ -58,11 +58,10 @@ *> *> (Note: since the matrix cannot be reduced beyond Hessenberg form, *> no packing options are available.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -282,10 +281,9 @@ *> 4 => Error return from CLARGE *> 5 => Zero singular value from SLATM1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatmr.f b/TESTING/MATGEN/clatmr.f index ae7dc93c..61611d36 100644 --- a/TESTING/MATGEN/clatmr.f +++ b/TESTING/MATGEN/clatmr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATMR( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RSIGN, GRADE, DL, MODEL, CONDL, DR, MODER, @@ -24,11 +24,11 @@ * COMPLEX A( LDA, * ), D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATMR generates random matrices of various types for testing *> LAPACK programs. @@ -85,11 +85,10 @@ *> in the order of the rows and/or columns, and otherwise *> contain the same data. This consistency cannot be and *> is not maintained with less than full bandwidth. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -472,10 +471,9 @@ *> 5 => ANORM is positive, but matrix constructed prior to *> attempting to scale it to have norm ANORM, is zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatms.f b/TESTING/MATGEN/clatms.f index 00768526..001024c8 100644 --- a/TESTING/MATGEN/clatms.f +++ b/TESTING/MATGEN/clatms.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATMS( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * KL, KU, PACK, A, LDA, WORK, INFO ) @@ -22,11 +22,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATMS generates random matrices with specified singular values *> (or hermitian with specified eigenvalues) @@ -82,11 +82,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -316,10 +315,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from CLAGGE, CLAGHE or CLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/clatmt.f b/TESTING/MATGEN/clatmt.f index bdfbf982..664293e4 100644 --- a/TESTING/MATGEN/clatmt.f +++ b/TESTING/MATGEN/clatmt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATMT( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RANK, KL, KU, PACK, A, LDA, WORK, INFO ) @@ -22,11 +22,11 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATMT generates random matrices with specified singular values *> (or hermitian with specified eigenvalues) @@ -82,11 +82,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -324,10 +323,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from CLAGGE, CLAGHE or CLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlagge.f b/TESTING/MATGEN/dlagge.f index 1a3b2a5c..d75294e3 100644 --- a/TESTING/MATGEN/dlagge.f +++ b/TESTING/MATGEN/dlagge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGGE( M, N, KL, KU, D, A, LDA, ISEED, WORK, INFO ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGGE generates a real general m by n matrix A, by pre- and post- *> multiplying a real diagonal matrix D with random orthogonal matrices: *> A = U*D*V. The lower and upper bandwidths may then be reduced to *> kl and ku by additional orthogonal transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -98,10 +97,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/MATGEN/dlagsy.f b/TESTING/MATGEN/dlagsy.f index 43853036..fc4cc165 100644 --- a/TESTING/MATGEN/dlagsy.f +++ b/TESTING/MATGEN/dlagsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGSY( N, K, D, A, LDA, ISEED, WORK, INFO ) * @@ -18,21 +18,20 @@ * DOUBLE PRECISION A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGSY generates a real symmetric matrix A, by pre- and post- *> multiplying a real diagonal matrix D with a random orthogonal matrix: *> A = U*D*U'. The semi-bandwidth may then be reduced to k by additional *> orthogonal transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,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/MATGEN/dlahilb.f b/TESTING/MATGEN/dlahilb.f index b35f40ee..545cc278 100644 --- a/TESTING/MATGEN/dlahilb.f +++ b/TESTING/MATGEN/dlahilb.f @@ -5,8 +5,8 @@ C> \brief \b DLAHILB * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * @@ -16,11 +16,11 @@ C> \brief \b DLAHILB * DOUBLE PRECISION A(LDA, N), X(LDX, NRHS), B(LDB, NRHS), WORK(N) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -40,11 +40,10 @@ C> \brief \b DLAHILB *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ C> \brief \b DLAHILB *> be not exact. *> < 0: if INFO = -i, the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,7 +136,6 @@ C> \brief \b DLAHILB * .. * * ===================================================================== - * .. Local Scalars .. INTEGER TM, TI, R INTEGER M diff --git a/TESTING/MATGEN/dlakf2.f b/TESTING/MATGEN/dlakf2.f index 2cbed70c..af1cbe18 100644 --- a/TESTING/MATGEN/dlakf2.f +++ b/TESTING/MATGEN/dlakf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAKF2( M, N, A, LDA, B, D, E, Z, LDZ ) * @@ -18,11 +18,11 @@ * $ E( LDA, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Form the 2*M*N by 2*M*N matrix *> @@ -32,11 +32,10 @@ *> where In is the identity matrix of size n and X' is the transpose *> of X. kron(X, Y) is the Kronecker product between the matrices X *> and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,9 @@ *> LDZ is INTEGER *> The leading dimension of Z. ( LDZ >= 2*M*N ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlaran.f b/TESTING/MATGEN/dlaran.f index cfd008ee..07cfb322 100644 --- a/TESTING/MATGEN/dlaran.f +++ b/TESTING/MATGEN/dlaran.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLARAN( ISEED ) * @@ -14,19 +14,18 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARAN returns a random real number from a uniform (0,1) *> distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] ISEED *> \verbatim @@ -36,10 +35,9 @@ *> odd. *> On exit, the seed is updated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -50,10 +48,9 @@ * *> \ingroup list_temp * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine uses a multiplicative congruential method with modulus @@ -65,7 +62,6 @@ *> 48-bit integers are stored in 4 integer array elements with 12 bits *> per element. Hence the routine is portable across machines with *> integers of 32 bits or more. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/dlarge.f b/TESTING/MATGEN/dlarge.f index e7e77e2a..bd863cfb 100644 --- a/TESTING/MATGEN/dlarge.f +++ b/TESTING/MATGEN/dlarge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARGE( N, A, LDA, ISEED, WORK, INFO ) * @@ -18,19 +18,18 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARGE pre- and post-multiplies a real general n by n matrix A *> with a random orthogonal matrix: A = U*D*U'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -72,10 +71,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/MATGEN/dlarnd.f b/TESTING/MATGEN/dlarnd.f index 3716cddd..29df1360 100644 --- a/TESTING/MATGEN/dlarnd.f +++ b/TESTING/MATGEN/dlarnd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLARND( IDIST, ISEED ) * @@ -17,19 +17,18 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARND returns a random real number from a uniform or normal *> distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -48,10 +47,9 @@ *> odd. *> On exit, the seed is updated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -62,16 +60,14 @@ * *> \ingroup double_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine DLARAN to generate a random *> real number from a uniform (0,1) distribution. The Box-Muller method *> is used to transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/dlaror.f b/TESTING/MATGEN/dlaror.f index 5bfa8459..5e14f6c3 100644 --- a/TESTING/MATGEN/dlaror.f +++ b/TESTING/MATGEN/dlaror.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAROR( SIDE, INIT, M, N, A, LDA, ISEED, X, INFO ) * @@ -19,21 +19,20 @@ * DOUBLE PRECISION A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAROR pre- or post-multiplies an M by N matrix A by a random *> orthogonal matrix U, overwriting A. A may optionally be initialized *> to the identity matrix before multiplying by U. U is generated using *> the method of G.W. Stewart (SIAM J. Numer. Anal. 17, 1980, 403-409). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -131,10 +130,9 @@ *> < 0: if INFO = -k, the k-th argument had an illegal value *> = 1: if the random numbers generated by DLARND are bad. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlarot.f b/TESTING/MATGEN/dlarot.f index 108a399a..1f89aed4 100644 --- a/TESTING/MATGEN/dlarot.f +++ b/TESTING/MATGEN/dlarot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAROT( LROWS, LLEFT, LRIGHT, NL, C, S, A, LDA, XLEFT, * XRIGHT ) @@ -20,11 +20,11 @@ * DOUBLE PRECISION A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAROT applies a (Givens) rotation to two adjacent rows or *> columns, where one element of the first and/or last column/row @@ -125,11 +125,10 @@ *> *> . . . . . . *> A(1,i),LDA-1, XTOP, XBOTTM ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> LROWS - LOGICAL @@ -210,10 +209,9 @@ *> (if LROWS=.FALSE.). *> Read and modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatm1.f b/TESTING/MATGEN/dlatm1.f index f8cbb9c9..d8f1296e 100644 --- a/TESTING/MATGEN/dlatm1.f +++ b/TESTING/MATGEN/dlatm1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATM1( MODE, COND, IRSIGN, IDIST, ISEED, D, N, INFO ) * @@ -19,21 +19,20 @@ * DOUBLE PRECISION D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM1 computes the entries of D(1..N) as specified by *> MODE, COND and IRSIGN. IDIST and ISEED determine the generation *> of random numbers. DLATM1 is called by SLATMR to generate *> random test matrices for LAPACK programs. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] MODE *> \verbatim @@ -120,10 +119,9 @@ *> -4 => if MODE equals 6 or -6 and IDIST not in range 1 to 3 *> -7 => if N negative *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatm2.f b/TESTING/MATGEN/dlatm2.f index 1f3eaf38..968629b8 100644 --- a/TESTING/MATGEN/dlatm2.f +++ b/TESTING/MATGEN/dlatm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLATM2( M, N, I, J, KL, KU, IDIST, * ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, SPARSE ) @@ -23,11 +23,11 @@ * DOUBLE PRECISION D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM2 returns the (I,J) entry of a random matrix of dimension *> (M, N) described by the other paramters. It is called by the @@ -65,11 +65,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -192,10 +191,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatm3.f b/TESTING/MATGEN/dlatm3.f index 10d1b2ba..9107fe95 100644 --- a/TESTING/MATGEN/dlatm3.f +++ b/TESTING/MATGEN/dlatm3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLATM3( M, N, I, J, ISUB, JSUB, KL, KU, * IDIST, ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, @@ -25,11 +25,11 @@ * DOUBLE PRECISION D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM3 returns the (ISUB,JSUB) entry of a random matrix of *> dimension (M, N) described by the other paramters. (ISUB,JSUB) @@ -70,11 +70,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -209,10 +208,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatm5.f b/TESTING/MATGEN/dlatm5.f index d3bb66ea..97deab2f 100644 --- a/TESTING/MATGEN/dlatm5.f +++ b/TESTING/MATGEN/dlatm5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATM5( PRTYPE, M, N, A, LDA, B, LDB, C, LDC, D, LDD, * E, LDE, F, LDF, R, LDR, L, LDL, ALPHA, QBLCKA, @@ -23,11 +23,11 @@ * $ L( LDL, * ), R( LDR, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM5 generates matrices involved in the Generalized Sylvester *> equation: @@ -40,11 +40,10 @@ *> [ I -L ] ( [ A -C ], [ D -F ] ) [ I R ] = ( [ A ], [ D ] ) *> [ I ] ( [ B ] [ E ] ) [ I ] ( [ B ] [ E ] ) *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PRTYPE *> \verbatim @@ -184,10 +183,9 @@ *> blocks on the diagonal in B. Otherwise, QBLCKB is not *> referenced. QBLCKB > 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -198,10 +196,9 @@ * *> \ingroup double_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> PRTYPE = 1: A and B are Jordan blocks, D and E are identity matrices @@ -264,7 +261,6 @@ *> L, R specifies the right hand sides (C, F). *> *> PRTYPE = 5 special case common and/or close eigs. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/dlatm6.f b/TESTING/MATGEN/dlatm6.f index 09f92aa8..ee929e89 100644 --- a/TESTING/MATGEN/dlatm6.f +++ b/TESTING/MATGEN/dlatm6.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATM6( TYPE, N, A, LDA, B, X, LDX, Y, LDY, ALPHA, * BETA, WX, WY, S, DIF ) @@ -20,11 +20,11 @@ * $ X( LDX, * ), Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM6 generates test matrices for the generalized eigenvalue *> problem, their corresponding right and left eigenvector matrices, @@ -65,11 +65,10 @@ *> 0 0 0 0 1, 0 0 0 0 1 , *> *> where a, b, x and y will have all values independently of each other. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -160,10 +159,9 @@ *> DIF is DOUBLE PRECISION array, dimension (N) *> DIF(i) is the reciprocal condition number for eigenvector i. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatm7.f b/TESTING/MATGEN/dlatm7.f index 252530f7..64efb748 100644 --- a/TESTING/MATGEN/dlatm7.f +++ b/TESTING/MATGEN/dlatm7.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATM7( MODE, COND, IRSIGN, IDIST, ISEED, D, N, * RANK, INFO ) @@ -20,21 +20,20 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATM7 computes the entries of D as specified by MODE *> COND and IRSIGN. IDIST and ISEED determine the generation *> of random numbers. DLATM7 is called by DLATMT to generate *> random test matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> MODE - INTEGER @@ -106,10 +105,9 @@ *> -4 => if MODE equals 6 or -6 and IDIST not in range 1 to 3 *> -7 => if N negative *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatme.f b/TESTING/MATGEN/dlatme.f index 9eccb773..804f0fd4 100644 --- a/TESTING/MATGEN/dlatme.f +++ b/TESTING/MATGEN/dlatme.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATME( N, DIST, ISEED, D, MODE, COND, DMAX, EI, * RSIGN, @@ -25,11 +25,11 @@ * DOUBLE PRECISION A( LDA, * ), D( * ), DS( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATME generates random non-symmetric square matrices with *> specified eigenvalues for testing LAPACK programs. @@ -63,11 +63,10 @@ *> *> (Note: since the matrix cannot be reduced beyond Hessenberg form, *> no packing options are available.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -313,10 +312,9 @@ *> 4 => Error return from DLARGE *> 5 => Zero singular value from DLATM1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatmr.f b/TESTING/MATGEN/dlatmr.f index 32eff554..d1826886 100644 --- a/TESTING/MATGEN/dlatmr.f +++ b/TESTING/MATGEN/dlatmr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATMR( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RSIGN, GRADE, DL, MODEL, CONDL, DR, MODER, @@ -23,11 +23,11 @@ * DOUBLE PRECISION A( LDA, * ), D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATMR generates random matrices of various types for testing *> LAPACK programs. @@ -81,11 +81,10 @@ *> in the order of the rows and/or columns, and otherwise *> contain the same data. This consistency cannot be and *> is not maintained with less than full bandwidth. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -453,10 +452,9 @@ *> 5 => ANORM is positive, but matrix constructed prior to *> attempting to scale it to have norm ANORM, is zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatms.f b/TESTING/MATGEN/dlatms.f index b63bf92f..dfa94d26 100644 --- a/TESTING/MATGEN/dlatms.f +++ b/TESTING/MATGEN/dlatms.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATMS( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * KL, KU, PACK, A, LDA, WORK, INFO ) @@ -21,11 +21,11 @@ * DOUBLE PRECISION A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATMS generates random matrices with specified singular values *> (or symmetric/hermitian with specified eigenvalues) @@ -81,11 +81,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -305,10 +304,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from DLAGGE or SLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/dlatmt.f b/TESTING/MATGEN/dlatmt.f index a3e9409b..e4b55724 100644 --- a/TESTING/MATGEN/dlatmt.f +++ b/TESTING/MATGEN/dlatmt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATMT( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RANK, KL, KU, PACK, A, LDA, WORK, INFO ) @@ -21,11 +21,11 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATMT generates random matrices with specified singular values *> (or symmetric/hermitian with specified eigenvalues) @@ -81,11 +81,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -315,10 +314,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from DLAGGE or DLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slagge.f b/TESTING/MATGEN/slagge.f index e551eee5..657df78c 100644 --- a/TESTING/MATGEN/slagge.f +++ b/TESTING/MATGEN/slagge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGGE( M, N, KL, KU, D, A, LDA, ISEED, WORK, INFO ) * @@ -18,21 +18,20 @@ * REAL A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGGE generates a real general m by n matrix A, by pre- and post- *> multiplying a real diagonal matrix D with random orthogonal matrices: *> A = U*D*V. The lower and upper bandwidths may then be reduced to *> kl and ku by additional orthogonal transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -98,10 +97,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/MATGEN/slagsy.f b/TESTING/MATGEN/slagsy.f index 18fdee00..c91d3864 100644 --- a/TESTING/MATGEN/slagsy.f +++ b/TESTING/MATGEN/slagsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGSY( N, K, D, A, LDA, ISEED, WORK, INFO ) * @@ -18,21 +18,20 @@ * REAL A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGSY generates a real symmetric matrix A, by pre- and post- *> multiplying a real diagonal matrix D with a random orthogonal matrix: *> A = U*D*U'. The semi-bandwidth may then be reduced to k by additional *> orthogonal transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,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/MATGEN/slahilb.f b/TESTING/MATGEN/slahilb.f index ceb9ef25..e25ee1f4 100644 --- a/TESTING/MATGEN/slahilb.f +++ b/TESTING/MATGEN/slahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * @@ -16,11 +16,11 @@ * REAL A(LDA, N), X(LDX, NRHS), B(LDB, NRHS), WORK(N) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -40,11 +40,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> be not exact. *> < 0: if INFO = -i, the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,7 +136,6 @@ * .. * * ===================================================================== - * .. Local Scalars .. INTEGER TM, TI, R INTEGER M diff --git a/TESTING/MATGEN/slakf2.f b/TESTING/MATGEN/slakf2.f index aa752fa3..bdc3da29 100644 --- a/TESTING/MATGEN/slakf2.f +++ b/TESTING/MATGEN/slakf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAKF2( M, N, A, LDA, B, D, E, Z, LDZ ) * @@ -18,11 +18,11 @@ * $ E( LDA, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Form the 2*M*N by 2*M*N matrix *> @@ -32,11 +32,10 @@ *> where In is the identity matrix of size n and X' is the transpose *> of X. kron(X, Y) is the Kronecker product between the matrices X *> and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,9 @@ *> LDZ is INTEGER *> The leading dimension of Z. ( LDZ >= 2*M*N ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slaran.f b/TESTING/MATGEN/slaran.f index 079aa349..abb9130e 100644 --- a/TESTING/MATGEN/slaran.f +++ b/TESTING/MATGEN/slaran.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLARAN( ISEED ) * @@ -14,19 +14,18 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARAN returns a random real number from a uniform (0,1) *> distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] ISEED *> \verbatim @@ -36,10 +35,9 @@ *> odd. *> On exit, the seed is updated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -50,10 +48,9 @@ * *> \ingroup real_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine uses a multiplicative congruential method with modulus @@ -65,7 +62,6 @@ *> 48-bit integers are stored in 4 integer array elements with 12 bits *> per element. Hence the routine is portable across machines with *> integers of 32 bits or more. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/slarge.f b/TESTING/MATGEN/slarge.f index 8293c289..78053352 100644 --- a/TESTING/MATGEN/slarge.f +++ b/TESTING/MATGEN/slarge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARGE( N, A, LDA, ISEED, WORK, INFO ) * @@ -18,19 +18,18 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARGE pre- and post-multiplies a real general n by n matrix A *> with a random orthogonal matrix: A = U*D*U'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -72,10 +71,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/MATGEN/slarnd.f b/TESTING/MATGEN/slarnd.f index 3868af38..e43c97e1 100644 --- a/TESTING/MATGEN/slarnd.f +++ b/TESTING/MATGEN/slarnd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLARND( IDIST, ISEED ) * @@ -17,19 +17,18 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARND returns a random real number from a uniform or normal *> distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -48,10 +47,9 @@ *> odd. *> On exit, the seed is updated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -62,16 +60,14 @@ * *> \ingroup real_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine SLARAN to generate a random *> real number from a uniform (0,1) distribution. The Box-Muller method *> is used to transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/slaror.f b/TESTING/MATGEN/slaror.f index 63300577..6b50dc7a 100644 --- a/TESTING/MATGEN/slaror.f +++ b/TESTING/MATGEN/slaror.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAROR( SIDE, INIT, M, N, A, LDA, ISEED, X, INFO ) * @@ -19,21 +19,20 @@ * REAL A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAROR pre- or post-multiplies an M by N matrix A by a random *> orthogonal matrix U, overwriting A. A may optionally be initialized *> to the identity matrix before multiplying by U. U is generated using *> the method of G.W. Stewart (SIAM J. Numer. Anal. 17, 1980, 403-409). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -131,10 +130,9 @@ *> < 0: if INFO = -k, the k-th argument had an illegal value *> = 1: if the random numbers generated by SLARND are bad. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slarot.f b/TESTING/MATGEN/slarot.f index 3d9616c7..5633b2c1 100644 --- a/TESTING/MATGEN/slarot.f +++ b/TESTING/MATGEN/slarot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAROT( LROWS, LLEFT, LRIGHT, NL, C, S, A, LDA, XLEFT, * XRIGHT ) @@ -20,11 +20,11 @@ * REAL A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAROT applies a (Givens) rotation to two adjacent rows or *> columns, where one element of the first and/or last column/row @@ -125,11 +125,10 @@ *> *> . . . . . . *> A(1,i),LDA-1, XTOP, XBOTTM ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> LROWS - LOGICAL @@ -210,10 +209,9 @@ *> (if LROWS=.FALSE.). *> Read and modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatm1.f b/TESTING/MATGEN/slatm1.f index 55415420..f303e3e2 100644 --- a/TESTING/MATGEN/slatm1.f +++ b/TESTING/MATGEN/slatm1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATM1( MODE, COND, IRSIGN, IDIST, ISEED, D, N, INFO ) * @@ -19,21 +19,20 @@ * REAL D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM1 computes the entries of D(1..N) as specified by *> MODE, COND and IRSIGN. IDIST and ISEED determine the generation *> of random numbers. SLATM1 is called by SLATMR to generate *> random test matrices for LAPACK programs. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] MODE *> \verbatim @@ -120,10 +119,9 @@ *> -4 => if MODE equals 6 or -6 and IDIST not in range 1 to 3 *> -7 => if N negative *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatm2.f b/TESTING/MATGEN/slatm2.f index 81fa969b..45a71b28 100644 --- a/TESTING/MATGEN/slatm2.f +++ b/TESTING/MATGEN/slatm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLATM2( M, N, I, J, KL, KU, IDIST, * ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, SPARSE ) @@ -23,11 +23,11 @@ * REAL D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM2 returns the (I,J) entry of a random matrix of dimension *> (M, N) described by the other paramters. It is called by the @@ -65,11 +65,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -192,10 +191,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatm3.f b/TESTING/MATGEN/slatm3.f index 3c639920..31046107 100644 --- a/TESTING/MATGEN/slatm3.f +++ b/TESTING/MATGEN/slatm3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLATM3( M, N, I, J, ISUB, JSUB, KL, KU, * IDIST, ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, @@ -25,11 +25,11 @@ * REAL D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM3 returns the (ISUB,JSUB) entry of a random matrix of *> dimension (M, N) described by the other paramters. (ISUB,JSUB) @@ -70,11 +70,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -209,10 +208,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatm5.f b/TESTING/MATGEN/slatm5.f index ef49ad8e..dd882f52 100644 --- a/TESTING/MATGEN/slatm5.f +++ b/TESTING/MATGEN/slatm5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATM5( PRTYPE, M, N, A, LDA, B, LDB, C, LDC, D, LDD, * E, LDE, F, LDF, R, LDR, L, LDL, ALPHA, QBLCKA, @@ -23,11 +23,11 @@ * $ L( LDL, * ), R( LDR, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM5 generates matrices involved in the Generalized Sylvester *> equation: @@ -40,11 +40,10 @@ *> [ I -L ] ( [ A -C ], [ D -F ] ) [ I R ] = ( [ A ], [ D ] ) *> [ I ] ( [ B ] [ E ] ) [ I ] ( [ B ] [ E ] ) *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PRTYPE *> \verbatim @@ -184,10 +183,9 @@ *> blocks on the diagonal in B. Otherwise, QBLCKB is not *> referenced. QBLCKB > 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -198,10 +196,9 @@ * *> \ingroup real_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> PRTYPE = 1: A and B are Jordan blocks, D and E are identity matrices @@ -264,7 +261,6 @@ *> L, R specifies the right hand sides (C, F). *> *> PRTYPE = 5 special case common and/or close eigs. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/slatm6.f b/TESTING/MATGEN/slatm6.f index 1e89a6f6..7cc630ea 100644 --- a/TESTING/MATGEN/slatm6.f +++ b/TESTING/MATGEN/slatm6.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATM6( TYPE, N, A, LDA, B, X, LDX, Y, LDY, ALPHA, * BETA, WX, WY, S, DIF ) @@ -20,11 +20,11 @@ * $ X( LDX, * ), Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM6 generates test matrices for the generalized eigenvalue *> problem, their corresponding right and left eigenvector matrices, @@ -65,11 +65,10 @@ *> 0 0 0 0 1, 0 0 0 0 1 , *> *> where a, b, x and y will have all values independently of each other. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -160,10 +159,9 @@ *> DIF is REAL array, dimension (N) *> DIF(i) is the reciprocal condition number for eigenvector i. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatm7.f b/TESTING/MATGEN/slatm7.f index d5508ba5..0a7db8e5 100644 --- a/TESTING/MATGEN/slatm7.f +++ b/TESTING/MATGEN/slatm7.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATM7( MODE, COND, IRSIGN, IDIST, ISEED, D, N, * RANK, INFO ) @@ -20,21 +20,20 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATM7 computes the entries of D as specified by MODE *> COND and IRSIGN. IDIST and ISEED determine the generation *> of random numbers. SLATM7 is called by SLATMT to generate *> random test matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> MODE - INTEGER @@ -106,10 +105,9 @@ *> -4 => if MODE equals 6 or -6 and IDIST not in range 1 to 3 *> -7 => if N negative *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatme.f b/TESTING/MATGEN/slatme.f index 3deff329..0e53e89f 100644 --- a/TESTING/MATGEN/slatme.f +++ b/TESTING/MATGEN/slatme.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATME( N, DIST, ISEED, D, MODE, COND, DMAX, EI, * RSIGN, @@ -25,11 +25,11 @@ * REAL A( LDA, * ), D( * ), DS( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATME generates random non-symmetric square matrices with *> specified eigenvalues for testing LAPACK programs. @@ -63,11 +63,10 @@ *> *> (Note: since the matrix cannot be reduced beyond Hessenberg form, *> no packing options are available.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -313,10 +312,9 @@ *> 4 => Error return from SLARGE *> 5 => Zero singular value from SLATM1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatmr.f b/TESTING/MATGEN/slatmr.f index e58b2671..64b48c23 100644 --- a/TESTING/MATGEN/slatmr.f +++ b/TESTING/MATGEN/slatmr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATMR( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RSIGN, GRADE, DL, MODEL, CONDL, DR, MODER, @@ -23,11 +23,11 @@ * REAL A( LDA, * ), D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATMR generates random matrices of various types for testing *> LAPACK programs. @@ -81,11 +81,10 @@ *> in the order of the rows and/or columns, and otherwise *> contain the same data. This consistency cannot be and *> is not maintained with less than full bandwidth. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -453,10 +452,9 @@ *> 5 => ANORM is positive, but matrix constructed prior to *> attempting to scale it to have norm ANORM, is zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatms.f b/TESTING/MATGEN/slatms.f index 74abc335..ff137dff 100644 --- a/TESTING/MATGEN/slatms.f +++ b/TESTING/MATGEN/slatms.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATMS( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * KL, KU, PACK, A, LDA, WORK, INFO ) @@ -21,11 +21,11 @@ * REAL A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATMS generates random matrices with specified singular values *> (or symmetric/hermitian with specified eigenvalues) @@ -81,11 +81,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -305,10 +304,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from SLAGGE or SLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/slatmt.f b/TESTING/MATGEN/slatmt.f index 3a3c598d..25d1e943 100644 --- a/TESTING/MATGEN/slatmt.f +++ b/TESTING/MATGEN/slatmt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATMT( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RANK, KL, KU, PACK, A, LDA, WORK, INFO ) @@ -21,11 +21,11 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATMT generates random matrices with specified singular values *> (or symmetric/hermitian with specified eigenvalues) @@ -81,11 +81,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -315,10 +314,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from SLAGGE or SLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlagge.f b/TESTING/MATGEN/zlagge.f index 5963699d..a39492d4 100644 --- a/TESTING/MATGEN/zlagge.f +++ b/TESTING/MATGEN/zlagge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAGGE( M, N, KL, KU, D, A, LDA, ISEED, WORK, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAGGE generates a complex general m by n matrix A, by pre- and post- *> multiplying a real diagonal matrix D with random unitary matrices: *> A = U*D*V. The lower and upper bandwidths may then be reduced to *> kl and ku by additional unitary transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,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/MATGEN/zlaghe.f b/TESTING/MATGEN/zlaghe.f index 8e9c6e3c..0b742da9 100644 --- a/TESTING/MATGEN/zlaghe.f +++ b/TESTING/MATGEN/zlaghe.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAGHE( N, K, D, A, LDA, ISEED, WORK, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAGHE generates a complex hermitian matrix A, by pre- and post- *> multiplying a real diagonal matrix D with a random unitary matrix: *> A = U*D*U'. The semi-bandwidth may then be reduced to k by additional *> unitary transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,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/MATGEN/zlagsy.f b/TESTING/MATGEN/zlagsy.f index 317d2489..4f6fd3a7 100644 --- a/TESTING/MATGEN/zlagsy.f +++ b/TESTING/MATGEN/zlagsy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAGSY( N, K, D, A, LDA, ISEED, WORK, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAGSY generates a complex symmetric matrix A, by pre- and post- *> multiplying a real diagonal matrix D with a random unitary matrix: *> A = U*D*U**T. The semi-bandwidth may then be reduced to k by *> additional unitary transformations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,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/MATGEN/zlahilb.f b/TESTING/MATGEN/zlahilb.f index 3d68ab69..9e55fa51 100644 --- a/TESTING/MATGEN/zlahilb.f +++ b/TESTING/MATGEN/zlahilb.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, * INFO, PATH) @@ -19,11 +19,11 @@ * CHARACTER*3 PATH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAHILB generates an N by N scaled Hilbert matrix in A along with *> NRHS right-hand sides in B and solutions in X such that A*X=B. @@ -43,11 +43,10 @@ *> *> In single, the generated solution is exact for N <= 6 and has *> small componentwise error for 7 <= N <= 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -118,10 +117,9 @@ *> PATH is CHARACTER*3 *> The LAPACK path name. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -150,7 +148,6 @@ * .. * * ===================================================================== - * .. Local Scalars .. INTEGER TM, TI, R INTEGER M diff --git a/TESTING/MATGEN/zlakf2.f b/TESTING/MATGEN/zlakf2.f index 07c748fb..eddd9877 100644 --- a/TESTING/MATGEN/zlakf2.f +++ b/TESTING/MATGEN/zlakf2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAKF2( M, N, A, LDA, B, D, E, Z, LDZ ) * @@ -18,11 +18,11 @@ * $ E( LDA, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Form the 2*M*N by 2*M*N matrix *> @@ -32,11 +32,10 @@ *> where In is the identity matrix of size n and X' is the transpose *> of X. kron(X, Y) is the Kronecker product between the matrices X *> and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,9 @@ *> LDZ is INTEGER *> The leading dimension of Z. ( LDZ >= 2*M*N ) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlarge.f b/TESTING/MATGEN/zlarge.f index 895afc48..e7b39ec2 100644 --- a/TESTING/MATGEN/zlarge.f +++ b/TESTING/MATGEN/zlarge.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARGE( N, A, LDA, ISEED, WORK, INFO ) * @@ -18,19 +18,18 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARGE pre- and post-multiplies a complex general n by n matrix A *> with a random unitary matrix: A = U*D*U'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -72,10 +71,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/MATGEN/zlarnd.f b/TESTING/MATGEN/zlarnd.f index 15919f27..757b3876 100644 --- a/TESTING/MATGEN/zlarnd.f +++ b/TESTING/MATGEN/zlarnd.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX*16 FUNCTION ZLARND( IDIST, ISEED ) * @@ -17,19 +17,18 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARND returns a random complex number from a uniform or normal *> distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -50,10 +49,9 @@ *> odd. *> On exit, the seed is updated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -64,16 +62,14 @@ * *> \ingroup complex16_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine DLARAN to generate a random *> real number from a uniform (0,1) distribution. The Box-Muller method *> is used to transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/zlaror.f b/TESTING/MATGEN/zlaror.f index 6eab03cb..a088028f 100644 --- a/TESTING/MATGEN/zlaror.f +++ b/TESTING/MATGEN/zlaror.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAROR( SIDE, INIT, M, N, A, LDA, ISEED, X, INFO ) * @@ -19,11 +19,11 @@ * COMPLEX*16 A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAROR pre- or post-multiplies an M by N matrix A by a random *> unitary matrix U, overwriting A. A may optionally be @@ -31,11 +31,10 @@ *> U is generated using the method of G.W. Stewart *> ( SIAM J. Numer. Anal. 17, 1980, pp. 403-409 ). *> (BLAS-2 version) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,9 @@ *> to M. *> -6 if LDA is less than M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlarot.f b/TESTING/MATGEN/zlarot.f index e0b85c62..30f3da89 100644 --- a/TESTING/MATGEN/zlarot.f +++ b/TESTING/MATGEN/zlarot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAROT( LROWS, LLEFT, LRIGHT, NL, C, S, A, LDA, XLEFT, * XRIGHT ) @@ -20,11 +20,11 @@ * COMPLEX*16 A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAROT applies a (Givens) rotation to two adjacent rows or *> columns, where one element of the first and/or last column/row @@ -125,11 +125,10 @@ *> *> . . . . . . *> A(1,i),LDA-1, XTOP, XBOTTM ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> LROWS - LOGICAL @@ -213,10 +212,9 @@ *> (if LROWS=.FALSE.). *> Read and modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatm1.f b/TESTING/MATGEN/zlatm1.f index 8e6829bf..524c5d27 100644 --- a/TESTING/MATGEN/zlatm1.f +++ b/TESTING/MATGEN/zlatm1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATM1( MODE, COND, IRSIGN, IDIST, ISEED, D, N, INFO ) * @@ -19,21 +19,20 @@ * COMPLEX*16 D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATM1 computes the entries of D(1..N) as specified by *> MODE, COND and IRSIGN. IDIST and ISEED determine the generation *> of random numbers. ZLATM1 is called by CLATMR to generate *> random test matrices for LAPACK programs. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] MODE *> \verbatim @@ -122,10 +121,9 @@ *> -4 => if MODE equals 6 or -6 and IDIST not in range 1 to 4 *> -7 => if N negative *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatm2.f b/TESTING/MATGEN/zlatm2.f index 76b0152d..813815c5 100644 --- a/TESTING/MATGEN/zlatm2.f +++ b/TESTING/MATGEN/zlatm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX*16 FUNCTION ZLATM2( M, N, I, J, KL, KU, IDIST, * ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, SPARSE ) @@ -23,11 +23,11 @@ * COMPLEX*16 D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATM2 returns the (I,J) entry of a random matrix of dimension *> (M, N) described by the other paramters. It is called by the @@ -65,11 +65,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -195,10 +194,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatm3.f b/TESTING/MATGEN/zlatm3.f index b3aac8ed..e4becc74 100644 --- a/TESTING/MATGEN/zlatm3.f +++ b/TESTING/MATGEN/zlatm3.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX*16 FUNCTION ZLATM3( M, N, I, J, ISUB, JSUB, KL, KU, * IDIST, ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, @@ -25,11 +25,11 @@ * COMPLEX*16 D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATM3 returns the (ISUB,JSUB) entry of a random matrix of *> dimension (M, N) described by the other paramters. (ISUB,JSUB) @@ -70,11 +70,10 @@ *> bandwidth KU. *> *> Set random entries to zero as specified by SPARSE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -212,10 +211,9 @@ *> entries will be set to zero. *> Not modified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatm5.f b/TESTING/MATGEN/zlatm5.f index 6e3ce53d..abc31cc4 100644 --- a/TESTING/MATGEN/zlatm5.f +++ b/TESTING/MATGEN/zlatm5.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATM5( PRTYPE, M, N, A, LDA, B, LDB, C, LDC, D, LDD, * E, LDE, F, LDF, R, LDR, L, LDL, ALPHA, QBLCKA, @@ -23,11 +23,11 @@ * $ L( LDL, * ), R( LDR, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATM5 generates matrices involved in the Generalized Sylvester *> equation: @@ -40,11 +40,10 @@ *> [ I -L ] ( [ A -C ], [ D -F ] ) [ I R ] = ( [ A ], [ D ] ) *> [ I ] ( [ B ] [ E ] ) [ I ] ( [ B ] [ E ] ) *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PRTYPE *> \verbatim @@ -184,10 +183,9 @@ *> blocks on the diagonal in B. Otherwise, QBLCKB is not *> referenced. QBLCKB > 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -198,10 +196,9 @@ * *> \ingroup complex16_matgen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> PRTYPE = 1: A and B are Jordan blocks, D and E are identity matrices @@ -264,7 +261,6 @@ *> L, R specifies the right hand sides (C, F). *> *> PRTYPE = 5 special case common and/or close eigs. -*> *> \endverbatim *> * ===================================================================== diff --git a/TESTING/MATGEN/zlatm6.f b/TESTING/MATGEN/zlatm6.f index 04a52d8b..082fe36c 100644 --- a/TESTING/MATGEN/zlatm6.f +++ b/TESTING/MATGEN/zlatm6.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATM6( TYPE, N, A, LDA, B, X, LDX, Y, LDY, ALPHA, * BETA, WX, WY, S, DIF ) @@ -21,11 +21,11 @@ * $ Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATM6 generates test matrices for the generalized eigenvalue *> problem, their corresponding right and left eigenvector matrices, @@ -63,11 +63,10 @@ *> 0 0 0 0 1, 0 0 0 0 1 , where *> *> a, b, x and y will have all values independently of each other. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -158,10 +157,9 @@ *> DIF is DOUBLE PRECISION array, dimension (N) *> DIF(i) is the reciprocal condition number for eigenvector i. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatme.f b/TESTING/MATGEN/zlatme.f index 51dbb2d1..afb6f411 100644 --- a/TESTING/MATGEN/zlatme.f +++ b/TESTING/MATGEN/zlatme.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATME( N, DIST, ISEED, D, MODE, COND, DMAX, * RSIGN, @@ -26,11 +26,11 @@ * COMPLEX*16 A( LDA, * ), D( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATME generates random non-symmetric square matrices with *> specified eigenvalues for testing LAPACK programs. @@ -58,11 +58,10 @@ *> *> (Note: since the matrix cannot be reduced beyond Hessenberg form, *> no packing options are available.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -282,10 +281,9 @@ *> 4 => Error return from ZLARGE *> 5 => Zero singular value from DLATM1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatmr.f b/TESTING/MATGEN/zlatmr.f index 9f2c2646..ec36ccfd 100644 --- a/TESTING/MATGEN/zlatmr.f +++ b/TESTING/MATGEN/zlatmr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATMR( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RSIGN, GRADE, DL, MODEL, CONDL, DR, MODER, @@ -24,11 +24,11 @@ * COMPLEX*16 A( LDA, * ), D( * ), DL( * ), DR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATMR generates random matrices of various types for testing *> LAPACK programs. @@ -85,11 +85,10 @@ *> in the order of the rows and/or columns, and otherwise *> contain the same data. This consistency cannot be and *> is not maintained with less than full bandwidth. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -472,10 +471,9 @@ *> 5 => ANORM is positive, but matrix constructed prior to *> attempting to scale it to have norm ANORM, is zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatms.f b/TESTING/MATGEN/zlatms.f index 2a25fc27..e57af33a 100644 --- a/TESTING/MATGEN/zlatms.f +++ b/TESTING/MATGEN/zlatms.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATMS( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * KL, KU, PACK, A, LDA, WORK, INFO ) @@ -22,11 +22,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATMS generates random matrices with specified singular values *> (or hermitian with specified eigenvalues) @@ -82,11 +82,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -316,10 +315,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from ZLAGGE, CLAGHE or CLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/TESTING/MATGEN/zlatmt.f b/TESTING/MATGEN/zlatmt.f index 99707c25..39ca0d6e 100644 --- a/TESTING/MATGEN/zlatmt.f +++ b/TESTING/MATGEN/zlatmt.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATMT( M, N, DIST, ISEED, SYM, D, MODE, COND, DMAX, * RANK, KL, KU, PACK, A, LDA, WORK, INFO ) @@ -22,11 +22,11 @@ * INTEGER ISEED( 4 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATMT generates random matrices with specified singular values *> (or hermitian with specified eigenvalues) @@ -82,11 +82,10 @@ *> If Method B is chosen, and band format is specified, then the *> matrix will be generated in the band format, so no repacking *> will be necessary. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -324,10 +323,9 @@ *> 2 => Cannot scale to DMAX (max. sing. value is 0) *> 3 => Error return from ZLAGGE, ZLAGHE or ZLAGSY *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley |