From: julie Date: Thu, 3 Nov 2011 20:32:56 +0000 (+0000) Subject: Cosmetic changes in Doxygen presentation. X-Git-Tag: accepted/tizen/5.0/unified/20181102.024111~753 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=1c3ba600671a59785b0c647d400226b4cc19a11f;p=platform%2Fupstream%2Flapack.git 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. --- diff --git a/BLAS/SRC/caxpy.f b/BLAS/SRC/caxpy.f index 3e274e5..7b23a34 100644 --- a/BLAS/SRC/caxpy.f +++ b/BLAS/SRC/caxpy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CAXPY(N,CA,CX,INCX,CY,INCY) * @@ -18,18 +18,17 @@ * COMPLEX CX(*),CY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CAXPY constant times a vector plus a vector. +*> \verbatim *> -*>\endverbatim +*> CAXPY constant times a vector plus a vector. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ccopy.f b/BLAS/SRC/ccopy.f index 039a8be..9c11db0 100644 --- a/BLAS/SRC/ccopy.f +++ b/BLAS/SRC/ccopy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CCOPY(N,CX,INCX,CY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX CX(*),CY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CCOPY copies a vector x to a vector y. +*> \verbatim *> -*>\endverbatim +*> CCOPY copies a vector x to a vector y. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cdotc.f b/BLAS/SRC/cdotc.f index 6903726..8e7d8b9 100644 --- a/BLAS/SRC/cdotc.f +++ b/BLAS/SRC/cdotc.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX FUNCTION CDOTC(N,CX,INCX,CY,INCY) * @@ -17,19 +17,18 @@ * COMPLEX CX(*),CY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> forms the dot product of two vectors, conjugating the first *> vector. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cdotu.f b/BLAS/SRC/cdotu.f index 00bc019..456a409 100644 --- a/BLAS/SRC/cdotu.f +++ b/BLAS/SRC/cdotu.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX FUNCTION CDOTU(N,CX,INCX,CY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX CX(*),CY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CDOTU forms the dot product of two vectors. +*> \verbatim *> -*>\endverbatim +*> CDOTU forms the dot product of two vectors. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cgbmv.f b/BLAS/SRC/cgbmv.f index 01690bb..cd597f9 100644 --- a/BLAS/SRC/cgbmv.f +++ b/BLAS/SRC/cgbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBMV(TRANS,M,N,KL,KU,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBMV performs one of the matrix-vector operations *> @@ -33,11 +33,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n band matrix, with kl sub-diagonals and ku super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -157,10 +156,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -171,10 +169,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -185,7 +182,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cgemm.f b/BLAS/SRC/cgemm.f index b1ba4c5..ecfe12e 100644 --- a/BLAS/SRC/cgemm.f +++ b/BLAS/SRC/cgemm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEMM(TRANSA,TRANSB,M,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> alpha and beta are scalars, and A, B and C are matrices, with op( A ) *> an m by k matrix, op( B ) a k by n matrix and C an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -158,10 +157,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -172,10 +170,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -185,7 +182,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cgemv.f b/BLAS/SRC/cgemv.f index db0564c..507d19e 100644 --- a/BLAS/SRC/cgemv.f +++ b/BLAS/SRC/cgemv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEMV(TRANS,M,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEMV performs one of the matrix-vector operations *> @@ -33,11 +33,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -128,10 +127,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -142,10 +140,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -156,7 +153,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cgerc.f b/BLAS/SRC/cgerc.f index d6539b0..a99d5b9 100644 --- a/BLAS/SRC/cgerc.f +++ b/BLAS/SRC/cgerc.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERC(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -18,11 +18,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGERC performs the rank 1 operation *> @@ -30,11 +30,10 @@ *> *> where alpha is a scalar, x is an m element vector, y is an n element *> vector and A is an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -101,10 +100,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cgeru.f b/BLAS/SRC/cgeru.f index 0db12d7..c551782 100644 --- a/BLAS/SRC/cgeru.f +++ b/BLAS/SRC/cgeru.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERU(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -18,11 +18,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGERU performs the rank 1 operation *> @@ -30,11 +30,10 @@ *> *> where alpha is a scalar, x is an m element vector, y is an n element *> vector and A is an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -101,10 +100,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/chbmv.f b/BLAS/SRC/chbmv.f index bafb5f1..bbfeb1f 100644 --- a/BLAS/SRC/chbmv.f +++ b/BLAS/SRC/chbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBMV(UPLO,N,K,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n hermitian band matrix, with k super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -157,10 +156,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -171,10 +169,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -185,7 +182,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/chemm.f b/BLAS/SRC/chemm.f index 2944c64..069491c 100644 --- a/BLAS/SRC/chemm.f +++ b/BLAS/SRC/chemm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEMM(SIDE,UPLO,M,N,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> where alpha and beta are scalars, A is an hermitian matrix and B and *> C are m by n matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -176,10 +174,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -189,7 +186,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/chemv.f b/BLAS/SRC/chemv.f index f93e0c4..56f8359 100644 --- a/BLAS/SRC/chemv.f +++ b/BLAS/SRC/chemv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEMV(UPLO,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -152,7 +149,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cher.f b/BLAS/SRC/cher.f index 1e74428..8cd6f0c 100644 --- a/BLAS/SRC/cher.f +++ b/BLAS/SRC/cher.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHER(UPLO,N,ALPHA,X,INCX,A,LDA) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHER performs the hermitian rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +105,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -120,10 +118,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -133,7 +130,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cher2.f b/BLAS/SRC/cher2.f index 9324e3a..cdbeba3 100644 --- a/BLAS/SRC/cher2.f +++ b/BLAS/SRC/cher2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHER2(UPLO,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHER2 performs the hermitian rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an n *> by n hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -121,10 +120,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -135,10 +133,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -148,7 +145,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cher2k.f b/BLAS/SRC/cher2k.f index 9ba1295..0c8218d 100644 --- a/BLAS/SRC/cher2k.f +++ b/BLAS/SRC/cher2k.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHER2K(UPLO,TRANS,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -20,11 +20,11 @@ * COMPLEX A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHER2K performs one of the hermitian rank 2k operations *> @@ -37,11 +37,10 @@ *> where alpha and beta are scalars with beta real, C is an n by n *> hermitian matrix and A and B are n by k matrices in the first case *> and k by n matrices in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,10 +164,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -179,10 +177,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -195,7 +192,6 @@ *> *> -- Modified 8-Nov-93 to set C(J,J) to REAL( C(J,J) ) when BETA = 1. *> Ed Anderson, Cray Research Inc. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cherk.f b/BLAS/SRC/cherk.f index addbefb..cbc5955 100644 --- a/BLAS/SRC/cherk.f +++ b/BLAS/SRC/cherk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHERK(UPLO,TRANS,N,K,ALPHA,A,LDA,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHERK performs one of the hermitian rank k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are real scalars, C is an n by n hermitian *> matrix and A is an n by k matrix in the first case and a k by n *> matrix in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -155,10 +153,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -171,7 +168,6 @@ *> *> -- Modified 8-Nov-93 to set C(J,J) to REAL( C(J,J) ) when BETA = 1. *> Ed Anderson, Cray Research Inc. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/chpmv.f b/BLAS/SRC/chpmv.f index 8128ca6..93c0342 100644 --- a/BLAS/SRC/chpmv.f +++ b/BLAS/SRC/chpmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPMV(UPLO,N,ALPHA,AP,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n hermitian matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -133,10 +131,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -147,7 +144,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/chpr.f b/BLAS/SRC/chpr.f index 3101ccd..8b0cecd 100644 --- a/BLAS/SRC/chpr.f +++ b/BLAS/SRC/chpr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPR(UPLO,N,ALPHA,X,INCX,AP) * @@ -19,11 +19,11 @@ * COMPLEX AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPR performs the hermitian rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n hermitian matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -101,10 +100,9 @@ *> not be set, they are assumed to be zero, and on exit they *> are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/chpr2.f b/BLAS/SRC/chpr2.f index d324211..eea346b 100644 --- a/BLAS/SRC/chpr2.f +++ b/BLAS/SRC/chpr2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPR2(UPLO,N,ALPHA,X,INCX,Y,INCY,AP) * @@ -19,11 +19,11 @@ * COMPLEX AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPR2 performs the hermitian rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an *> n by n hermitian matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -116,10 +115,9 @@ *> not be set, they are assumed to be zero, and on exit they *> are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -130,10 +128,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -143,7 +140,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/crotg.f b/BLAS/SRC/crotg.f index f480022..1a2efd4 100644 --- a/BLAS/SRC/crotg.f +++ b/BLAS/SRC/crotg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CROTG(CA,CB,C,S) * @@ -15,18 +15,17 @@ * REAL C * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CROTG determines a complex Givens rotation. +*> \verbatim *> -*>\endverbatim +*> CROTG determines a complex Givens rotation. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/cscal.f b/BLAS/SRC/cscal.f index 0e2dc6a..cceb77e 100644 --- a/BLAS/SRC/cscal.f +++ b/BLAS/SRC/cscal.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSCAL(N,CA,CX,INCX) * @@ -18,18 +18,17 @@ * COMPLEX CX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CSCAL scales a vector by a constant. +*> \verbatim *> -*>\endverbatim +*> CSCAL scales a vector by a constant. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,16 +39,14 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/csrot.f b/BLAS/SRC/csrot.f index 02a7a38..b600d9a 100644 --- a/BLAS/SRC/csrot.f +++ b/BLAS/SRC/csrot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSROT( N, CX, INCX, CY, INCY, C, S ) * @@ -18,20 +18,19 @@ * COMPLEX CX( * ), CY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSROT applies a plane rotation, where the cos and sin (c and s) are real *> and the vectors cx and cy are complex. *> jack dongarra, linpack, 3/11/78. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -83,10 +82,9 @@ *> S is REAL *> On entry, S specifies the sine, sin. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/csscal.f b/BLAS/SRC/csscal.f index 2af05c2..f2edde8 100644 --- a/BLAS/SRC/csscal.f +++ b/BLAS/SRC/csscal.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSSCAL(N,SA,CX,INCX) * @@ -18,18 +18,17 @@ * COMPLEX CX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CSSCAL scales a complex vector by a real constant. +*> \verbatim *> -*>\endverbatim +*> CSSCAL scales a complex vector by a real constant. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,16 +39,14 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/cswap.f b/BLAS/SRC/cswap.f index 12a6f19..2e4bedf 100644 --- a/BLAS/SRC/cswap.f +++ b/BLAS/SRC/cswap.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSWAP(N,CX,INCX,CY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX CX(*),CY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CSWAP interchanges two vectors. +*> \verbatim *> -*>\endverbatim +*> CSWAP interchanges two vectors. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/csymm.f b/BLAS/SRC/csymm.f index f229c48..9d6d743 100644 --- a/BLAS/SRC/csymm.f +++ b/BLAS/SRC/csymm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYMM(SIDE,UPLO,M,N,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> where alpha and beta are scalars, A is a symmetric matrix and B and *> C are m by n matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -160,10 +159,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -187,7 +184,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/csyr2k.f b/BLAS/SRC/csyr2k.f index d37e643..dfa68e0 100644 --- a/BLAS/SRC/csyr2k.f +++ b/BLAS/SRC/csyr2k.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYR2K(UPLO,TRANS,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYR2K performs one of the symmetric rank 2k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A and B are n by k matrices in the first case and k by n *> matrices in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,10 +158,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -173,10 +171,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -186,7 +183,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/csyrk.f b/BLAS/SRC/csyrk.f index 744e7f3..8bf58ad 100644 --- a/BLAS/SRC/csyrk.f +++ b/BLAS/SRC/csyrk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYRK(UPLO,TRANS,N,K,ALPHA,A,LDA,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYRK performs one of the symmetric rank k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A is an n by k matrix in the first case and a k by n matrix *> in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -138,10 +137,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -152,10 +150,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -165,7 +162,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctbmv.f b/BLAS/SRC/ctbmv.f index 18214c2..45d17b8 100644 --- a/BLAS/SRC/ctbmv.f +++ b/BLAS/SRC/ctbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBMV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular band matrix, with ( k + 1 ) diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,10 +155,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,10 +168,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -184,7 +181,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctbsv.f b/BLAS/SRC/ctbsv.f index 8a70301..3e6c663 100644 --- a/BLAS/SRC/ctbsv.f +++ b/BLAS/SRC/ctbsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBSV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBSV solves one of the systems of equations *> @@ -34,11 +34,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -160,10 +159,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -187,7 +184,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctpmv.f b/BLAS/SRC/ctpmv.f index ad6e9b3..14c7417 100644 --- a/BLAS/SRC/ctpmv.f +++ b/BLAS/SRC/ctpmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPMV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,10 +124,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -140,7 +137,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctpsv.f b/BLAS/SRC/ctpsv.f index fd2d0d1..40844de 100644 --- a/BLAS/SRC/ctpsv.f +++ b/BLAS/SRC/ctpsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPSV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -142,7 +139,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctrmm.f b/BLAS/SRC/ctrmm.f index 28a6d7d..b0ac1dd 100644 --- a/BLAS/SRC/ctrmm.f +++ b/BLAS/SRC/ctrmm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRMM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRMM performs one of the matrix-matrix operations *> @@ -33,11 +33,10 @@ *> non-unit, upper or lower triangular matrix and op( A ) is one of *> *> op( A ) = A or op( A ) = A**T or op( A ) = A**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -148,10 +147,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -162,10 +160,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -175,7 +172,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctrmv.f b/BLAS/SRC/ctrmv.f index 734bcd0..f2bfbc2 100644 --- a/BLAS/SRC/ctrmv.f +++ b/BLAS/SRC/ctrmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRMV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -131,10 +129,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctrsm.f b/BLAS/SRC/ctrsm.f index 93823f0..b87bfe3 100644 --- a/BLAS/SRC/ctrsm.f +++ b/BLAS/SRC/ctrsm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRSM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * COMPLEX A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRSM solves one of the matrix equations *> @@ -35,11 +35,10 @@ *> op( A ) = A or op( A ) = A**T or op( A ) = A**H. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup complex_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -178,7 +175,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ctrsv.f b/BLAS/SRC/ctrsv.f index 05e7c4e..9089728 100644 --- a/BLAS/SRC/ctrsv.f +++ b/BLAS/SRC/ctrsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRSV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -134,10 +132,9 @@ * *> \ingroup complex_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -147,7 +144,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dasum.f b/BLAS/SRC/dasum.f index b6609de..c1bd78a 100644 --- a/BLAS/SRC/dasum.f +++ b/BLAS/SRC/dasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DASUM(N,DX,INCX) * @@ -17,18 +17,17 @@ * DOUBLE PRECISION DX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DASUM takes the sum of the absolute values. +*> \verbatim *> -*>\endverbatim +*> DASUM takes the sum of the absolute values. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,16 +38,14 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/daxpy.f b/BLAS/SRC/daxpy.f index b21a965..64a02d6 100644 --- a/BLAS/SRC/daxpy.f +++ b/BLAS/SRC/daxpy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DAXPY(N,DA,DX,INCX,DY,INCY) * @@ -18,19 +18,18 @@ * DOUBLE PRECISION DX(*),DY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DAXPY constant times a vector plus a vector. *> uses unrolled loops for increments equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -41,15 +40,13 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dcabs1.f b/BLAS/SRC/dcabs1.f index f290b05..f6debb9 100644 --- a/BLAS/SRC/dcabs1.f +++ b/BLAS/SRC/dcabs1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DCABS1(Z) * @@ -14,18 +14,18 @@ * COMPLEX*16 Z * .. * .. -* Purpose -* ======= +* * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DCABS1 computes absolute value of a double complex number +*> \verbatim *> -*>\endverbatim +*> DCABS1 computes absolute value of a double complex number +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/dcopy.f b/BLAS/SRC/dcopy.f index 35d0f4d..d9d5ac7 100644 --- a/BLAS/SRC/dcopy.f +++ b/BLAS/SRC/dcopy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DCOPY(N,DX,INCX,DY,INCY) * @@ -17,19 +17,18 @@ * DOUBLE PRECISION DX(*),DY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DCOPY copies a vector, x, to a vector, y. *> uses unrolled loops for increments equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ddot.f b/BLAS/SRC/ddot.f index 13acc40..cc0c1b7 100644 --- a/BLAS/SRC/ddot.f +++ b/BLAS/SRC/ddot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DDOT(N,DX,INCX,DY,INCY) * @@ -17,19 +17,18 @@ * DOUBLE PRECISION DX(*),DY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDOT forms the dot product of two vectors. *> uses unrolled loops for increments equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dgbmv.f b/BLAS/SRC/dgbmv.f index 198b0ab..4a608bd 100644 --- a/BLAS/SRC/dgbmv.f +++ b/BLAS/SRC/dgbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBMV(TRANS,M,N,KL,KU,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBMV performs one of the matrix-vector operations *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n band matrix, with kl sub-diagonals and ku super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -155,10 +154,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -169,10 +167,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -183,7 +180,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dgemm.f b/BLAS/SRC/dgemm.f index e8aa6a4..45d001b 100644 --- a/BLAS/SRC/dgemm.f +++ b/BLAS/SRC/dgemm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEMM(TRANSA,TRANSB,M,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> alpha and beta are scalars, and A, B and C are matrices, with op( A ) *> an m by k matrix, op( B ) a k by n matrix and C an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -158,10 +157,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -172,10 +170,9 @@ * *> \ingroup double_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -185,7 +182,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dgemv.f b/BLAS/SRC/dgemv.f index ef42e93..675257f 100644 --- a/BLAS/SRC/dgemv.f +++ b/BLAS/SRC/dgemv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEMV(TRANS,M,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEMV performs one of the matrix-vector operations *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -126,10 +125,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -140,10 +138,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -154,7 +151,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dger.f b/BLAS/SRC/dger.f index c0e6059..a042483 100644 --- a/BLAS/SRC/dger.f +++ b/BLAS/SRC/dger.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGER(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGER performs the rank 1 operation *> @@ -30,11 +30,10 @@ *> *> where alpha is a scalar, x is an m element vector, y is an n element *> vector and A is an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -101,10 +100,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dnrm2.f b/BLAS/SRC/dnrm2.f index 7d4a005..5ea257a 100644 --- a/BLAS/SRC/dnrm2.f +++ b/BLAS/SRC/dnrm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DNRM2(N,X,INCX) * @@ -17,21 +17,20 @@ * DOUBLE PRECISION X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DNRM2 returns the euclidean norm of a vector via the function *> name, so that *> *> DNRM2 := sqrt( x'*x ) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -42,16 +41,14 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> -- This version written on 25-October-1982. *> Modified on 14-October-1993 to inline the call to DLASSQ. *> Sven Hammarling, Nag Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/drot.f b/BLAS/SRC/drot.f index 355e17f..1615ef6 100644 --- a/BLAS/SRC/drot.f +++ b/BLAS/SRC/drot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DROT(N,DX,INCX,DY,INCY,C,S) * @@ -18,18 +18,17 @@ * DOUBLE PRECISION DX(*),DY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DROT applies a plane rotation. +*> \verbatim *> -*>\endverbatim +*> DROT applies a plane rotation. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/drotg.f b/BLAS/SRC/drotg.f index dcf3e13..1026151 100644 --- a/BLAS/SRC/drotg.f +++ b/BLAS/SRC/drotg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DROTG(DA,DB,C,S) * @@ -14,18 +14,17 @@ * DOUBLE PRECISION C,DA,DB,S * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DROTG construct givens plane rotation. +*> \verbatim *> -*>\endverbatim +*> DROTG construct givens plane rotation. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -36,14 +35,12 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/drotm.f b/BLAS/SRC/drotm.f index 4d52311..538af67 100644 --- a/BLAS/SRC/drotm.f +++ b/BLAS/SRC/drotm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DROTM(N,DX,INCX,DY,INCY,DPARAM) * @@ -17,11 +17,11 @@ * DOUBLE PRECISION DPARAM(5),DX(*),DY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> APPLY THE MODIFIED GIVENS TRANSFORMATION, H, TO THE 2 BY N MATRIX *> @@ -38,11 +38,10 @@ *> H=( ) ( ) ( ) ( ) *> (DH21 DH22), (DH21 1.D0), (-1.D0 DH22), (0.D0 1.D0). *> SEE DROTMG FOR A DESCRIPTION OF DATA STORAGE IN DPARAM. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -83,10 +82,9 @@ *> DPARAM(4)=DH12 *> DPARAM(5)=DH22 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/drotmg.f b/BLAS/SRC/drotmg.f index 694d37a..d18d258 100644 --- a/BLAS/SRC/drotmg.f +++ b/BLAS/SRC/drotmg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DROTMG(DD1,DD2,DX1,DY1,DPARAM) * @@ -17,11 +17,11 @@ * DOUBLE PRECISION DPARAM(5) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CONSTRUCT THE MODIFIED GIVENS TRANSFORMATION MATRIX H WHICH ZEROS *> THE SECOND COMPONENT OF THE 2-VECTOR (DSQRT(DD1)*DX1,DSQRT(DD2)*> DY2)**T. @@ -40,11 +40,10 @@ *> INEXACT. THIS IS OK AS THEY ARE ONLY USED FOR TESTING THE SIZE *> OF DD1 AND DD2. ALL ACTUAL SCALING OF DATA IS DONE USING GAM. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] DD1 *> \verbatim @@ -75,10 +74,9 @@ *> DPARAM(4)=DH12 *> DPARAM(5)=DH22 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/dsbmv.f b/BLAS/SRC/dsbmv.f index 128864f..734668b 100644 --- a/BLAS/SRC/dsbmv.f +++ b/BLAS/SRC/dsbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBMV(UPLO,N,K,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBMV performs the matrix-vector operation *> @@ -31,11 +31,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: +* ========== * *> \param[in] UPLO *> \verbatim @@ -154,10 +153,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -168,10 +166,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -182,7 +179,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dscal.f b/BLAS/SRC/dscal.f index 50dd2eb..3337de8 100644 --- a/BLAS/SRC/dscal.f +++ b/BLAS/SRC/dscal.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSCAL(N,DA,DX,INCX) * @@ -18,19 +18,18 @@ * DOUBLE PRECISION DX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSCAL scales a vector by a constant. *> uses unrolled loops for increment equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -41,16 +40,14 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsdot.f b/BLAS/SRC/dsdot.f index a6f4ea8..f95a9ab 100644 --- a/BLAS/SRC/dsdot.f +++ b/BLAS/SRC/dsdot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSDOT(N,SX,INCX,SY,INCY) * @@ -22,11 +22,12 @@ * Lawson, C. L., (JPL), Hanson, R. J., (SNLA), * Kincaid, D. R., (U. of Texas), Krogh, F. T., (JPL) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> Compute the inner product of two vectors with extended *> precision accumulation and result. *> @@ -34,11 +35,10 @@ *> DSDOT = sum for I = 0 to N-1 of SX(LX+I*INCX) * SY(LY+I*INCY), *> where LX = 1 if INCX .GE. 0, else LX = 1+(1-N)*INCX, and LY is *> defined in a similar way using INCY. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -75,10 +75,9 @@ *> DSDOT is DOUBLE PRECISION *> DSDOT double precision dot product (zero if N.LE.0) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -89,13 +88,17 @@ * *> \ingroup double_blas_level1 * +*> \par Further Details: +* ===================== +*> +*> \verbatim +*> \endverbatim * -* Further Details -* =============== -*>\details \b Further \b Details +*> \par References: +* ================ +*> *> \verbatim *> -*> REFERENCES *> *> C. L. Lawson, R. J. Hanson, D. R. Kincaid and F. T. *> Krogh, Basic linear algebra subprograms for Fortran @@ -111,7 +114,6 @@ *> 920310 Corrected definition of LX in DESCRIPTION. (WRB) *> 920501 Reformatted the REFERENCES section. (WRB) *> 070118 Reformat to LAPACK style (JL) -*> *> \endverbatim *> * ===================================================================== @@ -129,8 +131,8 @@ REAL SX(*),SY(*) * .. * -* AUTHORS -* ======= +* Authors: +* ======== * Lawson, C. L., (JPL), Hanson, R. J., (SNLA), * Kincaid, D. R., (U. of Texas), Krogh, F. T., (JPL) * diff --git a/BLAS/SRC/dspmv.f b/BLAS/SRC/dspmv.f index ddebd55..fd3e2a0 100644 --- a/BLAS/SRC/dspmv.f +++ b/BLAS/SRC/dspmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPMV(UPLO,N,ALPHA,AP,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -131,10 +129,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dspr.f b/BLAS/SRC/dspr.f index 543dce9..6a575e7 100644 --- a/BLAS/SRC/dspr.f +++ b/BLAS/SRC/dspr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPR(UPLO,N,ALPHA,X,INCX,AP) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPR performs the symmetric rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -98,10 +97,9 @@ *> AP is overwritten by the lower triangular part of the *> updated matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -112,10 +110,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -125,7 +122,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dspr2.f b/BLAS/SRC/dspr2.f index cae156b..5861b29 100644 --- a/BLAS/SRC/dspr2.f +++ b/BLAS/SRC/dspr2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPR2(UPLO,N,ALPHA,X,INCX,Y,INCY,AP) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPR2 performs the symmetric rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an *> n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -113,10 +112,9 @@ *> AP is overwritten by the lower triangular part of the *> updated matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -127,10 +125,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -140,7 +137,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dswap.f b/BLAS/SRC/dswap.f index 2776058..e567bd9 100644 --- a/BLAS/SRC/dswap.f +++ b/BLAS/SRC/dswap.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSWAP(N,DX,INCX,DY,INCY) * @@ -17,19 +17,18 @@ * DOUBLE PRECISION DX(*),DY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> interchanges two vectors. *> uses unrolled loops for increments equal one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsymm.f b/BLAS/SRC/dsymm.f index 3a1710f..ee8df4d 100644 --- a/BLAS/SRC/dsymm.f +++ b/BLAS/SRC/dsymm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYMM(SIDE,UPLO,M,N,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> where alpha and beta are scalars, A is a symmetric matrix and B and *> C are m by n matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -160,10 +159,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup double_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -187,7 +184,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsymv.f b/BLAS/SRC/dsymv.f index f919dbc..5522023 100644 --- a/BLAS/SRC/dsymv.f +++ b/BLAS/SRC/dsymv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYMV(UPLO,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -122,10 +121,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -150,7 +147,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsyr.f b/BLAS/SRC/dsyr.f index 73ed1e5..0b8a762 100644 --- a/BLAS/SRC/dsyr.f +++ b/BLAS/SRC/dsyr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYR(UPLO,N,ALPHA,X,INCX,A,LDA) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYR performs the symmetric rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -117,10 +115,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -130,7 +127,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsyr2.f b/BLAS/SRC/dsyr2.f index f668694..05e1481 100644 --- a/BLAS/SRC/dsyr2.f +++ b/BLAS/SRC/dsyr2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYR2(UPLO,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYR2 performs the symmetric rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an n *> by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -118,10 +117,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -132,10 +130,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsyr2k.f b/BLAS/SRC/dsyr2k.f index 409f7e3..2dde293 100644 --- a/BLAS/SRC/dsyr2k.f +++ b/BLAS/SRC/dsyr2k.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYR2K(UPLO,TRANS,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYR2K performs one of the symmetric rank 2k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A and B are n by k matrices in the first case and k by n *> matrices in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -162,10 +161,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -176,10 +174,9 @@ * *> \ingroup double_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -190,7 +187,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dsyrk.f b/BLAS/SRC/dsyrk.f index 73f2a66..d91c336 100644 --- a/BLAS/SRC/dsyrk.f +++ b/BLAS/SRC/dsyrk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYRK(UPLO,TRANS,N,K,ALPHA,A,LDA,BETA,C,LDC) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYRK performs one of the symmetric rank k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A is an n by k matrix in the first case and a k by n matrix *> in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -140,10 +139,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -154,10 +152,9 @@ * *> \ingroup double_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -167,7 +164,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtbmv.f b/BLAS/SRC/dtbmv.f index 2b7ed08..86e027f 100644 --- a/BLAS/SRC/dtbmv.f +++ b/BLAS/SRC/dtbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBMV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular band matrix, with ( k + 1 ) diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,10 +155,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,10 +168,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -184,7 +181,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtbsv.f b/BLAS/SRC/dtbsv.f index e80fe00..5e25a92 100644 --- a/BLAS/SRC/dtbsv.f +++ b/BLAS/SRC/dtbsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBSV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBSV solves one of the systems of equations *> @@ -34,11 +34,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -160,10 +159,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -187,7 +184,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtpmv.f b/BLAS/SRC/dtpmv.f index 9f643dc..5af8f1d 100644 --- a/BLAS/SRC/dtpmv.f +++ b/BLAS/SRC/dtpmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPMV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,10 +124,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -140,7 +137,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtpsv.f b/BLAS/SRC/dtpsv.f index 937afcc..9376f21 100644 --- a/BLAS/SRC/dtpsv.f +++ b/BLAS/SRC/dtpsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPSV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -142,7 +139,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtrmm.f b/BLAS/SRC/dtrmm.f index 71a7e0d..cbd5ce7 100644 --- a/BLAS/SRC/dtrmm.f +++ b/BLAS/SRC/dtrmm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRMM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRMM performs one of the matrix-matrix operations *> @@ -33,11 +33,10 @@ *> non-unit, upper or lower triangular matrix and op( A ) is one of *> *> op( A ) = A or op( A ) = A**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -148,10 +147,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -162,10 +160,9 @@ * *> \ingroup double_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -175,7 +172,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtrmv.f b/BLAS/SRC/dtrmv.f index 7bb9d74..71459fe 100644 --- a/BLAS/SRC/dtrmv.f +++ b/BLAS/SRC/dtrmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRMV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -131,10 +129,9 @@ * *> \ingroup double_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtrsm.f b/BLAS/SRC/dtrsm.f index 6adb99e..065df9a 100644 --- a/BLAS/SRC/dtrsm.f +++ b/BLAS/SRC/dtrsm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRSM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * DOUBLE PRECISION A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRSM solves one of the matrix equations *> @@ -35,11 +35,10 @@ *> op( A ) = A or op( A ) = A**T. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup double_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -179,7 +176,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dtrsv.f b/BLAS/SRC/dtrsv.f index ce82d7d..e54303a 100644 --- a/BLAS/SRC/dtrsv.f +++ b/BLAS/SRC/dtrsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRSV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * DOUBLE PRECISION A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -128,10 +127,9 @@ *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/dzasum.f b/BLAS/SRC/dzasum.f index ea61e0b..cbeee99 100644 --- a/BLAS/SRC/dzasum.f +++ b/BLAS/SRC/dzasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DZASUM(N,ZX,INCX) * @@ -17,18 +17,17 @@ * COMPLEX*16 ZX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DZASUM takes the sum of the absolute values. +*> \verbatim *> -*>\endverbatim +*> DZASUM takes the sum of the absolute values. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,16 +38,14 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/dznrm2.f b/BLAS/SRC/dznrm2.f index 4a6b757..b5713a2 100644 --- a/BLAS/SRC/dznrm2.f +++ b/BLAS/SRC/dznrm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DZNRM2(N,X,INCX) * @@ -17,21 +17,20 @@ * COMPLEX*16 X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DZNRM2 returns the euclidean norm of a vector via the function *> name, so that *> *> DZNRM2 := sqrt( x**H*x ) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -42,16 +41,14 @@ * *> \ingroup double_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> -- This version written on 25-October-1982. *> Modified on 14-October-1993 to inline the call to ZLASSQ. *> Sven Hammarling, Nag Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/icamax.f b/BLAS/SRC/icamax.f index 5e060ec..2120db9 100644 --- a/BLAS/SRC/icamax.f +++ b/BLAS/SRC/icamax.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ICAMAX(N,CX,INCX) * @@ -17,18 +17,17 @@ * COMPLEX CX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ICAMAX finds the index of element having max. absolute value. +*> \verbatim *> -*>\endverbatim +*> ICAMAX finds the index of element having max. absolute value. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,16 +38,14 @@ * *> \ingroup aux_blas * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/idamax.f b/BLAS/SRC/idamax.f index e10fa05..4233fcc 100644 --- a/BLAS/SRC/idamax.f +++ b/BLAS/SRC/idamax.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION IDAMAX(N,DX,INCX) * @@ -17,18 +17,17 @@ * DOUBLE PRECISION DX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> IDAMAX finds the index of element having max. absolute value. +*> \verbatim *> -*>\endverbatim +*> IDAMAX finds the index of element having max. absolute value. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,16 +38,14 @@ * *> \ingroup aux_blas * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/isamax.f b/BLAS/SRC/isamax.f index 4e03d89..af977c5 100644 --- a/BLAS/SRC/isamax.f +++ b/BLAS/SRC/isamax.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ISAMAX(N,SX,INCX) * @@ -17,18 +17,17 @@ * REAL SX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ISAMAX finds the index of element having max. absolute value. +*> \verbatim *> -*>\endverbatim +*> ISAMAX finds the index of element having max. absolute value. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,16 +38,14 @@ * *> \ingroup aux_blas * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/izamax.f b/BLAS/SRC/izamax.f index 592c336..d51cd58 100644 --- a/BLAS/SRC/izamax.f +++ b/BLAS/SRC/izamax.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION IZAMAX(N,ZX,INCX) * @@ -17,18 +17,17 @@ * COMPLEX*16 ZX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> IZAMAX finds the index of element having max. absolute value. +*> \verbatim *> -*>\endverbatim +*> IZAMAX finds the index of element having max. absolute value. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,16 +38,14 @@ * *> \ingroup aux_blas * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 1/15/85. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/lsame.f b/BLAS/SRC/lsame.f index 7c0c8a0..f19f9cd 100644 --- a/BLAS/SRC/lsame.f +++ b/BLAS/SRC/lsame.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION LSAME(CA,CB) * @@ -14,19 +14,18 @@ * CHARACTER CA,CB * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> LSAME returns .TRUE. if CA is the same letter as CB regardless of *> case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] CA *> \verbatim @@ -38,10 +37,9 @@ *> CB is CHARACTER*1 *> CA and CB specify the single characters to be compared. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/sasum.f b/BLAS/SRC/sasum.f index 400eab0..46a4ecc 100644 --- a/BLAS/SRC/sasum.f +++ b/BLAS/SRC/sasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SASUM(N,SX,INCX) * @@ -17,19 +17,18 @@ * REAL SX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SASUM takes the sum of the absolute values. *> uses unrolled loops for increment equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,16 +39,14 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/saxpy.f b/BLAS/SRC/saxpy.f index 648be35..3fd45d7 100644 --- a/BLAS/SRC/saxpy.f +++ b/BLAS/SRC/saxpy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SAXPY(N,SA,SX,INCX,SY,INCY) * @@ -18,19 +18,18 @@ * REAL SX(*),SY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SAXPY constant times a vector plus a vector. *> uses unrolled loops for increments equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -41,15 +40,13 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/scabs1.f b/BLAS/SRC/scabs1.f index f17280f..cdb5c0b 100644 --- a/BLAS/SRC/scabs1.f +++ b/BLAS/SRC/scabs1.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SCABS1(Z) * @@ -14,18 +14,17 @@ * COMPLEX Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SCABS1 computes absolute value of a complex number +*> \verbatim *> -*>\endverbatim +*> SCABS1 computes absolute value of a complex number +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/scasum.f b/BLAS/SRC/scasum.f index dde1bad..03154eb 100644 --- a/BLAS/SRC/scasum.f +++ b/BLAS/SRC/scasum.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SCASUM(N,CX,INCX) * @@ -17,19 +17,18 @@ * COMPLEX CX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCASUM takes the sum of the absolute values of a complex vector and *> returns a single precision result. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,16 +39,14 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/scnrm2.f b/BLAS/SRC/scnrm2.f index 8b3f8e0..4a581e8 100644 --- a/BLAS/SRC/scnrm2.f +++ b/BLAS/SRC/scnrm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SCNRM2(N,X,INCX) * @@ -17,21 +17,20 @@ * COMPLEX X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCNRM2 returns the euclidean norm of a vector via the function *> name, so that *> *> SCNRM2 := sqrt( x**H*x ) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -42,16 +41,14 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> -- This version written on 25-October-1982. *> Modified on 14-October-1993 to inline the call to CLASSQ. *> Sven Hammarling, Nag Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/scopy.f b/BLAS/SRC/scopy.f index f8b5d67..3376fb0 100644 --- a/BLAS/SRC/scopy.f +++ b/BLAS/SRC/scopy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SCOPY(N,SX,INCX,SY,INCY) * @@ -17,19 +17,18 @@ * REAL SX(*),SY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCOPY copies a vector, x, to a vector, y. *> uses unrolled loops for increments equal to 1. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sdot.f b/BLAS/SRC/sdot.f index d3429a2..68555aa 100644 --- a/BLAS/SRC/sdot.f +++ b/BLAS/SRC/sdot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SDOT(N,SX,INCX,SY,INCY) * @@ -17,19 +17,18 @@ * REAL SX(*),SY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDOT forms the dot product of two vectors. *> uses unrolled loops for increments equal to one. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sdsdot.f b/BLAS/SRC/sdsdot.f index 7be8af1..39d3a2e 100644 --- a/BLAS/SRC/sdsdot.f +++ b/BLAS/SRC/sdsdot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SDSDOT(N,SB,SX,INCX,SY,INCY) * @@ -118,15 +118,15 @@ * SDSDOT = DSDOT * RETURN * END -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*>\endverbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/sgbmv.f b/BLAS/SRC/sgbmv.f index fde4e37..797ac7f 100644 --- a/BLAS/SRC/sgbmv.f +++ b/BLAS/SRC/sgbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBMV(TRANS,M,N,KL,KU,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBMV performs one of the matrix-vector operations *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n band matrix, with kl sub-diagonals and ku super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -155,10 +154,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -169,10 +167,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -183,7 +180,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sgemm.f b/BLAS/SRC/sgemm.f index 7708dc9..9a3d9e1 100644 --- a/BLAS/SRC/sgemm.f +++ b/BLAS/SRC/sgemm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEMM(TRANSA,TRANSB,M,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> alpha and beta are scalars, and A, B and C are matrices, with op( A ) *> an m by k matrix, op( B ) a k by n matrix and C an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -158,10 +157,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -172,10 +170,9 @@ * *> \ingroup single_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -185,7 +182,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sgemv.f b/BLAS/SRC/sgemv.f index ba1d3fa..eef133f 100644 --- a/BLAS/SRC/sgemv.f +++ b/BLAS/SRC/sgemv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEMV(TRANS,M,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEMV performs one of the matrix-vector operations *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -126,10 +125,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -140,10 +138,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -154,7 +151,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sger.f b/BLAS/SRC/sger.f index c34a2a9..cf85ffd 100644 --- a/BLAS/SRC/sger.f +++ b/BLAS/SRC/sger.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGER(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -18,11 +18,11 @@ * REAL A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGER performs the rank 1 operation *> @@ -30,11 +30,10 @@ *> *> where alpha is a scalar, x is an m element vector, y is an n element *> vector and A is an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -101,10 +100,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/snrm2.f b/BLAS/SRC/snrm2.f index 6e122cc..a3674a6 100644 --- a/BLAS/SRC/snrm2.f +++ b/BLAS/SRC/snrm2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SNRM2(N,X,INCX) * @@ -17,21 +17,20 @@ * REAL X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SNRM2 returns the euclidean norm of a vector via the function *> name, so that *> *> SNRM2 := sqrt( x'*x ). -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -42,16 +41,14 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> -- This version written on 25-October-1982. *> Modified on 14-October-1993 to inline the call to SLASSQ. *> Sven Hammarling, Nag Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/srot.f b/BLAS/SRC/srot.f index 50e20ed..c326e1c 100644 --- a/BLAS/SRC/srot.f +++ b/BLAS/SRC/srot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SROT(N,SX,INCX,SY,INCY,C,S) * @@ -18,18 +18,17 @@ * REAL SX(*),SY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> applies a plane rotation. +*> \verbatim *> -*>\endverbatim +*> applies a plane rotation. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/srotg.f b/BLAS/SRC/srotg.f index 666d550..90ba220 100644 --- a/BLAS/SRC/srotg.f +++ b/BLAS/SRC/srotg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SROTG(SA,SB,C,S) * @@ -14,18 +14,17 @@ * REAL C,S,SA,SB * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SROTG construct givens plane rotation. +*> \verbatim *> -*>\endverbatim +*> SROTG construct givens plane rotation. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -36,14 +35,12 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/srotm.f b/BLAS/SRC/srotm.f index be84807..f465f44 100644 --- a/BLAS/SRC/srotm.f +++ b/BLAS/SRC/srotm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SROTM(N,SX,INCX,SY,INCY,SPARAM) * @@ -17,11 +17,11 @@ * REAL SPARAM(5),SX(*),SY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> APPLY THE MODIFIED GIVENS TRANSFORMATION, H, TO THE 2 BY N MATRIX *> @@ -39,11 +39,10 @@ *> (SH21 SH22), (SH21 1.E0), (-1.E0 SH22), (0.E0 1.E0). *> SEE SROTMG FOR A DESCRIPTION OF DATA STORAGE IN SPARAM. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -84,10 +83,9 @@ *> SPARAM(4)=SH12 *> SPARAM(5)=SH22 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/srotmg.f b/BLAS/SRC/srotmg.f index 62a76e4..9a41e0a 100644 --- a/BLAS/SRC/srotmg.f +++ b/BLAS/SRC/srotmg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SROTMG(SD1,SD2,SX1,SY1,SPARAM) * @@ -17,11 +17,11 @@ * REAL SPARAM(5) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CONSTRUCT THE MODIFIED GIVENS TRANSFORMATION MATRIX H WHICH ZEROS *> THE SECOND COMPONENT OF THE 2-VECTOR (SQRT(SD1)*SX1,SQRT(SD2)*> SY2)**T. @@ -40,11 +40,10 @@ *> INEXACT. THIS IS OK AS THEY ARE ONLY USED FOR TESTING THE SIZE *> OF SD1 AND SD2. ALL ACTUAL SCALING OF DATA IS DONE USING GAM. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] SD1 *> \verbatim @@ -75,10 +74,9 @@ *> SPARAM(4)=SH12 *> SPARAM(5)=SH22 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/ssbmv.f b/BLAS/SRC/ssbmv.f index c91cb18..483f80b 100644 --- a/BLAS/SRC/ssbmv.f +++ b/BLAS/SRC/ssbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBMV(UPLO,N,K,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBMV performs the matrix-vector operation *> @@ -31,11 +31,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: +* ========== * *> \param[in] UPLO *> \verbatim @@ -154,10 +153,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -168,10 +166,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -182,7 +179,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sscal.f b/BLAS/SRC/sscal.f index d3d7130..b4b0862 100644 --- a/BLAS/SRC/sscal.f +++ b/BLAS/SRC/sscal.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSCAL(N,SA,SX,INCX) * @@ -18,19 +18,18 @@ * REAL SX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> scales a vector by a constant. *> uses unrolled loops for increment equal to 1. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -41,16 +40,14 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sspmv.f b/BLAS/SRC/sspmv.f index 393700a..b19f902 100644 --- a/BLAS/SRC/sspmv.f +++ b/BLAS/SRC/sspmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPMV(UPLO,N,ALPHA,AP,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * REAL AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -131,10 +129,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sspr.f b/BLAS/SRC/sspr.f index 4088b3f..9350cea 100644 --- a/BLAS/SRC/sspr.f +++ b/BLAS/SRC/sspr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPR(UPLO,N,ALPHA,X,INCX,AP) * @@ -19,11 +19,11 @@ * REAL AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPR performs the symmetric rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -98,10 +97,9 @@ *> AP is overwritten by the lower triangular part of the *> updated matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -112,10 +110,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -125,7 +122,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sspr2.f b/BLAS/SRC/sspr2.f index 3846691..50fa67c 100644 --- a/BLAS/SRC/sspr2.f +++ b/BLAS/SRC/sspr2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPR2(UPLO,N,ALPHA,X,INCX,Y,INCY,AP) * @@ -19,11 +19,11 @@ * REAL AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPR2 performs the symmetric rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an *> n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -113,10 +112,9 @@ *> AP is overwritten by the lower triangular part of the *> updated matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -127,10 +125,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -140,7 +137,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/sswap.f b/BLAS/SRC/sswap.f index d0dcddf..ad5a7f5 100644 --- a/BLAS/SRC/sswap.f +++ b/BLAS/SRC/sswap.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSWAP(N,SX,INCX,SY,INCY) * @@ -17,19 +17,18 @@ * REAL SX(*),SY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> interchanges two vectors. *> uses unrolled loops for increments equal to 1. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup single_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ssymm.f b/BLAS/SRC/ssymm.f index 0fc8fc5..ac10d0b 100644 --- a/BLAS/SRC/ssymm.f +++ b/BLAS/SRC/ssymm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYMM(SIDE,UPLO,M,N,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> where alpha and beta are scalars, A is a symmetric matrix and B and *> C are m by n matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -160,10 +159,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup single_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -187,7 +184,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ssymv.f b/BLAS/SRC/ssymv.f index 362a8f4..2b9ef17 100644 --- a/BLAS/SRC/ssymv.f +++ b/BLAS/SRC/ssymv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYMV(UPLO,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -122,10 +121,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -150,7 +147,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ssyr.f b/BLAS/SRC/ssyr.f index 96fce78..18a1a91 100644 --- a/BLAS/SRC/ssyr.f +++ b/BLAS/SRC/ssyr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYR(UPLO,N,ALPHA,X,INCX,A,LDA) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYR performs the symmetric rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -117,10 +115,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -130,7 +127,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ssyr2.f b/BLAS/SRC/ssyr2.f index 8830552..4c90ae8 100644 --- a/BLAS/SRC/ssyr2.f +++ b/BLAS/SRC/ssyr2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYR2(UPLO,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYR2 performs the symmetric rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an n *> by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -118,10 +117,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -132,10 +130,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ssyr2k.f b/BLAS/SRC/ssyr2k.f index a796857..435e996 100644 --- a/BLAS/SRC/ssyr2k.f +++ b/BLAS/SRC/ssyr2k.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYR2K(UPLO,TRANS,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYR2K performs one of the symmetric rank 2k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A and B are n by k matrices in the first case and k by n *> matrices in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -162,10 +161,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -176,10 +174,9 @@ * *> \ingroup single_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -190,7 +187,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ssyrk.f b/BLAS/SRC/ssyrk.f index b38025b..c428029 100644 --- a/BLAS/SRC/ssyrk.f +++ b/BLAS/SRC/ssyrk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYRK(UPLO,TRANS,N,K,ALPHA,A,LDA,BETA,C,LDC) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYRK performs one of the symmetric rank k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A is an n by k matrix in the first case and a k by n matrix *> in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -140,10 +139,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -154,10 +152,9 @@ * *> \ingroup single_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -167,7 +164,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/stbmv.f b/BLAS/SRC/stbmv.f index ebd5f6f..bd5036c 100644 --- a/BLAS/SRC/stbmv.f +++ b/BLAS/SRC/stbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBMV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * REAL A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular band matrix, with ( k + 1 ) diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,10 +155,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,10 +168,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -184,7 +181,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/stbsv.f b/BLAS/SRC/stbsv.f index f4e2688..4c31347 100644 --- a/BLAS/SRC/stbsv.f +++ b/BLAS/SRC/stbsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBSV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * REAL A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBSV solves one of the systems of equations *> @@ -34,11 +34,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -160,10 +159,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -187,7 +184,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/stpmv.f b/BLAS/SRC/stpmv.f index 5dac03a..e66dc4c 100644 --- a/BLAS/SRC/stpmv.f +++ b/BLAS/SRC/stpmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPMV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * REAL AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,10 +124,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -140,7 +137,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/stpsv.f b/BLAS/SRC/stpsv.f index d615193..9c58591 100644 --- a/BLAS/SRC/stpsv.f +++ b/BLAS/SRC/stpsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPSV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * REAL AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -142,7 +139,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/strmm.f b/BLAS/SRC/strmm.f index 2a00063..e713d19 100644 --- a/BLAS/SRC/strmm.f +++ b/BLAS/SRC/strmm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRMM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRMM performs one of the matrix-matrix operations *> @@ -33,11 +33,10 @@ *> non-unit, upper or lower triangular matrix and op( A ) is one of *> *> op( A ) = A or op( A ) = A**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -148,10 +147,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -162,10 +160,9 @@ * *> \ingroup single_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -175,7 +172,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/strmv.f b/BLAS/SRC/strmv.f index f3581cd..8f3a36f 100644 --- a/BLAS/SRC/strmv.f +++ b/BLAS/SRC/strmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRMV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * REAL A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -131,10 +129,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/strsm.f b/BLAS/SRC/strsm.f index 48f7dcf..dad4bb0 100644 --- a/BLAS/SRC/strsm.f +++ b/BLAS/SRC/strsm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRSM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * REAL A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRSM solves one of the matrix equations *> @@ -35,11 +35,10 @@ *> op( A ) = A or op( A ) = A**T. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup single_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -179,7 +176,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/strsv.f b/BLAS/SRC/strsv.f index 61a54c6..03262fb 100644 --- a/BLAS/SRC/strsv.f +++ b/BLAS/SRC/strsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRSV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * REAL A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -134,10 +132,9 @@ * *> \ingroup single_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -147,7 +144,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/xerbla.f b/BLAS/SRC/xerbla.f index 5d287b9..eb1c037 100644 --- a/BLAS/SRC/xerbla.f +++ b/BLAS/SRC/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,11 +15,11 @@ * INTEGER INFO * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> XERBLA is an error handler for the LAPACK routines. *> It is called by an LAPACK routine if an input parameter has an @@ -27,11 +27,10 @@ *> *> Installers may consider modifying the STOP statement in order to *> call system-specific exception-handling facilities. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SRNAME *> \verbatim @@ -45,10 +44,9 @@ *> The position of the invalid parameter in the parameter list *> of the calling routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/xerbla_array.f b/BLAS/SRC/xerbla_array.f index c6173ee..7fceaeb 100644 --- a/BLAS/SRC/xerbla_array.f +++ b/BLAS/SRC/xerbla_array.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE XERBLA_ARRAY(SRNAME_ARRAY, SRNAME_LEN, INFO) * @@ -17,11 +17,11 @@ * CHARACTER(1) SRNAME_ARRAY(SRNAME_LEN) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> XERBLA_ARRAY assists other languages in calling XERBLA, the LAPACK *> and BLAS error handler. Rather than taking a Fortran string argument @@ -41,11 +41,10 @@ *> *> Providing XERBLA_ARRAY is not necessary for intercepting LAPACK *> errors. XERBLA_ARRAY calls XERBLA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SRNAME_ARRAY *> \verbatim @@ -65,10 +64,9 @@ *> The position of the invalid parameter in the parameter list *> of the calling routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/zaxpy.f b/BLAS/SRC/zaxpy.f index 0daa887..e6f5e1f 100644 --- a/BLAS/SRC/zaxpy.f +++ b/BLAS/SRC/zaxpy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZAXPY(N,ZA,ZX,INCX,ZY,INCY) * @@ -18,18 +18,17 @@ * COMPLEX*16 ZX(*),ZY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZAXPY constant times a vector plus a vector. +*> \verbatim *> -*>\endverbatim +*> ZAXPY constant times a vector plus a vector. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,15 +39,13 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zcopy.f b/BLAS/SRC/zcopy.f index 93ee92d..baeafd5 100644 --- a/BLAS/SRC/zcopy.f +++ b/BLAS/SRC/zcopy.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCOPY(N,ZX,INCX,ZY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX*16 ZX(*),ZY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZCOPY copies a vector, x, to a vector, y. +*> \verbatim *> -*>\endverbatim +*> ZCOPY copies a vector, x, to a vector, y. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, linpack, 4/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zdotc.f b/BLAS/SRC/zdotc.f index 4ed407d..660648b 100644 --- a/BLAS/SRC/zdotc.f +++ b/BLAS/SRC/zdotc.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX*16 FUNCTION ZDOTC(N,ZX,INCX,ZY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX*16 ZX(*),ZY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDOTC forms the dot product of a vector. +*> \verbatim *> -*>\endverbatim +*> ZDOTC forms the dot product of a vector. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zdotu.f b/BLAS/SRC/zdotu.f index 9d481a9..dd86352 100644 --- a/BLAS/SRC/zdotu.f +++ b/BLAS/SRC/zdotu.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX*16 FUNCTION ZDOTU(N,ZX,INCX,ZY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX*16 ZX(*),ZY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDOTU forms the dot product of two vectors. +*> \verbatim *> -*>\endverbatim +*> ZDOTU forms the dot product of two vectors. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zdrot.f b/BLAS/SRC/zdrot.f index 3caaaca..f8bdcd7 100644 --- a/BLAS/SRC/zdrot.f +++ b/BLAS/SRC/zdrot.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDROT( N, CX, INCX, CY, INCY, C, S ) * @@ -18,20 +18,19 @@ * COMPLEX*16 CX( * ), CY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Applies a plane rotation, where the cos and sin (c and s) are real *> and the vectors cx and cy are complex. *> jack dongarra, linpack, 3/11/78. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -83,10 +82,9 @@ *> S is DOUBLE PRECISION *> On entry, S specifies the sine, sin. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/zdscal.f b/BLAS/SRC/zdscal.f index 327309c..57a9490 100644 --- a/BLAS/SRC/zdscal.f +++ b/BLAS/SRC/zdscal.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDSCAL(N,DA,ZX,INCX) * @@ -18,18 +18,17 @@ * COMPLEX*16 ZX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZDSCAL scales a vector by a constant. +*> \verbatim *> -*>\endverbatim +*> ZDSCAL scales a vector by a constant. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,16 +39,14 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zgbmv.f b/BLAS/SRC/zgbmv.f index 77aff8d..0e7311a 100644 --- a/BLAS/SRC/zgbmv.f +++ b/BLAS/SRC/zgbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBMV(TRANS,M,N,KL,KU,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBMV performs one of the matrix-vector operations *> @@ -33,11 +33,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n band matrix, with kl sub-diagonals and ku super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -157,10 +156,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -171,10 +169,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -185,7 +182,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zgemm.f b/BLAS/SRC/zgemm.f index 6f7fe98..f423315 100644 --- a/BLAS/SRC/zgemm.f +++ b/BLAS/SRC/zgemm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEMM(TRANSA,TRANSB,M,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> alpha and beta are scalars, and A, B and C are matrices, with op( A ) *> an m by k matrix, op( B ) a k by n matrix and C an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSA *> \verbatim @@ -158,10 +157,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -172,10 +170,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -185,7 +182,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zgemv.f b/BLAS/SRC/zgemv.f index b3ffbb8..4e174c9 100644 --- a/BLAS/SRC/zgemv.f +++ b/BLAS/SRC/zgemv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEMV(TRANS,M,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEMV performs one of the matrix-vector operations *> @@ -33,11 +33,10 @@ *> *> where alpha and beta are scalars, x and y are vectors and A is an *> m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -128,10 +127,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -142,10 +140,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -156,7 +153,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zgerc.f b/BLAS/SRC/zgerc.f index 9457319..accfeaf 100644 --- a/BLAS/SRC/zgerc.f +++ b/BLAS/SRC/zgerc.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERC(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -18,11 +18,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGERC performs the rank 1 operation *> @@ -30,11 +30,10 @@ *> *> where alpha is a scalar, x is an m element vector, y is an n element *> vector and A is an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -101,10 +100,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zgeru.f b/BLAS/SRC/zgeru.f index 26acb99..bf23ed7 100644 --- a/BLAS/SRC/zgeru.f +++ b/BLAS/SRC/zgeru.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERU(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -18,11 +18,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGERU performs the rank 1 operation *> @@ -30,11 +30,10 @@ *> *> where alpha is a scalar, x is an m element vector, y is an n element *> vector and A is an m by n matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -101,10 +100,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zhbmv.f b/BLAS/SRC/zhbmv.f index 14f4fa8..6a668c2 100644 --- a/BLAS/SRC/zhbmv.f +++ b/BLAS/SRC/zhbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBMV(UPLO,N,K,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n hermitian band matrix, with k super-diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -157,10 +156,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -171,10 +169,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -185,7 +182,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zhemm.f b/BLAS/SRC/zhemm.f index 608138c..77abea1 100644 --- a/BLAS/SRC/zhemm.f +++ b/BLAS/SRC/zhemm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEMM(SIDE,UPLO,M,N,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> where alpha and beta are scalars, A is an hermitian matrix and B and *> C are m by n matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -176,10 +174,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -189,7 +186,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zhemv.f b/BLAS/SRC/zhemv.f index baa2930..34216fb 100644 --- a/BLAS/SRC/zhemv.f +++ b/BLAS/SRC/zhemv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEMV(UPLO,N,ALPHA,A,LDA,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -152,7 +149,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zher.f b/BLAS/SRC/zher.f index 5f68482..0edc119 100644 --- a/BLAS/SRC/zher.f +++ b/BLAS/SRC/zher.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHER(UPLO,N,ALPHA,X,INCX,A,LDA) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHER performs the hermitian rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +105,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -120,10 +118,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -133,7 +130,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zher2.f b/BLAS/SRC/zher2.f index 1b98c63..e2a02c3 100644 --- a/BLAS/SRC/zher2.f +++ b/BLAS/SRC/zher2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHER2(UPLO,N,ALPHA,X,INCX,Y,INCY,A,LDA) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHER2 performs the hermitian rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an n *> by n hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -121,10 +120,9 @@ *> in the calling (sub) program. LDA must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -135,10 +133,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -148,7 +145,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zher2k.f b/BLAS/SRC/zher2k.f index b577e1b..0b91bd2 100644 --- a/BLAS/SRC/zher2k.f +++ b/BLAS/SRC/zher2k.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHER2K(UPLO,TRANS,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -20,11 +20,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHER2K performs one of the hermitian rank 2k operations *> @@ -37,11 +37,10 @@ *> where alpha and beta are scalars with beta real, C is an n by n *> hermitian matrix and A and B are n by k matrices in the first case *> and k by n matrices in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -180,10 +178,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -196,7 +193,6 @@ *> *> -- Modified 8-Nov-93 to set C(J,J) to DBLE( C(J,J) ) when BETA = 1. *> Ed Anderson, Cray Research Inc. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zherk.f b/BLAS/SRC/zherk.f index cd4fed5..7e561e8 100644 --- a/BLAS/SRC/zherk.f +++ b/BLAS/SRC/zherk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHERK(UPLO,TRANS,N,K,ALPHA,A,LDA,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHERK performs one of the hermitian rank k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are real scalars, C is an n by n hermitian *> matrix and A is an n by k matrix in the first case and a k by n *> matrix in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -155,10 +153,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -171,7 +168,6 @@ *> *> -- Modified 8-Nov-93 to set C(J,J) to DBLE( C(J,J) ) when BETA = 1. *> Ed Anderson, Cray Research Inc. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zhpmv.f b/BLAS/SRC/zhpmv.f index c81456f..23dad36 100644 --- a/BLAS/SRC/zhpmv.f +++ b/BLAS/SRC/zhpmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPMV(UPLO,N,ALPHA,AP,X,INCX,BETA,Y,INCY) * @@ -19,11 +19,11 @@ * COMPLEX*16 AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPMV performs the matrix-vector operation *> @@ -31,11 +31,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n hermitian matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -119,10 +118,9 @@ *> On entry, INCY specifies the increment for the elements of *> Y. INCY must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -133,10 +131,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -147,7 +144,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zhpr.f b/BLAS/SRC/zhpr.f index 0b0bd68..42e6119 100644 --- a/BLAS/SRC/zhpr.f +++ b/BLAS/SRC/zhpr.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPR(UPLO,N,ALPHA,X,INCX,AP) * @@ -19,11 +19,11 @@ * COMPLEX*16 AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPR performs the hermitian rank 1 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a real scalar, x is an n element vector and A is an *> n by n hermitian matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -101,10 +100,9 @@ *> not be set, they are assumed to be zero, and on exit they *> are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,10 +113,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -128,7 +125,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zhpr2.f b/BLAS/SRC/zhpr2.f index f160418..2c6f353 100644 --- a/BLAS/SRC/zhpr2.f +++ b/BLAS/SRC/zhpr2.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPR2(UPLO,N,ALPHA,X,INCX,Y,INCY,AP) * @@ -19,11 +19,11 @@ * COMPLEX*16 AP(*),X(*),Y(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPR2 performs the hermitian rank 2 operation *> @@ -31,11 +31,10 @@ *> *> where alpha is a scalar, x and y are n element vectors and A is an *> n by n hermitian matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -116,10 +115,9 @@ *> not be set, they are assumed to be zero, and on exit they *> are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -130,10 +128,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -143,7 +140,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zrotg.f b/BLAS/SRC/zrotg.f index daa0f66..ca03e06 100644 --- a/BLAS/SRC/zrotg.f +++ b/BLAS/SRC/zrotg.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZROTG(CA,CB,C,S) * @@ -15,18 +15,17 @@ * DOUBLE PRECISION C * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZROTG determines a double complex Givens rotation. +*> \verbatim *> -*>\endverbatim +*> ZROTG determines a double complex Givens rotation. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/BLAS/SRC/zscal.f b/BLAS/SRC/zscal.f index 6714806..ad28a10 100644 --- a/BLAS/SRC/zscal.f +++ b/BLAS/SRC/zscal.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSCAL(N,ZA,ZX,INCX) * @@ -18,18 +18,17 @@ * COMPLEX*16 ZX(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZSCAL scales a vector by a constant. +*> \verbatim *> -*>\endverbatim +*> ZSCAL scales a vector by a constant. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -40,16 +39,14 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 3/93 to return if incx .le. 0. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zswap.f b/BLAS/SRC/zswap.f index 8000bfc..ca2f347 100644 --- a/BLAS/SRC/zswap.f +++ b/BLAS/SRC/zswap.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSWAP(N,ZX,INCX,ZY,INCY) * @@ -17,18 +17,17 @@ * COMPLEX*16 ZX(*),ZY(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZSWAP interchanges two vectors. +*> \verbatim *> -*>\endverbatim +*> ZSWAP interchanges two vectors. +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -39,15 +38,13 @@ * *> \ingroup complex16_blas_level1 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> jack dongarra, 3/11/78. *> modified 12/3/93, array(1) declarations changed to array(*) -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zsymm.f b/BLAS/SRC/zsymm.f index 57e7020..b0ff42e 100644 --- a/BLAS/SRC/zsymm.f +++ b/BLAS/SRC/zsymm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYMM(SIDE,UPLO,M,N,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYMM performs one of the matrix-matrix operations *> @@ -35,11 +35,10 @@ *> *> where alpha and beta are scalars, A is a symmetric matrix and B and *> C are m by n matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -160,10 +159,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -187,7 +184,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zsyr2k.f b/BLAS/SRC/zsyr2k.f index 5f88db4..f46ede1 100644 --- a/BLAS/SRC/zsyr2k.f +++ b/BLAS/SRC/zsyr2k.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYR2K(UPLO,TRANS,N,K,ALPHA,A,LDA,B,LDB,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYR2K performs one of the symmetric rank 2k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A and B are n by k matrices in the first case and k by n *> matrices in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,10 +158,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -173,10 +171,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -186,7 +183,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/zsyrk.f b/BLAS/SRC/zsyrk.f index 8508988..c3484f9 100644 --- a/BLAS/SRC/zsyrk.f +++ b/BLAS/SRC/zsyrk.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYRK(UPLO,TRANS,N,K,ALPHA,A,LDA,BETA,C,LDC) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),C(LDC,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYRK performs one of the symmetric rank k operations *> @@ -36,11 +36,10 @@ *> where alpha and beta are scalars, C is an n by n symmetric matrix *> and A is an n by k matrix in the first case and a k by n matrix *> in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -138,10 +137,9 @@ *> in the calling (sub) program. LDC must be at least *> max( 1, n ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -152,10 +150,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -165,7 +162,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztbmv.f b/BLAS/SRC/ztbmv.f index 690af3c..2b5780b 100644 --- a/BLAS/SRC/ztbmv.f +++ b/BLAS/SRC/ztbmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBMV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX*16 A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular band matrix, with ( k + 1 ) diagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,10 +155,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,10 +168,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -184,7 +181,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztbsv.f b/BLAS/SRC/ztbsv.f index 7a7b02c..ea27219 100644 --- a/BLAS/SRC/ztbsv.f +++ b/BLAS/SRC/ztbsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBSV(UPLO,TRANS,DIAG,N,K,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX*16 A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBSV solves one of the systems of equations *> @@ -34,11 +34,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -160,10 +159,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -174,10 +172,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -187,7 +184,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztpmv.f b/BLAS/SRC/ztpmv.f index d5d8da9..e277ec1 100644 --- a/BLAS/SRC/ztpmv.f +++ b/BLAS/SRC/ztpmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPMV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX*16 AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,10 +124,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -140,7 +137,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztpsv.f b/BLAS/SRC/ztpsv.f index 9446342..0e75f9f 100644 --- a/BLAS/SRC/ztpsv.f +++ b/BLAS/SRC/ztpsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPSV(UPLO,TRANS,DIAG,N,AP,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX*16 AP(*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -142,7 +139,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztrmm.f b/BLAS/SRC/ztrmm.f index 16d6c95..ba7aead 100644 --- a/BLAS/SRC/ztrmm.f +++ b/BLAS/SRC/ztrmm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRMM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRMM performs one of the matrix-matrix operations *> @@ -33,11 +33,10 @@ *> non-unit, upper or lower triangular matrix and op( A ) is one of *> *> op( A ) = A or op( A ) = A**T or op( A ) = A**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -148,10 +147,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -162,10 +160,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -175,7 +172,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztrmv.f b/BLAS/SRC/ztrmv.f index ae8c40f..8d7974a 100644 --- a/BLAS/SRC/ztrmv.f +++ b/BLAS/SRC/ztrmv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRMV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX*16 A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRMV performs one of the matrix-vector operations *> @@ -30,11 +30,10 @@ *> *> where x is an n element vector and A is an n by n unit, or non-unit, *> upper or lower triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -131,10 +129,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -145,7 +142,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztrsm.f b/BLAS/SRC/ztrsm.f index f51fd2a..8e01254 100644 --- a/BLAS/SRC/ztrsm.f +++ b/BLAS/SRC/ztrsm.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRSM(SIDE,UPLO,TRANSA,DIAG,M,N,ALPHA,A,LDA,B,LDB) * @@ -19,11 +19,11 @@ * COMPLEX*16 A(LDA,*),B(LDB,*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRSM solves one of the matrix equations *> @@ -35,11 +35,10 @@ *> op( A ) = A or op( A ) = A**T or op( A ) = A**H. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> in the calling (sub) program. LDB must be at least *> max( 1, m ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup complex16_blas_level3 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 3 Blas routine. @@ -178,7 +175,6 @@ *> Iain Duff, AERE Harwell. *> Jeremy Du Croz, Numerical Algorithms Group Ltd. *> Sven Hammarling, Numerical Algorithms Group Ltd. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/SRC/ztrsv.f b/BLAS/SRC/ztrsv.f index 8270da1..f9fd4f8 100644 --- a/BLAS/SRC/ztrsv.f +++ b/BLAS/SRC/ztrsv.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRSV(UPLO,TRANS,DIAG,N,A,LDA,X,INCX) * @@ -18,11 +18,11 @@ * COMPLEX*16 A(LDA,*),X(*) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRSV solves one of the systems of equations *> @@ -33,11 +33,10 @@ *> *> No test for singularity or near-singularity is included in this *> routine. Such tests must be performed before calling this routine. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> On entry, INCX specifies the increment for the elements of *> X. INCX must not be zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -134,10 +132,9 @@ * *> \ingroup complex16_blas_level2 * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -147,7 +144,6 @@ *> Jeremy Du Croz, Nag Central Office. *> Sven Hammarling, Nag Central Office. *> Richard Hanson, Sandia National Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/BLAS/TESTING/cblat1.f b/BLAS/TESTING/cblat1.f index c8be436..450df9e 100644 --- a/BLAS/TESTING/cblat1.f +++ b/BLAS/TESTING/cblat1.f @@ -5,26 +5,25 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM CBLAT1 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the COMPLEX Level 1 BLAS. *> Based upon the original BLAS test routine together with: *> *> F06GAF Example Program Text -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -35,8 +34,7 @@ * *> \ingroup complex_blas_testing * -* ===================================================================== - PROGRAM CBLAT1 +* ===================================================================== PROGRAM CBLAT1 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/cblat2.f b/BLAS/TESTING/cblat2.f index 35f76af..e8467d2 100644 --- a/BLAS/TESTING/cblat2.f +++ b/BLAS/TESTING/cblat2.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM CBLAT2 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the COMPLEX Level 2 Blas. *> @@ -86,11 +86,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,8 +100,7 @@ * *> \ingroup complex_blas_testing * -* ===================================================================== - PROGRAM CBLAT2 +* ===================================================================== PROGRAM CBLAT2 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/cblat3.f b/BLAS/TESTING/cblat3.f index a84229e..25bc741 100644 --- a/BLAS/TESTING/cblat3.f +++ b/BLAS/TESTING/cblat3.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM CBLAT3 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the COMPLEX Level 3 Blas. *> @@ -68,11 +68,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -83,8 +82,7 @@ * *> \ingroup complex_blas_testing * -* ===================================================================== - PROGRAM CBLAT3 +* ===================================================================== PROGRAM CBLAT3 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/dblat1.f b/BLAS/TESTING/dblat1.f index 568160a..bda7aa7 100644 --- a/BLAS/TESTING/dblat1.f +++ b/BLAS/TESTING/dblat1.f @@ -5,26 +5,25 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DBLAT1 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the DOUBLE PRECISION Level 1 BLAS. *> *> Based upon the original BLAS test routine together with: *> F06EAF Example Program Text -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -35,8 +34,7 @@ * *> \ingroup double_blas_testing * -* ===================================================================== - PROGRAM DBLAT1 +* ===================================================================== PROGRAM DBLAT1 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/dblat2.f b/BLAS/TESTING/dblat2.f index 5e07e2a..52eefcc 100644 --- a/BLAS/TESTING/dblat2.f +++ b/BLAS/TESTING/dblat2.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DBLAT2 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the DOUBLE PRECISION Level 2 Blas. *> @@ -85,11 +85,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -100,8 +99,7 @@ * *> \ingroup double_blas_testing * -* ===================================================================== - PROGRAM DBLAT2 +* ===================================================================== PROGRAM DBLAT2 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/dblat3.f b/BLAS/TESTING/dblat3.f index 87a3e09..d716f1e 100644 --- a/BLAS/TESTING/dblat3.f +++ b/BLAS/TESTING/dblat3.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DBLAT3 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the DOUBLE PRECISION Level 3 Blas. *> @@ -65,11 +65,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -80,8 +79,7 @@ * *> \ingroup double_blas_testing * -* ===================================================================== - PROGRAM DBLAT3 +* ===================================================================== PROGRAM DBLAT3 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/sblat1.f b/BLAS/TESTING/sblat1.f index c465f63..744f2d9 100644 --- a/BLAS/TESTING/sblat1.f +++ b/BLAS/TESTING/sblat1.f @@ -5,26 +5,25 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM SBLAT1 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the REAL Level 1 BLAS. *> *> Based upon the original BLAS test routine together with: *> F06EAF Example Program Text -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -35,8 +34,7 @@ * *> \ingroup single_blas_testing * -* ===================================================================== - PROGRAM SBLAT1 +* ===================================================================== PROGRAM SBLAT1 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/sblat2.f b/BLAS/TESTING/sblat2.f index 10a0adc..53f760b 100644 --- a/BLAS/TESTING/sblat2.f +++ b/BLAS/TESTING/sblat2.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM SBLAT2 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the REAL Level 2 Blas. *> @@ -85,11 +85,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -100,8 +99,7 @@ * *> \ingroup single_blas_testing * -* ===================================================================== - PROGRAM SBLAT2 +* ===================================================================== PROGRAM SBLAT2 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/sblat3.f b/BLAS/TESTING/sblat3.f index 535e2e2..a07e8e6 100644 --- a/BLAS/TESTING/sblat3.f +++ b/BLAS/TESTING/sblat3.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM SBLAT3 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the REAL Level 3 Blas. *> @@ -65,11 +65,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -80,8 +79,7 @@ * *> \ingroup single_blas_testing * -* ===================================================================== - PROGRAM SBLAT3 +* ===================================================================== PROGRAM SBLAT3 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/zblat1.f b/BLAS/TESTING/zblat1.f index a8ad681..3482afa 100644 --- a/BLAS/TESTING/zblat1.f +++ b/BLAS/TESTING/zblat1.f @@ -5,26 +5,25 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZBLAT1 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the COMPLEX*16 Level 1 BLAS. *> *> Based upon the original BLAS test routine together with: *> F06GAF Example Program Text -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -35,8 +34,7 @@ * *> \ingroup complex16_blas_testing * -* ===================================================================== - PROGRAM ZBLAT1 +* ===================================================================== PROGRAM ZBLAT1 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/zblat2.f b/BLAS/TESTING/zblat2.f index 014ed66..71e8c21 100644 --- a/BLAS/TESTING/zblat2.f +++ b/BLAS/TESTING/zblat2.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZBLAT2 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the COMPLEX*16 Level 2 Blas. *> @@ -86,11 +86,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,8 +100,7 @@ * *> \ingroup complex16_blas_testing * -* ===================================================================== - PROGRAM ZBLAT2 +* ===================================================================== PROGRAM ZBLAT2 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/BLAS/TESTING/zblat3.f b/BLAS/TESTING/zblat3.f index b189e28..1855680 100644 --- a/BLAS/TESTING/zblat3.f +++ b/BLAS/TESTING/zblat3.f @@ -5,16 +5,16 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM ZBLAT3 * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Test program for the COMPLEX*16 Level 3 Blas. *> @@ -69,11 +69,10 @@ *> 10-9-00: Change STATUS='NEW' to 'UNKNOWN' so that the testers *> can be run multiple times without deleting generated *> output files (susan) -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,8 +83,7 @@ * *> \ingroup complex16_blas_testing * -* ===================================================================== - PROGRAM ZBLAT3 +* ===================================================================== PROGRAM ZBLAT3 * * -- Reference BLAS test routine (version 3.4.0) -- * -- Reference BLAS is a software package provided by Univ. of Tennessee, -- diff --git a/INSTALL/LAPACK_version.f b/INSTALL/LAPACK_version.f index d39cfd2..4d3ce09 100644 --- a/INSTALL/LAPACK_version.f +++ b/INSTALL/LAPACK_version.f @@ -5,13 +5,13 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM LAPACK_VERSION * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -22,8 +22,7 @@ * *> \ingroup auxOTHERauxiliary * -* ===================================================================== - PROGRAM LAPACK_VERSION +* ===================================================================== PROGRAM LAPACK_VERSION * * -- LAPACK auxiliary routine (version 3.2) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/INSTALL/dlamch.f b/INSTALL/dlamch.f index 6b001c2..4ab609e 100644 --- a/INSTALL/dlamch.f +++ b/INSTALL/dlamch.f @@ -5,23 +5,22 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLAMCH( CMACH ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DLAMCH determines double precision machine parameters. +*> \verbatim *> -*>\endverbatim +*> DLAMCH determines double precision machine parameters. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] CMACH *> \verbatim @@ -49,8 +48,8 @@ *> rmax = overflow threshold - (base**emax)*(1-eps) *> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -148,15 +147,13 @@ END ************************************************************************ *> \brief \b DLAMC3 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> DLAMC3 is intended to force A and B to be stored prior to doing *> the addition of A and B , for use in situations where optimizers *> might hold one of these in a register. -*> -*>\endverbatim +*> \endverbatim *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 *> \ingroup auxOTHERauxiliary diff --git a/INSTALL/dlamchf77.f b/INSTALL/dlamchf77.f index 5c84821..6606553 100644 --- a/INSTALL/dlamchf77.f +++ b/INSTALL/dlamchf77.f @@ -5,23 +5,22 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLAMCH( CMACH ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> DLAMCHF77 determines double precision machine parameters. +*> \verbatim *> -*>\endverbatim +*> DLAMCHF77 determines double precision machine parameters. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] CMACH *> \verbatim @@ -49,8 +48,8 @@ *> rmax = overflow threshold - (base**emax)*(1-eps) *> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -185,14 +184,12 @@ ************************************************************************ * *> \brief \b DLAMC1 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> DLAMC1 determines the machine parameters given by BETA, T, RND, and *> IEEE1. -*> -*>\endverbatim +*> \endverbatim *> *> \param[out] BETA *> \verbatim @@ -216,13 +213,12 @@ *> \verbatim *> Specifies whether rounding appears to be done in the IEEE *> 'round to nearest' style. -*> -*>\endverbatim +*> \endverbatim *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 *> \ingroup auxOTHERauxiliary *> -*>\details \b Further \b Details +*> \details \b Further \b Details *> \verbatim *> *> The routine is based on the routine ENVRON by Malcolm and @@ -384,14 +380,12 @@ ************************************************************************ * *> \brief \b DLAMC2 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> DLAMC2 determines the machine parameters specified in its argument *> list. -*> -*>\endverbatim +*> \endverbatim *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 *> \ingroup auxOTHERauxiliary @@ -445,12 +439,11 @@ *> value of BETA. *> \endverbatim *> -*>\details \b Further \b Details +*> \details \b Further \b Details *> \verbatim *> *> The computation of EPS is based on a routine PARANOIA by *> W. Kahan of the University of California at Berkeley. -*> *> \endverbatim SUBROUTINE DLAMC2( BETA, T, RND, EPS, EMIN, RMIN, EMAX, RMAX ) * @@ -660,14 +653,13 @@ ************************************************************************ * *> \brief \b DLAMC3 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> DLAMC3 is intended to force A and B to be stored prior to doing *> the addition of A and B , for use in situations where optimizers *> might hold one of these in a register. -*>\endverbatim +*> \endverbatim *> *> \param[in] A *> @@ -700,13 +692,11 @@ ************************************************************************ * *> \brief \b DLAMC4 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> DLAMC4 is a service routine for DLAMC2. -*> -*>\endverbatim +*> \endverbatim *> *> \param[out] EMIN *> \verbatim @@ -789,18 +779,16 @@ ************************************************************************ * *> \brief \b DLAMC5 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> DLAMC5 attempts to compute RMAX, the largest machine floating-point *> number, without overflow. It assumes that EMAX + abs(EMIN) sum *> approximately to a power of 2. It will fail on machines where this *> assumption does not hold, for example, the Cyber 205 (EMIN = -28625, *> EMAX = 28718). It will also fail if the value supplied for EMIN is *> too large (i.e. too close to zero), probably with overflow. -*> -*>\endverbatim +*> \endverbatim *> *> \param[in] BETA *> \verbatim diff --git a/INSTALL/dlamchtst.f b/INSTALL/dlamchtst.f index d2cf15b..9b4a86a 100644 --- a/INSTALL/dlamchtst.f +++ b/INSTALL/dlamchtst.f @@ -5,13 +5,13 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DLAMCHTST * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -22,8 +22,7 @@ * *> \ingroup auxOTHERauxiliary * -* ===================================================================== - PROGRAM DLAMCHTST +* ===================================================================== PROGRAM DLAMCHTST * * -- LAPACK test routine (version 3.2) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/INSTALL/dsecnd_EXT_ETIME.f b/INSTALL/dsecnd_EXT_ETIME.f index 1118042..a244b49 100644 --- a/INSTALL/dsecnd_EXT_ETIME.f +++ b/INSTALL/dsecnd_EXT_ETIME.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSECND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSECND returns the user time for a process in seconds. *> This version gets the time from the EXTERNAL system function ETIME. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/dsecnd_EXT_ETIME_.f b/INSTALL/dsecnd_EXT_ETIME_.f index 4b5161b..7fc3696 100644 --- a/INSTALL/dsecnd_EXT_ETIME_.f +++ b/INSTALL/dsecnd_EXT_ETIME_.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSECND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSECND returns the user time for a process in seconds. *> This version gets the time from the system function ETIME_. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/dsecnd_INT_CPU_TIME.f b/INSTALL/dsecnd_INT_CPU_TIME.f index 1a0ecd9..588db94 100644 --- a/INSTALL/dsecnd_INT_CPU_TIME.f +++ b/INSTALL/dsecnd_INT_CPU_TIME.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSECND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSECND returns the user time for a process in seconds. *> This version gets the time from the INTERNAL function CPU_TIME. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/dsecnd_INT_ETIME.f b/INSTALL/dsecnd_INT_ETIME.f index a8d8156..157cde7 100644 --- a/INSTALL/dsecnd_INT_ETIME.f +++ b/INSTALL/dsecnd_INT_ETIME.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSECND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSECND returns the user time for a process in seconds. *> This version gets the time from the INTERNAL function ETIME. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/dsecnd_NONE.f b/INSTALL/dsecnd_NONE.f index b65279a..527c792 100644 --- a/INSTALL/dsecnd_NONE.f +++ b/INSTALL/dsecnd_NONE.f @@ -5,26 +5,25 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DSECND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSECND returns nothing instead of returning the user time for a process in seconds. *> If you are using that routine, it means that neither EXTERNAL ETIME, *> EXTERNAL ETIME_, INTERNAL ETIME, INTERNAL CPU_TIME is available on *> your machine. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/dsecndtst.f b/INSTALL/dsecndtst.f index 603d53e..7403de4 100644 --- a/INSTALL/dsecndtst.f +++ b/INSTALL/dsecndtst.f @@ -5,13 +5,13 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM DSECNDTST * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -22,8 +22,7 @@ * *> \ingroup auxOTHERauxiliary * -* ===================================================================== - PROGRAM DSECNDTST +* ===================================================================== PROGRAM DSECNDTST * * -- LAPACK test routine (version 3.3.1) -- * diff --git a/INSTALL/ilaver.f b/INSTALL/ilaver.f index 4d4714b..779778d 100644 --- a/INSTALL/ilaver.f +++ b/INSTALL/ilaver.f @@ -5,25 +5,24 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ILAVER( VERS_MAJOR, VERS_MINOR, VERS_PATCH ) * * INTEGER VERS_MAJOR, VERS_MINOR, VERS_PATCH * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> This subroutine returns the LAPACK version. +*> \verbatim *> -*>\endverbatim +*> This subroutine returns the LAPACK version. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] VERS_MAJOR *> return the lapack major version @@ -34,8 +33,8 @@ *> \param[out] VERS_PATCH *> return the lapack patch version from the minor version * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -57,8 +56,7 @@ * ===================================================================== * INTEGER VERS_MAJOR, VERS_MINOR, VERS_PATCH -* ===================================================================== - VERS_MAJOR = 3 +* ===================================================================== VERS_MAJOR = 3 VERS_MINOR = 3 VERS_PATCH = 1 * ===================================================================== diff --git a/INSTALL/lsame.f b/INSTALL/lsame.f index b284aa4..227cc05 100644 --- a/INSTALL/lsame.f +++ b/INSTALL/lsame.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION LSAME( CA, CB ) * @@ -14,19 +14,18 @@ * CHARACTER CA, CB * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> LSAME returns .TRUE. if CA is the same letter as CB regardless of *> case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] CA *> \verbatim @@ -37,8 +36,8 @@ *> CA and CB specify the single characters to be compared. *> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/lsametst.f b/INSTALL/lsametst.f index 75dba05..c44c63e 100644 --- a/INSTALL/lsametst.f +++ b/INSTALL/lsametst.f @@ -5,13 +5,13 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * PROGRAM LSAMETST * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -22,8 +22,7 @@ * *> \ingroup auxOTHERauxiliary * -* ===================================================================== - PROGRAM LSAMETST +* ===================================================================== PROGRAM LSAMETST * * -- LAPACK test routine (version 3.2) -- * diff --git a/INSTALL/second_EXT_ETIME.f b/INSTALL/second_EXT_ETIME.f index 3b010a8..636e18e 100644 --- a/INSTALL/second_EXT_ETIME.f +++ b/INSTALL/second_EXT_ETIME.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SECOND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SECOND returns the user time for a process in seconds. *> This version gets the time from the EXTERNAL system function ETIME. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/second_EXT_ETIME_.f b/INSTALL/second_EXT_ETIME_.f index 1e0357f..29a800c 100644 --- a/INSTALL/second_EXT_ETIME_.f +++ b/INSTALL/second_EXT_ETIME_.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SECOND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SECOND returns the user time for a process in seconds. *> This version gets the time from the system function ETIME_. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/second_INT_CPU_TIME.f b/INSTALL/second_INT_CPU_TIME.f index ada39a9..5816f9f 100644 --- a/INSTALL/second_INT_CPU_TIME.f +++ b/INSTALL/second_INT_CPU_TIME.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SECOND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SECOND returns the user time for a process in seconds. *> This version gets the time from the INTERNAL function CPU_TIME. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/second_INT_ETIME.f b/INSTALL/second_INT_ETIME.f index 9b6a61b..ef2d025 100644 --- a/INSTALL/second_INT_ETIME.f +++ b/INSTALL/second_INT_ETIME.f @@ -5,24 +5,23 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SECOND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SECOND returns the user time for a process in seconds. *> This version gets the time from the INTERNAL function ETIME. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/second_NONE.f b/INSTALL/second_NONE.f index 67d1b67..ffb2528 100644 --- a/INSTALL/second_NONE.f +++ b/INSTALL/second_NONE.f @@ -5,26 +5,25 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SECOND( ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SECOND returns nothing instead of returning the user time for a process in seconds. *> If you are using that routine, it means that neither EXTERNAL ETIME, *> EXTERNAL ETIME_, INTERNAL ETIME, INTERNAL CPU_TIME is available on *> your machine. -*> -*>\endverbatim +*> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/INSTALL/secondtst.f b/INSTALL/secondtst.f index 858a430..a507895 100644 --- a/INSTALL/secondtst.f +++ b/INSTALL/secondtst.f @@ -6,8 +6,8 @@ * http://www.netlib.org/lapack/explore-html/ * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -18,8 +18,7 @@ * *> \ingroup auxOTHERcomputational * -* ===================================================================== - PROGRAM SECONDTST +* ===================================================================== PROGRAM SECONDTST * * -- LAPACK test routine (version 3.3.1) -- * diff --git a/INSTALL/slamch.f b/INSTALL/slamch.f index e96ed21..1947b6a 100644 --- a/INSTALL/slamch.f +++ b/INSTALL/slamch.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLAMCH( CMACH ) * @@ -14,18 +14,17 @@ * CHARACTER CMACH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SLAMCH determines single precision machine parameters. +*> \verbatim *> -*>\endverbatim +*> SLAMCH determines single precision machine parameters. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] CMACH *> \verbatim @@ -52,10 +51,9 @@ *> emax = largest exponent before overflow *> rmax = overflow threshold - (base**emax)*(1-eps) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -149,15 +147,13 @@ END ************************************************************************ *> \brief \b SLAMC3 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> SLAMC3 is intended to force A and B to be stored prior to doing *> the addition of A and B , for use in situations where optimizers *> might hold one of these in a register. -*> -*>\endverbatim +*> \endverbatim *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 *> \ingroup auxOTHERauxiliary diff --git a/INSTALL/slamchf77.f b/INSTALL/slamchf77.f index 71baea2..5a078d1 100644 --- a/INSTALL/slamchf77.f +++ b/INSTALL/slamchf77.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLAMCH( CMACH ) * @@ -14,18 +14,17 @@ * CHARACTER CMACH * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> SLAMCH determines single precision machine parameters. +*> \verbatim *> -*>\endverbatim +*> SLAMCH determines single precision machine parameters. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] CMACH *> \verbatim @@ -52,10 +51,9 @@ *> emax = largest exponent before overflow *> rmax = overflow threshold - (base**emax)*(1-eps) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -191,14 +189,12 @@ ************************************************************************ * *> \brief \b SLAMC1 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> SLAMC1 determines the machine parameters given by BETA, T, RND, and *> IEEE1. -*> -*>\endverbatim +*> \endverbatim *> *> \param[out] BETA *> \verbatim @@ -222,13 +218,12 @@ *> \verbatim *> Specifies whether rounding appears to be done in the IEEE *> 'round to nearest' style. -*> -*>\endverbatim +*> \endverbatim *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 *> \ingroup auxOTHERauxiliary *> -*>\details \b Further \b Details +*> \details \b Further \b Details *> \verbatim *> *> The routine is based on the routine ENVRON by Malcolm and @@ -390,14 +385,12 @@ ************************************************************************ * *> \brief \b SLAMC2 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> SLAMC2 determines the machine parameters specified in its argument *> list. -*> -*>\endverbatim +*> \endverbatim *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 *> \ingroup auxOTHERauxiliary @@ -451,12 +444,11 @@ *> value of BETA. *> \endverbatim *> -*>\details \b Further \b Details +*> \details \b Further \b Details *> \verbatim *> *> The computation of EPS is based on a routine PARANOIA by *> W. Kahan of the University of California at Berkeley. -*> *> \endverbatim SUBROUTINE SLAMC2( BETA, T, RND, EPS, EMIN, RMIN, EMAX, RMAX ) * @@ -666,14 +658,13 @@ ************************************************************************ * *> \brief \b SLAMC3 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> SLAMC3 is intended to force A and B to be stored prior to doing *> the addition of A and B , for use in situations where optimizers *> might hold one of these in a register. -*>\endverbatim +*> \endverbatim *> *> \param[in] A *> @@ -706,13 +697,11 @@ ************************************************************************ * *> \brief \b SLAMC4 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> SLAMC4 is a service routine for SLAMC2. -*> -*>\endverbatim +*> \endverbatim *> *> \param[out] EMIN *> \verbatim @@ -796,18 +785,16 @@ ************************************************************************ * *> \brief \b SLAMC5 -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> SLAMC5 attempts to compute RMAX, the largest machine floating-point *> number, without overflow. It assumes that EMAX + abs(EMIN) sum *> approximately to a power of 2. It will fail on machines where this *> assumption does not hold, for example, the Cyber 205 (EMIN = -28625, *> EMAX = 28718). It will also fail if the value supplied for EMIN is *> too large (i.e. too close to zero), probably with overflow. -*> -*>\endverbatim +*> \endverbatim *> *> \param[in] BETA *> \verbatim diff --git a/INSTALL/slamchtst.f b/INSTALL/slamchtst.f index 9812275..59c689a 100644 --- a/INSTALL/slamchtst.f +++ b/INSTALL/slamchtst.f @@ -6,8 +6,8 @@ * http://www.netlib.org/lapack/explore-html/ * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -18,8 +18,7 @@ * *> \ingroup auxOTHERcomputational * -* ===================================================================== - PROGRAM SLAMCHTST +* ===================================================================== PROGRAM SLAMCHTST * * -- LAPACK test routine (version 3.2) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/INSTALL/tstiee.f b/INSTALL/tstiee.f index 1064f14..300160f 100644 --- a/INSTALL/tstiee.f +++ b/INSTALL/tstiee.f @@ -5,8 +5,8 @@ * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -18,7 +18,6 @@ *> \ingroup auxOTHERauxiliary * * ===================================================================== - PROGRAM TSTIEE * * -- LAPACK test routine (version 3.2) -- @@ -107,8 +106,8 @@ * This routine will not function correctly if it is converted to all * lower case. Converting it to all upper case is allowed. * -* Arguments -* ========= +* Arguments: +* ========== * * ISPEC (input) INTEGER * Specifies the parameter to be returned as the value of @@ -640,8 +639,8 @@ * IEEECK is called from the ILAENV to verify that Inifinity and * possibly NaN arithmetic is safe (i.e. will not trap). * -* Arguments -* ========= +* Arguments: +* ========== * * ISPEC (input) INTEGER * Specifies whether to test just for inifinity arithmetic diff --git a/SRC/VARIANTS/cholesky/RL/cpotrf.f b/SRC/VARIANTS/cholesky/RL/cpotrf.f index cdc182e..0f45856 100644 --- a/SRC/VARIANTS/cholesky/RL/cpotrf.f +++ b/SRC/VARIANTS/cholesky/RL/cpotrf.f @@ -5,8 +5,8 @@ C> \brief \b CPOTRF VARIANT: right looking block version of the algorithm, calli * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/RL/dpotrf.f b/SRC/VARIANTS/cholesky/RL/dpotrf.f index f061439..ce323b4 100644 --- a/SRC/VARIANTS/cholesky/RL/dpotrf.f +++ b/SRC/VARIANTS/cholesky/RL/dpotrf.f @@ -5,8 +5,8 @@ C> \brief \b DPOTRF VARIANT: right looking block version of the algorithm, calli * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/RL/spotrf.f b/SRC/VARIANTS/cholesky/RL/spotrf.f index f388a36..21b0b41 100644 --- a/SRC/VARIANTS/cholesky/RL/spotrf.f +++ b/SRC/VARIANTS/cholesky/RL/spotrf.f @@ -5,8 +5,8 @@ C> \brief \b SPOTRF VARIANT: right looking block version of the algorithm, calli * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/RL/zpotrf.f b/SRC/VARIANTS/cholesky/RL/zpotrf.f index db1fff7..39e72c8 100644 --- a/SRC/VARIANTS/cholesky/RL/zpotrf.f +++ b/SRC/VARIANTS/cholesky/RL/zpotrf.f @@ -5,8 +5,8 @@ C> \brief \b ZPOTRF VARIANT: right looking block version of the algorithm, calli * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/TOP/cpotrf.f b/SRC/VARIANTS/cholesky/TOP/cpotrf.f index 365eb16..e42a78f 100644 --- a/SRC/VARIANTS/cholesky/TOP/cpotrf.f +++ b/SRC/VARIANTS/cholesky/TOP/cpotrf.f @@ -5,8 +5,8 @@ C> \brief \b CPOTRF VARIANT: top-looking block version of the algorithm, calling * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/TOP/dpotrf.f b/SRC/VARIANTS/cholesky/TOP/dpotrf.f index eccf4f8..c91669b 100644 --- a/SRC/VARIANTS/cholesky/TOP/dpotrf.f +++ b/SRC/VARIANTS/cholesky/TOP/dpotrf.f @@ -5,8 +5,8 @@ C> \brief \b DPOTRF VARIANT: top-looking block version of the algorithm, calling * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/TOP/spotrf.f b/SRC/VARIANTS/cholesky/TOP/spotrf.f index 65b6a8e..4a46f72 100644 --- a/SRC/VARIANTS/cholesky/TOP/spotrf.f +++ b/SRC/VARIANTS/cholesky/TOP/spotrf.f @@ -5,8 +5,8 @@ C> \brief \b SPOTRF VARIANT: top-looking block version of the algorithm, calling * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/cholesky/TOP/zpotrf.f b/SRC/VARIANTS/cholesky/TOP/zpotrf.f index 7614246..9d4f636 100644 --- a/SRC/VARIANTS/cholesky/TOP/zpotrf.f +++ b/SRC/VARIANTS/cholesky/TOP/zpotrf.f @@ -5,8 +5,8 @@ C> \brief \b ZPOTRF VARIANT: top-looking block version of the algorithm, calling * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOTRF ( UPLO, N, A, LDA, INFO ) * @@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] UPLO C> \verbatim @@ -85,8 +85,8 @@ C> completed. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/CR/cgetrf.f b/SRC/VARIANTS/lu/CR/cgetrf.f index 1446a8d..665ef82 100644 --- a/SRC/VARIANTS/lu/CR/cgetrf.f +++ b/SRC/VARIANTS/lu/CR/cgetrf.f @@ -5,8 +5,8 @@ C> \brief \b CGETRF VARIANT: Crout Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/CR/dgetrf.f b/SRC/VARIANTS/lu/CR/dgetrf.f index 1de7c10..d638156 100644 --- a/SRC/VARIANTS/lu/CR/dgetrf.f +++ b/SRC/VARIANTS/lu/CR/dgetrf.f @@ -5,8 +5,8 @@ C> \brief \b DGETRF VARIANT: Crout Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/CR/sgetrf.f b/SRC/VARIANTS/lu/CR/sgetrf.f index c70871b..d5aeae4 100644 --- a/SRC/VARIANTS/lu/CR/sgetrf.f +++ b/SRC/VARIANTS/lu/CR/sgetrf.f @@ -5,8 +5,8 @@ C> \brief \b SGETRF VARIANT: Crout Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/CR/zgetrf.f b/SRC/VARIANTS/lu/CR/zgetrf.f index 0a36b21..3178aac 100644 --- a/SRC/VARIANTS/lu/CR/zgetrf.f +++ b/SRC/VARIANTS/lu/CR/zgetrf.f @@ -5,8 +5,8 @@ C> \brief \b ZGETRF VARIANT: Crout Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/LL/cgetrf.f b/SRC/VARIANTS/lu/LL/cgetrf.f index 2765dfd..9787f43 100644 --- a/SRC/VARIANTS/lu/LL/cgetrf.f +++ b/SRC/VARIANTS/lu/LL/cgetrf.f @@ -5,8 +5,8 @@ C> \brief \b CGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/LL/dgetrf.f b/SRC/VARIANTS/lu/LL/dgetrf.f index a462814..3df00dc 100644 --- a/SRC/VARIANTS/lu/LL/dgetrf.f +++ b/SRC/VARIANTS/lu/LL/dgetrf.f @@ -5,8 +5,8 @@ C> \brief \b DGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/LL/sgetrf.f b/SRC/VARIANTS/lu/LL/sgetrf.f index 0e97e01..c36d8e7 100644 --- a/SRC/VARIANTS/lu/LL/sgetrf.f +++ b/SRC/VARIANTS/lu/LL/sgetrf.f @@ -5,8 +5,8 @@ C> \brief \b SGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/LL/zgetrf.f b/SRC/VARIANTS/lu/LL/zgetrf.f index b4b7d91..3b2199b 100644 --- a/SRC/VARIANTS/lu/LL/zgetrf.f +++ b/SRC/VARIANTS/lu/LL/zgetrf.f @@ -5,8 +5,8 @@ C> \brief \b ZGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETRF ( M, N, A, LDA, IPIV, INFO) * @@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -85,8 +85,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/REC/cgetrf.f b/SRC/VARIANTS/lu/REC/cgetrf.f index 8b45709..a46bad1 100644 --- a/SRC/VARIANTS/lu/REC/cgetrf.f +++ b/SRC/VARIANTS/lu/REC/cgetrf.f @@ -5,8 +5,8 @@ C> \brief \b CGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744 C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -119,8 +119,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/REC/dgetrf.f b/SRC/VARIANTS/lu/REC/dgetrf.f index 7263a5b..318c166 100644 --- a/SRC/VARIANTS/lu/REC/dgetrf.f +++ b/SRC/VARIANTS/lu/REC/dgetrf.f @@ -5,8 +5,8 @@ C> \brief \b DGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744 C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -119,8 +119,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/REC/sgetrf.f b/SRC/VARIANTS/lu/REC/sgetrf.f index 11eb781..9df7d5b 100644 --- a/SRC/VARIANTS/lu/REC/sgetrf.f +++ b/SRC/VARIANTS/lu/REC/sgetrf.f @@ -5,8 +5,8 @@ C> \brief \b SGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744 C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -119,8 +119,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/lu/REC/zgetrf.f b/SRC/VARIANTS/lu/REC/zgetrf.f index 19137fb..fe698e1 100644 --- a/SRC/VARIANTS/lu/REC/zgetrf.f +++ b/SRC/VARIANTS/lu/REC/zgetrf.f @@ -5,8 +5,8 @@ C> \brief \b ZGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744 C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -119,8 +119,8 @@ C> to solve a system of equations. C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/qr/LL/cgeqrf.f b/SRC/VARIANTS/qr/LL/cgeqrf.f index 08af07f..8a79ebe 100644 --- a/SRC/VARIANTS/qr/LL/cgeqrf.f +++ b/SRC/VARIANTS/qr/LL/cgeqrf.f @@ -5,8 +5,8 @@ C> \brief \b CGEQRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -115,8 +115,8 @@ C> < 0: if INFO = -i, the i-th argument had an illegal value C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley @@ -127,7 +127,6 @@ C> \date November 2011 * C> \ingroup variantsGEcomputational * -* * Further Details * =============== C>\details \b Further \b Details diff --git a/SRC/VARIANTS/qr/LL/dgeqrf.f b/SRC/VARIANTS/qr/LL/dgeqrf.f index 2249720..b6fa5ac 100644 --- a/SRC/VARIANTS/qr/LL/dgeqrf.f +++ b/SRC/VARIANTS/qr/LL/dgeqrf.f @@ -5,8 +5,8 @@ C> \brief \b DGEQRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -115,8 +115,8 @@ C> < 0: if INFO = -i, the i-th argument had an illegal value C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley @@ -127,7 +127,6 @@ C> \date November 2011 * C> \ingroup variantsGEcomputational * -* * Further Details * =============== C>\details \b Further \b Details diff --git a/SRC/VARIANTS/qr/LL/sceil.f b/SRC/VARIANTS/qr/LL/sceil.f index f988e6b..397b7df 100644 --- a/SRC/VARIANTS/qr/LL/sceil.f +++ b/SRC/VARIANTS/qr/LL/sceil.f @@ -5,8 +5,8 @@ C> \brief \b SCEIL * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SCEIL( A ) * @@ -39,12 +39,12 @@ C>\details \b Purpose: C>\verbatim C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley diff --git a/SRC/VARIANTS/qr/LL/sgeqrf.f b/SRC/VARIANTS/qr/LL/sgeqrf.f index a74272b..1d22897 100644 --- a/SRC/VARIANTS/qr/LL/sgeqrf.f +++ b/SRC/VARIANTS/qr/LL/sgeqrf.f @@ -5,8 +5,8 @@ C> \brief \b SGEQRF VARIANT: left-looking Level 3 BLAS version of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -115,8 +115,8 @@ C> < 0: if INFO = -i, the i-th argument had an illegal value C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley @@ -127,7 +127,6 @@ C> \date November 2011 * C> \ingroup variantsGEcomputational * -* * Further Details * =============== C>\details \b Further \b Details diff --git a/SRC/VARIANTS/qr/LL/zgeqrf.f b/SRC/VARIANTS/qr/LL/zgeqrf.f index 2f6b709..576d9fa 100644 --- a/SRC/VARIANTS/qr/LL/zgeqrf.f +++ b/SRC/VARIANTS/qr/LL/zgeqrf.f @@ -5,8 +5,8 @@ C> \brief \b ZGEQRF VARIANT: left-looking Level 3 BLAS of the algorithm. * Online html documentation available at * http://www.netlib.org/lapack/explore-html/ * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm. C> C>\endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * C> \param[in] M C> \verbatim @@ -115,8 +115,8 @@ C> < 0: if INFO = -i, the i-th argument had an illegal value C> \endverbatim C> * -* Authors -* ======= +* Authors: +* ======== * C> \author Univ. of Tennessee C> \author Univ. of California Berkeley @@ -127,7 +127,6 @@ C> \date November 2011 * C> \ingroup variantsGEcomputational * -* * Further Details * =============== C>\details \b Further \b Details diff --git a/SRC/cbbcsd.f b/SRC/cbbcsd.f index 91254a9..4c9b2eb 100644 --- a/SRC/cbbcsd.f +++ b/SRC/cbbcsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q, * THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T, @@ -35,11 +35,11 @@ * $ V2T( LDV2T, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CBBCSD computes the CS decomposition of a unitary matrix in *> bidiagonal-block form, @@ -68,11 +68,10 @@ *> The unitary matrices U1, U2, V1T, and V2T are input/output. *> The input matrices are pre- or post-multiplied by the appropriate *> singular vector matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -297,25 +296,26 @@ *> > 0: if CBBCSD did not converge, INFO specifies the number *> of nonzero entries in PHI, and B11D, B11E, etc., *> contain the partially reduced matrix. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Reference -*> ========= -*> -*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. -*> Algorithms, 50(1):33-65, 2009. -*> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL REAL, default = MAX(10,MIN(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they *> are within TOLMUL*EPS of either bound. *> \endverbatim +* +*> \par References: +* ================ *> +*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. +*> Algorithms, 50(1):33-65, 2009. * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cbdsqr.f b/SRC/cbdsqr.f index c9423b9..7121d07 100644 --- a/SRC/cbdsqr.f +++ b/SRC/cbdsqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, * LDU, C, LDC, RWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX C( LDC, * ), U( LDU, * ), VT( LDVT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CBDSQR computes the singular values and, optionally, the right and/or *> left singular vectors from the singular value decomposition (SVD) of @@ -65,11 +65,10 @@ *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics *> Department, University of California at Berkeley, July 1992 *> for a detailed description of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -180,10 +179,12 @@ *> elements of a bidiagonal matrix which is orthogonally *> similar to the input matrix B; if INFO = i, i *> elements of E have not converged to zero. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL REAL, default = max(10,min(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> If it is positive, TOLMUL*EPS is the desired relative @@ -205,10 +206,9 @@ *> (and so fails to converge) if the number of passes *> through the inner loop exceeds MAXITR*N**2. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbbrd.f b/SRC/cgbbrd.f index 2b5b4f4..0c5f8b7 100644 --- a/SRC/cgbbrd.f +++ b/SRC/cgbbrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q, * LDQ, PT, LDPT, C, LDC, WORK, RWORK, INFO ) @@ -31,22 +31,21 @@ * $ Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBBRD reduces a complex general m-by-n band matrix A to real upper *> bidiagonal form B by a unitary transformation: Q**H * A * P = B. *> *> The routine computes B, and optionally forms Q or P**H, or computes *> Q**H*C for a given matrix C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -177,10 +176,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/SRC/cgbcon.f b/SRC/cgbcon.f index d7e564c..d944df3 100644 --- a/SRC/cgbcon.f +++ b/SRC/cgbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND, * WORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * COMPLEX AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBCON estimates the reciprocal of the condition number of a complex *> general band matrix A, in either the 1-norm or the infinity-norm, @@ -45,11 +45,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -131,10 +130,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/SRC/cgbequ.f b/SRC/cgbequ.f index 01e8178..6d64efb 100644 --- a/SRC/cgbequ.f +++ b/SRC/cgbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -30,11 +30,11 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBEQU computes row and column scalings intended to equilibrate an *> M-by-N band matrix A and reduce its condition number. R returns the @@ -46,11 +46,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -138,10 +137,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbequb.f b/SRC/cgbequb.f index 65385f0..db110e6 100644 --- a/SRC/cgbequb.f +++ b/SRC/cgbequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -30,11 +30,11 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -53,11 +53,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -145,10 +144,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbrfs.f b/SRC/cgbrfs.f index 1bff7c1..a139050 100644 --- a/SRC/cgbrfs.f +++ b/SRC/cgbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, @@ -33,20 +33,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is banded, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -181,16 +180,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbrfsx.f b/SRC/cgbrfsx.f index 7448f1e..0d0e751 100644 --- a/SRC/cgbrfsx.f +++ b/SRC/cgbrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBRFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -58,11 +56,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -423,10 +420,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbsv.f b/SRC/cgbsv.f index 4529a15..283e9a6 100644 --- a/SRC/cgbsv.f +++ b/SRC/cgbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBSV computes the solution to a complex system of linear equations *> A * X = B, where A is a band matrix of order N with KL subdiagonals @@ -43,11 +43,10 @@ *> and unit lower triangular matrices with KL subdiagonals, and U is *> upper triangular with KL+KU superdiagonals. The factored form of A *> is then used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -125,10 +124,9 @@ *> has been completed, but the factor U is exactly *> singular, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,10 +137,9 @@ * *> \ingroup complexGBsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -160,7 +157,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgbsvx.f b/SRC/cgbsvx.f index 890112d..5308dc6 100644 --- a/SRC/cgbsvx.f +++ b/SRC/cgbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -35,11 +35,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBSVX uses the LU factorization to compute the solution to a complex *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B, @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed by this subroutine: *> @@ -88,11 +91,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -350,10 +352,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbsvxx.f b/SRC/cgbsvxx.f index 3684e81..d55fef7 100644 --- a/SRC/cgbsvxx.f +++ b/SRC/cgbsvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBSVXX uses the LU factorization to compute the solution to a *> complex system of linear equations A * X = B, where A is an @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what CGBSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -109,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -543,10 +543,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgbtf2.f b/SRC/cgbtf2.f index b01bad7..fcce0b6 100644 --- a/SRC/cgbtf2.f +++ b/SRC/cgbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBTF2 computes an LU factorization of a complex m-by-n band matrix *> A using partial pivoting with row interchanges. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup complexGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -143,7 +140,6 @@ *> + need not be set on entry, but are required by the routine to store *> elements of U, because of fill-in resulting from the row *> interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgbtrf.f b/SRC/cgbtrf.f index 17a238b..6cd4b58 100644 --- a/SRC/cgbtrf.f +++ b/SRC/cgbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBTRF computes an LU factorization of a complex m-by-n band matrix A *> using partial pivoting with row interchanges. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup complexGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -142,7 +139,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgbtrs.f b/SRC/cgbtrs.f index 2166ce6..52cba82 100644 --- a/SRC/cgbtrs.f +++ b/SRC/cgbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * COMPLEX AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGBTRS solves a system of linear equations *> A * X = B, A**T * X = B, or A**H * X = B *> with a general band matrix A using the LU factorization computed *> by CGBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/cgebak.f b/SRC/cgebak.f index 48870c8..cc063a0 100644 --- a/SRC/cgebak.f +++ b/SRC/cgebak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV, * INFO ) @@ -30,20 +30,19 @@ * COMPLEX V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEBAK forms the right or left eigenvectors of a complex general *> matrix by backward transformation on the computed eigenvectors of the *> balanced matrix output by CGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \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/SRC/cgebal.f b/SRC/cgebal.f index 276137f..ee8ba6b 100644 --- a/SRC/cgebal.f +++ b/SRC/cgebal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEBAL balances a general complex matrix A. This involves, first, *> permuting A by a similarity transformation to isolate eigenvalues @@ -44,11 +44,10 @@ *> *> Balancing may reduce the 1-norm of the matrix, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -114,10 +113,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 @@ -128,10 +126,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The permutations consist of row and column interchanges which put @@ -159,7 +156,6 @@ *> *> Modified by Tzu-Yi Chen, Computer Science Division, University of *> California at Berkeley, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgebd2.f b/SRC/cgebd2.f index 4adf2e8..dc2a823 100644 --- a/SRC/cgebd2.f +++ b/SRC/cgebd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEBD2 reduces a complex general m by n matrix A to upper or lower *> real bidiagonal form B by a unitary transformation: Q**H * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -139,10 +137,9 @@ *> \ingroup complexGEcomputational * @precisions normal c -> s d z * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -188,7 +185,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgebrd.f b/SRC/cgebrd.f index 798e027..4d9f2f1 100644 --- a/SRC/cgebrd.f +++ b/SRC/cgebrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, * INFO ) @@ -30,21 +30,20 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEBRD reduces a general complex M-by-N matrix A to upper or lower *> bidiagonal form B by a unitary transformation: Q**H * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -140,10 +139,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 @@ -154,10 +152,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -203,7 +200,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgecon.f b/SRC/cgecon.f index bc538b0..848908a 100644 --- a/SRC/cgecon.f +++ b/SRC/cgecon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, RWORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGECON estimates the reciprocal of the condition number of a general *> complex matrix A, in either the 1-norm or the infinity-norm, using @@ -44,11 +44,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +107,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/SRC/cgeequ.f b/SRC/cgeequ.f index e38b1be..a8138c1 100644 --- a/SRC/cgeequ.f +++ b/SRC/cgeequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEEQU computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -46,11 +46,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgeequb.f b/SRC/cgeequb.f index d4c353c..d9b75a1 100644 --- a/SRC/cgeequb.f +++ b/SRC/cgeequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -53,11 +53,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -131,10 +130,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgees.f b/SRC/cgees.f index 0c5199c..24cde6f 100644 --- a/SRC/cgees.f +++ b/SRC/cgees.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, W, VS, * LDVS, WORK, LWORK, RWORK, BWORK, INFO ) @@ -35,11 +35,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEES computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur @@ -51,11 +51,10 @@ *> invariant subspace corresponding to the selected eigenvalues. *> *> A complex matrix is in Schur form if it is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -181,10 +180,9 @@ *> SELECT = .TRUE.. This could also be caused by *> underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgeesx.f b/SRC/cgeesx.f index c4c24f3..145c2e0 100644 --- a/SRC/cgeesx.f +++ b/SRC/cgeesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, W, * VS, LDVS, RCONDE, RCONDV, WORK, LWORK, RWORK, @@ -37,11 +37,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEESX computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur @@ -60,11 +60,10 @@ *> these quantities are called s and sep respectively). *> *> A complex matrix is in Schur form if it is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -222,10 +221,9 @@ *> the Schur form no longer satisfy SELECT=.TRUE. This *> could also be caused by underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgeev.f b/SRC/cgeev.f index bad77c5..a41b50e 100644 --- a/SRC/cgeev.f +++ b/SRC/cgeev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEEV( JOBVL, JOBVR, N, A, LDA, W, VL, LDVL, VR, LDVR, * WORK, LWORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEEV computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -49,11 +49,10 @@ *> *> The computed eigenvectors are normalized to have Euclidean norm *> equal to 1 and largest component real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -161,10 +160,9 @@ *> elements and i+1:N of W contain eigenvalues which have *> converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgeevx.f b/SRC/cgeevx.f index 8f37a56..a2354ea 100644 --- a/SRC/cgeevx.f +++ b/SRC/cgeevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, * LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE, @@ -34,11 +34,11 @@ * $ W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEEVX computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -69,11 +69,10 @@ *> (in exact arithmetic) but diagonal scaling will. For further *> explanation of balancing, see section 4.10.2 of the LAPACK *> Users' Guide. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -268,10 +267,9 @@ *> have been computed; elements 1:ILO-1 and i+1:N of W *> contain eigenvalues which have converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgegs.f b/SRC/cgegs.f index 90d2e34..f0e9c95 100644 --- a/SRC/cgegs.f +++ b/SRC/cgegs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHA, BETA, * VSL, LDVSL, VSR, LDVSR, WORK, LWORK, RWORK, @@ -33,11 +33,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine CGGES. *> @@ -56,11 +56,10 @@ *> CGEGV should be used instead. See CGEGV for a description of the *> eigenvalues of the generalized nonsymmetric eigenvalue problem *> (GNEP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -208,10 +207,9 @@ *> =N+8: error return from CGGBAK (computing VSR) *> =N+9: error return from CLASCL (various places) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgegv.f b/SRC/cgegv.f index 69fc829..7c2396f 100644 --- a/SRC/cgegv.f +++ b/SRC/cgegv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA, * VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine CGGEV. *> @@ -64,11 +64,10 @@ *> are left eigenvectors of (A,B). *> *> Note: this routine performs "full balancing" on A and B -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -234,10 +233,9 @@ *> =N+9: error return from CGGBAK (computing VR) *> =N+10: error return from CLASCL (various calls) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -248,10 +246,9 @@ * *> \ingroup complexGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing @@ -279,7 +276,6 @@ *> are computed, then only the diagonal blocks will be correct. *> *> [*] In other words, upper triangular form. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgehd2.f b/SRC/cgehd2.f index b7fe084..2e3085e 100644 --- a/SRC/cgehd2.f +++ b/SRC/cgehd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEHD2 reduces a complex general matrix A to upper Hessenberg form H *> by a unitary similarity transformation: Q**H * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \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 @@ -112,10 +110,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -147,7 +144,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgehrd.f b/SRC/cgehrd.f index 363c9a8..9c0032f 100644 --- a/SRC/cgehrd.f +++ b/SRC/cgehrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEHRD reduces a complex general matrix A to upper Hessenberg form H by *> an unitary similarity transformation: Q**H * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -113,10 +112,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 @@ -127,10 +125,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -166,7 +163,6 @@ *> This file is a slight modification of LAPACK-3.0's DGEHRD *> subroutine incorporating improvements proposed by Quintana-Orti and *> Van de Geijn (2006). (See DLAHR2.) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgelq2.f b/SRC/cgelq2.f index 2e91545..32fa0c7 100644 --- a/SRC/cgelq2.f +++ b/SRC/cgelq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGELQ2 computes an LQ factorization of a complex m by n matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in *> A(i,i+1:n), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgelqf.f b/SRC/cgelqf.f index f88e525..b5973f6 100644 --- a/SRC/cgelqf.f +++ b/SRC/cgelqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGELQF computes an LQ factorization of a complex M-by-N matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -102,10 +101,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 @@ -116,10 +114,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -133,7 +130,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in *> A(i,i+1:n), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgels.f b/SRC/cgels.f index 29bb2ab..7b9e95d 100644 --- a/SRC/cgels.f +++ b/SRC/cgels.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGELS solves overdetermined or underdetermined complex linear systems *> involving an M-by-N matrix A, or its conjugate-transpose, using a QR @@ -59,11 +59,10 @@ *> handled in a single call; they are stored as the columns of the *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution *> matrix X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -166,10 +165,9 @@ *> full rank; the least squares solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgelsd.f b/SRC/cgelsd.f index 4ec0862..fd6df63 100644 --- a/SRC/cgelsd.f +++ b/SRC/cgelsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, RWORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGELSD computes the minimum-norm solution to a real linear least *> squares problem: @@ -66,11 +66,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -202,10 +201,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -216,19 +214,13 @@ * *> \ingroup complexGEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE CGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, $ WORK, LWORK, RWORK, IWORK, INFO ) diff --git a/SRC/cgelss.f b/SRC/cgelss.f index e254078..85c4f98 100644 --- a/SRC/cgelss.f +++ b/SRC/cgelss.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, RWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGELSS computes the minimum norm solution to a complex linear *> least squares problem: @@ -52,11 +52,10 @@ *> The effective rank of A is determined by treating as zero those *> singular values which are less than RCOND times the largest singular *> value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -162,10 +161,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgelsx.f b/SRC/cgelsx.f index 706bc33..ad65a7a 100644 --- a/SRC/cgelsx.f +++ b/SRC/cgelsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine CGELSY. *> @@ -66,11 +66,10 @@ *> X = P * Z**H [ inv(T11)*Q1**H*B ] *> [ 0 ] *> where Q1 consists of the first RANK columns of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -168,10 +167,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/SRC/cgelsy.f b/SRC/cgelsy.f index 8e8261c..ef67bcd 100644 --- a/SRC/cgelsy.f +++ b/SRC/cgelsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, LWORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGELSY computes the minimum-norm solution to a complex linear least *> squares problem: @@ -73,11 +73,10 @@ *> the call to the subroutine xGEQP3. This subroutine is a Blas-3 *> version of the QR factorization with column pivoting. *> o Matrix B (the right hand side) is updated with Blas-3. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,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 @@ -201,18 +199,12 @@ * *> \ingroup complexGEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> -*> \endverbatim +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n +*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n +*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n *> * ===================================================================== SUBROUTINE CGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, diff --git a/SRC/cgemqrt.f b/SRC/cgemqrt.f index e036e71..e118f01 100644 --- a/SRC/cgemqrt.f +++ b/SRC/cgemqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, * C, LDC, WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEMQRT overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> generated using the compact WY representation as returned by CGEQRT. *> *> Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -152,10 +151,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/SRC/cgeql2.f b/SRC/cgeql2.f index 3830626..40c1bad 100644 --- a/SRC/cgeql2.f +++ b/SRC/cgeql2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQL2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQL2 computes a QL factorization of a complex m by n matrix A: *> A = Q * L. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqlf.f b/SRC/cgeqlf.f index a3db5bb..8c77e96 100644 --- a/SRC/cgeqlf.f +++ b/SRC/cgeqlf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQLF computes a QL factorization of a complex M-by-N matrix A: *> A = Q * L. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqp3.f b/SRC/cgeqp3.f index 7c1dc19..a41ed01 100644 --- a/SRC/cgeqp3.f +++ b/SRC/cgeqp3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK, * INFO ) @@ -30,19 +30,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQP3 computes a QR factorization with column pivoting of a *> matrix A: A*P = Q*R using Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,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 @@ -133,10 +131,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -150,13 +147,14 @@ *> where tau is a real/complex scalar, and v is a real/complex vector *> with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in *> A(i+1:m,i), and tau in TAU(i). +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK, $ INFO ) diff --git a/SRC/cgeqpf.f b/SRC/cgeqpf.f index 937afba..9bd9ca6 100644 --- a/SRC/cgeqpf.f +++ b/SRC/cgeqpf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine CGEQP3. *> *> CGEQPF computes a QR factorization with column pivoting of a *> complex M-by-N matrix A: A*P = Q*R. -*> -*>\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 @@ -120,10 +118,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -146,7 +143,6 @@ *> University of Zagreb, Croatia. *> -- April 2011 -- *> For more details see LAPACK Working Note 176. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqr2.f b/SRC/cgeqr2.f index 029bcf6..a255950 100644 --- a/SRC/cgeqr2.f +++ b/SRC/cgeqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQR2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQR2 computes a QR factorization of a complex m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqr2p.f b/SRC/cgeqr2p.f index 7d05968..94ceb24 100644 --- a/SRC/cgeqr2p.f +++ b/SRC/cgeqr2p.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQR2P( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQR2P computes a QR factorization of a complex m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqrf.f b/SRC/cgeqrf.f index cc76e06..eada7d4 100644 --- a/SRC/cgeqrf.f +++ b/SRC/cgeqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQRF computes a QR factorization of a complex M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqrfp.f b/SRC/cgeqrfp.f index d734cc4..a84c44a 100644 --- a/SRC/cgeqrfp.f +++ b/SRC/cgeqrfp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQRFP computes a QR factorization of a complex M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqrt.f b/SRC/cgeqrt.f index 2f87d6b..1aa6272 100644 --- a/SRC/cgeqrt.f +++ b/SRC/cgeqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQRT computes a blocked QR factorization of a complex M-by-N matrix A *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -100,10 +99,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 @@ -114,11 +112,11 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The matrix V stores the elementary reflectors H(i) in the i-th column *> below the diagonal. For example, if M=5 and N=3, the matrix V is *> @@ -138,7 +136,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = (T1 T2 ... TB). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqrt2.f b/SRC/cgeqrt2.f index 8ad882a..b2bf285 100644 --- a/SRC/cgeqrt2.f +++ b/SRC/cgeqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGEQRT2( M, N, A, LDA, T, LDT, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQRT2 computes a QR factorization of a complex M-by-N matrix A, *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,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 @@ -103,10 +101,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -125,7 +122,6 @@ *> H = I - V * T * V**H *> *> where V**H is the conjugate transpose of V. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgeqrt3.f b/SRC/cgeqrt3.f index 3b28ea1..d4b3383 100644 --- a/SRC/cgeqrt3.f +++ b/SRC/cgeqrt3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE CGEQRT3( M, N, A, LDA, T, LDT, INFO ) * @@ -27,22 +27,21 @@ * COMPLEX A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGEQRT3 recursively computes a QR factorization of a complex M-by-N matrix A, *> using the compact WY representation of Q. *> *> Based on the algorithm of Elmroth and Gustavson, *> IBM J. Res. Develop. Vol 44 No. 4 July 2000. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,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 @@ -106,10 +104,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -130,7 +127,6 @@ *> where V**H is the conjugate transpose of V. *> *> For details of the algorithm, see Elmroth and Gustavson (cited above). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgerfs.f b/SRC/cgerfs.f index f06fd21..acd6392 100644 --- a/SRC/cgerfs.f +++ b/SRC/cgerfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -32,20 +32,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGERFS improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates for *> the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -162,16 +161,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgerfsx.f b/SRC/cgerfsx.f index e43b36c..795a201 100644 --- a/SRC/cgerfsx.f +++ b/SRC/cgerfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGERFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -398,10 +395,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgerq2.f b/SRC/cgerq2.f index aae722c..9e85e9f 100644 --- a/SRC/cgerq2.f +++ b/SRC/cgerq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGERQ2 computes an RQ factorization of a complex m by n matrix A: *> A = R * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on *> exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgerqf.f b/SRC/cgerqf.f index 3cc0966..c790d69 100644 --- a/SRC/cgerqf.f +++ b/SRC/cgerqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGERQF computes an RQ factorization of a complex M-by-N matrix A: *> A = R * Q. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on *> exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgesc2.f b/SRC/cgesc2.f index 152ddef..6bdc105 100644 --- a/SRC/cgesc2.f +++ b/SRC/cgesc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), RHS( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGESC2 solves a system of linear equations *> @@ -42,11 +42,10 @@ *> with a general N-by-N matrix A using the LU factorization with *> complete pivoting computed by CGETC2. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,9 @@ *> On exit, SCALE contains the scale factor. SCALE is chosen *> 0 <= SCALE <= 1 to prevent owerflow in the solution. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -108,18 +106,12 @@ * *> \ingroup complexGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * diff --git a/SRC/cgesdd.f b/SRC/cgesdd.f index 994428f..d14bd1e 100644 --- a/SRC/cgesdd.f +++ b/SRC/cgesdd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, * WORK, LWORK, RWORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGESDD computes the singular value decomposition (SVD) of a complex *> M-by-N matrix A, optionally computing the left and/or right singular @@ -59,11 +59,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -200,10 +199,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: The updating process of SBDSDC did not converge. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -214,18 +212,12 @@ * *> \ingroup complexGEsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, $ WORK, LWORK, RWORK, IWORK, INFO ) diff --git a/SRC/cgesv.f b/SRC/cgesv.f index 1d0714e..5e04976 100644 --- a/SRC/cgesv.f +++ b/SRC/cgesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGESV computes the solution to a complex system of linear equations *> A * X = B, @@ -44,11 +44,10 @@ *> where P is a permutation matrix, L is unit lower triangular, and U is *> upper triangular. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -107,10 +106,9 @@ *> has been completed, but the factor U is exactly *> singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgesvd.f b/SRC/cgesvd.f index 9abb763..c1158d6 100644 --- a/SRC/cgesvd.f +++ b/SRC/cgesvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, * WORK, LWORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGESVD computes the singular value decomposition (SVD) of a complex *> M-by-N matrix A, optionally computing the left and/or right singular @@ -51,11 +51,10 @@ *> U and V are the left and right singular vectors of A. *> *> Note that the routine returns V**H, not V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -198,10 +197,9 @@ *> did not converge to zero. See the description of RWORK *> above for details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgesvx.f b/SRC/cgesvx.f index 17dc4ad..37c5e9e 100644 --- a/SRC/cgesvx.f +++ b/SRC/cgesvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -35,11 +35,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGESVX uses the LU factorization to compute the solution to a complex *> system of linear equations @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -87,11 +90,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -330,10 +332,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgesvxx.f b/SRC/cgesvxx.f index 543a52c..a349f37 100644 --- a/SRC/cgesvxx.f +++ b/SRC/cgesvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGESVXX uses the LU factorization to compute the solution to a *> complex system of linear equations A * X = B, where A is an @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what CGESVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -109,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -523,10 +523,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgetc2.f b/SRC/cgetc2.f index d9bf6a0..85230e4 100644 --- a/SRC/cgetc2.f +++ b/SRC/cgetc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETC2( N, A, LDA, IPIV, JPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGETC2 computes an LU factorization, using complete pivoting, of the *> n-by-n matrix A. The factorization has the form A = P * L * U * Q, @@ -40,11 +40,10 @@ *> unit diagonal elements and U is upper triangular. *> *> This is a level 1 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> one tries to solve for x in Ax = b. So U is perturbed *> to avoid the overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,18 +102,12 @@ * *> \ingroup complexGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CGETC2( N, A, LDA, IPIV, JPIV, INFO ) * diff --git a/SRC/cgetf2.f b/SRC/cgetf2.f index bd9f20a..8d5e12c 100644 --- a/SRC/cgetf2.f +++ b/SRC/cgetf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETF2( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGETF2 computes an LU factorization of a general m-by-n matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgetrf.f b/SRC/cgetrf.f index 95addd4..21f01a0 100644 --- a/SRC/cgetrf.f +++ b/SRC/cgetrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGETRF computes an LU factorization of a general M-by-N matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgetri.f b/SRC/cgetri.f index feb3a38..c316486 100644 --- a/SRC/cgetri.f +++ b/SRC/cgetri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -28,22 +28,21 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGETRI computes the inverse of a matrix using the LU factorization *> computed by CGETRF. *> *> This method inverts U and then computes inv(A) by solving the system *> inv(A)*L = inv(U) for inv(A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, U(i,i) is exactly zero; the matrix is *> singular and its inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgetrs.f b/SRC/cgetrs.f index 433c5bd..0e676b4 100644 --- a/SRC/cgetrs.f +++ b/SRC/cgetrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGETRS solves a system of linear equations *> A * X = B, A**T * X = B, or A**H * X = B *> with a general N-by-N matrix A using the LU factorization computed *> by CGETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/cggbak.f b/SRC/cggbak.f index f561c60..c129f1b 100644 --- a/SRC/cggbak.f +++ b/SRC/cggbak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V, * LDV, INFO ) @@ -30,21 +30,20 @@ * COMPLEX V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGBAK forms the right or left eigenvectors of a complex generalized *> eigenvalue problem A*x = lambda*B*x, by backward transformation on *> the computed eigenvectors of the balanced pair of matrices output by *> CGGBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -123,10 +122,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 @@ -137,15 +135,13 @@ * *> \ingroup complexGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. Ward, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cggbal.f b/SRC/cggbal.f index 41c4910..e843433 100644 --- a/SRC/cggbal.f +++ b/SRC/cggbal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE, * RSCALE, WORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGBAL balances a pair of general complex matrices (A,B). This *> involves, first, permuting A and B by similarity transformations to @@ -46,11 +46,10 @@ *> Balancing may reduce the 1-norm of the matrices, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors in the *> generalized eigenvalue problem A*x = lambda*B*x. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -152,10 +151,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 @@ -166,15 +164,13 @@ * *> \ingroup complexGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. WARD, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgges.f b/SRC/cgges.f index 723c61f..27fd606 100644 --- a/SRC/cgges.f +++ b/SRC/cgges.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB, * SDIM, ALPHA, BETA, VSL, LDVSL, VSR, LDVSR, WORK, @@ -38,11 +38,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGES computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B), the generalized eigenvalues, the generalized complex Schur @@ -70,11 +70,10 @@ *> A pair of matrices (S,T) is in generalized complex Schur form if S *> and T are upper triangular and, in addition, the diagonal elements *> of T are non-negative real numbers. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -253,10 +252,9 @@ *> be caused due to scaling. *> =N+3: reordering falied in CTGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cggesx.f b/SRC/cggesx.f index d2073a1..b5fa8e3 100644 --- a/SRC/cggesx.f +++ b/SRC/cggesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA, * B, LDB, SDIM, ALPHA, BETA, VSL, LDVSL, VSR, @@ -41,11 +41,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGESX computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B), the generalized eigenvalues, the complex Schur form (S,T), @@ -74,11 +74,10 @@ *> A pair of matrices (S,T) is in generalized complex Schur form if T is *> upper triangular with non-negative diagonal and S is upper *> triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -312,10 +311,9 @@ *> be caused due to scaling. *> =N+3: reordering failed in CTGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cggev.f b/SRC/cggev.f index 69cb6fc..1d6619f 100644 --- a/SRC/cggev.f +++ b/SRC/cggev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA, * VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGEV computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B), the generalized eigenvalues, and optionally, the left and/or @@ -59,11 +59,10 @@ *> u(j)**H * A = lambda(j) * u(j)**H * B *> *> where u(j)**H is the conjugate-transpose of u(j). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -201,10 +200,9 @@ *> > N: =N+1: other then QZ iteration failed in SHGEQZ, *> =N+2: error return from STGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cggevx.f b/SRC/cggevx.f index 011ff1f..85bc855 100644 --- a/SRC/cggevx.f +++ b/SRC/cggevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB, * ALPHA, BETA, VL, LDVL, VR, LDVR, ILO, IHI, @@ -38,11 +38,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGEVX computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B) the generalized eigenvalues, and optionally, the left and/or @@ -68,11 +68,10 @@ *> u(j)**H * A = lambda(j) * u(j)**H * B. *> where u(j)**H is the conjugate-transpose of u(j). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -327,10 +326,9 @@ *> > N: =N+1: other than QZ iteration failed in CHGEQZ. *> =N+2: error return from CTGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -341,10 +339,9 @@ * *> \ingroup complexGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing a matrix pair (A,B) includes, first, permuting rows and @@ -369,7 +366,6 @@ *> *> For further explanation of the reciprocal condition numbers RCONDE *> and RCONDV, see section 4.11 of LAPACK User's Guide. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cggglm.f b/SRC/cggglm.f index 16d74fc..09175da 100644 --- a/SRC/cggglm.f +++ b/SRC/cggglm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGGLM solves a general Gauss-Markov linear model (GLM) problem: *> @@ -61,11 +61,10 @@ *> x *> *> where inv(B) denotes the inverse of B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -169,10 +168,9 @@ *> rank( A B ) < N; the least squares solution could not *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgghrd.f b/SRC/cgghrd.f index 46c6b28..cb98fef 100644 --- a/SRC/cgghrd.f +++ b/SRC/cgghrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q, * LDQ, Z, LDZ, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGHRD reduces a pair of complex matrices (A,B) to generalized upper *> Hessenberg form using unitary transformations, where A is a @@ -61,11 +61,10 @@ *> If Q1 is the unitary matrix from the QR factorization of B in the *> original equation A*x = lambda*B*x, then CGGHRD reduces the original *> problem to generalized Hessenberg form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -178,10 +177,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 @@ -192,16 +190,14 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine reduces A to Hessenberg and B to triangular form by *> an unblocked reduction, as described in _Matrix_Computations_, *> by Golub and van Loan (Johns Hopkins Press). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cgglse.f b/SRC/cgglse.f index 4a62fd4..cfef336 100644 --- a/SRC/cgglse.f +++ b/SRC/cgglse.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGLSE solves the linear equality-constrained least squares (LSE) *> problem: @@ -52,11 +52,10 @@ *> matrices (B, A) given by *> *> B = (0 R)*Q, A = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,9 @@ *> ( (B) ) *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cggqrf.f b/SRC/cggqrf.f index 34b7f77..59b9ce9 100644 --- a/SRC/cggqrf.f +++ b/SRC/cggqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGQRF computes a generalized QR factorization of an N-by-M matrix A *> and an N-by-P matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z' denotes the *> conjugate transpose of matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -165,10 +164,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 @@ -179,10 +177,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -212,7 +209,6 @@ *> B(n-k+i,1:p-k+i-1), and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine CUNGRQ. *> To use Z to update another matrix, use LAPACK subroutine CUNMRQ. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cggrqf.f b/SRC/cggrqf.f index a930930..6b8eabb 100644 --- a/SRC/cggrqf.f +++ b/SRC/cggrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGRQF computes a generalized RQ factorization of an M-by-N matrix A *> and a P-by-N matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**H denotes the *> conjugate transpose of the matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,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 @@ -178,10 +176,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -211,7 +208,6 @@ *> and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine CUNGQR. *> To use Z to update another matrix, use LAPACK subroutine CUNMQR. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cggsvd.f b/SRC/cggsvd.f index 2280d3f..962fa05 100644 --- a/SRC/cggsvd.f +++ b/SRC/cggsvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, * LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, @@ -33,11 +33,11 @@ * $ U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGSVD computes the generalized singular value decomposition (GSVD) *> of an M-by-N complex matrix A and P-by-N complex matrix B: @@ -117,11 +117,10 @@ *> *> X = Q*( I 0 ) *> ( 0 inv(R) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -298,10 +297,12 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, the Jacobi-type procedure failed to *> converge. For further details, see subroutine CTGSJA. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLA REAL *> TOLB REAL *> TOLA and TOLB are the thresholds to determine the effective @@ -311,10 +312,9 @@ *> The size of TOLA and TOLB may affect the size of backward *> errors of the decomposition. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -325,18 +325,12 @@ * *> \ingroup complexOTHERsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> 2-96 Based on modifications by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, $ LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, diff --git a/SRC/cggsvp.f b/SRC/cggsvp.f index dd98adc..3ab5fa8 100644 --- a/SRC/cggsvp.f +++ b/SRC/cggsvp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, * TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, @@ -34,11 +34,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGGSVP computes unitary matrices U, V and Q such that *> @@ -63,11 +63,10 @@ *> This decomposition is the preprocessing step for computing the *> Generalized Singular Value Decomposition (GSVD), see subroutine *> CGGSVD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -236,10 +235,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 @@ -250,18 +248,13 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> *> The subroutine uses LAPACK subroutine CGEQPF for the QR factorization *> with column pivoting to detect the effective numerical rank of the *> a matrix. It may be replaced by a better rank determination strategy. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, $ TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, diff --git a/SRC/cgtcon.f b/SRC/cgtcon.f index e07b048..6319b37 100644 --- a/SRC/cgtcon.f +++ b/SRC/cgtcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND, * WORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX D( * ), DL( * ), DU( * ), DU2( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTCON estimates the reciprocal of the condition number of a complex *> tridiagonal matrix A using the LU factorization as computed by @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \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/SRC/cgtrfs.f b/SRC/cgtrfs.f index de8ed77..8addb1d 100644 --- a/SRC/cgtrfs.f +++ b/SRC/cgtrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, @@ -34,20 +34,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is tridiagonal, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -185,16 +184,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgtsv.f b/SRC/cgtsv.f index 2556dff..0454074 100644 --- a/SRC/cgtsv.f +++ b/SRC/cgtsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTSV( N, NRHS, DL, D, DU, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX B( LDB, * ), D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTSV solves the equation *> @@ -42,11 +42,10 @@ *> *> Note that the equation A**T *X = B may be solved by interchanging the *> order of the arguments DU and DL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> has not been computed. The factorization has not been *> completed unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgtsvx.f b/SRC/cgtsvx.f index 27667e1..a3b2c77 100644 --- a/SRC/cgtsvx.f +++ b/SRC/cgtsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, * DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -35,11 +35,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTSVX uses the LU factorization to compute the solution to a complex *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B, @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -72,11 +75,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -274,10 +276,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgttrf.f b/SRC/cgttrf.f index 17d4017..c3efc94 100644 --- a/SRC/cgttrf.f +++ b/SRC/cgttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTTRF( N, DL, D, DU, DU2, IPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTTRF computes an LU factorization of a complex tridiagonal matrix A *> using elimination with partial pivoting and row interchanges. @@ -42,11 +42,10 @@ *> where L is a product of permutation and unit lower bidiagonal *> matrices and U is upper triangular with nonzeros in only the main *> diagonal and first two superdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cgttrs.f b/SRC/cgttrs.f index 2c015b0..270a636 100644 --- a/SRC/cgttrs.f +++ b/SRC/cgttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * COMPLEX B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTTRS solves one of the systems of equations *> A * X = B, A**T * X = B, or A**H * X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by CGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -122,10 +121,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/SRC/cgtts2.f b/SRC/cgtts2.f index 1a68ef7..0c09aab 100644 --- a/SRC/cgtts2.f +++ b/SRC/cgtts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB ) * @@ -28,21 +28,20 @@ * COMPLEX B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CGTTS2 solves one of the systems of equations *> A * X = B, A**T * X = B, or A**H * X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by CGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITRANS *> \verbatim @@ -113,10 +112,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chbev.f b/SRC/chbev.f index 49c0a34..7b33521 100644 --- a/SRC/chbev.f +++ b/SRC/chbev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * RWORK, INFO ) @@ -30,19 +30,18 @@ * COMPLEX AB( LDAB, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBEV computes all the eigenvalues and, optionally, eigenvectors of *> a complex Hermitian band matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -136,10 +135,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chbevd.f b/SRC/chbevd.f index 42b1a56..3e4dc39 100644 --- a/SRC/chbevd.f +++ b/SRC/chbevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AB( LDAB, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBEVD computes all the eigenvalues and, optionally, eigenvectors of *> a complex Hermitian band matrix A. If eigenvectors are desired, it @@ -47,11 +47,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -199,10 +198,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chbevx.f b/SRC/chbevx.f index 74cc1b4..074ef01 100644 --- a/SRC/chbevx.f +++ b/SRC/chbevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL, * VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK, @@ -34,21 +34,20 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBEVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian band matrix A. Eigenvalues and eigenvectors *> can be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -243,10 +242,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chbgst.f b/SRC/chbgst.f index 7ca2662..ba6ce59 100644 --- a/SRC/chbgst.f +++ b/SRC/chbgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X, * LDX, WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBGST reduces a complex Hermitian-definite banded generalized *> eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, @@ -45,11 +45,10 @@ *> split Cholesky factorization. A is overwritten by C = X**H*A*X, where *> X = S**(-1)*Q and Q is a unitary matrix chosen to preserve the *> bandwidth of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -149,10 +148,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/SRC/chbgv.f b/SRC/chbgv.f index fcb39ee..83462b3 100644 --- a/SRC/chbgv.f +++ b/SRC/chbgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z, * LDZ, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBGV computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite banded eigenproblem, of *> the form A*x=(lambda)*B*x. Here A and B are assumed to be Hermitian *> and banded, and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -167,10 +166,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chbgvd.f b/SRC/chbgvd.f index 68eed18..241b68d 100644 --- a/SRC/chbgvd.f +++ b/SRC/chbgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, * Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK, @@ -34,11 +34,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite banded eigenproblem, of @@ -52,11 +52,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -230,10 +229,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -244,17 +242,11 @@ * *> \ingroup complexOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, $ Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK, diff --git a/SRC/chbgvx.f b/SRC/chbgvx.f index 451ffc3..5942afd 100644 --- a/SRC/chbgvx.f +++ b/SRC/chbgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, * LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, @@ -35,11 +35,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBGVX computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite banded eigenproblem, of @@ -47,11 +47,10 @@ *> and banded, and B is also positive definite. Eigenvalues and *> eigenvectors can be selected by specifying either all eigenvalues, *> a range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -269,10 +268,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -283,17 +281,11 @@ * *> \ingroup complexOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, $ LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, diff --git a/SRC/chbtrd.f b/SRC/chbtrd.f index 1e2ec2d..a6f3126 100644 --- a/SRC/chbtrd.f +++ b/SRC/chbtrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ, * WORK, INFO ) @@ -30,20 +30,19 @@ * COMPLEX AB( LDAB, * ), Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHBTRD reduces a complex Hermitian band matrix A to real symmetric *> tridiagonal form T by a unitary similarity transformation: *> Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -139,10 +138,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 @@ -153,14 +151,12 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by Linda Kaufman, Bell Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/checon.f b/SRC/checon.f index 3612061..f0b6013 100644 --- a/SRC/checon.f +++ b/SRC/checon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHECON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHECON estimates the reciprocal of the condition number of a complex *> Hermitian matrix A using the factorization A = U*D*U**H or @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,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/SRC/cheequb.f b/SRC/cheequb.f index 9381436..fc27ff4 100644 --- a/SRC/cheequb.f +++ b/SRC/cheequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * @@ -30,11 +30,11 @@ * REAL S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYEQUB computes row and column scalings intended to equilibrate a *> symmetric matrix A and reduce its condition number @@ -44,11 +44,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cheev.f b/SRC/cheev.f index fc702c1..df93600 100644 --- a/SRC/cheev.f +++ b/SRC/cheev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, * INFO ) @@ -30,19 +30,18 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEEV computes all eigenvalues and, optionally, eigenvectors of a *> complex Hermitian matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -124,10 +123,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cheevd.f b/SRC/cheevd.f index 817ed7b..0156e9b 100644 --- a/SRC/cheevd.f +++ b/SRC/cheevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, * LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEEVD computes all eigenvalues and, optionally, eigenvectors of a *> complex Hermitian matrix A. If eigenvectors are desired, it uses a @@ -47,11 +47,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -178,10 +177,9 @@ *> lying in rows and columns INFO/(N+1) through *> mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -192,18 +190,16 @@ * *> \ingroup complexHEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA +*> \par Further Details: +* ===================== *> *> Modified description of INFO. Sven, 16 Feb 05. -*> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA *> * ===================================================================== SUBROUTINE CHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, diff --git a/SRC/cheevr.f b/SRC/cheevr.f index 64b2513..b78403f 100644 --- a/SRC/cheevr.f +++ b/SRC/cheevr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, @@ -34,11 +34,11 @@ * COMPLEX A( LDA, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEEVR computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian matrix A. Eigenvalues and eigenvectors can @@ -97,11 +97,10 @@ *> hence may abort due to a floating point exception in environments *> which do not handle NaNs and infinities in the ieee standard default *> manner. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -321,10 +320,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: Internal error *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -335,21 +333,15 @@ * *> \ingroup complexHEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n *> Ken Stanley, Computer Science Division, University of -*> California at Berkeley, USA +*> California at Berkeley, USA \n *> Jason Riedy, Computer Science Division, University of -*> California at Berkeley, USA -*> -*> \endverbatim +*> California at Berkeley, USA \n *> * ===================================================================== SUBROUTINE CHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, diff --git a/SRC/cheevx.f b/SRC/cheevx.f index f2d41f6..9c404e6 100644 --- a/SRC/cheevx.f +++ b/SRC/cheevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, LWORK, RWORK, @@ -33,21 +33,20 @@ * COMPLEX A( LDA, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEEVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian matrix A. Eigenvalues and eigenvectors can *> be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -235,10 +234,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chegs2.f b/SRC/chegs2.f index dd09df1..c7ad1f6 100644 --- a/SRC/chegs2.f +++ b/SRC/chegs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEGS2 reduces a complex Hermitian-definite generalized *> eigenproblem to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H *A*L. *> *> B must have been previously factorized as U**H *U or L*L**H by ZPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/chegst.f b/SRC/chegst.f index 400252f..be0f608 100644 --- a/SRC/chegst.f +++ b/SRC/chegst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEGST reduces a complex Hermitian-definite generalized *> eigenproblem to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. *> *> B must have been previously factorized as U**H*U or L*L**H by CPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/chegv.f b/SRC/chegv.f index 4c5dbeb..723a651 100644 --- a/SRC/chegv.f +++ b/SRC/chegv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, RWORK, INFO ) @@ -30,22 +30,21 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEGV computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be Hermitian and B is also *> positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -165,10 +164,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chegvd.f b/SRC/chegvd.f index 88e9de1..ff2c86b 100644 --- a/SRC/chegvd.f +++ b/SRC/chegvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -49,11 +49,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -217,10 +216,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -231,20 +229,21 @@ * *> \ingroup complexHEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> Based on contributions by -*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA +*> \verbatim *> *> Modified so that no backsubstitution is performed if CHEEVD fails to *> converge (NEIG in old code could be greater than N causing out of *> bounds reference to A - reported by Ralf Meyer). Also corrected the *> description of INFO and the test on ITYPE. Sven, 16 Feb 05. *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA *> * ===================================================================== SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, diff --git a/SRC/chegvx.f b/SRC/chegvx.f index ca395bc..aaaaf80 100644 --- a/SRC/chegvx.f +++ b/SRC/chegvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, * VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, @@ -34,11 +34,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHEGVX computes selected eigenvalues, and optionally, eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -46,11 +46,10 @@ *> B are assumed to be Hermitian and B is also positive definite. *> Eigenvalues and eigenvectors can be selected by specifying either a *> range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -276,10 +275,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -290,17 +288,11 @@ * *> \ingroup complexHEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, $ VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, diff --git a/SRC/cherfs.f b/SRC/cherfs.f index 38afe80..a4c5828 100644 --- a/SRC/cherfs.f +++ b/SRC/cherfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHERFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -32,20 +32,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHERFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian indefinite, and *> provides error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -168,16 +167,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cherfsx.f b/SRC/cherfsx.f index 33a5853..32c1112 100644 --- a/SRC/cherfsx.f +++ b/SRC/cherfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHERFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -37,13 +37,11 @@ * $ ERR_BNDS_NORM( NRHS, * ), * $ ERR_BNDS_COMP( NRHS, * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHERFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian indefinite, and @@ -56,11 +54,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -385,10 +382,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chesv.f b/SRC/chesv.f index ffc0a76..35414e6 100644 --- a/SRC/chesv.f +++ b/SRC/chesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHESV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, * LWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHESV computes the solution to a complex system of linear equations *> A * X = B, @@ -48,11 +48,10 @@ *> triangular matrices, and D is Hermitian and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then *> used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chesvx.f b/SRC/chesvx.f index cf38ff8..bbbf81d 100644 --- a/SRC/chesvx.f +++ b/SRC/chesvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHESVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHESVX uses the diagonal pivoting factorization to compute the *> solution to a complex system of linear equations A * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -74,11 +77,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -265,10 +267,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chesvxx.f b/SRC/chesvxx.f index 9c6ac83..b0e83dd 100644 --- a/SRC/chesvxx.f +++ b/SRC/chesvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHESVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,11 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHESVXX uses the diagonal pivoting factorization to compute the *> solution to a complex system of linear equations A * X = B, where @@ -63,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what CHESVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -106,11 +109,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(R) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -488,10 +490,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cheswapr.f b/SRC/cheswapr.f index bb4a17f..efebddc 100644 --- a/SRC/cheswapr.f +++ b/SRC/cheswapr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHESWAPR( UPLO, N, A, LDA, I1, I2) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * COMPLEX A( LDA, N ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHESWAPR applies an elementary permutation on the rows and the columns of *> a hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,9 @@ *> I2 is INTEGER *> Index of the second row to swap *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chetd2.f b/SRC/chetd2.f index ccb7867..f3af224 100644 --- a/SRC/chetd2.f +++ b/SRC/chetd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETD2( UPLO, N, A, LDA, D, E, TAU, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETD2 reduces a complex Hermitian matrix A to real symmetric *> tridiagonal form T by a unitary similarity transformation: *> Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,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 @@ -128,10 +126,9 @@ * *> \ingroup complexHEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -173,7 +170,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chetf2.f b/SRC/chetf2.f index 76d6251..d0d4392 100644 --- a/SRC/chetf2.f +++ b/SRC/chetf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETF2( UPLO, N, A, LDA, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETF2 computes the factorization of a complex Hermitian matrix A *> using the Bunch-Kaufman diagonal pivoting method: @@ -45,11 +45,10 @@ *> Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -124,10 +122,9 @@ * *> \ingroup complexHEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 09-29-06 - patch from @@ -175,7 +172,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chetrd.f b/SRC/chetrd.f index 0c1927f..2734b9d 100644 --- a/SRC/chetrd.f +++ b/SRC/chetrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRD reduces a complex Hermitian matrix A to real symmetric *> tridiagonal form T by a unitary similarity transformation: *> Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,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 @@ -145,10 +143,9 @@ * *> \ingroup complexHEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -190,7 +187,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chetrf.f b/SRC/chetrf.f index 7f14b7d..5732d49 100644 --- a/SRC/chetrf.f +++ b/SRC/chetrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRF computes the factorization of a complex Hermitian matrix A *> using the Bunch-Kaufman diagonal pivoting method. The form of the @@ -46,11 +46,10 @@ *> 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -122,10 +121,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup complexHEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', then A = U*D*U**H, where @@ -175,7 +172,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chetri.f b/SRC/chetri.f index 4c916ce..4b9981b 100644 --- a/SRC/chetri.f +++ b/SRC/chetri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRI( UPLO, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRI computes the inverse of a complex Hermitian indefinite matrix *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by *> CHETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chetri2.f b/SRC/chetri2.f index 02fd41c..ad1ce7e 100644 --- a/SRC/chetri2.f +++ b/SRC/chetri2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRI2 computes the inverse of a COMPLEX hermitian indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> CHETRF. CHETRI2 set the LEADING DIMENSION of the workspace *> before calling CHETRI2X that actually computes the inverse. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chetri2x.f b/SRC/chetri2x.f index a065a6b..58e8ea3 100644 --- a/SRC/chetri2x.f +++ b/SRC/chetri2x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), WORK( N+NB+1,* ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRI2X computes the inverse of a complex Hermitian indefinite matrix *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by *> CHETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chetrs.f b/SRC/chetrs.f index 75d6ed9..0752cdc 100644 --- a/SRC/chetrs.f +++ b/SRC/chetrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRS solves a system of linear equations A*X = B with a complex *> Hermitian matrix A using the factorization A = U*D*U**H or *> A = L*D*L**H computed by CHETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/chetrs2.f b/SRC/chetrs2.f index 1decf24..c8ab77e 100644 --- a/SRC/chetrs2.f +++ b/SRC/chetrs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHETRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, * WORK, INFO ) @@ -30,20 +30,19 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHETRS2 solves a system of linear equations A*X = B with a complex *> Hermitian matrix A using the factorization A = U*D*U**H or *> A = L*D*L**H computed by CHETRF and converted by CSYCONV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/SRC/chfrk.f b/SRC/chfrk.f index a289f82..4554162 100644 --- a/SRC/chfrk.f +++ b/SRC/chfrk.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, * C ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for C in RFP Format. *> @@ -49,11 +49,10 @@ *> where alpha and beta are real scalars, C is an n--by--n Hermitian *> matrix and A is an n--by--k matrix in the first case and a k--by--n *> matrix in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -152,10 +151,9 @@ *> parts of the diagonal elements need not be set, they are *> assumed to be zero, and on exit they are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chgeqz.f b/SRC/chgeqz.f index 52cf95d..95a8c3c 100644 --- a/SRC/chgeqz.f +++ b/SRC/chgeqz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT, * ALPHA, BETA, Q, LDQ, Z, LDZ, WORK, LWORK, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHGEQZ computes the eigenvalues of a complex matrix pair (H,T), *> where H is an upper Hessenberg matrix and T is upper triangular, @@ -81,11 +81,10 @@ *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix *> Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973), *> pp. 241--256. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -258,10 +257,9 @@ *> in Schur form, but ALPHA(i) and BETA(i), *> i=INFO-N+1,...,N should be correct. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -272,15 +270,13 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We assume that complex ABS works as long as its value is less than *> overflow. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chla_transtype.f b/SRC/chla_transtype.f index b707368..1f75a65 100644 --- a/SRC/chla_transtype.f +++ b/SRC/chla_transtype.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * CHARACTER*1 FUNCTION CHLA_TRANSTYPE( TRANS ) * @@ -24,11 +24,11 @@ * INTEGER TRANS * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine translates from a BLAST-specified integer constant to *> the character string specifying a transposition operation. @@ -37,15 +37,14 @@ *> then input is not an integer indicating a transposition operator. *> Otherwise CHLA_TRANSTYPE returns the constant value corresponding to *> TRANS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chpcon.f b/SRC/chpcon.f index be5072b..a9a2e2d 100644 --- a/SRC/chpcon.f +++ b/SRC/chpcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPCON estimates the reciprocal of the condition number of a complex *> Hermitian packed matrix A using the factorization A = U*D*U**H or @@ -42,11 +42,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/chpev.f b/SRC/chpev.f index 16d7240..b49aa5f 100644 --- a/SRC/chpev.f +++ b/SRC/chpev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, RWORK, * INFO ) @@ -30,19 +30,18 @@ * COMPLEX AP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPEV computes all the eigenvalues and, optionally, eigenvectors of a *> complex Hermitian matrix in packed storage. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -122,10 +121,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chpevd.f b/SRC/chpevd.f index e5b446f..4716140 100644 --- a/SRC/chpevd.f +++ b/SRC/chpevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK, * RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPEVD computes all the eigenvalues and, optionally, eigenvectors of *> a complex Hermitian matrix A in packed storage. If eigenvectors are @@ -47,11 +47,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -184,10 +183,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chpevx.f b/SRC/chpevx.f index 4634b34..fd05a13 100644 --- a/SRC/chpevx.f +++ b/SRC/chpevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, RWORK, IWORK, @@ -33,21 +33,20 @@ * COMPLEX AP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPEVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian matrix A in packed storage. *> Eigenvalues/vectors can be selected by specifying either a range of *> values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -216,10 +215,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chpgst.f b/SRC/chpgst.f index 1368e71..1ff1480 100644 --- a/SRC/chpgst.f +++ b/SRC/chpgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPGST( ITYPE, UPLO, N, AP, BP, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AP( * ), BP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPGST reduces a complex Hermitian-definite generalized *> eigenproblem to standard form, using packed storage. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. *> *> B must have been previously factorized as U**H*U or L*L**H by CPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \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/SRC/chpgv.f b/SRC/chpgv.f index faa9b78..642c689 100644 --- a/SRC/chpgv.f +++ b/SRC/chpgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * RWORK, INFO ) @@ -30,22 +30,21 @@ * COMPLEX AP( * ), BP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPGV computes all the eigenvalues and, optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be Hermitian, stored in packed format, *> and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -149,10 +148,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chpgvd.f b/SRC/chpgvd.f index b873f5a..73f1eb6 100644 --- a/SRC/chpgvd.f +++ b/SRC/chpgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AP( * ), BP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPGVD computes all the eigenvalues and, optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -50,11 +50,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -210,10 +209,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -224,17 +222,11 @@ * *> \ingroup complexOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, $ LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/chpgvx.f b/SRC/chpgvx.f index a1d0b90..7abed68 100644 --- a/SRC/chpgvx.f +++ b/SRC/chpgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, * IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK, @@ -33,11 +33,11 @@ * COMPLEX AP( * ), BP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPGVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -46,11 +46,10 @@ *> positive definite. Eigenvalues and eigenvectors can be selected by *> specifying either a range of values or a range of indices for the *> desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -246,10 +245,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -260,17 +258,11 @@ * *> \ingroup complexOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, $ IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK, diff --git a/SRC/chprfs.f b/SRC/chprfs.f index 863f6ae..08ce496 100644 --- a/SRC/chprfs.f +++ b/SRC/chprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -32,21 +32,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian indefinite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,16 +155,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chpsv.f b/SRC/chpsv.f index 6f3ff6d..181f283 100644 --- a/SRC/chpsv.f +++ b/SRC/chpsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPSV computes the solution to a complex system of linear equations *> A * X = B, @@ -47,11 +47,10 @@ *> triangular matrices, D is Hermitian and block diagonal with 1-by-1 *> and 2-by-2 diagonal blocks. The factored form of A is then used to *> solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, so the solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -160,7 +157,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chpsvx.f b/SRC/chpsvx.f index 3fe0aea..3b8d857 100644 --- a/SRC/chpsvx.f +++ b/SRC/chpsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, * LDX, RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPSVX uses the diagonal pivoting factorization A = U*D*U**H or *> A = L*D*L**H to compute the solution to a complex system of linear @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -72,11 +75,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -238,10 +240,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -252,10 +253,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -271,7 +271,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chptrd.f b/SRC/chptrd.f index 32c57a2..e3b299e 100644 --- a/SRC/chptrd.f +++ b/SRC/chptrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPTRD( UPLO, N, AP, D, E, TAU, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPTRD reduces a complex Hermitian matrix A stored in packed form to *> real symmetric tridiagonal form T by a unitary similarity *> transformation: Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -104,10 +103,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 @@ -118,10 +116,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -149,7 +146,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP, *> overwriting A(i+2:n,i), and tau is stored in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chptrf.f b/SRC/chptrf.f index e78d98e..d912a77 100644 --- a/SRC/chptrf.f +++ b/SRC/chptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPTRF( UPLO, N, AP, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPTRF computes the factorization of a complex Hermitian packed *> matrix A using the Bunch-Kaufman diagonal pivoting method: @@ -43,11 +43,10 @@ *> where U (or L) is a product of permutation and unit upper (lower) *> triangular matrices, and D is Hermitian and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,14 +111,10 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 5-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**H, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -155,8 +149,12 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> J. Lewis, Boeing Computer Services Company *> * ===================================================================== SUBROUTINE CHPTRF( UPLO, N, AP, IPIV, INFO ) diff --git a/SRC/chptri.f b/SRC/chptri.f index 69dbc56..680d6e2 100644 --- a/SRC/chptri.f +++ b/SRC/chptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPTRI( UPLO, N, AP, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPTRI computes the inverse of a complex Hermitian indefinite matrix *> A in packed storage using the factorization A = U*D*U**H or *> A = L*D*L**H computed by CHPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/chptrs.f b/SRC/chptrs.f index 79405af..d2fa3f3 100644 --- a/SRC/chptrs.f +++ b/SRC/chptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHPTRS solves a system of linear equations A*X = B with a complex *> Hermitian matrix A stored in packed format using the factorization *> A = U*D*U**H or A = L*D*L**H computed by CHPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,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/SRC/chsein.f b/SRC/chsein.f index b46e7cb..c6de12a 100644 --- a/SRC/chsein.f +++ b/SRC/chsein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, W, VL, * LDVL, VR, LDVR, MM, M, WORK, RWORK, IFAILL, @@ -34,11 +34,11 @@ * $ W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHSEIN uses inverse iteration to find specified right and/or left *> eigenvectors of a complex upper Hessenberg matrix H. @@ -49,11 +49,10 @@ *> H * x = w * x, y**h * H = w * y**h *> *> where y**h denotes the conjugate transpose of the vector y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -217,10 +216,9 @@ *> failed to converge; see IFAILL and IFAILR for further *> details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -231,16 +229,14 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x|+|y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/chseqr.f b/SRC/chseqr.f index b1e2423..8acbb52 100644 --- a/SRC/chseqr.f +++ b/SRC/chseqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ, * WORK, LWORK, INFO ) @@ -28,13 +28,12 @@ * .. Array Arguments .. * COMPLEX H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. -* Purpose -* ======= +* * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CHSEQR computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -45,11 +44,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -209,10 +207,9 @@ *> If INFO .GT. 0 and COMPZ = 'N', then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -223,6 +220,81 @@ * *> \ingroup complexOTHERcomputational * +*> \par Contributors: +* ================== +*> +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim +*> +*> Default values supplied by +*> ILAENV(ISPEC,'CHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). +*> It is suggested that these defaults be adjusted in order +*> to attain best performance in each particular +*> computational environment. +*> +*> ISPEC=12: The CLAHQR vs CLAQR0 crossover point. +*> Default: 75. (Must be at least 11.) +*> +*> ISPEC=13: Recommended deflation window size. +*> This depends on ILO, IHI and NS. NS is the +*> number of simultaneous shifts returned +*> by ILAENV(ISPEC=15). (See ISPEC=15 below.) +*> The default for (IHI-ILO+1).LE.500 is NS. +*> The default for (IHI-ILO+1).GT.500 is 3*NS/2. +*> +*> ISPEC=14: Nibble crossover point. (See IPARMQ for +*> details.) Default: 14% of deflation window +*> size. +*> +*> ISPEC=15: Number of simultaneous shifts in a multishift +*> QR iteration. +*> +*> If IHI-ILO+1 is ... +*> +*> greater than ...but less ... the +*> or equal to ... than default is +*> +*> 1 30 NS = 2(+) +*> 30 60 NS = 4(+) +*> 60 150 NS = 10(+) +*> 150 590 NS = ** +*> 590 3000 NS = 64 +*> 3000 6000 NS = 128 +*> 6000 infinity NS = 256 +*> +*> (+) By default some or all matrices of this order +*> are passed to the implicit double shift routine +*> CLAHQR and this parameter is ignored. See +*> ISPEC=12 above and comments in IPARMQ for +*> details. +*> +*> (**) The asterisks (**) indicate an ad-hoc +*> function of N increasing from 10 to 64. +*> +*> ISPEC=16: Select structured matrix multiply. +*> If the number of simultaneous shifts (specified +*> by ISPEC=15) is less than 14, then the default +*> for ISPEC=16 is 0. Otherwise the default for +*> ISPEC=16 is 2. +*> \endverbatim +* +*> \par References: +* ================ +*> +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. +*> \n +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part II: Aggressive Early Deflation, SIAM Journal +*> of Matrix Analysis, volume 23, pages 948--973, 2002. +* * ===================================================================== SUBROUTINE CHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ, $ WORK, LWORK, INFO ) @@ -239,75 +311,9 @@ * .. Array Arguments .. COMPLEX H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. -* ================================================================ -* Default values supplied by -* ILAENV(ISPEC,'CHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). -* It is suggested that these defaults be adjusted in order -* to attain best performance in each particular -* computational environment. -* -* ISPEC=12: The CLAHQR vs CLAQR0 crossover point. -* Default: 75. (Must be at least 11.) -* -* ISPEC=13: Recommended deflation window size. -* This depends on ILO, IHI and NS. NS is the -* number of simultaneous shifts returned -* by ILAENV(ISPEC=15). (See ISPEC=15 below.) -* The default for (IHI-ILO+1).LE.500 is NS. -* The default for (IHI-ILO+1).GT.500 is 3*NS/2. -* -* ISPEC=14: Nibble crossover point. (See IPARMQ for -* details.) Default: 14% of deflation window -* size. -* -* ISPEC=15: Number of simultaneous shifts in a multishift -* QR iteration. -* -* If IHI-ILO+1 is ... -* -* greater than ...but less ... the -* or equal to ... than default is -* -* 1 30 NS = 2(+) -* 30 60 NS = 4(+) -* 60 150 NS = 10(+) -* 150 590 NS = ** -* 590 3000 NS = 64 -* 3000 6000 NS = 128 -* 6000 infinity NS = 256 -* -* (+) By default some or all matrices of this order -* are passed to the implicit double shift routine -* CLAHQR and this parameter is ignored. See -* ISPEC=12 above and comments in IPARMQ for -* details. -* -* (**) The asterisks (**) indicate an ad-hoc -* function of N increasing from 10 to 64. -* -* ISPEC=16: Select structured matrix multiply. -* If the number of simultaneous shifts (specified -* by ISPEC=15) is less than 14, then the default -* for ISPEC=16 is 0. Otherwise the default for -* ISPEC=16 is 2. -* -* ================================================================ -* Based on contributions by -* Karen Braman and Ralph Byers, Department of Mathematics, -* University of Kansas, USA -* -* ================================================================ -* References: -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 -* Performance, SIAM Journal of Matrix Analysis, volume 23, pages -* 929--947, 2002. -* -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part II: Aggressive Early Deflation, SIAM Journal -* of Matrix Analysis, volume 23, pages 948--973, 2002. -* -* ================================================================ +* +* ===================================================================== +* * .. Parameters .. * * ==== Matrices of order NTINY or smaller must be processed by diff --git a/SRC/cla_gbamv.f b/SRC/cla_gbamv.f index 3a22bca..2e452d9 100644 --- a/SRC/cla_gbamv.f +++ b/SRC/cla_gbamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X, * INCX, BETA, Y, INCY ) @@ -30,11 +30,11 @@ * REAL Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_GBAMV performs one of the matrix-vector operations *> @@ -52,11 +52,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -170,10 +169,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gbrcond_c.f b/SRC/cla_gbrcond_c.f index 3453dc1..41a93c3 100644 --- a/SRC/cla_gbrcond_c.f +++ b/SRC/cla_gbrcond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_GBRCOND_C( TRANS, N, KL, KU, AB, LDAB, AFB, * LDAFB, IPIV, C, CAPPLY, INFO, WORK, @@ -33,19 +33,18 @@ * REAL C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_GBRCOND_C Computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a REAL vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -144,10 +143,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gbrcond_x.f b/SRC/cla_gbrcond_x.f index 1fc3a73..a8105e3 100644 --- a/SRC/cla_gbrcond_x.f +++ b/SRC/cla_gbrcond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_GBRCOND_X( TRANS, N, KL, KU, AB, LDAB, AFB, * LDAFB, IPIV, X, INFO, WORK, RWORK ) @@ -32,19 +32,18 @@ * REAL RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_GBRCOND_X Computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -137,10 +136,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gbrfsx_extended.f b/SRC/cla_gbrfsx_extended.f index 71ece7c..9ae69c2 100644 --- a/SRC/cla_gbrfsx_extended.f +++ b/SRC/cla_gbrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_GBRFSX_EXTENDED ( PREC_TYPE, TRANS_TYPE, N, KL, KU, * NRHS, AB, LDAB, AFB, LDAFB, IPIV, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_GBRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -391,10 +390,9 @@ *> < 0: if INFO = -i, the ith argument to CGBTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gbrpvgrw.f b/SRC/cla_gbrpvgrw.f index 00760da..09c5f76 100644 --- a/SRC/cla_gbrpvgrw.f +++ b/SRC/cla_gbrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_GBRPVGRW( N, KL, KU, NCOLS, AB, LDAB, AFB, * LDAFB ) @@ -28,11 +28,11 @@ * COMPLEX AB( LDAB, * ), AFB( LDAFB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_GBRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +40,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -101,10 +100,9 @@ *> LDAFB is INTEGER *> The leading dimension of the array AFB. LDAFB >= 2*KL+KU+1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_geamv.f b/SRC/cla_geamv.f index 09eb5b0..b78c011 100644 --- a/SRC/cla_geamv.f +++ b/SRC/cla_geamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA, * Y, INCY ) @@ -31,11 +31,11 @@ * REAL Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_GEAMV performs one of the matrix-vector operations *> @@ -53,11 +53,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -159,10 +158,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gercond_c.f b/SRC/cla_gercond_c.f index 3b14afd..e789260 100644 --- a/SRC/cla_gercond_c.f +++ b/SRC/cla_gercond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_GERCOND_C( TRANS, N, A, LDA, AF, LDAF, IPIV, C, * CAPPLY, INFO, WORK, RWORK ) @@ -32,19 +32,19 @@ * REAL C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_GERCOND_C computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a REAL vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -125,10 +125,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gercond_x.f b/SRC/cla_gercond_x.f index c9b2b14..9eb75d5 100644 --- a/SRC/cla_gercond_x.f +++ b/SRC/cla_gercond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_GERCOND_X( TRANS, N, A, LDA, AF, LDAF, IPIV, X, * INFO, WORK, RWORK ) @@ -31,19 +31,19 @@ * REAL RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_GERCOND_X computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -118,10 +118,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gerfsx_extended.f b/SRC/cla_gerfsx_extended.f index 438b424..c91914c 100644 --- a/SRC/cla_gerfsx_extended.f +++ b/SRC/cla_gerfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, * LDA, AF, LDAF, IPIV, COLEQU, C, B, @@ -40,11 +40,12 @@ * $ ERRS_N( NRHS, * ), ERRS_C( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_GERFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -55,11 +56,10 @@ *> and ERRS_C for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERRS_N and ERRS_C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -376,10 +376,9 @@ *> < 0: if INFO = -i, the ith argument to CGETRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_gerpvgrw.f b/SRC/cla_gerpvgrw.f index a3427b7..fd8ee85 100644 --- a/SRC/cla_gerpvgrw.f +++ b/SRC/cla_gerpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_GERPVGRW( N, NCOLS, A, LDA, AF, LDAF ) * @@ -27,11 +27,12 @@ * COMPLEX A( LDA, * ), AF( LDAF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_GERPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -39,11 +40,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -82,10 +82,9 @@ *> LDAF is INTEGER *> The leading dimension of the array AF. LDAF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_heamv.f b/SRC/cla_heamv.f index ea7acd0..c33760c 100644 --- a/SRC/cla_heamv.f +++ b/SRC/cla_heamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_HEAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -30,11 +30,11 @@ * REAL Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_SYAMV performs the matrix-vector operation *> @@ -51,11 +51,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -146,10 +145,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -160,10 +158,9 @@ * *> \ingroup complexHEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -175,7 +172,6 @@ *> Richard Hanson, Sandia National Labs. *> -- Modified for the absolute-value product, April 2006 *> Jason Riedy, UC Berkeley -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cla_hercond_c.f b/SRC/cla_hercond_c.f index 612e760..69867cc 100644 --- a/SRC/cla_hercond_c.f +++ b/SRC/cla_hercond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_HERCOND_C( UPLO, N, A, LDA, AF, LDAF, IPIV, C, * CAPPLY, INFO, WORK, RWORK ) @@ -32,19 +32,18 @@ * REAL C ( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_HERCOND_C computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a REAL vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -122,10 +121,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_hercond_x.f b/SRC/cla_hercond_x.f index a405309..8f5bfaf 100644 --- a/SRC/cla_hercond_x.f +++ b/SRC/cla_hercond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_HERCOND_X( UPLO, N, A, LDA, AF, LDAF, IPIV, X, * INFO, WORK, RWORK ) @@ -31,19 +31,18 @@ * REAL RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_HERCOND_X computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_herfsx_extended.f b/SRC/cla_herfsx_extended.f index 91f5899..bd6e31e 100644 --- a/SRC/cla_herfsx_extended.f +++ b/SRC/cla_herfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_HERFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, IPIV, COLEQU, C, B, LDB, @@ -42,11 +42,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_HERFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -57,11 +57,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -377,10 +376,9 @@ *> < 0: if INFO = -i, the ith argument to CHETRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_herpvgrw.f b/SRC/cla_herpvgrw.f index b9d7d1d..2cb3860 100644 --- a/SRC/cla_herpvgrw.f +++ b/SRC/cla_herpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_HERPVGRW( UPLO, N, INFO, A, LDA, AF, LDAF, IPIV, * WORK ) @@ -31,11 +31,12 @@ * REAL WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_HERPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -43,11 +44,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +106,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_lin_berr.f b/SRC/cla_lin_berr.f index adf0281..90316a9 100644 --- a/SRC/cla_lin_berr.f +++ b/SRC/cla_lin_berr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR ) * @@ -28,22 +28,21 @@ * COMPLEX RES( N, NRHS ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_LIN_BERR computes componentwise relative backward error from *> the formula *> max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) ) *> where abs(Z) is the componentwise absolute value of the matrix *> or vector Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> BERR is COMPLEX array, dimension (NRHS) *> The componentwise relative backward error from the formula above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_porcond_c.f b/SRC/cla_porcond_c.f index d9a6416..7a6f323 100644 --- a/SRC/cla_porcond_c.f +++ b/SRC/cla_porcond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_PORCOND_C( UPLO, N, A, LDA, AF, LDAF, C, CAPPLY, * INFO, WORK, RWORK ) @@ -31,19 +31,18 @@ * REAL C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_PORCOND_C Computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_porcond_x.f b/SRC/cla_porcond_x.f index f0043f5..af39edd 100644 --- a/SRC/cla_porcond_x.f +++ b/SRC/cla_porcond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_PORCOND_X( UPLO, N, A, LDA, AF, LDAF, X, INFO, * WORK, RWORK ) @@ -30,19 +30,18 @@ * REAL RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_PORCOND_X Computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -107,10 +106,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_porfsx_extended.f b/SRC/cla_porfsx_extended.f index ac8428c..1e6d93b 100644 --- a/SRC/cla_porfsx_extended.f +++ b/SRC/cla_porfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, COLEQU, C, B, LDB, Y, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_PORFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -369,10 +368,9 @@ *> < 0: if INFO = -i, the ith argument to CPOTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_porpvgrw.f b/SRC/cla_porpvgrw.f index 156f809..8d57ff6 100644 --- a/SRC/cla_porpvgrw.f +++ b/SRC/cla_porpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, LDAF, WORK ) * @@ -29,11 +29,12 @@ * REAL WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_PORPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -41,11 +42,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +89,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_syamv.f b/SRC/cla_syamv.f index c738954..07f563c 100644 --- a/SRC/cla_syamv.f +++ b/SRC/cla_syamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -31,11 +31,11 @@ * REAL Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_SYAMV performs the matrix-vector operation *> @@ -52,11 +52,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -147,10 +146,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -161,10 +159,9 @@ * *> \ingroup complexSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -176,7 +173,6 @@ *> Richard Hanson, Sandia National Labs. *> -- Modified for the absolute-value product, April 2006 *> Jason Riedy, UC Berkeley -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cla_syrcond_c.f b/SRC/cla_syrcond_c.f index 1cb8dfc..a73671e 100644 --- a/SRC/cla_syrcond_c.f +++ b/SRC/cla_syrcond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_SYRCOND_C( UPLO, N, A, LDA, AF, LDAF, IPIV, C, * CAPPLY, INFO, WORK, RWORK ) @@ -32,19 +32,18 @@ * REAL C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_SYRCOND_C Computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a REAL vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -122,10 +121,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_syrcond_x.f b/SRC/cla_syrcond_x.f index 7769199..f3d6592 100644 --- a/SRC/cla_syrcond_x.f +++ b/SRC/cla_syrcond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_SYRCOND_X( UPLO, N, A, LDA, AF, LDAF, IPIV, X, * INFO, WORK, RWORK ) @@ -31,19 +31,18 @@ * REAL RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_SYRCOND_X Computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> RWORK is REAL array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_syrfsx_extended.f b/SRC/cla_syrfsx_extended.f index 44a90b3..b60fcda 100644 --- a/SRC/cla_syrfsx_extended.f +++ b/SRC/cla_syrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, IPIV, COLEQU, C, B, LDB, @@ -42,11 +42,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_SYRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -57,11 +57,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -377,10 +376,9 @@ *> < 0: if INFO = -i, the ith argument to CSYTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_syrpvgrw.f b/SRC/cla_syrpvgrw.f index 810348f..2d3af6b 100644 --- a/SRC/cla_syrpvgrw.f +++ b/SRC/cla_syrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF, LDAF, IPIV, * WORK ) @@ -31,11 +31,12 @@ * INTEGER IPIV( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> CLA_SYRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -43,11 +44,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +106,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cla_wwaddw.f b/SRC/cla_wwaddw.f index b56caa1..32c89d1 100644 --- a/SRC/cla_wwaddw.f +++ b/SRC/cla_wwaddw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLA_WWADDW( N, X, Y, W ) * @@ -27,23 +27,20 @@ * COMPLEX X( * ), Y( * ), W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLA_WWADDW adds a vector W into a doubled-single vector (X, Y). *> *> This works for all extant IBM's hex and binary floating point *> arithmetics, but not for decimal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -68,10 +65,9 @@ *> W is COMPLEX array, dimension (N) *> The vector to be added. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clabrd.f b/SRC/clabrd.f index a51c010..3e7eed4 100644 --- a/SRC/clabrd.f +++ b/SRC/clabrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, * LDY ) @@ -30,11 +30,11 @@ * $ Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLABRD reduces the first NB rows and columns of a complex general *> m by n matrix A to upper or lower real bidiagonal form by a unitary @@ -45,11 +45,10 @@ *> bidiagonal form. *> *> This is an auxiliary routine called by CGEBRD -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -149,10 +148,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -163,10 +161,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -209,7 +206,6 @@ *> where a denotes an element of the original matrix which is unchanged, *> vi denotes an element of the vector defining H(i), and ui an element *> of the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clacgv.f b/SRC/clacgv.f index 7c7559c..9485b50 100644 --- a/SRC/clacgv.f +++ b/SRC/clacgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACGV( N, X, INCX ) * @@ -27,18 +27,17 @@ * COMPLEX X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> CLACGV conjugates a complex vector of length N. +*> \verbatim *> -*>\endverbatim +*> CLACGV conjugates a complex vector of length N. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -59,10 +58,9 @@ *> INCX is INTEGER *> The spacing between successive elements of X. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clacn2.f b/SRC/clacn2.f index 7c71088..c39cd38 100644 --- a/SRC/clacn2.f +++ b/SRC/clacn2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACN2( N, V, X, EST, KASE, ISAVE ) * @@ -29,19 +29,18 @@ * COMPLEX V( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLACN2 estimates the 1-norm of a square, complex matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -88,10 +87,9 @@ *> ISAVE is INTEGER array, dimension (3) *> ISAVE is used to save variables between calls to SLACN2 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -102,19 +100,13 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> -*> Contributed by Nick Higham, University of Manchester. *> Originally named CONEST, dated March 16, 1988. *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of -*> a real or complex matrix, with applications to condition estimation", -*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. -*> *> Last modified: April, 1999 *> *> This is a thread safe version of CLACON, which uses the array ISAVE @@ -124,8 +116,19 @@ *> JUMP ISAVE(1) *> J ISAVE(2) *> ITER ISAVE(3) -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Nick Higham, University of Manchester +* +*> \par References: +* ================ +*> +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> a real or complex matrix, with applications to condition estimation", +*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> * ===================================================================== SUBROUTINE CLACN2( N, V, X, EST, KASE, ISAVE ) diff --git a/SRC/clacon.f b/SRC/clacon.f index acd2b34..abefb22 100644 --- a/SRC/clacon.f +++ b/SRC/clacon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACON( N, V, X, EST, KASE ) * @@ -28,19 +28,18 @@ * COMPLEX V( N ), X( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLACON estimates the 1-norm of a square, complex matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -81,10 +80,9 @@ *> whether X should be overwritten by A * X or A**H * X. *> On the final return from CLACON, KASE will again be 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -95,23 +93,24 @@ * *> \ingroup complexOTHERauxiliary * +*> \par Further Details: +* ===================== +*> +*> Originally named CONEST, dated March 16, 1988. \n +*> Last modified: April, 1999 * -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Contributed by Nick Higham, University of Manchester. -*> Originally named CONEST, dated March 16, 1988. +*> Nick Higham, University of Manchester +* +*> \par References: +* ================ *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of *> a real or complex matrix, with applications to condition estimation", *> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> -*> Last modified: April, 1999 -*> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CLACON( N, V, X, EST, KASE ) * diff --git a/SRC/clacp2.f b/SRC/clacp2.f index f9c182f..4f89c4a 100644 --- a/SRC/clacp2.f +++ b/SRC/clacp2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACP2( UPLO, M, N, A, LDA, B, LDB ) * @@ -29,19 +29,18 @@ * COMPLEX B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLACP2 copies all or part of a real two-dimensional matrix A to a *> complex matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clacpy.f b/SRC/clacpy.f index f7469d1..af943bc 100644 --- a/SRC/clacpy.f +++ b/SRC/clacpy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACPY( UPLO, M, N, A, LDA, B, LDB ) * @@ -28,19 +28,18 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLACPY copies all or part of a two-dimensional matrix A to another *> matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -88,10 +87,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clacrm.f b/SRC/clacrm.f index d044610..ff82e3d 100644 --- a/SRC/clacrm.f +++ b/SRC/clacrm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACRM( M, N, A, LDA, B, LDB, C, LDC, RWORK ) * @@ -28,21 +28,20 @@ * COMPLEX A( LDA, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLACRM performs a very simple matrix-matrix multiplication: *> C := A * B, *> where A is M by N and complex; B is N by N and real; *> C is M by N and complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> \verbatim *> RWORK is REAL array, dimension (2*M*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clacrt.f b/SRC/clacrt.f index 4df167e..d782c6f 100644 --- a/SRC/clacrt.f +++ b/SRC/clacrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLACRT( N, CX, INCX, CY, INCY, C, S ) * @@ -28,11 +28,11 @@ * COMPLEX CX( * ), CY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLACRT performs the operation *> @@ -40,11 +40,10 @@ *> ( -s c )( y ) ( y ) *> *> where c and s are complex and the vectors x and y are complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> [ C S ]. *> [ -S C ] *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cladiv.f b/SRC/cladiv.f index 9af6cfc..9ae257a 100644 --- a/SRC/cladiv.f +++ b/SRC/cladiv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX FUNCTION CLADIV( X, Y ) * @@ -24,20 +24,19 @@ * COMPLEX X, Y * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLADIV := X / Y, where X and Y are complex. The computation of X / Y *> will not overflow on an intermediary step unless the results *> overflows. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -49,10 +48,9 @@ *> Y is COMPLEX *> The complex scalars X and Y. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claed0.f b/SRC/claed0.f index c338d1c..01cd985 100644 --- a/SRC/claed0.f +++ b/SRC/claed0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAED0( QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, RWORK, * IWORK, INFO ) @@ -30,21 +30,20 @@ * COMPLEX Q( LDQ, * ), QSTORE( LDQS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Using the divide and conquer method, CLAED0 computes all eigenvalues *> of a symmetric tridiagonal matrix which is one diagonal block of *> those from reducing a dense or band Hermitian matrix and *> corresponding eigenvectors of the dense or band matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] QSIZ *> \verbatim @@ -129,10 +128,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claed7.f b/SRC/claed7.f index 4c6bb80..45f9e36 100644 --- a/SRC/claed7.f +++ b/SRC/claed7.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, * LDQ, RHO, INDXQ, QSTORE, QPTR, PRMPTR, PERM, @@ -35,11 +35,11 @@ * COMPLEX Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAED7 computes the updated eigensystem of a diagonal *> matrix after modification by a rank-one symmetric matrix. This @@ -71,11 +71,10 @@ *> directly using the updated eigenvalues. The eigenvectors for *> the current problem are multiplied with the eigenvectors from *> the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -231,10 +230,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claed8.f b/SRC/claed8.f index 8ab605b..636dca6 100644 --- a/SRC/claed8.f +++ b/SRC/claed8.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAED8( K, N, QSIZ, Q, LDQ, D, RHO, CUTPNT, Z, DLAMDA, * Q2, LDQ2, W, INDXP, INDX, INDXQ, PERM, GIVPTR, @@ -34,11 +34,11 @@ * COMPLEX Q( LDQ, * ), Q2( LDQ2, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAED8 merges the two sets of eigenvalues together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -46,11 +46,10 @@ *> eigenvalues are close together or if there is a tiny element in the *> Z vector. For each such occurrence the order of the related secular *> equation problem is reduced by one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] K *> \verbatim @@ -211,10 +210,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/SRC/claein.f b/SRC/claein.f index df1d014..a7c6e8f 100644 --- a/SRC/claein.f +++ b/SRC/claein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAEIN( RIGHTV, NOINIT, N, H, LDH, W, V, B, LDB, RWORK, * EPS3, SMLNUM, INFO ) @@ -32,20 +32,19 @@ * COMPLEX B( LDB, * ), H( LDH, * ), V( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAEIN uses inverse iteration to find a right or left eigenvector *> corresponding to the eigenvalue W of a complex upper Hessenberg *> matrix H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RIGHTV *> \verbatim @@ -133,10 +132,9 @@ *> = 1: inverse iteration did not converge; V is set to the *> last iterate. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claesy.f b/SRC/claesy.f index ea02a94..900939c 100644 --- a/SRC/claesy.f +++ b/SRC/claesy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAESY( A, B, C, RT1, RT2, EVSCAL, CS1, SN1 ) * @@ -24,11 +24,11 @@ * COMPLEX A, B, C, CS1, EVSCAL, RT1, RT2, SN1 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAESY computes the eigendecomposition of a 2-by-2 symmetric matrix *> ( ( A, B );( B, C ) ) @@ -41,11 +41,10 @@ *> *> [ CS1 SN1 ] . [ A B ] . [ CS1 -SN1 ] = [ RT1 0 ] *> [ -SN1 CS1 ] [ B C ] [ SN1 CS1 ] [ 0 RT2 ] -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -100,10 +99,9 @@ *> If EVSCAL .NE. 0, ( CS1, SN1 ) is the unit right eigenvector *> for RT1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claev2.f b/SRC/claev2.f index 16359b8..586f852 100644 --- a/SRC/claev2.f +++ b/SRC/claev2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAEV2( A, B, C, RT1, RT2, CS1, SN1 ) * @@ -25,11 +25,11 @@ * COMPLEX A, B, C, SN1 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAEV2 computes the eigendecomposition of a 2-by-2 Hermitian matrix *> [ A B ] @@ -40,11 +40,10 @@ *> *> [ CS1 CONJG(SN1) ] [ A B ] [ CS1 -CONJG(SN1) ] = [ RT1 0 ] *> [-SN1 CS1 ] [ CONJG(B) C ] [ SN1 CS1 ] [ 0 RT2 ]. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -87,10 +86,9 @@ *> SN1 is COMPLEX *> The vector (CS1, SN1) is a unit right eigenvector for RT1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,10 +99,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> RT1 is accurate to a few ulps barring over/underflow. @@ -119,7 +116,6 @@ *> Overflow is possible only if RT1 is within a factor of 5 of overflow. *> Underflow is harmless if the input data is 0 or exceeds *> underflow_threshold / macheps. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clag2z.f b/SRC/clag2z.f index 8fdc9ab..74733d7 100644 --- a/SRC/clag2z.f +++ b/SRC/clag2z.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAG2Z( M, N, SA, LDSA, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAG2Z converts a COMPLEX matrix, SA, to a COMPLEX*16 matrix, A. *> @@ -41,11 +41,10 @@ *> converting from single to double. *> *> This is an auxiliary routine so there is no argument checking. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,9 @@ *> INFO is INTEGER *> = 0: successful exit *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clags2.f b/SRC/clags2.f index 1d840fb..84a1d4a 100644 --- a/SRC/clags2.f +++ b/SRC/clags2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV, * SNV, CSQ, SNQ ) @@ -27,11 +27,11 @@ * COMPLEX A2, B2, SNQ, SNU, SNV * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAGS2 computes 2-by-2 unitary matrices U, V and Q, such *> that if ( UPPER ) then @@ -63,11 +63,10 @@ *> then the transformed (2,2) element of B is not zero, except when the *> first rows of input A and B are parallel and the second rows are *> zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPPER *> \verbatim @@ -142,10 +141,9 @@ *> SNQ is COMPLEX *> The desired unitary matrix Q. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clagtm.f b/SRC/clagtm.f index ea0bf48..6b010e4 100644 --- a/SRC/clagtm.f +++ b/SRC/clagtm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA, * B, LDB ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAGTM performs a matrix-vector product of the form *> @@ -44,11 +44,10 @@ *> where A is a tridiagonal matrix of order N, B and X are N by NRHS *> matrices, and alpha and beta are real scalars, each of which may be *> 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -129,10 +128,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/SRC/clahef.f b/SRC/clahef.f index 34c4bca..7acfdfa 100644 --- a/SRC/clahef.f +++ b/SRC/clahef.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAHEF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAHEF computes a partial factorization of a complex Hermitian *> matrix A using the Bunch-Kaufman diagonal pivoting method. The @@ -52,11 +52,10 @@ *> CLAHEF is an auxiliary routine called by CHETRF. It uses blocked code *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or *> A22 (if UPLO = 'L'). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -142,10 +141,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clahqr.f b/SRC/clahqr.f index 8e32a18..141f16b 100644 --- a/SRC/clahqr.f +++ b/SRC/clahqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, * IHIZ, Z, LDZ, INFO ) @@ -29,23 +29,20 @@ * COMPLEX H( LDH, * ), W( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAHQR is an auxiliary routine called by CHSEQR to update the *> eigenvalues and Schur decomposition already computed by CHSEQR, by *> dealing with the Hessenberg submatrix in rows and columns ILO to *> IHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -165,10 +162,9 @@ *> where U is the orthogonal matrix in (*) *> (regardless of the value of WANTT.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -179,10 +175,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Contributors: +* ================== +*> *> \verbatim *> *> 02-96 Based on modifications by @@ -194,7 +189,6 @@ *> It is (1) more robust against overflow and underflow and *> (2) adopts the more conservative Ahues & Tisseur stopping *> criterion (LAWN 122, 1997). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clahr2.f b/SRC/clahr2.f index 28e0bc1..2e48fbf 100644 --- a/SRC/clahr2.f +++ b/SRC/clahr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAHR2 reduces the first NB columns of A complex general n-BY-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -41,11 +41,10 @@ *> Q as a block reflector I - V*T*v**H, and also the matrix Y = A * V * T. *> *> This is an auxiliary routine called by CGEHRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -115,10 +114,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -172,16 +169,15 @@ *> Gejin. Note that the entries of A(1:K,2:NB) differ from those *> returned by the original LAPACK-3.0's DLAHRD routine. (This *> subroutine is not backward compatible with LAPACK-3.0's DLAHRD.) -*> -*> References -*> ========== +*> \endverbatim +* +*> \par References: +* ================ *> *> Gregorio Quintana-Orti and Robert van de Geijn, "Improving the *> performance of reduction to Hessenberg form," ACM Transactions on *> Mathematical Software, 32(2):180-194, June 2006. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * diff --git a/SRC/clahrd.f b/SRC/clahrd.f index 5372cd2..8d5fda8 100644 --- a/SRC/clahrd.f +++ b/SRC/clahrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAHRD reduces the first NB columns of a complex general n-by-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -43,11 +43,10 @@ *> This is an OBSOLETE auxiliary routine. *> This routine will be 'deprecated' in a future release. *> Please use the new routine CLAHR2 instead. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -116,10 +115,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -130,10 +128,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -167,7 +164,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/claic1.f b/SRC/claic1.f index 6567452..29f307d 100644 --- a/SRC/claic1.f +++ b/SRC/claic1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C ) * @@ -29,11 +29,11 @@ * COMPLEX W( J ), X( J ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAIC1 applies one step of incremental condition estimation in *> its simplest version: @@ -60,11 +60,10 @@ *> [ conjg(gamma) ] *> *> where alpha = x**H*w. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -120,10 +119,9 @@ *> C is COMPLEX *> Cosine needed in forming xhat. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clals0.f b/SRC/clals0.f index 3bc79e3..ca6ce17 100644 --- a/SRC/clals0.f +++ b/SRC/clals0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, * PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, @@ -35,11 +35,11 @@ * COMPLEX B( LDB, * ), BX( LDBX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLALS0 applies back the multiplying factors of either the left or the *> right singular vector matrix of a diagonal matrix appended by a row @@ -70,11 +70,10 @@ *> (3R) The inverse transformation of (2L). *> *> (4R) The inverse transformation of (1L). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -246,10 +245,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 @@ -260,19 +258,13 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE CLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, $ PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, diff --git a/SRC/clalsa.f b/SRC/clalsa.f index 6065fe1..e76ef4f 100644 --- a/SRC/clalsa.f +++ b/SRC/clalsa.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, * LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, @@ -36,11 +36,11 @@ * COMPLEX B( LDB, * ), BX( LDBX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLALSA is an itermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The @@ -52,11 +52,10 @@ *> ICOMPQ = 1, CLALSA applies the right singular vector matrix to the *> right hand side. The singular vector matrices were generated in *> compact form by CLALSA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -243,10 +242,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 @@ -257,19 +255,13 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE CLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, $ LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, diff --git a/SRC/clalsd.f b/SRC/clalsd.f index 60aae67..238dd33 100644 --- a/SRC/clalsd.f +++ b/SRC/clalsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, * RANK, WORK, RWORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * COMPLEX B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLALSD uses the singular value decomposition of A to solve the least *> squares problem of finding X to minimize the Euclidean norm of each @@ -54,11 +54,10 @@ *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -163,10 +162,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through MOD(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -177,19 +175,13 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE CLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, $ RANK, WORK, RWORK, IWORK, INFO ) diff --git a/SRC/clangb.f b/SRC/clangb.f index 3385720..f1efad5 100644 --- a/SRC/clangb.f +++ b/SRC/clangb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANGB( NORM, N, KL, KU, AB, LDAB, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANGB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n band matrix A, with kl sub-diagonals and ku super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANGB returns the value +*> \return CLANGB +*> \verbatim *> *> CLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -110,10 +108,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clange.f b/SRC/clange.f index 1b798b6..af30a2a 100644 --- a/SRC/clange.f +++ b/SRC/clange.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANGE( NORM, M, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANGE returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANGE returns the value +*> \return CLANGE +*> \verbatim *> *> CLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -101,10 +99,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clangt.f b/SRC/clangt.f index 31ae38a..73de683 100644 --- a/SRC/clangt.f +++ b/SRC/clangt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANGT( NORM, N, DL, D, DU ) * @@ -28,20 +28,19 @@ * COMPLEX D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANGT returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANGT returns the value +*> \return CLANGT +*> \verbatim *> *> CLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -92,10 +90,9 @@ *> DU is COMPLEX array, dimension (N-1) *> The (n-1) super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clanhb.f b/SRC/clanhb.f index ce866cd..b8688e5 100644 --- a/SRC/clanhb.f +++ b/SRC/clanhb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANHB( NORM, UPLO, N, K, AB, LDAB, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANHB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n hermitian band matrix A, with k super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANHB returns the value +*> \return CLANHB +*> \verbatim *> *> CLANHB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -117,10 +115,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clanhe.f b/SRC/clanhe.f index c5b52d9..5154b61 100644 --- a/SRC/clanhe.f +++ b/SRC/clanhe.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANHE( NORM, UPLO, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANHE returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex hermitian matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANHE returns the value +*> \return CLANHE +*> \verbatim *> *> CLANHE = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -110,10 +108,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clanhf.f b/SRC/clanhf.f index 29fcbd1..94af2a6 100644 --- a/SRC/clanhf.f +++ b/SRC/clanhf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANHF( NORM, TRANSR, UPLO, N, A, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANHF returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex Hermitian matrix A in RFP format. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANHF returns the value +*> \return CLANHF +*> \verbatim *> *> CLANHF = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -124,10 +122,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +135,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -245,7 +241,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clanhp.f b/SRC/clanhp.f index dfefe68..501de4f 100644 --- a/SRC/clanhp.f +++ b/SRC/clanhp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANHP( NORM, UPLO, N, AP, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANHP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex hermitian matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANHP returns the value +*> \return CLANHP +*> \verbatim *> *> CLANHP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -103,10 +101,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clanhs.f b/SRC/clanhs.f index 541e1ae..ca0aadc 100644 --- a/SRC/clanhs.f +++ b/SRC/clanhs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANHS( NORM, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANHS returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> Hessenberg matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANHS returns the value +*> \return CLANHS +*> \verbatim *> *> CLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -95,10 +93,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clanht.f b/SRC/clanht.f index 9a0816e..386af4c 100644 --- a/SRC/clanht.f +++ b/SRC/clanht.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANHT( NORM, N, D, E ) * @@ -29,20 +29,19 @@ * COMPLEX E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANHT returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex Hermitian tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANHT returns the value +*> \return CLANHT +*> \verbatim *> *> CLANHT = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -87,10 +85,9 @@ *> E is COMPLEX array, dimension (N-1) *> The (n-1) sub-diagonal or super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clansb.f b/SRC/clansb.f index f5ab9ca..1b08bb4 100644 --- a/SRC/clansb.f +++ b/SRC/clansb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANSB( NORM, UPLO, N, K, AB, LDAB, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANSB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n symmetric band matrix A, with k super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANSB returns the value +*> \return CLANSB +*> \verbatim *> *> CLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -115,10 +113,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clansp.f b/SRC/clansp.f index 5054f00..335e7f4 100644 --- a/SRC/clansp.f +++ b/SRC/clansp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANSP( NORM, UPLO, N, AP, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANSP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex symmetric matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANSP returns the value +*> \return CLANSP +*> \verbatim *> *> CLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -101,10 +99,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clansy.f b/SRC/clansy.f index acea7a0..0addf51 100644 --- a/SRC/clansy.f +++ b/SRC/clansy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANSY( NORM, UPLO, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANSY returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex symmetric matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANSY returns the value +*> \return CLANSY +*> \verbatim *> *> CLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -109,10 +107,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clantb.f b/SRC/clantb.f index 5428da3..17c13ef 100644 --- a/SRC/clantb.f +++ b/SRC/clantb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANTB( NORM, UPLO, DIAG, N, K, AB, * LDAB, WORK ) @@ -30,20 +30,19 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANTB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n triangular band matrix A, with ( k + 1 ) diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANTB returns the value +*> \return CLANTB +*> \verbatim *> *> CLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -126,10 +124,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clantp.f b/SRC/clantp.f index b173643..782a8db 100644 --- a/SRC/clantp.f +++ b/SRC/clantp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANTP( NORM, UPLO, DIAG, N, AP, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANTP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> triangular matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANTP returns the value +*> \return CLANTP +*> \verbatim *> *> CLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -111,10 +109,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clantr.f b/SRC/clantr.f index db6b98b..03ed07c 100644 --- a/SRC/clantr.f +++ b/SRC/clantr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION CLANTR( NORM, UPLO, DIAG, M, N, A, LDA, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLANTR returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> trapezoidal or triangular matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> CLANTR returns the value +*> \return CLANTR +*> \verbatim *> *> CLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -127,10 +125,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clapll.f b/SRC/clapll.f index 01507b5..c9ae99f 100644 --- a/SRC/clapll.f +++ b/SRC/clapll.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAPLL( N, X, INCX, Y, INCY, SSMIN ) * @@ -28,11 +28,11 @@ * COMPLEX X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given two column vectors X and Y, let *> @@ -42,11 +42,10 @@ *> and then computes the SVD of the 2-by-2 upper triangular matrix R. *> The smaller singular value of R is returned in SSMIN, which is used *> as the measurement of the linear dependency of the vectors X and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -85,10 +84,9 @@ *> SSMIN is REAL *> The smallest singular value of the N-by-2 matrix A = ( X Y ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clapmr.f b/SRC/clapmr.f index 4264c60..6faca93 100644 --- a/SRC/clapmr.f +++ b/SRC/clapmr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAPMR( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * COMPLEX X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAPMR rearranges the rows of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(I,*) is moved to X(K(I),*) for I = 1,2,...,M. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clapmt.f b/SRC/clapmt.f index 35fb9e9..966028b 100644 --- a/SRC/clapmt.f +++ b/SRC/clapmt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAPMT( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * COMPLEX X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAPMT rearranges the columns of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqgb.f b/SRC/claqgb.f index 642ff10..846069a 100644 --- a/SRC/claqgb.f +++ b/SRC/claqgb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, EQUED ) @@ -31,20 +31,19 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQGB equilibrates a general M by N band matrix A with KL *> subdiagonals and KU superdiagonals using the row and scaling factors *> in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -129,10 +128,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -142,10 +143,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqge.f b/SRC/claqge.f index 902dec0..d8be08a 100644 --- a/SRC/claqge.f +++ b/SRC/claqge.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * EQUED ) @@ -31,19 +31,18 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQGE equilibrates a general M by N matrix A using the row and *> column scaling factors in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -125,10 +126,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqhb.f b/SRC/claqhb.f index 562acf3..15c25a9 100644 --- a/SRC/claqhb.f +++ b/SRC/claqhb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQHB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQHB equilibrates an Hermitian band matrix A using the scaling *> factors in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -124,10 +125,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqhe.f b/SRC/claqhe.f index fceb3f7..61ee38c 100644 --- a/SRC/claqhe.f +++ b/SRC/claqhe.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQHE( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQHE equilibrates a Hermitian matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -117,10 +118,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqhp.f b/SRC/claqhp.f index c4d8f0a..9b1824c 100644 --- a/SRC/claqhp.f +++ b/SRC/claqhp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQHP( UPLO, N, AP, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQHP equilibrates a Hermitian matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -109,10 +110,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqp2.f b/SRC/claqp2.f index cdbab2e..3084e34 100644 --- a/SRC/claqp2.f +++ b/SRC/claqp2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQP2 computes a QR factorization with column pivoting of *> the block A(OFFSET+1:M,1:N). *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -114,10 +113,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -128,23 +126,25 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA -*> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE CLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, $ WORK ) diff --git a/SRC/claqps.f b/SRC/claqps.f index 88dfeee..8b95e16 100644 --- a/SRC/claqps.f +++ b/SRC/claqps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, * VN2, AUXV, F, LDF ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), AUXV( * ), F( LDF, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQPS computes a step of QR factorization with column pivoting *> of a complex M-by-N matrix A by using Blas-3. It tries to factorize @@ -46,11 +46,10 @@ *> columns is returned in KB. *> *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -142,10 +141,9 @@ *> LDF is INTEGER *> The leading dimension of the array F. LDF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -156,23 +154,26 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA *> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE CLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, $ VN2, AUXV, F, LDF ) diff --git a/SRC/claqr0.f b/SRC/claqr0.f index be73778..6b28bec 100644 --- a/SRC/claqr0.f +++ b/SRC/claqr0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, * IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQR0 computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -44,11 +44,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -206,10 +205,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -220,28 +218,24 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, $ IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/claqr1.f b/SRC/claqr1.f index 8b468a6..d183c2d 100644 --- a/SRC/claqr1.f +++ b/SRC/claqr1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQR1( N, H, LDH, S1, S2, V ) * @@ -28,11 +28,11 @@ * COMPLEX H( LDH, * ), V( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given a 2-by-2 or 3-by-3 matrix H, CLAQR1 sets v to a *> scalar multiple of the first column of the product @@ -43,11 +43,10 @@ *> *> This is useful for starting double implicit shift bulges *> in the QR algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> A scalar multiple of the first column of the *> matrix K in (*). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -100,17 +98,11 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE CLAQR1( N, H, LDH, S1, S2, V ) diff --git a/SRC/claqr2.f b/SRC/claqr2.f index 5fc0555..a6ef1cb 100644 --- a/SRC/claqr2.f +++ b/SRC/claqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT, @@ -32,11 +32,11 @@ * $ WORK( * ), WV( LDWV, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQR2 is identical to CLAQR3 except that it avoids *> recursion by calling CLAHQR instead of CLAQR4. @@ -51,11 +51,10 @@ *> an unitary similarity transformation of H. It is to be *> hoped that the final version of H has many zero subdiagonal *> entries. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -246,10 +245,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -260,17 +258,11 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE CLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/claqr3.f b/SRC/claqr3.f index 185be7e..45ba1c4 100644 --- a/SRC/claqr3.f +++ b/SRC/claqr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT, @@ -32,11 +32,11 @@ * $ WORK( * ), WV( LDWV, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Aggressive early deflation: *> @@ -48,11 +48,10 @@ *> an unitary similarity transformation of H. It is to be *> hoped that the final version of H has many zero subdiagonal *> entries. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -243,10 +242,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -257,17 +255,11 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE CLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/claqr4.f b/SRC/claqr4.f index d7a96d8..8ba6ef3 100644 --- a/SRC/claqr4.f +++ b/SRC/claqr4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, * IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQR4 implements one level of recursion for CLAQR0. *> It is a complete implementation of the small bulge multi-shift @@ -52,11 +52,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -215,10 +214,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -229,28 +227,24 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, $ IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/claqr5.f b/SRC/claqr5.f index 5967121..6bd29a1 100644 --- a/SRC/claqr5.f +++ b/SRC/claqr5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S, * H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV, @@ -32,19 +32,18 @@ * $ WH( LDWH, * ), WV( LDWV, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQR5 called by CLAQR0 performs a *> single small-bulge multi-shift QR sweep. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -220,10 +219,9 @@ *> LDWV is the leading dimension of WV as declared in the *> in the calling subroutine. LDWV.GE.NV. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -234,24 +232,19 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> \par Contributors: +* ================== *> -*> Reference: -*> -*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -*> Algorithm Part I: Maintaining Well Focused Shifts, and -*> Level 3 Performance, SIAM Journal of Matrix Analysis, -*> volume 23, pages 929--947, 2002. +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> \endverbatim +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. *> * ===================================================================== SUBROUTINE CLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S, diff --git a/SRC/claqsb.f b/SRC/claqsb.f index 22d92c1..cdb9e91 100644 --- a/SRC/claqsb.f +++ b/SRC/claqsb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQSB equilibrates a symmetric band matrix A using the scaling *> factors in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -124,10 +125,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqsp.f b/SRC/claqsp.f index 31f68d1..15d3b68 100644 --- a/SRC/claqsp.f +++ b/SRC/claqsp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQSP equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -109,10 +110,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claqsy.f b/SRC/claqsy.f index 80b4696..d3dd3be 100644 --- a/SRC/claqsy.f +++ b/SRC/claqsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAQSY equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -117,10 +118,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clar1v.f b/SRC/clar1v.f index ed6d312..d4179f7 100644 --- a/SRC/clar1v.f +++ b/SRC/clar1v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, * PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, @@ -35,11 +35,11 @@ * COMPLEX Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAR1V computes the (scaled) r-th column of the inverse of *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix @@ -56,11 +56,10 @@ *> (d) Computation of the (scaled) r-th column of the inverse using the *> twisted factorization obtained by combining the top part of the *> the stationary and the bottom part of the progressive transform. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -204,10 +203,9 @@ *> \verbatim *> WORK is REAL array, dimension (4*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -218,21 +216,15 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE CLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, $ PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, diff --git a/SRC/clar2v.f b/SRC/clar2v.f index d614432..29abba5 100644 --- a/SRC/clar2v.f +++ b/SRC/clar2v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAR2V( N, X, Y, Z, INCX, C, S, INCC ) * @@ -28,11 +28,11 @@ * COMPLEX S( * ), X( * ), Y( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAR2V applies a vector of complex plane rotations with real cosines *> from both sides to a sequence of 2-by-2 complex Hermitian matrices, @@ -43,11 +43,10 @@ *> *> ( c(i) conjg(s(i)) ) ( x(i) z(i) ) ( c(i) -conjg(s(i)) ) *> ( -s(i) c(i) ) ( conjg(z(i)) y(i) ) ( s(i) c(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -96,10 +95,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clarcm.f b/SRC/clarcm.f index b6fd399..191da9d 100644 --- a/SRC/clarcm.f +++ b/SRC/clarcm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARCM( M, N, A, LDA, B, LDB, C, LDC, RWORK ) * @@ -28,21 +28,20 @@ * COMPLEX B( LDB, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARCM performs a very simple matrix-matrix multiplication: *> C := A * B, *> where A is M by M and real; B is M by N and complex; *> C is M by N and complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> \verbatim *> RWORK is REAL array, dimension (2*M*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clarf.f b/SRC/clarf.f index 2c0dd76..c6ded92 100644 --- a/SRC/clarf.f +++ b/SRC/clarf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARF applies a complex elementary reflector H to a complex M-by-N *> matrix C, from either the left or the right. H is represented in the @@ -47,11 +47,10 @@ *> *> To apply H**H (the conjugate transpose of H), supply conjg(tau) instead *> tau. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -113,10 +112,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clarfb.f b/SRC/clarfb.f index 335023a..0d27814 100644 --- a/SRC/clarfb.f +++ b/SRC/clarfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, * T, LDT, C, LDC, WORK, LDWORK ) @@ -30,19 +30,18 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARFB applies a complex block reflector H or its transpose H**H to a *> complex M-by-N matrix C, from either the left or the right. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -192,7 +189,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clarfg.f b/SRC/clarfg.f index cc977f0..5b8dffd 100644 --- a/SRC/clarfg.f +++ b/SRC/clarfg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARFG( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * COMPLEX X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARFG generates a complex elementary reflector H of order n, such *> that @@ -53,11 +53,10 @@ *> and H is taken to be the unit matrix. *> *> Otherwise 1 <= real(tau) <= 2 and abs(tau-1) <= 1 . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -91,10 +90,9 @@ *> TAU is COMPLEX *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clarfgp.f b/SRC/clarfgp.f index cbad5fc..9d50bd3 100644 --- a/SRC/clarfgp.f +++ b/SRC/clarfgp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARFGP( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * COMPLEX X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARFGP generates a complex elementary reflector H of order n, such *> that @@ -51,11 +51,10 @@ *> *> If the elements of x are all zero and alpha is real, then tau = 0 *> and H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> TAU is COMPLEX *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clarft.f b/SRC/clarft.f index b2a74b6..be79468 100644 --- a/SRC/clarft.f +++ b/SRC/clarft.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * COMPLEX T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARFT forms the triangular factor T of a complex block reflector H *> of order n, which is defined as a product of k elementary reflectors. @@ -50,11 +50,10 @@ *> H(i) is stored in the i-th row of the array V, and *> *> H = I - V**H * T * V -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -122,10 +121,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -163,7 +160,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clarfx.f b/SRC/clarfx.f index cbd57a6..eef6071 100644 --- a/SRC/clarfx.f +++ b/SRC/clarfx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARFX applies a complex elementary reflector H to a complex m by n *> matrix C, from either the left or the right. H is represented in the @@ -46,11 +46,10 @@ *> If tau = 0, then H is taken to be the unit matrix *> *> This version uses inline code if H has order < 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -104,10 +103,9 @@ *> or (M) if SIDE = 'R' *> WORK is not referenced if H has order < 11. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clargv.f b/SRC/clargv.f index 059a1f9..b32ee6b 100644 --- a/SRC/clargv.f +++ b/SRC/clargv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARGV( N, X, INCX, Y, INCY, C, INCC ) * @@ -28,11 +28,11 @@ * COMPLEX X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARGV generates a vector of complex plane rotations with real *> cosines, determined by elements of the complex vectors x and y. @@ -47,11 +47,10 @@ *> but differ from the BLAS1 routine CROTG): *> If y(i)=0, then c(i)=1 and s(i)=0. *> If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -96,10 +95,9 @@ *> INCC is INTEGER *> The increment between elements of C. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -110,17 +108,15 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel *> *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clarnv.f b/SRC/clarnv.f index 7fb7987..f6724d8 100644 --- a/SRC/clarnv.f +++ b/SRC/clarnv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARNV( IDIST, ISEED, N, X ) * @@ -28,19 +28,18 @@ * COMPLEX X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARNV returns a vector of n random complex numbers from a uniform or *> normal distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -73,10 +72,9 @@ *> X is COMPLEX array, dimension (N) *> The generated random numbers. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -87,17 +85,15 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine SLARUV to generate random *> real numbers from a uniform (0,1) distribution, in batches of up to *> 128 using vectorisable code. The Box-Muller method is used to *> transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clarrv.f b/SRC/clarrv.f index fc3b914..a6606fb 100644 --- a/SRC/clarrv.f +++ b/SRC/clarrv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARRV( N, VL, VU, D, L, PIVMIN, * ISPLIT, M, DOL, DOU, MINRGP, @@ -36,20 +36,19 @@ * COMPLEX Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARRV computes the eigenvectors of the tridiagonal matrix *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T. *> The input eigenvalues should have been computed by SLARRE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -255,10 +254,9 @@ *> = 5: The Rayleigh Quotient Iteration failed to converge to *> full accuracy in MAXITR steps. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -269,21 +267,15 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE CLARRV( N, VL, VU, D, L, PIVMIN, $ ISPLIT, M, DOL, DOU, MINRGP, diff --git a/SRC/clarscl2.f b/SRC/clarscl2.f index f3564c8..76990d3 100644 --- a/SRC/clarscl2.f +++ b/SRC/clarscl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARSCL2 ( M, N, D, X, LDX ) * @@ -28,11 +28,11 @@ * REAL D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARSCL2 performs a reciprocal diagonal scaling on an vector: *> x <-- inv(D) * x @@ -40,11 +40,10 @@ *> *> Eventually to be replaced by BLAS_cge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -76,10 +75,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clartg.f b/SRC/clartg.f index 8374649..a5bfb80 100644 --- a/SRC/clartg.f +++ b/SRC/clartg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARTG( F, G, CS, SN, R ) * @@ -25,11 +25,11 @@ * COMPLEX F, G, R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARTG generates a plane rotation so that *> @@ -42,11 +42,10 @@ *> F and G are unchanged on return. *> If G=0, then CS=1 and SN=0. *> If F=0, then CS=0 and SN is chosen so that R is real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -77,10 +76,9 @@ *> R is COMPLEX *> The nonzero component of the rotated vector. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -91,17 +89,15 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel *> *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clartv.f b/SRC/clartv.f index 5977e0e..3925ed3 100644 --- a/SRC/clartv.f +++ b/SRC/clartv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARTV( N, X, INCX, Y, INCY, C, S, INCC ) * @@ -28,22 +28,21 @@ * COMPLEX S( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARTV applies a vector of complex plane rotations with real cosines *> to elements of the complex vectors x and y. For i = 1,2,...,n *> *> ( x(i) ) := ( c(i) s(i) ) ( x(i) ) *> ( y(i) ) ( -conjg(s(i)) c(i) ) ( y(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -92,10 +91,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clarz.f b/SRC/clarz.f index 27f222e..f0e26ab 100644 --- a/SRC/clarz.f +++ b/SRC/clarz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARZ applies a complex elementary reflector H to a complex *> M-by-N matrix C, from either the left or the right. H is represented @@ -49,11 +49,10 @@ *> tau. *> *> H is a product of k elementary reflectors as returned by CTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -121,10 +120,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -135,15 +133,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/clarzb.f b/SRC/clarzb.f index 9be5249..3ff98c8 100644 --- a/SRC/clarzb.f +++ b/SRC/clarzb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, * LDV, T, LDT, C, LDC, WORK, LDWORK ) @@ -30,21 +30,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARZB applies a complex block reflector H or its transpose H**H *> to a complex distributed M-by-N C from the left or the right. *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -156,10 +155,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,15 +168,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/clarzt.f b/SRC/clarzt.f index 16c8e96..20e1c65 100644 --- a/SRC/clarzt.f +++ b/SRC/clarzt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * COMPLEX T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLARZT forms the triangular factor T of a complex block reflector *> H of order > n, which is defined as a product of k elementary @@ -53,11 +53,10 @@ *> H = I - V**H * T * V *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -125,10 +124,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,14 +137,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define *> the H(i) is best illustrated by the following example with n = 5 and @@ -181,7 +180,6 @@ *> V = ( v1 v2 v3 ) *> ( v1 v2 v3 ) *> ( v1 v2 v3 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clascl.f b/SRC/clascl.f index d5039e9..a6e62b2 100644 --- a/SRC/clascl.f +++ b/SRC/clascl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) * @@ -29,22 +29,21 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASCL multiplies the M by N complex matrix A by the real scalar *> CTO/CFROM. This is done without over/underflow as long as the final *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that *> A may be full, upper triangular, lower triangular, upper Hessenberg, *> or banded. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -124,10 +123,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/SRC/clascl2.f b/SRC/clascl2.f index 8d2db22..811bae4 100644 --- a/SRC/clascl2.f +++ b/SRC/clascl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASCL2 ( M, N, D, X, LDX ) * @@ -28,11 +28,11 @@ * COMPLEX X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASCL2 performs a diagonal scaling on a vector: *> x <-- D * x @@ -40,11 +40,10 @@ *> *> Eventually to be replaced by BLAS_cge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -76,10 +75,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claset.f b/SRC/claset.f index c750199..f5089ef 100644 --- a/SRC/claset.f +++ b/SRC/claset.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASET( UPLO, M, N, ALPHA, BETA, A, LDA ) * @@ -29,19 +29,18 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASET initializes a 2-D array A to BETA on the diagonal and *> ALPHA on the offdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -91,10 +90,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clasr.f b/SRC/clasr.f index d84f820..99612e1 100644 --- a/SRC/clasr.f +++ b/SRC/clasr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASR applies a sequence of real plane rotations to a complex matrix *> A, from either the left or the right. @@ -106,11 +106,10 @@ *> *> where R(k) appears in rows and columns k and z. The rotations are *> performed without ever forming P(k) explicitly. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -185,10 +184,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/classq.f b/SRC/classq.f index f104ede..b32f1bc 100644 --- a/SRC/classq.f +++ b/SRC/classq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASSQ( N, X, INCX, SCALE, SUMSQ ) * @@ -28,11 +28,11 @@ * COMPLEX X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASSQ returns the values scl and ssq such that *> @@ -52,11 +52,10 @@ *> SCALE and SUMSQ are overwritten by scl and ssq respectively. *> *> The routine makes only one pass through the vector X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -91,10 +90,9 @@ *> On entry, the value sumsq in the equation above. *> On exit, SUMSQ is overwritten with the value ssq . *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/claswp.f b/SRC/claswp.f index cd16789..464b3e6 100644 --- a/SRC/claswp.f +++ b/SRC/claswp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASWP( N, A, LDA, K1, K2, IPIV, INCX ) * @@ -28,19 +28,18 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASWP performs a series of row interchanges on the matrix A. *> One row interchange is initiated for each of rows K1 through K2 of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> The increment between successive values of IPIV. If IPIV *> is negative, the pivots are applied in reverse order. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,15 +102,13 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by *> R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clasyf.f b/SRC/clasyf.f index 0d9a4df..c103a82 100644 --- a/SRC/clasyf.f +++ b/SRC/clasyf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLASYF computes a partial factorization of a complex symmetric matrix *> A using the Bunch-Kaufman diagonal pivoting method. The partial @@ -52,11 +52,10 @@ *> CLASYF is an auxiliary routine called by CSYTRF. It uses blocked code *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or *> A22 (if UPLO = 'L'). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -142,10 +141,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clatbs.f b/SRC/clatbs.f index 1e7dcce..159d75d 100644 --- a/SRC/clatbs.f +++ b/SRC/clatbs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X, * SCALE, CNORM, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AB( LDAB, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATBS solves one of the triangular systems *> @@ -49,11 +49,10 @@ *> overflow, the Level 2 BLAS routine CTBSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,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 @@ -169,10 +167,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, CTBSV @@ -240,7 +237,6 @@ *> *> and we can safely call CTBSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clatdf.f b/SRC/clatdf.f index 9b6b4ea..5b9993f 100644 --- a/SRC/clatdf.f +++ b/SRC/clatdf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, * JPIV ) @@ -30,11 +30,11 @@ * COMPLEX RHS( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATDF computes the contribution to the reciprocal Dif-estimate *> by solving for x in Z * x = b, where b is chosen such that the norm @@ -45,11 +45,10 @@ *> The factorization of Z returned by CGETC2 has the form *> Z = P * L * U * Q, where P and Q are permutation matrices. L is lower *> triangular with unit diagonal elements and U is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -126,10 +125,9 @@ *> The pivot indices; for 1 <= j <= N, column j of the *> matrix has been interchanged with column JPIV(j). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -140,18 +138,20 @@ * *> \ingroup complexOTHERauxiliary * +*> \par Further Details: +* ===================== +*> +*> This routine is a further developed implementation of algorithm +*> BSOLVE in [1] using complete pivoting in the LU factorization. * -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> This routine is a further developed implementation of algorithm -*> BSOLVE in [1] using complete pivoting in the LU factorization. +* +*> \par References: +* ================ *> *> [1] Bo Kagstrom and Lars Westin, *> Generalized Schur Methods with Condition Estimators for @@ -164,9 +164,7 @@ *> Condition Estimation. Report UMINF-95.05, Department of *> Computing Science, Umea University, S-901 87 Umea, Sweden, *> 1995. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, $ JPIV ) diff --git a/SRC/clatps.f b/SRC/clatps.f index 5c36c90..d96b252 100644 --- a/SRC/clatps.f +++ b/SRC/clatps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE, * CNORM, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AP( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATPS solves one of the triangular systems *> @@ -50,11 +50,10 @@ *> overflow, the Level 2 BLAS routine CTPSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -143,10 +142,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 @@ -157,10 +155,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, CTPSV @@ -228,7 +225,6 @@ *> *> and we can safely call CTPSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clatrd.f b/SRC/clatrd.f index 32b2648..348c16c 100644 --- a/SRC/clatrd.f +++ b/SRC/clatrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), TAU( * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATRD reduces NB rows and columns of a complex Hermitian matrix A to *> Hermitian tridiagonal form by a unitary similarity @@ -46,11 +46,10 @@ *> matrix, of which the lower triangle is supplied. *> *> This is an auxiliary routine called by CHETRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -132,10 +131,9 @@ *> LDW is INTEGER *> The leading dimension of the array W. LDW >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -146,10 +144,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -197,7 +194,6 @@ *> where d denotes a diagonal element of the reduced matrix, a denotes *> an element of the original matrix that is unchanged, and vi denotes *> an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clatrs.f b/SRC/clatrs.f index 675550f..4c5cd4c 100644 --- a/SRC/clatrs.f +++ b/SRC/clatrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, * CNORM, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATRS solves one of the triangular systems *> @@ -49,11 +49,10 @@ *> unscaled problem will not cause overflow, the Level 2 BLAS routine *> CTRSV is called. If the matrix A is singular (A(j,j) = 0 for some j), *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -151,10 +150,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 @@ -165,10 +163,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, CTRSV @@ -236,7 +233,6 @@ *> *> and we can safely call CTRSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clatrz.f b/SRC/clatrz.f index f2185f4..9baf615 100644 --- a/SRC/clatrz.f +++ b/SRC/clatrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATRZ( M, N, L, A, LDA, TAU, WORK ) * @@ -27,21 +27,20 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLATRZ factors the M-by-(M+L) complex upper trapezoidal matrix *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R 0 ) * Z by means *> of unitary transformations, where Z is an (M+L)-by-(M+L) unitary *> matrix and, R and A1 are M-by-M upper triangular matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,9 @@ *> \verbatim *> WORK is COMPLEX array, dimension (M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,14 +101,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -136,7 +135,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/clatzm.f b/SRC/clatzm.f index d0915df..3e08ddf 100644 --- a/SRC/clatzm.f +++ b/SRC/clatzm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine CUNMRZ. *> @@ -54,11 +54,10 @@ *> C = [ C1, C2 ] m *> 1 n-1 *> Then C is overwritten by C*P. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -137,10 +136,9 @@ *> (N) if SIDE = 'L' *> (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/clauu2.f b/SRC/clauu2.f index 5ae6288..4741e46 100644 --- a/SRC/clauu2.f +++ b/SRC/clauu2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAUU2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAUU2 computes the product U * U**H or L**H * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the unblocked form of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/clauum.f b/SRC/clauum.f index d1058fa..7ee248e 100644 --- a/SRC/clauum.f +++ b/SRC/clauum.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CLAUUM( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CLAUUM computes the product U * U**H or L**H * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the blocked form of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/cpbcon.f b/SRC/cpbcon.f index 2173710..73cefdf 100644 --- a/SRC/cpbcon.f +++ b/SRC/cpbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK, * RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite band matrix using @@ -44,11 +44,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,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/SRC/cpbequ.f b/SRC/cpbequ.f index 81d85b6..61c41a8 100644 --- a/SRC/cpbequ.f +++ b/SRC/cpbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBEQU computes row and column scalings intended to equilibrate a *> Hermitian positive definite band matrix A and reduce its condition @@ -44,11 +44,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpbrfs.f b/SRC/cpbrfs.f index 9ac4f70..de9fcbd 100644 --- a/SRC/cpbrfs.f +++ b/SRC/cpbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B, * LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite *> and banded, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,16 +164,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpbstf.f b/SRC/cpbstf.f index 3f4cf11..5fe5427 100644 --- a/SRC/cpbstf.f +++ b/SRC/cpbstf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBSTF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBSTF computes a split Cholesky factorization of a complex *> Hermitian positive definite band matrix A. @@ -47,11 +47,10 @@ *> *> where U is upper triangular of order m = (n+kd)/2, and L is lower *> triangular of order n-m. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> because the updated element a(i,i) was negative; the *> matrix A is not positive definite. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -151,7 +148,6 @@ *> *> Array elements marked * are not used by the routine; s12**H denotes *> conjg(s12); the diagonal elements of S are real. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpbsv.f b/SRC/cpbsv.f index 627cfc3..4e3b36c 100644 --- a/SRC/cpbsv.f +++ b/SRC/cpbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBSV computes the solution to a complex system of linear equations *> A * X = B, @@ -46,11 +46,10 @@ *> triangular band matrix, with the same number of superdiagonals or *> subdiagonals as A. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -162,7 +159,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpbsvx.f b/SRC/cpbsvx.f index 05c9989..69b77d6 100644 --- a/SRC/cpbsvx.f +++ b/SRC/cpbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, * EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -33,11 +33,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to *> compute the solution to a complex system of linear equations @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -85,11 +88,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -290,10 +292,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -304,10 +305,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -335,7 +335,6 @@ *> a31 a42 a53 a64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpbtf2.f b/SRC/cpbtf2.f index 883edfa..c026573 100644 --- a/SRC/cpbtf2.f +++ b/SRC/cpbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBTF2( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBTF2 computes the Cholesky factorization of a complex Hermitian *> positive definite band matrix A. @@ -44,11 +44,10 @@ *> of U, and L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -140,7 +137,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpbtrf.f b/SRC/cpbtrf.f index 8a11a5c..ef3c019 100644 --- a/SRC/cpbtrf.f +++ b/SRC/cpbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBTRF computes the Cholesky factorization of a complex Hermitian *> positive definite band matrix A. @@ -41,11 +41,10 @@ *> A = U**H * U, if UPLO = 'U', or *> A = L * L**H, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -111,10 +109,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -135,12 +132,13 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> -*> Contributed by -*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 -*> *> \endverbatim +* +*> \par Contributors: +* ================== *> +*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 +* * ===================================================================== SUBROUTINE CPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * diff --git a/SRC/cpbtrs.f b/SRC/cpbtrs.f index 7686d96..14bde13 100644 --- a/SRC/cpbtrs.f +++ b/SRC/cpbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPBTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite band matrix A using the Cholesky factorization *> A = U**H*U or A = L*L**H computed by CPBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/cpftrf.f b/SRC/cpftrf.f index 647d596..8790c2f 100644 --- a/SRC/cpftrf.f +++ b/SRC/cpftrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPFTRF( TRANSR, UPLO, N, A, INFO ) * @@ -27,11 +27,11 @@ * .. Array Arguments .. * COMPLEX A( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPFTRF computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A. @@ -42,11 +42,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -196,10 +195,9 @@ *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpftri.f b/SRC/cpftri.f index 5937eff..40a58a7 100644 --- a/SRC/cpftri.f +++ b/SRC/cpftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPFTRI( TRANSR, UPLO, N, A, INFO ) * @@ -27,20 +27,19 @@ * COMPLEX A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPFTRI computes the inverse of a complex Hermitian positive definite *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H *> computed by CPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -89,10 +88,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,10 +101,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -210,7 +207,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpftrs.f b/SRC/cpftrs.f index 83fc928..4260b74 100644 --- a/SRC/cpftrs.f +++ b/SRC/cpftrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX A( 0: * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPFTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite matrix A using the Cholesky factorization *> A = U**H*U or A = L*L**H computed by CPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -97,10 +96,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 @@ -111,10 +109,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -218,7 +215,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpocon.f b/SRC/cpocon.f index 15daf86..8bce056 100644 --- a/SRC/cpocon.f +++ b/SRC/cpocon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, RWORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite matrix using the @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/cpoequ.f b/SRC/cpoequ.f index 1aebf9c..01d7bb1 100644 --- a/SRC/cpoequ.f +++ b/SRC/cpoequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOEQU( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOEQU computes row and column scalings intended to equilibrate a *> Hermitian positive definite matrix A and reduce its condition number @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -98,10 +97,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpoequb.f b/SRC/cpoequb.f index 969c911..e26f65b 100644 --- a/SRC/cpoequb.f +++ b/SRC/cpoequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * REAL S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOEQUB computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A and reduce its condition number @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -98,10 +97,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cporfs.f b/SRC/cporfs.f index 580ab10..190243c 100644 --- a/SRC/cporfs.f +++ b/SRC/cporfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X, * LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPORFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite, *> and provides error bounds and backward error estimates for the *> solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,16 +158,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cporfsx.f b/SRC/cporfsx.f index 2ba6cef..7fa79e9 100644 --- a/SRC/cporfsx.f +++ b/SRC/cporfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B, * LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -37,13 +37,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPORFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -377,10 +374,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cposv.f b/SRC/cposv.f index 4b73f6c..488c46b 100644 --- a/SRC/cposv.f +++ b/SRC/cposv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOSV computes the solution to a complex system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cposvx.f b/SRC/cposvx.f index ef3d591..2983dc8 100644 --- a/SRC/cposvx.f +++ b/SRC/cposvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, @@ -33,11 +33,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to *> compute the solution to a complex system of linear equations @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -85,11 +88,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -286,10 +288,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cposvxx.f b/SRC/cposvxx.f index fb1c6df..ed9b807 100644 --- a/SRC/cposvxx.f +++ b/SRC/cposvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -37,13 +37,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T *> to compute the solution to a complex system of linear equations @@ -64,9 +62,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what CPOSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -104,11 +105,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -477,10 +477,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpotf2.f b/SRC/cpotf2.f index a9f5efe..c6a9023 100644 --- a/SRC/cpotf2.f +++ b/SRC/cpotf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOTF2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOTF2 computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpotrf.f b/SRC/cpotrf.f index 0d20bb0..76f4966 100644 --- a/SRC/cpotrf.f +++ b/SRC/cpotrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOTRF( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOTRF computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -92,10 +91,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpotri.f b/SRC/cpotri.f index d8b8970..c36abe2 100644 --- a/SRC/cpotri.f +++ b/SRC/cpotri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOTRI( UPLO, N, A, LDA, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOTRI computes the inverse of a complex Hermitian positive definite *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H *> computed by CPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -80,10 +79,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpotrs.f b/SRC/cpotrs.f index 2eae0ab..b2b56dd 100644 --- a/SRC/cpotrs.f +++ b/SRC/cpotrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPOTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite matrix A using the Cholesky factorization *> A = U**H*U or A = L*L**H computed by CPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/cppcon.f b/SRC/cppcon.f index e04a539..d4ef84c 100644 --- a/SRC/cppcon.f +++ b/SRC/cppcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPCON( UPLO, N, AP, ANORM, RCOND, WORK, RWORK, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite packed matrix using @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/cppequ.f b/SRC/cppequ.f index 6fc241a..c031a30 100644 --- a/SRC/cppequ.f +++ b/SRC/cppequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPEQU computes row and column scalings intended to equilibrate a *> Hermitian positive definite matrix A in packed storage and reduce @@ -44,11 +44,10 @@ *> This choice of S puts the condition number of B within a factor N of *> the smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpprfs.f b/SRC/cpprfs.f index a5c2665..cfccd71 100644 --- a/SRC/cpprfs.f +++ b/SRC/cpprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR, * BERR, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -147,16 +146,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cppsv.f b/SRC/cppsv.f index 5aa477d..3d3a44d 100644 --- a/SRC/cppsv.f +++ b/SRC/cppsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPSV( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPSV computes the solution to a complex system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -123,10 +121,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -142,7 +139,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cppsvx.f b/SRC/cppsvx.f index b9051a6..af42f6d 100644 --- a/SRC/cppsvx.f +++ b/SRC/cppsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB, * X, LDX, RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to *> compute the solution to a complex system of linear equations @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -84,11 +87,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -272,10 +274,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -286,10 +287,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -305,7 +305,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpptrf.f b/SRC/cpptrf.f index e99f033..60763f6 100644 --- a/SRC/cpptrf.f +++ b/SRC/cpptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPTRF( UPLO, N, AP, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPTRF computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A stored in packed format. @@ -41,11 +41,10 @@ *> A = U**H * U, if UPLO = 'U', or *> A = L * L**H, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -84,10 +83,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -98,10 +96,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -117,7 +114,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpptri.f b/SRC/cpptri.f index dcfbae5..f6b5662 100644 --- a/SRC/cpptri.f +++ b/SRC/cpptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPTRI( UPLO, N, AP, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPTRI computes the inverse of a complex Hermitian positive definite *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H *> computed by CPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -78,10 +77,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpptrs.f b/SRC/cpptrs.f index b9d85ac..28a9b63 100644 --- a/SRC/cpptrs.f +++ b/SRC/cpptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPPTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite matrix A in packed storage using the Cholesky *> factorization A = U**H*U or A = L*L**H computed by CPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,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/SRC/cpstf2.f b/SRC/cpstf2.f index 4ec6ea7..3478a39 100644 --- a/SRC/cpstf2.f +++ b/SRC/cpstf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -31,11 +31,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPSTF2 computes the Cholesky factorization with complete *> pivoting of a complex Hermitian positive semidefinite matrix A. @@ -48,11 +48,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -126,10 +125,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpstrf.f b/SRC/cpstrf.f index 976fd5e..d751c44 100644 --- a/SRC/cpstrf.f +++ b/SRC/cpstrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -31,11 +31,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPSTRF computes the Cholesky factorization with complete *> pivoting of a complex Hermitian positive semidefinite matrix A. @@ -48,11 +48,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -126,10 +125,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cptcon.f b/SRC/cptcon.f index fc014ad..a398b5c 100644 --- a/SRC/cptcon.f +++ b/SRC/cptcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTCON( N, D, E, ANORM, RCOND, RWORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTCON computes the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite tridiagonal matrix @@ -43,11 +43,10 @@ *> Norm(inv(A)) is computed by a direct method, and the reciprocal of *> the condition number is computed as *> RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,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 @@ -108,16 +106,14 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The method used is described in Nicholas J. Higham, "Efficient *> Algorithms for Computing the Condition Number of a Tridiagonal *> Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cpteqr.f b/SRC/cpteqr.f index 15a07e0..e3164d7 100644 --- a/SRC/cpteqr.f +++ b/SRC/cpteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric positive definite tridiagonal matrix by first factoring the @@ -52,11 +52,10 @@ *> tridiagonal form, however, may preclude the possibility of obtaining *> high relative accuracy in the small eigenvalues of the original *> matrix, if these eigenvalues range over many orders of magnitude.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -130,10 +129,9 @@ *> if INFO = N+i, i off-diagonal elements of the *> bidiagonal factor did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cptrfs.f b/SRC/cptrfs.f index ce1277d..3a4d3c8 100644 --- a/SRC/cptrfs.f +++ b/SRC/cptrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTRFS( UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -32,21 +32,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite *> and tridiagonal, and provides error bounds and backward error *> estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,16 +158,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cptsv.f b/SRC/cptsv.f index 11112d7..8f622e9 100644 --- a/SRC/cptsv.f +++ b/SRC/cptsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTSV( N, NRHS, D, E, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX B( LDB, * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTSV computes the solution to a complex system of linear equations *> A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal @@ -40,11 +40,10 @@ *> *> A is factored as A = L*D*L**H, and the factored form of A is then *> used to solve the system of equations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -100,10 +99,9 @@ *> computed. The factorization has not been completed *> unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cptsvx.f b/SRC/cptsvx.f index 756c05a..9859eed 100644 --- a/SRC/cptsvx.f +++ b/SRC/cptsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, * RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTSVX uses the factorization A = L*D*L**H to compute the solution *> to a complex system of linear equations A*X = B, where A is an @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -71,11 +74,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -215,10 +217,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpttrf.f b/SRC/cpttrf.f index 264081d..379153e 100644 --- a/SRC/cpttrf.f +++ b/SRC/cpttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTTRF( N, D, E, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTTRF computes the L*D*L**H factorization of a complex Hermitian *> positive definite tridiagonal matrix A. The factorization may also *> be regarded as having the form A = U**H *D*U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -77,10 +76,9 @@ *> be completed, while if k = N, the factorization was *> completed, but D(N) <= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cpttrs.f b/SRC/cpttrs.f index e8bb4ee..bd75b46 100644 --- a/SRC/cpttrs.f +++ b/SRC/cpttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTTRS( UPLO, N, NRHS, D, E, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX B( LDB, * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTTRS solves a tridiagonal system of the form *> A * X = B @@ -41,11 +41,10 @@ *> D is a diagonal matrix specified in the vector D, U (or L) is a unit *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in *> the vector E, and X and B are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +105,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/SRC/cptts2.f b/SRC/cptts2.f index 8603a07..390323a 100644 --- a/SRC/cptts2.f +++ b/SRC/cptts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CPTTS2( IUPLO, N, NRHS, D, E, B, LDB ) * @@ -28,11 +28,11 @@ * COMPLEX B( LDB, * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CPTTS2 solves a tridiagonal system of the form *> A * X = B @@ -40,11 +40,10 @@ *> D is a diagonal matrix specified in the vector D, U (or L) is a unit *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in *> the vector E, and X and B are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IUPLO *> \verbatim @@ -98,10 +97,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/crot.f b/SRC/crot.f index 6a93866..0e40045 100644 --- a/SRC/crot.f +++ b/SRC/crot.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CROT( N, CX, INCX, CY, INCY, C, S ) * @@ -29,19 +29,18 @@ * COMPLEX CX( * ), CY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CROT applies a plane rotation, where the cos (C) is real and the *> sin (S) is complex, and the vectors CX and CY are complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -88,10 +87,9 @@ *> [ -conjg(S) C ] *> where C*C + S*CONJG(S) = 1.0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cspcon.f b/SRC/cspcon.f index f799258..4067652 100644 --- a/SRC/cspcon.f +++ b/SRC/cspcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex symmetric packed matrix A using the @@ -42,11 +42,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/cspmv.f b/SRC/cspmv.f index 7d3539a..d503dc0 100644 --- a/SRC/cspmv.f +++ b/SRC/cspmv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPMV( UPLO, N, ALPHA, AP, X, INCX, BETA, Y, INCY ) * @@ -29,11 +29,11 @@ * COMPLEX AP( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPMV performs the matrix-vector operation *> @@ -41,11 +41,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -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/SRC/cspr.f b/SRC/cspr.f index eb28257..f1659c7 100644 --- a/SRC/cspr.f +++ b/SRC/cspr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPR( UPLO, N, ALPHA, X, INCX, AP ) * @@ -29,11 +29,11 @@ * COMPLEX AP( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPR performs the symmetric rank 1 operation *> @@ -41,11 +41,10 @@ *> *> where alpha is a complex scalar, x is an n element vector and A is an *> n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> not be set, they are assumed to be zero, and on exit they *> are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csprfs.f b/SRC/csprfs.f index b84474d..7052913 100644 --- a/SRC/csprfs.f +++ b/SRC/csprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -32,21 +32,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,16 +155,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cspsv.f b/SRC/cspsv.f index ebcde72..7102c72 100644 --- a/SRC/cspsv.f +++ b/SRC/cspsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPSV computes the solution to a complex system of linear equations *> A * X = B, @@ -47,11 +47,10 @@ *> triangular matrices, D is symmetric and block diagonal with 1-by-1 *> and 2-by-2 diagonal blocks. The factored form of A is then used to *> solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, so the solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -160,7 +157,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cspsvx.f b/SRC/cspsvx.f index 2c7be9d..a3a9566 100644 --- a/SRC/cspsvx.f +++ b/SRC/cspsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, * LDX, RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPSVX uses the diagonal pivoting factorization A = U*D*U**T or *> A = L*D*L**T to compute the solution to a complex system of linear @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -72,11 +75,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -238,10 +240,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -252,10 +253,9 @@ * *> \ingroup complexOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -271,7 +271,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/csptrf.f b/SRC/csptrf.f index 2842bd4..ed0c23e 100644 --- a/SRC/csptrf.f +++ b/SRC/csptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPTRF( UPLO, N, AP, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPTRF computes the factorization of a complex symmetric matrix A *> stored in packed format using the Bunch-Kaufman diagonal pivoting @@ -44,11 +44,10 @@ *> where U (or L) is a product of permutation and unit upper (lower) *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -114,10 +112,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 5-96 - Based on modifications by J. Lewis, Boeing Computer Services @@ -156,7 +153,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/csptri.f b/SRC/csptri.f index 0981022..e1132c4 100644 --- a/SRC/csptri.f +++ b/SRC/csptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPTRI( UPLO, N, AP, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPTRI computes the inverse of a complex symmetric indefinite matrix *> A in packed storage using the factorization A = U*D*U**T or *> A = L*D*L**T computed by CSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csptrs.f b/SRC/csptrs.f index 6398c7e..f896167 100644 --- a/SRC/csptrs.f +++ b/SRC/csptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSPTRS solves a system of linear equations A*X = B with a complex *> symmetric matrix A stored in packed format using the factorization *> A = U*D*U**T or A = L*D*L**T computed by CSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,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/SRC/csrscl.f b/SRC/csrscl.f index 3ddb05a..485f1fc 100644 --- a/SRC/csrscl.f +++ b/SRC/csrscl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSRSCL( N, SA, SX, INCX ) * @@ -28,20 +28,19 @@ * COMPLEX SX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSRSCL multiplies an n-element complex vector x by the real scalar *> 1/a. This is done without overflow or underflow as long as *> the final result x/a does not overflow or underflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -69,10 +68,9 @@ *> The increment between successive values of the vector SX. *> > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cstedc.f b/SRC/cstedc.f index 54c5d1d..a3af791 100644 --- a/SRC/cstedc.f +++ b/SRC/cstedc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK, * LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTEDC computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the divide and conquer method. @@ -49,11 +49,10 @@ *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. See SLAED3 for details. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -190,10 +189,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -204,18 +202,12 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE CSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK, $ LRWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/cstegr.f b/SRC/cstegr.f index 1222baf..86fa365 100644 --- a/SRC/cstegr.f +++ b/SRC/cstegr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, @@ -33,11 +33,11 @@ * COMPLEX Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTEGR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -59,11 +59,10 @@ *> NaNs. Normal execution may create these exceptiona values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -232,10 +231,9 @@ *> the nonzero error code returned by SLARRE or *> CLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -246,19 +244,13 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, LBNL/NERSC, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE CSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, diff --git a/SRC/cstein.f b/SRC/cstein.f index 691a764..a01fce0 100644 --- a/SRC/cstein.f +++ b/SRC/cstein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK, * IWORK, IFAIL, INFO ) @@ -31,11 +31,11 @@ * COMPLEX Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTEIN computes the eigenvectors of a real symmetric tridiagonal *> matrix T corresponding to specified eigenvalues, using inverse @@ -49,11 +49,10 @@ *> transformation to the eigenvectors of a complex Hermitian matrix *> which was reduced to tridiagonal form. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -153,10 +152,12 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge *> in MAXITS iterations. Their indices are stored in *> array IFAIL. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> MAXITS INTEGER, default = 5 *> The maximum number of iterations performed. *> @@ -164,10 +165,9 @@ *> The number of iterations performed after norm growth *> criterion is satisfied, should be at least 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cstemr.f b/SRC/cstemr.f index 4e605e7..dde431a 100644 --- a/SRC/cstemr.f +++ b/SRC/cstemr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, @@ -34,11 +34,11 @@ * COMPLEX Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTEMR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -107,11 +107,10 @@ *> Since LAPACK drivers overwrite the matrix data with the eigenvectors, *> CSTEMR accepts complex workspace to facilitate interoperability *> with CUNMTR or CUPMTR. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -303,10 +302,9 @@ *> the nonzero error code returned by SLARRE or *> CLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -317,21 +315,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE CSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, diff --git a/SRC/csteqr.f b/SRC/csteqr.f index 6fb00c9..175e061 100644 --- a/SRC/csteqr.f +++ b/SRC/csteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -29,22 +29,21 @@ * COMPLEX Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the implicit QL or QR method. *> The eigenvectors of a full or band complex Hermitian matrix can also *> be found if CHETRD or CHPTRD or CHBTRD has been used to reduce this *> matrix to tridiagonal form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -117,10 +116,9 @@ *> matrix which is unitarily similar to the original *> matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csycon.f b/SRC/csycon.f index b2dfbc8..5d468bd 100644 --- a/SRC/csycon.f +++ b/SRC/csycon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex symmetric matrix A using the factorization @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,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/SRC/csyconv.f b/SRC/csyconv.f index cec5068..d00e4a9 100644 --- a/SRC/csyconv.f +++ b/SRC/csyconv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYCONV convert A given by TRF into L and D and vice-versa. *> Get Non-diag elements of D (returned in workspace) and *> apply or reverse permutation done in TRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,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/SRC/csyequb.f b/SRC/csyequb.f index 421e42a..c4cb24a 100644 --- a/SRC/csyequb.f +++ b/SRC/csyequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * @@ -30,11 +30,11 @@ * REAL S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYEQUB computes row and column scalings intended to equilibrate a *> symmetric matrix A and reduce its condition number @@ -44,11 +44,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -113,10 +112,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -127,19 +125,14 @@ * *> \ingroup complexSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par References: +* ================ *> -*> Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization", -*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. -*> DOI 10.1023/B:NUMA.0000016606.32820.69 +*> Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n +*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n +*> DOI 10.1023/B:NUMA.0000016606.32820.69 \n *> Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * diff --git a/SRC/csymv.f b/SRC/csymv.f index ee7caed..ea8f38e 100644 --- a/SRC/csymv.f +++ b/SRC/csymv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYMV performs the matrix-vector operation *> @@ -41,11 +41,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -142,10 +141,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/SRC/csyr.f b/SRC/csyr.f index b6b1ed7..fe12790 100644 --- a/SRC/csyr.f +++ b/SRC/csyr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYR( UPLO, N, ALPHA, X, INCX, A, LDA ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYR performs the symmetric rank 1 operation *> @@ -41,11 +41,10 @@ *> *> where alpha is a complex scalar, x is an n element vector and A is an *> n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> max( 1, N ). *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csyrfs.f b/SRC/csyrfs.f index bd070ff..9d25ecd 100644 --- a/SRC/csyrfs.f +++ b/SRC/csyrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -32,20 +32,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and *> provides error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -168,16 +167,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csyrfsx.f b/SRC/csyrfsx.f index 216d39f..2444bb8 100644 --- a/SRC/csyrfsx.f +++ b/SRC/csyrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYRFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -386,10 +383,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csysv.f b/SRC/csysv.f index f9233e4..19ab3bc 100644 --- a/SRC/csysv.f +++ b/SRC/csysv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, * LWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYSV computes the solution to a complex system of linear equations *> A * X = B, @@ -48,11 +48,10 @@ *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then *> used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csysvx.f b/SRC/csysvx.f index 34b8688..1977c6b 100644 --- a/SRC/csysvx.f +++ b/SRC/csysvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYSVX uses the diagonal pivoting factorization to compute the *> solution to a complex system of linear equations A * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -74,11 +77,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -265,10 +267,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csysvxx.f b/SRC/csysvxx.f index 652e08b..e867c19 100644 --- a/SRC/csysvxx.f +++ b/SRC/csysvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYSVXX uses the diagonal pivoting factorization to compute the *> solution to a complex system of linear equations A * X = B, where @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what CSYSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -108,11 +109,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(R) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -490,10 +490,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csyswapr.f b/SRC/csyswapr.f index ec98d5d..3d7a084 100644 --- a/SRC/csyswapr.f +++ b/SRC/csyswapr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYSWAPR( UPLO, N, A, LDA, I1, I2) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * COMPLEX A( LDA, N ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYSWAPR applies an elementary permutation on the rows and the columns of *> a symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,9 @@ *> I2 is INTEGER *> Index of the second row to swap *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csytf2.f b/SRC/csytf2.f index 11c0d21..4fb4665 100644 --- a/SRC/csytf2.f +++ b/SRC/csytf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTF2 computes the factorization of a complex symmetric matrix A *> using the Bunch-Kaufman diagonal pivoting method: @@ -45,11 +45,10 @@ *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -124,22 +122,10 @@ * *> \ingroup complexSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 09-29-06 - patch from -*> Bobby Cheng, MathWorks -*> -*> Replace l.209 and l.377 -*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN -*> by -*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN -*> -*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -174,9 +160,25 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> \verbatim +*> +*> 09-29-06 - patch from +*> Bobby Cheng, MathWorks *> +*> Replace l.209 and l.377 +*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN +*> by +*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN +*> +*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services +*> Company +*> \endverbatim +* * ===================================================================== SUBROUTINE CSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * diff --git a/SRC/csytrf.f b/SRC/csytrf.f index f3206b3..4da4369 100644 --- a/SRC/csytrf.f +++ b/SRC/csytrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTRF computes the factorization of a complex symmetric matrix A *> using the Bunch-Kaufman diagonal pivoting method. The form of the @@ -46,11 +46,10 @@ *> with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup complexSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where @@ -180,7 +177,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/csytri.f b/SRC/csytri.f index c41a061..2229ded 100644 --- a/SRC/csytri.f +++ b/SRC/csytri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTRI computes the inverse of a complex symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> CSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csytri2.f b/SRC/csytri2.f index 92f9ec7..152187a 100644 --- a/SRC/csytri2.f +++ b/SRC/csytri2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTRI2 computes the inverse of a COMPLEX hermitian indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> CSYTRF. CSYTRI2 sets the LEADING DIMENSION of the workspace *> before calling CSYTRI2X that actually computes the inverse. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csytri2x.f b/SRC/csytri2x.f index fd8c32b..d230ee8 100644 --- a/SRC/csytri2x.f +++ b/SRC/csytri2x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), WORK( N+NB+1,* ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTRI2X computes the inverse of a real symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> CSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/csytrs.f b/SRC/csytrs.f index 60c1178..8fb084e 100644 --- a/SRC/csytrs.f +++ b/SRC/csytrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTRS solves a system of linear equations A*X = B with a complex *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by CSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/csytrs2.f b/SRC/csytrs2.f index 81222c0..ec1e16c 100644 --- a/SRC/csytrs2.f +++ b/SRC/csytrs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, * WORK, INFO ) @@ -30,20 +30,19 @@ * COMPLEX A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CSYTRS2 solves a system of linear equations A*X = B with a COMPLEX *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by CSYTRF and converted by CSYCONV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/SRC/ctbcon.f b/SRC/ctbcon.f index 4508d9f..5def298 100644 --- a/SRC/ctbcon.f +++ b/SRC/ctbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK, * RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBCON estimates the reciprocal of the condition number of a *> triangular band matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -127,10 +126,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/SRC/ctbrfs.f b/SRC/ctbrfs.f index 67bc1b2..15c90f5 100644 --- a/SRC/ctbrfs.f +++ b/SRC/ctbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular band @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by CTBTRS or some other *> means before entering this routine. CTBRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -172,10 +171,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/SRC/ctbtrs.f b/SRC/ctbtrs.f index 906c424..a513945 100644 --- a/SRC/ctbtrs.f +++ b/SRC/ctbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, INFO ) @@ -29,11 +29,11 @@ * COMPLEX AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTBTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular band matrix of order N, and B is an *> N-by-NRHS matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ctfsm.f b/SRC/ctfsm.f index 8b6e15c..df67ece 100644 --- a/SRC/ctfsm.f +++ b/SRC/ctfsm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, * B, LDB ) @@ -30,11 +30,11 @@ * COMPLEX A( 0: * ), B( 0: LDB-1, 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for A in RFP Format. *> @@ -50,11 +50,10 @@ *> A is in Rectangular Full Packed (RFP) Format. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -174,10 +173,9 @@ *> max( 1, m ). *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -188,10 +186,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -295,7 +292,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctftri.f b/SRC/ctftri.f index ea60649..aae8af7 100644 --- a/SRC/ctftri.f +++ b/SRC/ctftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTFTRI computes the inverse of a triangular matrix A stored in RFP *> format. *> *> This is a Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -98,10 +97,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -112,10 +110,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -219,7 +216,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctfttp.f b/SRC/ctfttp.f index 501194a..5622989 100644 --- a/SRC/ctfttp.f +++ b/SRC/ctfttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTFTTP( TRANSR, UPLO, N, ARF, AP, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX AP( 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTFTTP copies a triangular matrix A from rectangular full packed *> format (TF) to standard packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -85,10 +84,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 @@ -99,10 +97,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -206,7 +203,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctfttr.f b/SRC/ctfttr.f index 71479ed..e23e9e3 100644 --- a/SRC/ctfttr.f +++ b/SRC/ctfttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTFTTR copies a triangular matrix A from rectangular full packed *> format (TF) to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -93,10 +92,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 @@ -107,10 +105,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -214,7 +211,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctgevc.f b/SRC/ctgevc.f index e9ba5b0..bc0912a 100644 --- a/SRC/ctgevc.f +++ b/SRC/ctgevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL, * LDVL, VR, LDVR, MM, M, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGEVC computes some or all of the right and/or left eigenvectors of *> a pair of complex matrices (S,P), where S and P are upper triangular. @@ -63,11 +63,10 @@ *> If Q and Z are the unitary factors from the generalized Schur *> factorization of a matrix pair (A,B), then Z*X and Q*Y *> are the matrices of right and left eigenvectors of (A,B). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -203,10 +202,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/SRC/ctgex2.f b/SRC/ctgex2.f index 96076b4..75d4810 100644 --- a/SRC/ctgex2.f +++ b/SRC/ctgex2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, J1, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22) *> in an upper triangular matrix pair (A, B) by an unitary equivalence @@ -49,11 +49,10 @@ *> Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H *> Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -145,10 +144,9 @@ *> from generalized Schur form; the problem is ill- *> conditioned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -159,26 +157,28 @@ * *> \ingroup complexGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, -*> Umea University, S-901 87 Umea, Sweden. +*> \par Further Details: +* ===================== *> *> In the current code both weak and strong stability tests are *> performed. The user can omit the strong stability test by changing *> the internal logical parameter WANDS to .FALSE.. See ref. [2] for *> details. +* +*> \par Contributors: +* ================== +*> +*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, +*> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> +*> \n *> [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified *> Eigenvalues of a Regular Matrix Pair (A, B) and Condition *> Estimation: Theory, Algorithms and Software, Report UMINF-94.04, @@ -186,8 +186,6 @@ *> Sweden, 1994. Also as LAPACK Working Note 87. To appear in *> Numerical Algorithms, 1996. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, $ LDZ, J1, INFO ) diff --git a/SRC/ctgexc.f b/SRC/ctgexc.f index 7faed5c..6abffec 100644 --- a/SRC/ctgexc.f +++ b/SRC/ctgexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, IFST, ILST, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGEXC reorders the generalized Schur decomposition of a complex *> matrix pair (A,B), using an unitary equivalence transformation @@ -49,11 +49,10 @@ *> *> Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H *> Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -155,10 +154,9 @@ *> and ILST points to the first row of the current *> position of the block being moved. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -169,28 +167,27 @@ * *> \ingroup complexGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> +*> \n *> [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified *> Eigenvalues of a Regular Matrix Pair (A, B) and Condition *> Estimation: Theory, Algorithms and Software, Report *> UMINF - 94.04, Department of Computing Science, Umea University, *> S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87. *> To appear in Numerical Algorithms, 1996. -*> +*> \n *> [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the *> Separation between Regular Matrix Pairs, Report UMINF - 93.23, @@ -199,8 +196,6 @@ *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, *> 1996. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, $ LDZ, IFST, ILST, INFO ) diff --git a/SRC/ctgsen.f b/SRC/ctgsen.f index b9a1756..491f6b4 100644 --- a/SRC/ctgsen.f +++ b/SRC/ctgsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB, * ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF, @@ -36,11 +36,11 @@ * $ BETA( * ), Q( LDQ, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGSEN reorders the generalized Schur decomposition of a complex *> matrix pair (A, B) (in terms of an unitary equivalence trans- @@ -65,11 +65,10 @@ *> and norms of "projections" onto left and right eigenspaces w.r.t. *> the selected cluster in the (1,1)-block. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -282,10 +281,9 @@ *> (A, B) may have been partially reordered. *> If requested, 0 is returned in DIF(*), PL and PR. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -296,10 +294,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> CTGSEN first collects the selected eigenvalues by computing unitary @@ -400,26 +397,29 @@ *> based estimate DIF is not wanted (see CLATDF), then the parameter *> IDIFJB (see below) should be changed from 3 to 4 (routine CLATDF *> (IJOB = 2 will be used)). See CTGSYL for more details. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> References -*> ========== +* +*> \par References: +* ================ *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> +*> \n *> [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified *> Eigenvalues of a Regular Matrix Pair (A, B) and Condition *> Estimation: Theory, Algorithms and Software, Report *> UMINF - 94.04, Department of Computing Science, Umea University, *> S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87. *> To appear in Numerical Algorithms, 1996. -*> +*> \n *> [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the *> Separation between Regular Matrix Pairs, Report UMINF - 93.23, @@ -428,8 +428,6 @@ *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, *> 1996. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB, $ ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF, diff --git a/SRC/ctgsja.f b/SRC/ctgsja.f index 73f0e9b..aee342b 100644 --- a/SRC/ctgsja.f +++ b/SRC/ctgsja.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B, * LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV, @@ -34,11 +34,11 @@ * $ U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGSJA computes the generalized singular value decomposition (GSVD) *> of two complex upper triangular (or trapezoidal) matrices A and B. @@ -124,11 +124,10 @@ *> The computation of the unitary transformation matrices U, V or Q *> is optional. These matrices may either be formed explicitly, or they *> may be postmultiplied into input matrices U1, V1, or Q1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -333,20 +332,19 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> = 1: the procedure does not converge after MAXIT cycles. *> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> *> \verbatim *> MAXIT INTEGER *> MAXIT specifies the total loops that the iterative procedure *> may take. If after MAXIT cycles, the routine fails to *> converge, we return INFO = 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -357,10 +355,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> CTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce @@ -375,7 +372,6 @@ *> C1**2 + S1**2 = I, *> *> and R1 is an L-by-L nonsingular upper triangular matrix. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctgsna.f b/SRC/ctgsna.f index 474fbd8..b864eda 100644 --- a/SRC/ctgsna.f +++ b/SRC/ctgsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL, * LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK, @@ -34,22 +34,21 @@ * $ VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or eigenvectors of a matrix pair (A, B). *> *> (A, B) must be in generalized Schur canonical form, that is, A and *> B are both upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -205,10 +204,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 @@ -219,10 +217,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of the i-th generalized @@ -275,13 +272,18 @@ *> EPS * norm(A, B) / DIF(i). *> *> See ref. [2-3] for more details and further references. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -302,7 +304,6 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. *> To appear in ACM Trans. on Math. Software, Vol 22, No 1, 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctgsy2.f b/SRC/ctgsy2.f index 6bcda94..879b2b2 100644 --- a/SRC/ctgsy2.f +++ b/SRC/ctgsy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, @@ -32,11 +32,11 @@ * $ D( LDD, * ), E( LDE, * ), F( LDF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGSY2 solves the generalized Sylvester equation *> @@ -73,11 +73,10 @@ *> of an upper bound on the separation between to matrix pairs. Then *> the input (A, D), (B, E) are sub-pencils of two matrix pairs in *> CTGSYL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -236,10 +235,9 @@ *> >0: The matrix pairs (A, D) and (B, E) have common or very *> close eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -250,18 +248,12 @@ * *> \ingroup complexSYauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE CTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, $ LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, diff --git a/SRC/ctgsyl.f b/SRC/ctgsyl.f index 79efe85..9d142cf 100644 --- a/SRC/ctgsyl.f +++ b/SRC/ctgsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK, @@ -35,11 +35,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTGSYL solves the generalized Sylvester equation: *> @@ -79,11 +79,10 @@ *> reciprocal of the smallest singular value of Z. *> *> This is a level-3 BLAS algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -252,10 +251,9 @@ *> >0: (A, D) and (B, E) have common or very close *> eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -266,15 +264,14 @@ * *> \ingroup complexSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> *> [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the @@ -283,18 +280,16 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, *> No 1, 1996. -*> +*> \n *> [2] B. Kagstrom, A Perturbation Analysis of the Generalized Sylvester *> Equation (AR - LB, DR - LE ) = (C, F), SIAM J. Matrix Anal. *> Appl., 15(4):1045-1060, 1994. -*> +*> \n *> [3] B. Kagstrom and L. Westin, Generalized Schur Methods with *> Condition Estimators for Solving the Generalized Sylvester *> Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7, *> July 1989, pp 745-751. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, $ LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK, diff --git a/SRC/ctpcon.f b/SRC/ctpcon.f index e8de46f..116a4af 100644 --- a/SRC/ctpcon.f +++ b/SRC/ctpcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, RWORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPCON estimates the reciprocal of the condition number of a packed *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -114,10 +113,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/SRC/ctpmqrt.f b/SRC/ctpmqrt.f index 91a3620..ad820db 100644 --- a/SRC/ctpmqrt.f +++ b/SRC/ctpmqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT, * A, LDA, B, LDB, WORK, INFO ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPMQRT applies a complex orthogonal matrix Q obtained from a *> "triangular-pentagonal" complex block reflector H to a general *> complex matrix C, which consists of two blocks A and B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -167,10 +166,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 @@ -181,10 +179,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The columns of the pentagonal matrix V contain the elementary reflectors @@ -213,7 +210,6 @@ *> If TRANS='N' and SIDE='R', C is on exit replaced with C * Q. *> *> If TRANS='C' and SIDE='R', C is on exit replaced with C * Q**H. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctpqrt.f b/SRC/ctpqrt.f index 3a88bc4..369ddbe 100644 --- a/SRC/ctpqrt.f +++ b/SRC/ctpqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK, * INFO ) @@ -28,21 +28,20 @@ * COMPLEX A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPQRT computes a blocked QR factorization of a complex *> "triangular-pentagonal" matrix C, which is composed of a *> triangular block A and pentagonal block B, using the compact *> WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,11 +136,11 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The input matrix C is a (N+M)-by-N matrix *> *> C = [ A ] @@ -185,7 +183,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = [T1 T2 ... TB]. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctpqrt2.f b/SRC/ctpqrt2.f index 8a57e99..44f215e 100644 --- a/SRC/ctpqrt2.f +++ b/SRC/ctpqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) * @@ -27,20 +27,19 @@ * COMPLEX A( LDA, * ), B( LDB, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPQRT2 computes a QR factorization of a complex "triangular-pentagonal" *> matrix C, which is composed of a triangular block A and pentagonal block B, *> using the compact WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -111,10 +110,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 @@ -125,10 +123,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The input matrix C is a (N+M)-by-N matrix @@ -171,7 +168,6 @@ *> *> where W**H is the conjugate transpose of W and T is the upper triangular *> factor of the block reflector. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctprfb.f b/SRC/ctprfb.f index c39cb0d..5d4d130 100644 --- a/SRC/ctprfb.f +++ b/SRC/ctprfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, * V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK ) @@ -30,20 +30,20 @@ * $ V( LDV, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPRFB applies a complex "triangular-pentagonal" block reflector H or its *> conjugate transpose H**H to a complex matrix C, which is composed of two *> blocks A and B, either from the left or right. *> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -185,10 +185,9 @@ *> If SIDE = 'L', LDWORK >= K; *> if SIDE = 'R', LDWORK >= M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -199,10 +198,9 @@ * *> \ingroup complexOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix C is a composite matrix formed from blocks A and B. @@ -247,7 +245,6 @@ *> If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L. *> *> If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctprfs.f b/SRC/ctprfs.f index 0cf567d..307eca8 100644 --- a/SRC/ctprfs.f +++ b/SRC/ctprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular packed @@ -43,11 +43,10 @@ *> The solution matrix X must be computed by CTPTRS or some other *> means before entering this routine. CTPRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -158,10 +157,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/SRC/ctptri.f b/SRC/ctptri.f index 2d8b2b5..49e9448 100644 --- a/SRC/ctptri.f +++ b/SRC/ctptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPTRI( UPLO, DIAG, N, AP, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPTRI computes the inverse of a complex upper or lower triangular *> matrix A stored in packed format. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -83,10 +82,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -97,10 +95,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A triangular matrix A can be transferred to packed storage using one @@ -115,7 +112,6 @@ *> 1 CONTINUE 1 CONTINUE *> JC = JC + J JC = JC + N - J + 1 *> 2 CONTINUE 2 CONTINUE -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctptrs.f b/SRC/ctptrs.f index fde1520..3f3ac05 100644 --- a/SRC/ctptrs.f +++ b/SRC/ctptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> where A is a triangular matrix of order N stored in packed format, *> and B is an N-by-NRHS matrix. A check is made to verify that A is *> nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ctpttf.f b/SRC/ctpttf.f index d97e4e3..9b49591 100644 --- a/SRC/ctpttf.f +++ b/SRC/ctpttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * COMPLEX AP( 0: * ), ARF( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPTTF copies a triangular matrix A from standard packed format (TP) *> to rectangular full packed format (TF). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -84,10 +83,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 @@ -98,10 +96,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -205,7 +202,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctpttr.f b/SRC/ctpttr.f index 9a3b0b8..291916f 100644 --- a/SRC/ctpttr.f +++ b/SRC/ctpttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTPTTR( UPLO, N, AP, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTPTTR copies a triangular matrix A from standard packed format (TP) *> to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/ctrcon.f b/SRC/ctrcon.f index bbf7ddd..0ad0634 100644 --- a/SRC/ctrcon.f +++ b/SRC/ctrcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK, * RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRCON estimates the reciprocal of the condition number of a *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -121,10 +120,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/SRC/ctrevc.f b/SRC/ctrevc.f index acb3e54..4f6d584 100644 --- a/SRC/ctrevc.f +++ b/SRC/ctrevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, MM, M, WORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTREVC computes some or all of the right and/or left eigenvectors of *> a complex upper triangular matrix T. @@ -57,11 +57,10 @@ *> input matrix. If Q is the unitary factor that reduces a matrix A to *> Schur form T, then Q*X and Q*Y are the matrices of right and left *> eigenvectors of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \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 @@ -202,10 +200,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The algorithm used in this program is basically backward (forward) @@ -215,7 +212,6 @@ *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x| + |y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctrexc.f b/SRC/ctrexc.f index 9722600..10ae276 100644 --- a/SRC/ctrexc.f +++ b/SRC/ctrexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX Q( LDQ, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTREXC reorders the Schur factorization of a complex matrix *> A = Q*T*Q**H, so that the diagonal element of T with row index IFST @@ -41,11 +41,10 @@ *> The Schur form T is reordered by a unitary similarity transformation *> Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by *> postmultplying it with Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -109,10 +108,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/SRC/ctrrfs.f b/SRC/ctrrfs.f index ad42418..30cfc42 100644 --- a/SRC/ctrrfs.f +++ b/SRC/ctrrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by CTRTRS or some other *> means before entering this routine. CTRRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,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/SRC/ctrsen.f b/SRC/ctrsen.f index ef22122..6e1b395 100644 --- a/SRC/ctrsen.f +++ b/SRC/ctrsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, W, M, S, * SEP, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRSEN reorders the Schur factorization of a complex matrix *> A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in @@ -45,11 +45,10 @@ *> *> Optionally the routine computes the reciprocal condition numbers of *> the cluster of eigenvalues and/or the invariant subspace. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -174,10 +173,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 @@ -188,10 +186,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> CTRSEN first collects the selected eigenvalues by computing a unitary @@ -261,7 +258,6 @@ *> error in the computed right invariant subspace is *> *> EPS * norm(T) / SEP -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctrsna.f b/SRC/ctrsna.f index a090202..c076239 100644 --- a/SRC/ctrsna.f +++ b/SRC/ctrsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, S, SEP, MM, M, WORK, LDWORK, RWORK, @@ -33,20 +33,19 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or right eigenvectors of a complex upper triangular *> matrix T (or of any matrix Q*T*Q**H with Q unitary). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -189,10 +188,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 @@ -203,10 +201,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of an eigenvalue lambda is @@ -245,7 +242,6 @@ *> is given by *> *> EPS * norm(T) / SEP(i) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctrsyl.f b/SRC/ctrsyl.f index fea187f..8a5e08e 100644 --- a/SRC/ctrsyl.f +++ b/SRC/ctrsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, * LDC, SCALE, INFO ) @@ -30,11 +30,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRSYL solves the complex Sylvester matrix equation: *> @@ -45,11 +45,10 @@ *> M-by-M and B is N-by-N; the right hand side C and the solution X are *> M-by-N; and scale is an output scale factor, set <= 1 to avoid *> overflow in X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANA *> \verbatim @@ -141,10 +140,9 @@ *> values were used to solve the equation (but the matrices *> A and B are unchanged). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ctrti2.f b/SRC/ctrti2.f index 5c11fd7..3eb7801 100644 --- a/SRC/ctrti2.f +++ b/SRC/ctrti2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRTI2( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRTI2 computes the inverse of a complex upper or lower triangular *> matrix. *> *> This is the Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/ctrtri.f b/SRC/ctrtri.f index 71f9f23..7e6a5a6 100644 --- a/SRC/ctrtri.f +++ b/SRC/ctrtri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRTRI( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRTRI computes the inverse of a complex upper or lower triangular *> matrix A. *> *> This is the Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ctrtrs.f b/SRC/ctrtrs.f index 70ccad2..7e9bc9f 100644 --- a/SRC/ctrtrs.f +++ b/SRC/ctrtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, * INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular matrix of order N, and B is an N-by-NRHS *> matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> indicating that the matrix is singular and the solutions *> X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ctrttf.f b/SRC/ctrttf.f index 2fcb8da..089efe3 100644 --- a/SRC/ctrttf.f +++ b/SRC/ctrttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRTTF copies a triangular matrix A from standard full format (TR) *> to rectangular full packed format (TF) . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -93,10 +92,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 @@ -107,10 +105,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -214,7 +211,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctrttp.f b/SRC/ctrttp.f index 0ed6028..9b44f44 100644 --- a/SRC/ctrttp.f +++ b/SRC/ctrttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTRTTP( UPLO, N, A, LDA, AP, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTRTTP copies a triangular matrix A from full format (TR) to standard *> packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/ctzrqf.f b/SRC/ctzrqf.f index 918fa2e..06805c7 100644 --- a/SRC/ctzrqf.f +++ b/SRC/ctzrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTZRQF( M, N, A, LDA, TAU, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine CTZRZF. *> @@ -44,11 +44,10 @@ *> *> where Z is an N-by-N unitary matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -91,10 +90,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 @@ -105,10 +103,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The factorization is obtained by Householder's method. The kth @@ -136,7 +133,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ctzrzf.f b/SRC/ctzrzf.f index 95945e1..8c27b0e 100644 --- a/SRC/ctzrzf.f +++ b/SRC/ctzrzf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CTZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CTZRZF reduces the M-by-N ( M<=N ) complex upper trapezoidal matrix A *> to upper triangular form by means of unitary transformations. @@ -42,11 +42,10 @@ *> *> where Z is an N-by-N unitary matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -108,10 +107,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 @@ -122,14 +120,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -156,7 +155,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/cunbdb.f b/SRC/cunbdb.f index 1f14986..dfa3da9 100644 --- a/SRC/cunbdb.f +++ b/SRC/cunbdb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, * X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, @@ -34,11 +34,11 @@ * $ X21( LDX21, * ), X22( LDX22, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNBDB simultaneously bidiagonalizes the blocks of an M-by-M *> partitioned unitary matrix X: @@ -60,11 +60,10 @@ *> *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented *> implicitly by angles THETA, PHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -247,10 +246,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 @@ -261,10 +259,9 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The bidiagonal blocks B11, B12, B21, and B22 are represented @@ -277,15 +274,14 @@ *> P1, P2, Q1, and Q2 are represented as products of elementary *> reflectors. See CUNCSD for details on generating P1, P2, Q1, and Q2 *> using CUNGQR and CUNGLQ. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE CUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, $ X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, diff --git a/SRC/cuncsd.f b/SRC/cuncsd.f index ad81209..26d1f00 100644 --- a/SRC/cuncsd.f +++ b/SRC/cuncsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE CUNCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, * SIGNS, M, P, Q, X11, LDX11, X12, @@ -40,11 +40,11 @@ * $ * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNCSD computes the CS decomposition of an M-by-M partitioned *> unitary matrix X: @@ -61,11 +61,10 @@ *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in *> which R = MIN(P,M-P,Q,M-Q). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -293,17 +292,16 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: CBBCSD did not converge. See the description of RWORK *> above for details. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. -*> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cung2l.f b/SRC/cung2l.f index 731d358..ebe417a 100644 --- a/SRC/cung2l.f +++ b/SRC/cung2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNG2L( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNG2L generates an m by n complex matrix Q with orthonormal columns, *> which is defined as the last n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by CGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cung2r.f b/SRC/cung2r.f index 18b129e..01c32f1 100644 --- a/SRC/cung2r.f +++ b/SRC/cung2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNG2R( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNG2R generates an m by n complex matrix Q with orthonormal columns, *> which is defined as the first n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by CGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cungbr.f b/SRC/cungbr.f index 13e333c..cd76c8e 100644 --- a/SRC/cungbr.f +++ b/SRC/cungbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGBR generates one of the complex unitary matrices Q or P**H *> determined by CGEBRD when reducing a complex matrix A to bidiagonal @@ -52,11 +52,10 @@ *> rows of P**H, where n >= m >= k; *> if k >= n, P**H = G(n-1) . . . G(2) G(1) and CUNGBR returns P**H as *> an N-by-N matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -142,10 +141,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/SRC/cunghr.f b/SRC/cunghr.f index 8288e16..b160bdf 100644 --- a/SRC/cunghr.f +++ b/SRC/cunghr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,22 +27,21 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGHR generates a complex unitary matrix Q which is defined as the *> product of IHI-ILO elementary reflectors of order N, as returned by *> CGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,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/SRC/cungl2.f b/SRC/cungl2.f index 3557ff5..6233045 100644 --- a/SRC/cungl2.f +++ b/SRC/cungl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGL2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGL2 generates an m-by-n complex matrix Q with orthonormal rows, *> which is defined as the first m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k)**H . . . H(2)**H H(1)**H *> *> as returned by CGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -98,10 +97,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cunglq.f b/SRC/cunglq.f index 8b263bf..174f0d9 100644 --- a/SRC/cunglq.f +++ b/SRC/cunglq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGLQ generates an M-by-N complex matrix Q with orthonormal rows, *> which is defined as the first M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k)**H . . . H(2)**H H(1)**H *> *> as returned by CGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,9 @@ *> = 0: successful exit; *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cungql.f b/SRC/cungql.f index 59510b6..8ad6275 100644 --- a/SRC/cungql.f +++ b/SRC/cungql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGQL generates an M-by-N complex matrix Q with orthonormal columns, *> which is defined as the last N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by CGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cungqr.f b/SRC/cungqr.f index 71b9294..118da00 100644 --- a/SRC/cungqr.f +++ b/SRC/cungqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGQR generates an M-by-N complex matrix Q with orthonormal columns, *> which is defined as the first N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by CGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cungr2.f b/SRC/cungr2.f index 4189f2f..795ccc8 100644 --- a/SRC/cungr2.f +++ b/SRC/cungr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGR2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGR2 generates an m by n complex matrix Q with orthonormal rows, *> which is defined as the last m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1)**H H(2)**H . . . H(k)**H *> *> as returned by CGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cungrq.f b/SRC/cungrq.f index f6cca67..88332a6 100644 --- a/SRC/cungrq.f +++ b/SRC/cungrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGRQ generates an M-by-N complex matrix Q with orthonormal rows, *> which is defined as the last M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1)**H H(2)**H . . . H(k)**H *> *> as returned by CGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/cungtr.f b/SRC/cungtr.f index f31fe24..99535a8 100644 --- a/SRC/cungtr.f +++ b/SRC/cungtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNGTR generates a complex unitary matrix Q which is defined as the *> product of n-1 elementary reflectors of order N, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,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/SRC/cunm2l.f b/SRC/cunm2l.f index 5467ee7..2855dd7 100644 --- a/SRC/cunm2l.f +++ b/SRC/cunm2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNM2L overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by CGEQLF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/cunm2r.f b/SRC/cunm2r.f index 72244b7..dcd536d 100644 --- a/SRC/cunm2r.f +++ b/SRC/cunm2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNM2R overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by CGEQRF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/cunmbr.f b/SRC/cunmbr.f index 785e540..b5e0b11 100644 --- a/SRC/cunmbr.f +++ b/SRC/cunmbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> If VECT = 'Q', CUNMBR overwrites the general complex M-by-N matrix C *> with @@ -63,11 +63,10 @@ *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix: *> if k < nq, P = G(1) G(2) . . . G(k); *> if k >= nq, P = G(1) G(2) . . . G(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -181,10 +180,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/SRC/cunmhr.f b/SRC/cunmhr.f index 4fffdea..4bf11d0 100644 --- a/SRC/cunmhr.f +++ b/SRC/cunmhr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMHR overwrites the general complex M-by-N matrix C with *> @@ -47,11 +47,10 @@ *> IHI-ILO elementary reflectors, as returned by CGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -163,10 +162,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/SRC/cunml2.f b/SRC/cunml2.f index 196a653..2280f6a 100644 --- a/SRC/cunml2.f +++ b/SRC/cunml2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNML2 overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by CGELQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/cunmlq.f b/SRC/cunmlq.f index 7674046..ff98edc 100644 --- a/SRC/cunmlq.f +++ b/SRC/cunmlq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMLQ overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by CGELQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/cunmql.f b/SRC/cunmql.f index 72147b5..916d048 100644 --- a/SRC/cunmql.f +++ b/SRC/cunmql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMQL overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by CGEQLF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/cunmqr.f b/SRC/cunmqr.f index cbeb19a..97c0033 100644 --- a/SRC/cunmqr.f +++ b/SRC/cunmqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMQR overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by CGEQRF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/cunmr2.f b/SRC/cunmr2.f index 1c438c9..ba00fcb 100644 --- a/SRC/cunmr2.f +++ b/SRC/cunmr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMR2 overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by CGERQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/cunmr3.f b/SRC/cunmr3.f index 8d763b6..7fa2bb2 100644 --- a/SRC/cunmr3.f +++ b/SRC/cunmr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMR3 overwrites the general complex m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by CTZRZF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,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 @@ -165,15 +163,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/cunmrq.f b/SRC/cunmrq.f index 093ae0b..de5083b 100644 --- a/SRC/cunmrq.f +++ b/SRC/cunmrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMRQ overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by CGERQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/cunmrz.f b/SRC/cunmrz.f index 42c6e3a..d5c427a 100644 --- a/SRC/cunmrz.f +++ b/SRC/cunmrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMRZ overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by CTZRZF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,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 @@ -176,15 +174,15 @@ * *> \ingroup complexOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/cunmtr.f b/SRC/cunmtr.f index a4247d1..11310b0 100644 --- a/SRC/cunmtr.f +++ b/SRC/cunmtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUNMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUNMTR overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -156,10 +155,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/SRC/cupgtr.f b/SRC/cupgtr.f index 3b0eb54..0a22dbb 100644 --- a/SRC/cupgtr.f +++ b/SRC/cupgtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX AP( * ), Q( LDQ, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUPGTR generates a complex unitary matrix Q which is defined as the *> product of n-1 elementary reflectors H(i) of order n, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/cupmtr.f b/SRC/cupmtr.f index ca04a08..132b6f0 100644 --- a/SRC/cupmtr.f +++ b/SRC/cupmtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE CUPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, * INFO ) @@ -29,11 +29,11 @@ * COMPLEX AP( * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> CUPMTR overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -134,10 +133,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/SRC/dbbcsd.f b/SRC/dbbcsd.f index 23aaf53..0abc792 100644 --- a/SRC/dbbcsd.f +++ b/SRC/dbbcsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q, * THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T, @@ -35,11 +35,11 @@ * $ V2T( LDV2T, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DBBCSD computes the CS decomposition of an orthogonal matrix in *> bidiagonal-block form, @@ -68,11 +68,10 @@ *> The orthogonal matrices U1, U2, V1T, and V2T are input/output. *> The input matrices are pre- or post-multiplied by the appropriate *> singular vector matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -297,25 +296,26 @@ *> > 0: if DBBCSD did not converge, INFO specifies the number *> of nonzero entries in PHI, and B11D, B11E, etc., *> contain the partially reduced matrix. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Reference -*> ========= -*> -*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. -*> Algorithms, 50(1):33-65, 2009. -*> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL DOUBLE PRECISION, default = MAX(10,MIN(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they *> are within TOLMUL*EPS of either bound. *> \endverbatim +* +*> \par References: +* ================ *> +*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. +*> Algorithms, 50(1):33-65, 2009. * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dbdsdc.f b/SRC/dbdsdc.f index 1b15b4a..4dded10 100644 --- a/SRC/dbdsdc.f +++ b/SRC/dbdsdc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ, * WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DBDSDC computes the singular value decomposition (SVD) of a real *> N-by-N (upper or lower) bidiagonal matrix B: B = U * S * VT, @@ -55,11 +55,10 @@ *> The code currently calls DLASDQ if singular values only are desired. *> However, it can be slightly modified to compute singular values *> using the divide and conquer method. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -183,10 +182,9 @@ *> > 0: The algorithm failed to compute a singular value. *> The update process of divide and conquer failed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -197,18 +195,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ, $ WORK, IWORK, INFO ) diff --git a/SRC/dbdsqr.f b/SRC/dbdsqr.f index cab83f3..33deafb 100644 --- a/SRC/dbdsqr.f +++ b/SRC/dbdsqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, * LDU, C, LDC, WORK, INFO ) @@ -30,11 +30,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DBDSQR computes the singular values and, optionally, the right and/or *> left singular vectors from the singular value decomposition (SVD) of @@ -65,11 +65,10 @@ *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics *> Department, University of California at Berkeley, July 1992 *> for a detailed description of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -187,10 +186,12 @@ *> elements of a bidiagonal matrix which is orthogonally *> similar to the input matrix B; if INFO = i, i *> elements of E have not converged to zero. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL DOUBLE PRECISION, default = max(10,min(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> If it is positive, TOLMUL*EPS is the desired relative @@ -212,10 +213,9 @@ *> (and so fails to converge) if the number of passes *> through the inner loop exceeds MAXITR*N**2. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ddisna.f b/SRC/ddisna.f index 6a72e74..5594af9 100644 --- a/SRC/ddisna.f +++ b/SRC/ddisna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DDISNA( JOB, M, N, D, SEP, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), SEP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DDISNA computes the reciprocal condition numbers for the eigenvectors *> of a real symmetric or complex Hermitian matrix or for the left or @@ -51,11 +51,10 @@ *> *> DDISNA may also be used to compute error bounds for eigenvectors of *> the generalized symmetric definite eigenproblem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -102,10 +101,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/SRC/dgbbrd.f b/SRC/dgbbrd.f index 9de990a..bdfa1bc 100644 --- a/SRC/dgbbrd.f +++ b/SRC/dgbbrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q, * LDQ, PT, LDPT, C, LDC, WORK, INFO ) @@ -30,22 +30,21 @@ * $ PT( LDPT, * ), Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBBRD reduces a real general m-by-n band matrix A to upper *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. *> *> The routine computes B, and optionally forms Q or P**T, or computes *> Q**T*C for a given matrix C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -171,10 +170,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/SRC/dgbcon.f b/SRC/dgbcon.f index 3e7debd..776ae16 100644 --- a/SRC/dgbcon.f +++ b/SRC/dgbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND, * WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBCON estimates the reciprocal of the condition number of a real *> general band matrix A, in either the 1-norm or the infinity-norm, @@ -44,11 +44,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -130,10 +129,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/SRC/dgbequ.f b/SRC/dgbequ.f index 109ff11..29feef6 100644 --- a/SRC/dgbequ.f +++ b/SRC/dgbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION AB( LDAB, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBEQU computes row and column scalings intended to equilibrate an *> M-by-N band matrix A and reduce its condition number. R returns the @@ -45,11 +45,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -137,10 +136,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgbequb.f b/SRC/dgbequb.f index 7d302b2..96a22a6 100644 --- a/SRC/dgbequb.f +++ b/SRC/dgbequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION AB( LDAB, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -52,11 +52,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -144,10 +143,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgbrfs.f b/SRC/dgbrfs.f index 2dba93a..5ddb96a 100644 --- a/SRC/dgbrfs.f +++ b/SRC/dgbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, @@ -32,20 +32,19 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is banded, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -180,16 +179,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgbrfsx.f b/SRC/dgbrfsx.f index 86839c8..1972ddf 100644 --- a/SRC/dgbrfsx.f +++ b/SRC/dgbrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBRFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -58,11 +56,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -423,10 +420,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgbsv.f b/SRC/dgbsv.f index e8db8a1..12eafd3 100644 --- a/SRC/dgbsv.f +++ b/SRC/dgbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBSV computes the solution to a real system of linear equations *> A * X = B, where A is a band matrix of order N with KL subdiagonals @@ -43,11 +43,10 @@ *> and unit lower triangular matrices with KL subdiagonals, and U is *> upper triangular with KL+KU superdiagonals. The factored form of A *> is then used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -125,10 +124,9 @@ *> has been completed, but the factor U is exactly *> singular, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,10 +137,9 @@ * *> \ingroup doubleGBsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -160,7 +157,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgbsvx.f b/SRC/dgbsvx.f index e33e31a..2d1a7ce 100644 --- a/SRC/dgbsvx.f +++ b/SRC/dgbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBSVX uses the LU factorization to compute the solution to a real *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed by this subroutine: *> @@ -87,11 +90,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -349,10 +351,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgbsvxx.f b/SRC/dgbsvxx.f index f35aa51..98506d0 100644 --- a/SRC/dgbsvxx.f +++ b/SRC/dgbsvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -39,11 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBSVXX uses the LU factorization to compute the solution to a *> double precision system of linear equations A * X = B, where A is an @@ -63,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what DGBSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -107,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -538,10 +540,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgbtf2.f b/SRC/dgbtf2.f index 174c171..e257fd0 100644 --- a/SRC/dgbtf2.f +++ b/SRC/dgbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBTF2 computes an LU factorization of a real m-by-n band matrix A *> using partial pivoting with row interchanges. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup doubleGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -143,7 +140,6 @@ *> + need not be set on entry, but are required by the routine to store *> elements of U, because of fill-in resulting from the row *> interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgbtrf.f b/SRC/dgbtrf.f index 76f57cb..23ab50c 100644 --- a/SRC/dgbtrf.f +++ b/SRC/dgbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBTRF computes an LU factorization of a real m-by-n band matrix A *> using partial pivoting with row interchanges. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup doubleGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -142,7 +139,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgbtrs.f b/SRC/dgbtrs.f index 5b4eacf..1ec18a3 100644 --- a/SRC/dgbtrs.f +++ b/SRC/dgbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * DOUBLE PRECISION AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGBTRS solves a system of linear equations *> A * X = B or A**T * X = B *> with a general band matrix A using the LU factorization computed *> by DGBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/dgebak.f b/SRC/dgebak.f index 4cf10a4..8e0483e 100644 --- a/SRC/dgebak.f +++ b/SRC/dgebak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV, * INFO ) @@ -29,20 +29,19 @@ * DOUBLE PRECISION SCALE( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEBAK forms the right or left eigenvectors of a real general matrix *> by backward transformation on the computed eigenvectors of the *> balanced matrix output by DGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -114,10 +113,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/SRC/dgebal.f b/SRC/dgebal.f index c39015f..8f8e9e8 100644 --- a/SRC/dgebal.f +++ b/SRC/dgebal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), SCALE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEBAL balances a general real matrix A. This involves, first, *> permuting A by a similarity transformation to isolate eigenvalues @@ -43,11 +43,10 @@ *> *> Balancing may reduce the 1-norm of the matrix, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -113,10 +112,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 @@ -127,10 +125,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The permutations consist of row and column interchanges which put @@ -158,7 +155,6 @@ *> *> Modified by Tzu-Yi Chen, Computer Science Division, University of *> California at Berkeley, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgebd2.f b/SRC/dgebd2.f index a68b64f..8056451 100644 --- a/SRC/dgebd2.f +++ b/SRC/dgebd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO ) * @@ -28,21 +28,20 @@ * $ TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEBD2 reduces a real general m by n matrix A to upper or lower *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,10 +136,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -187,7 +184,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgebrd.f b/SRC/dgebrd.f index da5ba9c..a26171a 100644 --- a/SRC/dgebrd.f +++ b/SRC/dgebrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, * INFO ) @@ -29,21 +29,20 @@ * $ TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEBRD reduces a general real M-by-N matrix A to upper or lower *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -139,10 +138,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 @@ -153,10 +151,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -202,7 +199,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgecon.f b/SRC/dgecon.f index 540f110..193329d 100644 --- a/SRC/dgecon.f +++ b/SRC/dgecon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGECON estimates the reciprocal of the condition number of a general *> real matrix A, in either the 1-norm or the infinity-norm, using @@ -44,11 +44,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +107,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/SRC/dgeequ.f b/SRC/dgeequ.f index 13adbfa..d976807 100644 --- a/SRC/dgeequ.f +++ b/SRC/dgeequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEEQU computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -45,11 +45,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -123,10 +122,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgeequb.f b/SRC/dgeequb.f index 625458c..23de050 100644 --- a/SRC/dgeequb.f +++ b/SRC/dgeequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -52,11 +52,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -130,10 +129,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgees.f b/SRC/dgees.f index d288923..c9f4be5 100644 --- a/SRC/dgees.f +++ b/SRC/dgees.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, WR, WI, * VS, LDVS, WORK, LWORK, BWORK, INFO ) @@ -35,11 +35,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEES computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues, the real Schur form T, and, optionally, the matrix of @@ -57,11 +57,10 @@ *> [ c a ] *> *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -200,10 +199,9 @@ *> the Schur form no longer satisfy SELECT=.TRUE. This *> could also be caused by underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgeesx.f b/SRC/dgeesx.f index 0f648b5..6776b2f 100644 --- a/SRC/dgeesx.f +++ b/SRC/dgeesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, * WR, WI, VS, LDVS, RCONDE, RCONDV, WORK, LWORK, @@ -38,11 +38,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEESX computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues, the real Schur form T, and, optionally, the matrix of @@ -67,11 +67,10 @@ *> [ c a ] *> *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -264,10 +263,9 @@ *> the Schur form no longer satisfy SELECT=.TRUE. This *> could also be caused by underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgeev.f b/SRC/dgeev.f index e1ceb71..adeeb7b 100644 --- a/SRC/dgeev.f +++ b/SRC/dgeev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEEV( JOBVL, JOBVR, N, A, LDA, WR, WI, VL, LDVL, VR, * LDVR, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WI( * ), WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEEV computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -48,11 +48,10 @@ *> *> The computed eigenvectors are normalized to have Euclidean norm *> equal to 1 and largest component real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -173,10 +172,9 @@ *> elements i+1:N of WR and WI contain eigenvalues which *> have converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgeevx.f b/SRC/dgeevx.f index fbcff63..f110f1d 100644 --- a/SRC/dgeevx.f +++ b/SRC/dgeevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, WR, WI, * VL, LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, @@ -34,11 +34,11 @@ * $ WI( * ), WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEEVX computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -69,11 +69,10 @@ *> (in exact arithmetic) but diagonal scaling will. For further *> explanation of balancing, see section 4.10.2 of the LAPACK *> Users' Guide. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -286,10 +285,9 @@ *> have been computed; elements 1:ILO-1 and i+1:N of WR *> and WI contain eigenvalues which have converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgegs.f b/SRC/dgegs.f index cd10b6d..c30c2fa 100644 --- a/SRC/dgegs.f +++ b/SRC/dgegs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHAR, * ALPHAI, BETA, VSL, LDVSL, VSR, LDVSR, WORK, @@ -32,11 +32,11 @@ * $ VSR( LDVSR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine DGGES. *> @@ -57,11 +57,10 @@ *> DGEGV should be used instead. See DGEGV for a description of the *> eigenvalues of the generalized nonsymmetric eigenvalue problem *> (GNEP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -210,10 +209,9 @@ *> =N+8: error return from DGGBAK (computing VSR) *> =N+9: error return from DLASCL (various places) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgegv.f b/SRC/dgegv.f index b22b7e5..9c35584 100644 --- a/SRC/dgegv.f +++ b/SRC/dgegv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI, * BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * $ VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine DGGEV. *> @@ -67,11 +67,10 @@ *> are left eigenvectors of (A,B). *> *> Note: this routine performs "full balancing" on A and B -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -257,10 +256,9 @@ *> =N+9: error return from DGGBAK (computing VR) *> =N+10: error return from DLASCL (various calls) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -271,10 +269,9 @@ * *> \ingroup doubleGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing @@ -303,7 +300,6 @@ *> *> [*] See DHGEQZ, DGEGS, or read the book "Matrix Computations", *> by Golub & van Loan, pub. by Johns Hopkins U. Press. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgehd2.f b/SRC/dgehd2.f index e2ab7ff..7c05f86 100644 --- a/SRC/dgehd2.f +++ b/SRC/dgehd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEHD2 reduces a real general matrix A to upper Hessenberg form H by *> an orthogonal similarity transformation: Q**T * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \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 @@ -112,10 +110,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -147,7 +144,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgehrd.f b/SRC/dgehrd.f index fdf8f6b..a4b0214 100644 --- a/SRC/dgehrd.f +++ b/SRC/dgehrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEHRD reduces a real general matrix A to upper Hessenberg form H by *> an orthogonal similarity transformation: Q**T * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -113,10 +112,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 @@ -127,10 +125,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -166,7 +163,6 @@ *> This file is a slight modification of LAPACK-3.0's DGEHRD *> subroutine incorporating improvements proposed by Quintana-Orti and *> Van de Geijn (2006). (See DLAHR2.) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgejsv.f b/SRC/dgejsv.f index 345b6ab..98302cf 100644 --- a/SRC/dgejsv.f +++ b/SRC/dgejsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, * M, N, A, LDA, SVA, U, LDU, V, LDV, @@ -33,11 +33,11 @@ * CHARACTER*1 JOBA, JOBP, JOBR, JOBT, JOBU, JOBV * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEJSV computes the singular value decomposition (SVD) of a real M-by-N *> matrix [A], where M >= N. The SVD of [A] is written as @@ -51,11 +51,10 @@ *> the right singular vectors of [A], respectively. The matrices [U] and [V] *> are computed and stored in the arrays U and V, respectively. The diagonal *> of [SIGMA] is computed and stored in the array SVA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBA *> \verbatim @@ -381,10 +380,9 @@ *> > 0 : DGEJSV did not converge in the maximal allowed number *> of sweeps. The computed values may be inaccurate. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -395,10 +393,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> DGEJSV implements a preconditioned Jacobi SVD algorithm. It uses DGEQP3, @@ -439,12 +436,17 @@ *> this extra QRF step easily. The implementer can also improve data movement *> (matrix transpose, matrix copy, matrix transposed copy) - this *> implementation of DGEJSV uses only the simplest, naive data movement. -*> -*> Contributors +*> \endverbatim +* +*> \par Contributors: +* ================== *> *> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +* +*> \par References: +* ================ *> -*> References +*> \verbatim *> *> [1] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I. *> SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342. @@ -459,14 +461,14 @@ *> [4] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV, *> QSVD, (H,K)-SVD computations. *> Department of Mathematics, University of Zagreb, 2008. -*> -*> Bugs, examples and comments +*> \endverbatim +* +*> \par Bugs, examples and comments: +* ================================= *> *> Please report all bugs and send interesting examples and/or comments to *> drmac@math.hr. Thank you. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, $ M, N, A, LDA, SVA, U, LDU, V, LDV, diff --git a/SRC/dgelq2.f b/SRC/dgelq2.f index d53a278..7b298b7 100644 --- a/SRC/dgelq2.f +++ b/SRC/dgelq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGELQ2 computes an LQ factorization of a real m by n matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgelqf.f b/SRC/dgelqf.f index 4ca356b..d404f13 100644 --- a/SRC/dgelqf.f +++ b/SRC/dgelqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGELQF computes an LQ factorization of a real M-by-N matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -102,10 +101,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 @@ -116,10 +114,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -133,7 +130,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgels.f b/SRC/dgels.f index ac76f11..056cb75 100644 --- a/SRC/dgels.f +++ b/SRC/dgels.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGELS solves overdetermined or underdetermined real linear systems *> involving an M-by-N matrix A, or its transpose, using a QR or LQ @@ -59,11 +59,10 @@ *> handled in a single call; they are stored as the columns of the *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution *> matrix X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -167,10 +166,9 @@ *> full rank; the least squares solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgelsd.f b/SRC/dgelsd.f index 4f40929..6a0e82b 100644 --- a/SRC/dgelsd.f +++ b/SRC/dgelsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, IWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGELSD computes the minimum-norm solution to a real linear least *> squares problem: @@ -65,11 +65,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -186,10 +185,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -200,19 +198,13 @@ * *> \ingroup doubleGEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE DGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, $ WORK, LWORK, IWORK, INFO ) diff --git a/SRC/dgelss.f b/SRC/dgelss.f index 3be272d..60aeb8e 100644 --- a/SRC/dgelss.f +++ b/SRC/dgelss.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGELSS computes the minimum norm solution to a real linear least *> squares problem: @@ -51,11 +51,10 @@ *> The effective rank of A is determined by treating as zero those *> singular values which are less than RCOND times the largest singular *> value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -156,10 +155,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgelsx.f b/SRC/dgelsx.f index 0af3de8..c75b8d5 100644 --- a/SRC/dgelsx.f +++ b/SRC/dgelsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine DGELSY. *> @@ -65,11 +65,10 @@ *> X = P * Z**T [ inv(T11)*Q1**T*B ] *> [ 0 ] *> where Q1 consists of the first RANK columns of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -162,10 +161,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/SRC/dgelsy.f b/SRC/dgelsy.f index 2aa8a49..a8c0691 100644 --- a/SRC/dgelsy.f +++ b/SRC/dgelsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGELSY computes the minimum-norm solution to a real linear least *> squares problem: @@ -72,11 +72,10 @@ *> o Matrix B (the right hand side) is updated with Blas-3. *> o The permutation of matrix B (the right hand side) is faster and *> more simple. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -181,10 +180,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 @@ -195,18 +193,12 @@ * *> \ingroup doubleGEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> -*> \endverbatim +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n +*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n +*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n *> * ===================================================================== SUBROUTINE DGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, diff --git a/SRC/dgemqrt.f b/SRC/dgemqrt.f index 3ff66ac..33090b9 100644 --- a/SRC/dgemqrt.f +++ b/SRC/dgemqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, * C, LDC, WORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEMQRT overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> generated using the compact WY representation as returned by DGEQRT. *> *> Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -152,10 +151,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/SRC/dgeql2.f b/SRC/dgeql2.f index d085395..1747b0b 100644 --- a/SRC/dgeql2.f +++ b/SRC/dgeql2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQL2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQL2 computes a QL factorization of a real m by n matrix A: *> A = Q * L. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqlf.f b/SRC/dgeqlf.f index 5c372e9..c533925 100644 --- a/SRC/dgeqlf.f +++ b/SRC/dgeqlf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQLF computes a QL factorization of a real M-by-N matrix A: *> A = Q * L. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqp3.f b/SRC/dgeqp3.f index 30f2f32..e277151 100644 --- a/SRC/dgeqp3.f +++ b/SRC/dgeqp3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQP3 computes a QR factorization with column pivoting of a *> matrix A: A*P = Q*R using Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,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 @@ -126,10 +124,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -143,13 +140,14 @@ *> where tau is a real/complex scalar, and v is a real/complex vector *> with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in *> A(i+1:m,i), and tau in TAU(i). +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO ) * diff --git a/SRC/dgeqpf.f b/SRC/dgeqpf.f index d9c2bce..077d2f9 100644 --- a/SRC/dgeqpf.f +++ b/SRC/dgeqpf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQPF( M, N, A, LDA, JPVT, TAU, WORK, INFO ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine DGEQP3. *> *> DGEQPF computes a QR factorization with column pivoting of a *> real M-by-N matrix A: A*P = Q*R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -100,10 +99,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 @@ -114,10 +112,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -140,7 +137,6 @@ *> University of Zagreb, Croatia. *> -- April 2011 -- *> For more details see LAPACK Working Note 176. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqr2.f b/SRC/dgeqr2.f index b9c8f84..1498e24 100644 --- a/SRC/dgeqr2.f +++ b/SRC/dgeqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQR2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQR2 computes a QR factorization of a real m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqr2p.f b/SRC/dgeqr2p.f index fce8378..1e365fc 100644 --- a/SRC/dgeqr2p.f +++ b/SRC/dgeqr2p.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQR2P( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQR2 computes a QR factorization of a real m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqrf.f b/SRC/dgeqrf.f index 50254dc..90b4855 100644 --- a/SRC/dgeqrf.f +++ b/SRC/dgeqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQRF computes a QR factorization of a real M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqrfp.f b/SRC/dgeqrfp.f index 07ce01b..0172361 100644 --- a/SRC/dgeqrfp.f +++ b/SRC/dgeqrfp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQRFP computes a QR factorization of a real M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqrt.f b/SRC/dgeqrt.f index 2ef1a0e..c1071dd 100644 --- a/SRC/dgeqrt.f +++ b/SRC/dgeqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQRT computes a blocked QR factorization of a real M-by-N matrix A *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -100,10 +99,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 @@ -114,11 +112,11 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The matrix V stores the elementary reflectors H(i) in the i-th column *> below the diagonal. For example, if M=5 and N=3, the matrix V is *> @@ -138,7 +136,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = (T1 T2 ... TB). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqrt2.f b/SRC/dgeqrt2.f index a82abc9..01d5233 100644 --- a/SRC/dgeqrt2.f +++ b/SRC/dgeqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGEQRT2( M, N, A, LDA, T, LDT, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQRT2 computes a QR factorization of a real M-by-N matrix A, *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,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 @@ -103,10 +101,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -125,7 +122,6 @@ *> H = I - V * T * V**T *> *> where V**T is the transpose of V. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgeqrt3.f b/SRC/dgeqrt3.f index 5e81b1a..00e0af1 100644 --- a/SRC/dgeqrt3.f +++ b/SRC/dgeqrt3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE DGEQRT3( M, N, A, LDA, T, LDT, INFO ) * @@ -27,22 +27,21 @@ * DOUBLE PRECISION A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGEQRT3 recursively computes a QR factorization of a real M-by-N *> matrix A, using the compact WY representation of Q. *> *> Based on the algorithm of Elmroth and Gustavson, *> IBM J. Res. Develop. Vol 44 No. 4 July 2000. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,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 @@ -106,10 +104,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -130,7 +127,6 @@ *> where V**T is the transpose of V. *> *> For details of the algorithm, see Elmroth and Gustavson (cited above). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgerfs.f b/SRC/dgerfs.f index 62485c0..9a9f2f3 100644 --- a/SRC/dgerfs.f +++ b/SRC/dgerfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,20 +31,19 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGERFS improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates for *> the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -161,16 +160,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgerfsx.f b/SRC/dgerfsx.f index 523cf34..144ed7b 100644 --- a/SRC/dgerfsx.f +++ b/SRC/dgerfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGERFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -398,10 +395,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgerq2.f b/SRC/dgerq2.f index 15ec955..6f6647e 100644 --- a/SRC/dgerq2.f +++ b/SRC/dgerq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGERQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGERQ2 computes an RQ factorization of a real m by n matrix A: *> A = R * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in *> A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgerqf.f b/SRC/dgerqf.f index a97926a..ba42091 100644 --- a/SRC/dgerqf.f +++ b/SRC/dgerqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGERQF computes an RQ factorization of a real M-by-N matrix A: *> A = R * Q. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in *> A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgesc2.f b/SRC/dgesc2.f index 7150c64..db8e91f 100644 --- a/SRC/dgesc2.f +++ b/SRC/dgesc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), RHS( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESC2 solves a system of linear equations *> @@ -41,11 +41,10 @@ *> *> with a general N-by-N matrix A using the LU factorization with *> complete pivoting computed by DGETC2. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> On exit, SCALE contains the scale factor. SCALE is chosen *> 0 <= SCALE <= 1 to prevent owerflow in the solution. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -107,18 +105,12 @@ * *> \ingroup doubleGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * diff --git a/SRC/dgesdd.f b/SRC/dgesdd.f index ed99f34..1190515 100644 --- a/SRC/dgesdd.f +++ b/SRC/dgesdd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, * LWORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESDD computes the singular value decomposition (SVD) of a real *> M-by-N matrix A, optionally computing the left and right singular @@ -61,11 +61,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -195,10 +194,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: DBDSDC did not converge, updating process failed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -209,18 +207,12 @@ * *> \ingroup doubleGEsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, $ LWORK, IWORK, INFO ) diff --git a/SRC/dgesv.f b/SRC/dgesv.f index 2178dc8..74a355f 100644 --- a/SRC/dgesv.f +++ b/SRC/dgesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESV computes the solution to a real system of linear equations *> A * X = B, @@ -44,11 +44,10 @@ *> where P is a permutation matrix, L is unit lower triangular, and U is *> upper triangular. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -107,10 +106,9 @@ *> has been completed, but the factor U is exactly *> singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgesvd.f b/SRC/dgesvd.f index 1b8e0f8..3ab77a0 100644 --- a/SRC/dgesvd.f +++ b/SRC/dgesvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESVD computes the singular value decomposition (SVD) of a real *> M-by-N matrix A, optionally computing the left and/or right singular @@ -50,11 +50,10 @@ *> U and V are the left and right singular vectors of A. *> *> Note that the routine returns V**T, not V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -195,10 +194,9 @@ *> did not converge to zero. See the description of WORK *> above for details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgesvj.f b/SRC/dgesvj.f index 6e0bfdd..9d84257 100644 --- a/SRC/dgesvj.f +++ b/SRC/dgesvj.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, * LDV, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESVJ computes the singular value decomposition (SVD) of a real *> M-by-N matrix A, where M >= N. The SVD of A is written as @@ -45,11 +45,10 @@ *> matrix, and V is an N-by-N orthogonal matrix. The diagonal elements *> of SIGMA are the singular values of A. The columns of U and V are the *> left and the right singular vectors of A, respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBA *> \verbatim @@ -250,10 +249,9 @@ *> of sweeps. The output may still be useful. See the *> description of WORK. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -264,10 +262,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane @@ -288,14 +285,22 @@ *> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even *> denormalized singular values can be computed with the corresponding *> gradual loss of accurate digits. +*> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> \verbatim *> -*> Contributors *> ============ *> *> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +*> \endverbatim +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] A. A. Anda and H. Park: Fast plane rotations with dynamic scaling. *> SIAM J. matrix Anal. Appl., Vol. 15 (1994), pp. 162-174. @@ -315,12 +320,15 @@ *> [7] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV, *> QSVD, (H,K)-SVD computations. *> Department of Mathematics, University of Zagreb, 2008. +*> \endverbatim +* +*> \par Bugs, examples and comments: +* ================================= *> -*> Bugs, Examples and Comments +*> \verbatim *> =========================== *> Please report all bugs and send interesting test examples and comments to *> drmac@math.hr. Thank you. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgesvx.f b/SRC/dgesvx.f index 798ff9f..00be2d4 100644 --- a/SRC/dgesvx.f +++ b/SRC/dgesvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESVX uses the LU factorization to compute the solution to a real *> system of linear equations @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -86,11 +89,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -329,10 +331,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgesvxx.f b/SRC/dgesvxx.f index 88411a3..a986953 100644 --- a/SRC/dgesvxx.f +++ b/SRC/dgesvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW, @@ -39,11 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGESVXX uses the LU factorization to compute the solution to a *> double precision system of linear equations A * X = B, where A is an @@ -63,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what DGESVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -107,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -518,10 +520,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgetc2.f b/SRC/dgetc2.f index a13abbc..28ee0ab 100644 --- a/SRC/dgetc2.f +++ b/SRC/dgetc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETC2( N, A, LDA, IPIV, JPIV, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGETC2 computes an LU factorization with complete pivoting of the *> n-by-n matrix A. The factorization has the form A = P * L * U * Q, @@ -40,11 +40,10 @@ *> unit diagonal elements and U is upper triangular. *> *> This is the Level 2 BLAS algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> we try to solve for x in Ax = b. So U is perturbed to *> avoid the overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,18 +102,12 @@ * *> \ingroup doubleGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DGETC2( N, A, LDA, IPIV, JPIV, INFO ) * diff --git a/SRC/dgetf2.f b/SRC/dgetf2.f index 9cd144d..ca78603 100644 --- a/SRC/dgetf2.f +++ b/SRC/dgetf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETF2( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGETF2 computes an LU factorization of a general m-by-n matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgetrf.f b/SRC/dgetrf.f index df349aa..503271a 100644 --- a/SRC/dgetrf.f +++ b/SRC/dgetrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGETRF computes an LU factorization of a general M-by-N matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgetri.f b/SRC/dgetri.f index 82b32cc..e74d34d 100644 --- a/SRC/dgetri.f +++ b/SRC/dgetri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -28,22 +28,21 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGETRI computes the inverse of a matrix using the LU factorization *> computed by DGETRF. *> *> This method inverts U and then computes inv(A) by solving the system *> inv(A)*L = inv(U) for inv(A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, U(i,i) is exactly zero; the matrix is *> singular and its inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgetrs.f b/SRC/dgetrs.f index ddebc68..eb17b9f 100644 --- a/SRC/dgetrs.f +++ b/SRC/dgetrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,21 +29,20 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGETRS solves a system of linear equations *> A * X = B or A**T * X = B *> with a general N-by-N matrix A using the LU factorization computed *> by DGETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/dggbak.f b/SRC/dggbak.f index 0b945e3..f07fe40 100644 --- a/SRC/dggbak.f +++ b/SRC/dggbak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V, * LDV, INFO ) @@ -29,21 +29,20 @@ * DOUBLE PRECISION LSCALE( * ), RSCALE( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGBAK forms the right or left eigenvectors of a real generalized *> eigenvalue problem A*x = lambda*B*x, by backward transformation on *> the computed eigenvectors of the balanced pair of matrices output by *> DGGBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \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 @@ -136,15 +134,13 @@ * *> \ingroup doubleGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. Ward, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dggbal.f b/SRC/dggbal.f index e8bf1cb..3c56f88 100644 --- a/SRC/dggbal.f +++ b/SRC/dggbal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE, * RSCALE, WORK, INFO ) @@ -30,11 +30,11 @@ * $ RSCALE( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGBAL balances a pair of general real matrices (A,B). This *> involves, first, permuting A and B by similarity transformations to @@ -46,11 +46,10 @@ *> Balancing may reduce the 1-norm of the matrices, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors in the *> generalized eigenvalue problem A*x = lambda*B*x. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -152,10 +151,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 @@ -166,15 +164,13 @@ * *> \ingroup doubleGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. WARD, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgges.f b/SRC/dgges.f index 44b8f6b..46fb7e9 100644 --- a/SRC/dgges.f +++ b/SRC/dgges.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB, * SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, VSR, @@ -37,11 +37,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGES computes for a pair of N-by-N real nonsymmetric matrices (A,B), *> the generalized eigenvalues, the generalized real Schur form (S,T), @@ -76,11 +76,10 @@ *> and the pair of corresponding 2-by-2 blocks in S and T will have a *> complex conjugate pair of generalized eigenvalues. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -267,10 +266,9 @@ *> be caused due to scaling. *> =N+3: reordering failed in DTGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dggesx.f b/SRC/dggesx.f index 4d6d683..df832c7 100644 --- a/SRC/dggesx.f +++ b/SRC/dggesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA, * B, LDB, SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, @@ -41,11 +41,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGESX computes for a pair of N-by-N real nonsymmetric matrices *> (A,B), the generalized eigenvalues, the real Schur form (S,T), and, @@ -81,11 +81,10 @@ *> and the pair of corresponding 2-by-2 blocks in S and T will have a *> complex conjugate pair of generalized eigenvalues. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -329,10 +328,9 @@ *> be caused due to scaling. *> =N+3: reordering failed in DTGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -343,10 +341,9 @@ * *> \ingroup doubleGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> An approximate (asymptotic) bound on the average absolute error of @@ -360,7 +357,6 @@ *> EPS * norm((A, B)) / RCONDV( 2 ). *> *> See LAPACK User's Guide, section 4.11 for more information. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dggev.f b/SRC/dggev.f index 3527817..c3ea7e3 100644 --- a/SRC/dggev.f +++ b/SRC/dggev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI, * BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * $ VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGEV computes for a pair of N-by-N real nonsymmetric matrices (A,B) *> the generalized eigenvalues, and optionally, the left and/or right @@ -59,11 +59,10 @@ *> *> where u(j)**H is the conjugate-transpose of u(j). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -210,10 +209,9 @@ *> > N: =N+1: other than QZ iteration failed in DHGEQZ. *> =N+2: error return from DTGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dggevx.f b/SRC/dggevx.f index 0f4f86b..be094fb 100644 --- a/SRC/dggevx.f +++ b/SRC/dggevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB, * ALPHAR, ALPHAI, BETA, VL, LDVL, VR, LDVR, ILO, @@ -37,11 +37,11 @@ * $ VL( LDVL, * ), VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGEVX computes for a pair of N-by-N real nonsymmetric matrices (A,B) *> the generalized eigenvalues, and optionally, the left and/or right @@ -71,11 +71,10 @@ *> *> where u(j)**H is the conjugate-transpose of u(j). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -344,10 +343,9 @@ *> > N: =N+1: other than QZ iteration failed in DHGEQZ. *> =N+2: error return from DTGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -358,10 +356,9 @@ * *> \ingroup doubleGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing a matrix pair (A,B) includes, first, permuting rows and @@ -386,7 +383,6 @@ *> *> For further explanation of the reciprocal condition numbers RCONDE *> and RCONDV, see section 4.11 of LAPACK User's Guide. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dggglm.f b/SRC/dggglm.f index 945ab59..4830af9 100644 --- a/SRC/dggglm.f +++ b/SRC/dggglm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGGLM solves a general Gauss-Markov linear model (GLM) problem: *> @@ -61,11 +61,10 @@ *> x *> *> where inv(B) denotes the inverse of B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -169,10 +168,9 @@ *> rank( A B ) < N; the least squares solution could not *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgghrd.f b/SRC/dgghrd.f index 5296059..c2a2053 100644 --- a/SRC/dgghrd.f +++ b/SRC/dgghrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q, * LDQ, Z, LDZ, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGHRD reduces a pair of real matrices (A,B) to generalized upper *> Hessenberg form using orthogonal transformations, where A is a @@ -64,11 +64,10 @@ *> If Q1 is the orthogonal matrix from the QR factorization of B in the *> original equation A*x = lambda*B*x, then DGGHRD reduces the original *> problem to generalized Hessenberg form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -181,10 +180,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 @@ -195,16 +193,14 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine reduces A to Hessenberg and B to triangular form by *> an unblocked reduction, as described in _Matrix_Computations_, *> by Golub and Van Loan (Johns Hopkins Press.) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dgglse.f b/SRC/dgglse.f index 0f5ac04..1a1cb82 100644 --- a/SRC/dgglse.f +++ b/SRC/dgglse.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGLSE solves the linear equality-constrained least squares (LSE) *> problem: @@ -52,11 +52,10 @@ *> matrices (B, A) given by *> *> B = (0 R)*Q, A = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,9 @@ *> ( (B) ) *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dggqrf.f b/SRC/dggqrf.f index c490b3a..b4c3748 100644 --- a/SRC/dggqrf.f +++ b/SRC/dggqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGQRF computes a generalized QR factorization of an N-by-M matrix A *> and an N-by-P matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the *> transpose of the matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -165,10 +164,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 @@ -179,10 +177,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -212,7 +209,6 @@ *> B(n-k+i,1:p-k+i-1), and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine DORGRQ. *> To use Z to update another matrix, use LAPACK subroutine DORMRQ. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dggrqf.f b/SRC/dggrqf.f index 6439c67..7af4fe9 100644 --- a/SRC/dggrqf.f +++ b/SRC/dggrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGRQF computes a generalized RQ factorization of an M-by-N matrix A *> and a P-by-N matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the *> transpose of the matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,9 @@ *> = 0: successful exit *> < 0: if INF0= -i, the i-th argument had an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -178,10 +176,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -211,7 +208,6 @@ *> and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine DORGQR. *> To use Z to update another matrix, use LAPACK subroutine DORMQR. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dggsvd.f b/SRC/dggsvd.f index fc43938..3caeab9 100644 --- a/SRC/dggsvd.f +++ b/SRC/dggsvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, * LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, @@ -33,11 +33,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGSVD computes the generalized singular value decomposition (GSVD) *> of an M-by-N real matrix A and P-by-N real matrix B: @@ -117,11 +117,10 @@ *> *> X = Q*( I 0 ) *> ( 0 inv(R) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -294,10 +293,12 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, the Jacobi-type procedure failed to *> converge. For further details, see subroutine DTGSJA. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLA DOUBLE PRECISION *> TOLB DOUBLE PRECISION *> TOLA and TOLB are the thresholds to determine the effective @@ -307,10 +308,9 @@ *> The size of TOLA and TOLB may affect the size of backward *> errors of the decomposition. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -321,18 +321,12 @@ * *> \ingroup doubleOTHERsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> 2-96 Based on modifications by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, $ LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, diff --git a/SRC/dggsvp.f b/SRC/dggsvp.f index aa82939..f77df23 100644 --- a/SRC/dggsvp.f +++ b/SRC/dggsvp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, * TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, @@ -33,11 +33,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGGSVP computes orthogonal matrices U, V and Q such that *> @@ -62,11 +62,10 @@ *> This decomposition is the preprocessing step for computing the *> Generalized Singular Value Decomposition (GSVD), see subroutine *> DGGSVD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -230,10 +229,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 @@ -244,18 +242,13 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> *> The subroutine uses LAPACK subroutine DGEQPF for the QR factorization *> with column pivoting to detect the effective numerical rank of the *> a matrix. It may be replaced by a better rank determination strategy. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, $ TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, diff --git a/SRC/dgsvj0.f b/SRC/dgsvj0.f index d9e174d..c7a2087 100644 --- a/SRC/dgsvj0.f +++ b/SRC/dgsvj0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS, * SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) @@ -31,35 +31,20 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGSVJ0 is called from DGESVJ as a pre-processor and that is its main *> purpose. It applies Jacobi rotations in the same way as DGESVJ does, but *> it does not check convergence (stopping criterion). Few tuning *> parameters (marked by [TP]) are available for the implementer. -*> -*> Further Details -*> ~~~~~~~~~~~~~~~ -*> DGSVJ0 is used just to enable SGESVJ to call a simplified version of -*> itself to work on a submatrix of the original matrix. -*> -*> Contributors -*> ~~~~~~~~~~~~ -*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) -*> -*> Bugs, Examples and Comments -*> ~~~~~~~~~~~~~~~~~~~~~~~~~~~ -*> Please report all bugs and send interesting test examples and comments to -*> drmac@math.hr. Thank you. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBV *> \verbatim @@ -199,10 +184,9 @@ *> = 0 : successful exit. *> < 0 : if INFO = -i, then the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -213,6 +197,23 @@ * *> \ingroup doubleOTHERcomputational * +*> \par Further Details: +* ===================== +*> +*> DGSVJ0 is used just to enable DGESVJ to call a simplified version of +*> itself to work on a submatrix of the original matrix. +*> +*> \par Contributors: +* ================== +*> +*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +*> +*> \par Bugs, Examples and Comments: +* ================================= +*> +*> Please report all bugs and send interesting test examples and comments to +*> drmac@math.hr. Thank you. +* * ===================================================================== SUBROUTINE DGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS, $ SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) diff --git a/SRC/dgsvj1.f b/SRC/dgsvj1.f index 71a8629..0636f47 100644 --- a/SRC/dgsvj1.f +++ b/SRC/dgsvj1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV, * EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGSVJ1 is called from SGESVJ as a pre-processor and that is its main *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but @@ -64,15 +64,10 @@ *> tiled using quadratic tiles of side KBL. Here, KBL is a tunning parmeter. *> The number of sweeps is given in NSWEEP and the orthogonality threshold *> is given in TOL. -*> -*> Contributors -*> ~~~~~~~~~~~~ -*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBV *> \verbatim @@ -219,10 +214,9 @@ *> = 0 : successful exit. *> < 0 : if INFO = -i, then the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -233,6 +227,11 @@ * *> \ingroup doubleOTHERcomputational * +*> \par Contributors: +* ================== +*> +*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +* * ===================================================================== SUBROUTINE DGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV, $ EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) diff --git a/SRC/dgtcon.f b/SRC/dgtcon.f index cc20274..cab5d0c 100644 --- a/SRC/dgtcon.f +++ b/SRC/dgtcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND, * WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION D( * ), DL( * ), DU( * ), DU2( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTCON estimates the reciprocal of the condition number of a real *> tridiagonal matrix A using the LU factorization as computed by @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -130,10 +129,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/SRC/dgtrfs.f b/SRC/dgtrfs.f index 897b81a..e292b6e 100644 --- a/SRC/dgtrfs.f +++ b/SRC/dgtrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, @@ -33,20 +33,19 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is tridiagonal, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -184,16 +183,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgtsv.f b/SRC/dgtsv.f index 58cb98b..9f450d3 100644 --- a/SRC/dgtsv.f +++ b/SRC/dgtsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTSV( N, NRHS, DL, D, DU, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTSV solves the equation *> @@ -42,11 +42,10 @@ *> *> Note that the equation A**T*X = B may be solved by interchanging the *> order of the arguments DU and DL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -112,10 +111,9 @@ *> has not been computed. The factorization has not been *> completed unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgtsvx.f b/SRC/dgtsvx.f index e7d2d1b..85dd9bf 100644 --- a/SRC/dgtsvx.f +++ b/SRC/dgtsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, * DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -34,11 +34,11 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTSVX uses the LU factorization to compute the solution to a real *> system of linear equations A * X = B or A**T * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -71,11 +74,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -273,10 +275,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgttrf.f b/SRC/dgttrf.f index 173c1a7..d244930 100644 --- a/SRC/dgttrf.f +++ b/SRC/dgttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTTRF( N, DL, D, DU, DU2, IPIV, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTTRF computes an LU factorization of a real tridiagonal matrix A *> using elimination with partial pivoting and row interchanges. @@ -42,11 +42,10 @@ *> where L is a product of permutation and unit lower bidiagonal *> matrices and U is upper triangular with nonzeros in only the main *> diagonal and first two superdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dgttrs.f b/SRC/dgttrs.f index 7cb0fe3..0f129f6 100644 --- a/SRC/dgttrs.f +++ b/SRC/dgttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTTRS solves one of the systems of equations *> A*X = B or A**T*X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by DGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/dgtts2.f b/SRC/dgtts2.f index dbb4803..bf1a88d 100644 --- a/SRC/dgtts2.f +++ b/SRC/dgtts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DGTTS2 solves one of the systems of equations *> A*X = B or A**T*X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by DGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITRANS *> \verbatim @@ -113,10 +112,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dhgeqz.f b/SRC/dhgeqz.f index 849b76c..6a151c5 100644 --- a/SRC/dhgeqz.f +++ b/SRC/dhgeqz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT, * ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, WORK, @@ -32,11 +32,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DHGEQZ computes the eigenvalues of a real matrix pair (H,T), *> where H is an upper Hessenberg matrix and T is upper triangular, @@ -92,11 +92,10 @@ *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix *> Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973), *> pp. 241--256. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -274,10 +273,9 @@ *> in Schur form, but ALPHAR(i), ALPHAI(i), and *> BETA(i), i=INFO-N+1,...,N should be correct. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -288,10 +286,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Iteration counters: @@ -300,7 +297,6 @@ *> IITER -- counts iterations run since ILAST was last *> changed. This is therefore reset only when a 1-by-1 or *> 2-by-2 block deflates off the bottom. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dhsein.f b/SRC/dhsein.f index b59fd91..0b83712 100644 --- a/SRC/dhsein.f +++ b/SRC/dhsein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, WR, WI, * VL, LDVL, VR, LDVR, MM, M, WORK, IFAILL, @@ -33,11 +33,11 @@ * $ WI( * ), WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DHSEIN uses inverse iteration to find specified right and/or left *> eigenvectors of a real upper Hessenberg matrix H. @@ -48,11 +48,10 @@ *> H * x = w * x, y**h * H = w * y**h *> *> where y**h denotes the conjugate transpose of the vector y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -235,10 +234,9 @@ *> failed to converge; see IFAILL and IFAILR for further *> details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -249,16 +247,14 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x|+|y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dhseqr.f b/SRC/dhseqr.f index 9e66590..4041e6e 100644 --- a/SRC/dhseqr.f +++ b/SRC/dhseqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z, * LDZ, WORK, LWORK, INFO ) @@ -29,13 +29,12 @@ * DOUBLE PRECISION H( LDH, * ), WI( * ), WORK( * ), WR( * ), * $ Z( LDZ, * ) * .. -* Purpose -* ======= +* * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DHSEQR computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -46,11 +45,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -226,10 +224,9 @@ *> If INFO .GT. 0 and COMPZ = 'N', then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -240,6 +237,81 @@ * *> \ingroup doubleOTHERcomputational * +*> \par Contributors: +* ================== +*> +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim +*> +*> Default values supplied by +*> ILAENV(ISPEC,'DHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). +*> It is suggested that these defaults be adjusted in order +*> to attain best performance in each particular +*> computational environment. +*> +*> ISPEC=12: The DLAHQR vs DLAQR0 crossover point. +*> Default: 75. (Must be at least 11.) +*> +*> ISPEC=13: Recommended deflation window size. +*> This depends on ILO, IHI and NS. NS is the +*> number of simultaneous shifts returned +*> by ILAENV(ISPEC=15). (See ISPEC=15 below.) +*> The default for (IHI-ILO+1).LE.500 is NS. +*> The default for (IHI-ILO+1).GT.500 is 3*NS/2. +*> +*> ISPEC=14: Nibble crossover point. (See IPARMQ for +*> details.) Default: 14% of deflation window +*> size. +*> +*> ISPEC=15: Number of simultaneous shifts in a multishift +*> QR iteration. +*> +*> If IHI-ILO+1 is ... +*> +*> greater than ...but less ... the +*> or equal to ... than default is +*> +*> 1 30 NS = 2(+) +*> 30 60 NS = 4(+) +*> 60 150 NS = 10(+) +*> 150 590 NS = ** +*> 590 3000 NS = 64 +*> 3000 6000 NS = 128 +*> 6000 infinity NS = 256 +*> +*> (+) By default some or all matrices of this order +*> are passed to the implicit double shift routine +*> DLAHQR and this parameter is ignored. See +*> ISPEC=12 above and comments in IPARMQ for +*> details. +*> +*> (**) The asterisks (**) indicate an ad-hoc +*> function of N increasing from 10 to 64. +*> +*> ISPEC=16: Select structured matrix multiply. +*> If the number of simultaneous shifts (specified +*> by ISPEC=15) is less than 14, then the default +*> for ISPEC=16 is 0. Otherwise the default for +*> ISPEC=16 is 2. +*> \endverbatim +* +*> \par References: +* ================ +*> +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. +*> \n +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part II: Aggressive Early Deflation, SIAM Journal +*> of Matrix Analysis, volume 23, pages 948--973, 2002. +* * ===================================================================== SUBROUTINE DHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z, $ LDZ, WORK, LWORK, INFO ) @@ -257,75 +329,9 @@ DOUBLE PRECISION H( LDH, * ), WI( * ), WORK( * ), WR( * ), $ Z( LDZ, * ) * .. -* ================================================================ -* Default values supplied by -* ILAENV(ISPEC,'DHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). -* It is suggested that these defaults be adjusted in order -* to attain best performance in each particular -* computational environment. -* -* ISPEC=12: The DLAHQR vs DLAQR0 crossover point. -* Default: 75. (Must be at least 11.) -* -* ISPEC=13: Recommended deflation window size. -* This depends on ILO, IHI and NS. NS is the -* number of simultaneous shifts returned -* by ILAENV(ISPEC=15). (See ISPEC=15 below.) -* The default for (IHI-ILO+1).LE.500 is NS. -* The default for (IHI-ILO+1).GT.500 is 3*NS/2. -* -* ISPEC=14: Nibble crossover point. (See IPARMQ for -* details.) Default: 14% of deflation window -* size. -* -* ISPEC=15: Number of simultaneous shifts in a multishift -* QR iteration. -* -* If IHI-ILO+1 is ... -* -* greater than ...but less ... the -* or equal to ... than default is -* -* 1 30 NS = 2(+) -* 30 60 NS = 4(+) -* 60 150 NS = 10(+) -* 150 590 NS = ** -* 590 3000 NS = 64 -* 3000 6000 NS = 128 -* 6000 infinity NS = 256 -* -* (+) By default some or all matrices of this order -* are passed to the implicit double shift routine -* DLAHQR and this parameter is ignored. See -* ISPEC=12 above and comments in IPARMQ for -* details. -* -* (**) The asterisks (**) indicate an ad-hoc -* function of N increasing from 10 to 64. -* -* ISPEC=16: Select structured matrix multiply. -* If the number of simultaneous shifts (specified -* by ISPEC=15) is less than 14, then the default -* for ISPEC=16 is 0. Otherwise the default for -* ISPEC=16 is 2. -* -* ================================================================ -* Based on contributions by -* Karen Braman and Ralph Byers, Department of Mathematics, -* University of Kansas, USA -* -* ================================================================ -* References: -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 -* Performance, SIAM Journal of Matrix Analysis, volume 23, pages -* 929--947, 2002. -* -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part II: Aggressive Early Deflation, SIAM Journal -* of Matrix Analysis, volume 23, pages 948--973, 2002. -* -* ================================================================ +* +* ===================================================================== +* * .. Parameters .. * * ==== Matrices of order NTINY or smaller must be processed by diff --git a/SRC/disnan.f b/SRC/disnan.f index 6418645..4e37159 100644 --- a/SRC/disnan.f +++ b/SRC/disnan.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION DISNAN( DIN ) * @@ -24,30 +24,28 @@ * DOUBLE PRECISION DIN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DISNAN returns .TRUE. if its argument is NaN, and .FALSE. *> otherwise. To be replaced by the Fortran 2003 intrinsic in the *> future. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIN *> \verbatim *> DIN is DOUBLE PRECISION *> Input to test for NaN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gbamv.f b/SRC/dla_gbamv.f index d1da127..355767a 100644 --- a/SRC/dla_gbamv.f +++ b/SRC/dla_gbamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X, * INCX, BETA, Y, INCY ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION AB( LDAB, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_GBAMV performs one of the matrix-vector operations *> @@ -51,11 +51,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -169,10 +168,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gbrcond.f b/SRC/dla_gbrcond.f index 657b324..3f85476 100644 --- a/SRC/dla_gbrcond.f +++ b/SRC/dla_gbrcond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_GBRCOND( TRANS, N, KL, KU, AB, LDAB, * AFB, LDAFB, IPIV, CMODE, C, @@ -32,11 +32,11 @@ * $ C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_GBRCOND Estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -47,11 +47,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -153,10 +152,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gbrfsx_extended.f b/SRC/dla_gbrfsx_extended.f index 5a32cf5..6c8582b 100644 --- a/SRC/dla_gbrfsx_extended.f +++ b/SRC/dla_gbrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, * NRHS, AB, LDAB, AFB, LDAFB, IPIV, @@ -41,11 +41,12 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> DLA_GBRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +57,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -392,10 +392,9 @@ *> < 0: if INFO = -i, the ith argument to DGBTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gbrpvgrw.f b/SRC/dla_gbrpvgrw.f index c8a4597..5a2c127 100644 --- a/SRC/dla_gbrpvgrw.f +++ b/SRC/dla_gbrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_GBRPVGRW( N, KL, KU, NCOLS, AB, * LDAB, AFB, LDAFB ) @@ -28,11 +28,11 @@ * DOUBLE PRECISION AB( LDAB, * ), AFB( LDAFB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_GBRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +40,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -101,10 +100,9 @@ *> LDAFB is INTEGER *> The leading dimension of the array AFB. LDAFB >= 2*KL+KU+1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_geamv.f b/SRC/dla_geamv.f index b13d475..f9ca77e 100644 --- a/SRC/dla_geamv.f +++ b/SRC/dla_geamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA, * Y, INCY ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_GEAMV performs one of the matrix-vector operations *> @@ -51,11 +51,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -158,10 +157,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gercond.f b/SRC/dla_gercond.f index f44c128..d6209c9 100644 --- a/SRC/dla_gercond.f +++ b/SRC/dla_gercond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_GERCOND ( TRANS, N, A, LDA, AF, * LDAF, IPIV, CMODE, C, @@ -32,11 +32,11 @@ * $ C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_GERCOND estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -47,11 +47,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -135,10 +134,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gerfsx_extended.f b/SRC/dla_gerfsx_extended.f index b845667..6655cce 100644 --- a/SRC/dla_gerfsx_extended.f +++ b/SRC/dla_gerfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, * LDA, AF, LDAF, IPIV, COLEQU, C, B, @@ -39,11 +39,12 @@ * $ ERRS_N( NRHS, * ), ERRS_C( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> DLA_GERFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -54,11 +55,10 @@ *> and ERRS_C for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERRS_N and ERRS_C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -378,10 +378,9 @@ *> < 0: if INFO = -i, the ith argument to DGETRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_gerpvgrw.f b/SRC/dla_gerpvgrw.f index b779664..c2f4e19 100644 --- a/SRC/dla_gerpvgrw.f +++ b/SRC/dla_gerpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_GERPVGRW( N, NCOLS, A, LDA, AF, * LDAF ) @@ -28,11 +28,12 @@ * DOUBLE PRECISION A( LDA, * ), AF( LDAF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> DLA_GERPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +41,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -83,10 +83,9 @@ *> LDAF is INTEGER *> The leading dimension of the array AF. LDAF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_lin_berr.f b/SRC/dla_lin_berr.f index ac81168..e3cfb17 100644 --- a/SRC/dla_lin_berr.f +++ b/SRC/dla_lin_berr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR ) * @@ -28,22 +28,21 @@ * DOUBLE PRECISION RES( N, NRHS ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_LIN_BERR computes component-wise relative backward error from *> the formula *> max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) ) *> where abs(Z) is the component-wise absolute value of the matrix *> or vector Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> BERR is DOUBLE PRECISION array, dimension (NRHS) *> The component-wise relative backward error from the formula above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_porcond.f b/SRC/dla_porcond.f index e9e4720..4522c1e 100644 --- a/SRC/dla_porcond.f +++ b/SRC/dla_porcond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_PORCOND( UPLO, N, A, LDA, AF, LDAF, * CMODE, C, INFO, WORK, @@ -32,11 +32,11 @@ * INTEGER IWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_PORCOND Estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -47,11 +47,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_porfsx_extended.f b/SRC/dla_porfsx_extended.f index c7b68a5..7242877 100644 --- a/SRC/dla_porfsx_extended.f +++ b/SRC/dla_porfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, COLEQU, C, B, LDB, Y, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_PORFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -369,10 +368,9 @@ *> < 0: if INFO = -i, the ith argument to DPOTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_porpvgrw.f b/SRC/dla_porpvgrw.f index f0934d7..5aea294 100644 --- a/SRC/dla_porpvgrw.f +++ b/SRC/dla_porpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, * LDAF, WORK ) @@ -29,11 +29,12 @@ * DOUBLE PRECISION A( LDA, * ), AF( LDAF, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> DLA_PORPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -41,11 +42,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +89,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_syamv.f b/SRC/dla_syamv.f index 21e50be..e601473 100644 --- a/SRC/dla_syamv.f +++ b/SRC/dla_syamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_SYAMV performs the matrix-vector operation *> @@ -50,11 +50,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -145,10 +144,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -159,10 +157,9 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -174,7 +171,6 @@ *> Richard Hanson, Sandia National Labs. *> -- Modified for the absolute-value product, April 2006 *> Jason Riedy, UC Berkeley -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dla_syrcond.f b/SRC/dla_syrcond.f index a9355c6..8cb261c 100644 --- a/SRC/dla_syrcond.f +++ b/SRC/dla_syrcond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_SYRCOND( UPLO, N, A, LDA, AF, LDAF, * IPIV, CMODE, C, INFO, WORK, @@ -31,11 +31,11 @@ * DOUBLE PRECISION A( LDA, * ), AF( LDAF, * ), WORK( * ), C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_SYRCOND estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -46,11 +46,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_syrfsx_extended.f b/SRC/dla_syrfsx_extended.f index 131144d..7a3ca65 100644 --- a/SRC/dla_syrfsx_extended.f +++ b/SRC/dla_syrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, IPIV, COLEQU, C, B, LDB, @@ -42,11 +42,12 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> DLA_SYRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -57,11 +58,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -377,10 +377,9 @@ *> < 0: if INFO = -i, the ith argument to DSYTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_syrpvgrw.f b/SRC/dla_syrpvgrw.f index a8c1310..f388432 100644 --- a/SRC/dla_syrpvgrw.f +++ b/SRC/dla_syrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF, * LDAF, IPIV, WORK ) @@ -30,11 +30,12 @@ * DOUBLE PRECISION A( LDA, * ), AF( LDAF, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> DLA_SYRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -42,11 +43,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +105,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dla_wwaddw.f b/SRC/dla_wwaddw.f index 95edcab..36fec17 100644 --- a/SRC/dla_wwaddw.f +++ b/SRC/dla_wwaddw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLA_WWADDW( N, X, Y, W ) * @@ -27,23 +27,20 @@ * DOUBLE PRECISION X( * ), Y( * ), W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLA_WWADDW adds a vector W into a doubled-single vector (X, Y). *> *> This works for all extant IBM's hex and binary floating point *> arithmetics, but not for decimal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -68,10 +65,9 @@ *> W is DOUBLE PRECISION array, dimension (N) *> The vector to be added. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlabad.f b/SRC/dlabad.f index fa2c5a1..ad5f202 100644 --- a/SRC/dlabad.f +++ b/SRC/dlabad.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLABAD( SMALL, LARGE ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION LARGE, SMALL * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLABAD takes as input the values computed by DLAMCH for underflow and *> overflow, and returns the square root of each of these values if the @@ -38,11 +38,10 @@ *> the values computed by DLAMCH. This subroutine is needed because *> DLAMCH does not compensate for poor arithmetic in the upper half of *> the exponent range, as is found on a Cray. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] SMALL *> \verbatim @@ -59,10 +58,9 @@ *> On exit, if LOG10(LARGE) is sufficiently large, the square *> root of LARGE, otherwise unchanged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlabrd.f b/SRC/dlabrd.f index df97e83..17c6982 100644 --- a/SRC/dlabrd.f +++ b/SRC/dlabrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, * LDY ) @@ -29,11 +29,11 @@ * $ TAUQ( * ), X( LDX, * ), Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLABRD reduces the first NB rows and columns of a real general *> m by n matrix A to upper or lower bidiagonal form by an orthogonal @@ -44,11 +44,10 @@ *> bidiagonal form. *> *> This is an auxiliary routine called by DGEBRD -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -148,10 +147,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -162,10 +160,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -207,7 +204,6 @@ *> where a denotes an element of the original matrix which is unchanged, *> vi denotes an element of the vector defining H(i), and ui an element *> of the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlacn2.f b/SRC/dlacn2.f index a435fbb..9180f53 100644 --- a/SRC/dlacn2.f +++ b/SRC/dlacn2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLACN2( N, V, X, ISGN, EST, KASE, ISAVE ) * @@ -29,19 +29,18 @@ * DOUBLE PRECISION V( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLACN2 estimates the 1-norm of a square, real matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> ISAVE is INTEGER array, dimension (3) *> ISAVE is used to save variables between calls to DLACN2 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -107,19 +105,13 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> -*> Contributed by Nick Higham, University of Manchester. *> Originally named SONEST, dated March 16, 1988. *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of -*> a real or complex matrix, with applications to condition estimation", -*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. -*> *> This is a thread safe version of DLACON, which uses the array ISAVE *> in place of a SAVE statement, as follows: *> @@ -127,8 +119,19 @@ *> JUMP ISAVE(1) *> J ISAVE(2) *> ITER ISAVE(3) -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Nick Higham, University of Manchester +* +*> \par References: +* ================ +*> +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> a real or complex matrix, with applications to condition estimation", +*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> * ===================================================================== SUBROUTINE DLACN2( N, V, X, ISGN, EST, KASE, ISAVE ) diff --git a/SRC/dlacon.f b/SRC/dlacon.f index 2dc6f55..79d9521 100644 --- a/SRC/dlacon.f +++ b/SRC/dlacon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLACON( N, V, X, ISGN, EST, KASE ) * @@ -29,19 +29,18 @@ * DOUBLE PRECISION V( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLACON estimates the 1-norm of a square, real matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> whether X should be overwritten by A * X or A**T * X. *> On the final return from DLACON, KASE will again be 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,21 +99,19 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Contributed by Nick Higham, University of Manchester. +*> Nick Higham, University of Manchester. \n *> Originally named SONEST, dated March 16, 1988. +* +*> \par References: +* ================ *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of *> a real or complex matrix, with applications to condition estimation", *> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLACON( N, V, X, ISGN, EST, KASE ) * diff --git a/SRC/dlacpy.f b/SRC/dlacpy.f index 34b4562..441acd0 100644 --- a/SRC/dlacpy.f +++ b/SRC/dlacpy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLACPY( UPLO, M, N, A, LDA, B, LDB ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLACPY copies all or part of a two-dimensional matrix A to another *> matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -88,10 +87,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dladiv.f b/SRC/dladiv.f index 7ddf101..f4e07da 100644 --- a/SRC/dladiv.f +++ b/SRC/dladiv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLADIV( A, B, C, D, P, Q ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION A, B, C, D, P, Q * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLADIV performs complex division in real arithmetic *> @@ -38,11 +38,10 @@ *> *> The algorithm is due to Robert L. Smith and can be found *> in D. Knuth, The art of Computer Programming, Vol.2, p.195 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -75,10 +74,9 @@ *> Q is DOUBLE PRECISION *> The scalars p and q in the above expression. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlae2.f b/SRC/dlae2.f index a52ccce..e85b386 100644 --- a/SRC/dlae2.f +++ b/SRC/dlae2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAE2( A, B, C, RT1, RT2 ) * @@ -24,22 +24,21 @@ * DOUBLE PRECISION A, B, C, RT1, RT2 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAE2 computes the eigenvalues of a 2-by-2 symmetric matrix *> [ A B ] *> [ B C ]. *> On return, RT1 is the eigenvalue of larger absolute value, and RT2 *> is the eigenvalue of smaller absolute value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -70,10 +69,9 @@ *> RT2 is DOUBLE PRECISION *> The eigenvalue of smaller absolute value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,10 +82,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> RT1 is accurate to a few ulps barring over/underflow. @@ -100,7 +97,6 @@ *> Overflow is possible only if RT1 is within a factor of 5 of overflow. *> Underflow is harmless if the input data is 0 or exceeds *> underflow_threshold / macheps. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlaebz.f b/SRC/dlaebz.f index 3177f66..b7efc46 100644 --- a/SRC/dlaebz.f +++ b/SRC/dlaebz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAEBZ( IJOB, NITMAX, N, MMAX, MINP, NBMIN, ABSTOL, * RELTOL, PIVMIN, D, E, E2, NVAL, AB, C, MOUT, @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAEBZ contains the iteration loops which compute and use the *> function N(w), which is the count of eigenvalues of a symmetric @@ -75,11 +75,10 @@ *> *> Note: the arguments are, in general, *not* checked for unreasonable *> values. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -265,10 +264,9 @@ *> = 1--MMAX: The last INFO intervals did not converge. *> = MMAX+1: More than MMAX intervals were generated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -279,10 +277,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine is intended to be called only by other LAPACK @@ -315,7 +312,6 @@ *> >= 0, then the interval will have N(AB(j,1))=NAB(j,1)=f-k and *> N(AB(j,2))=NAB(j,2)=f+r. The cases w(l) < w(l+1) and *> w(l-r)=...=w(l+k) are handled similarly. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlaed0.f b/SRC/dlaed0.f index 004464b..2307b12 100644 --- a/SRC/dlaed0.f +++ b/SRC/dlaed0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, * WORK, IWORK, INFO ) @@ -30,19 +30,18 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED0 computes all eigenvalues and corresponding eigenvectors of a *> symmetric tridiagonal matrix using the divide and conquer method. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -150,10 +149,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -164,18 +162,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE DLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, $ WORK, IWORK, INFO ) diff --git a/SRC/dlaed1.f b/SRC/dlaed1.f index e8a266e..026f9a2 100644 --- a/SRC/dlaed1.f +++ b/SRC/dlaed1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK, * INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION D( * ), Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED1 computes the updated eigensystem of a diagonal *> matrix after modification by a rank-one symmetric matrix. This @@ -68,11 +68,10 @@ *> directly using the updated eigenvalues. The eigenvectors for *> the current problem are multiplied with the eigenvectors from *> the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -140,10 +139,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -154,18 +152,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE DLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK, diff --git a/SRC/dlaed2.f b/SRC/dlaed2.f index 7cd5eab..9048e50 100644 --- a/SRC/dlaed2.f +++ b/SRC/dlaed2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W, * Q2, INDX, INDXC, INDXP, COLTYP, INFO ) @@ -32,11 +32,11 @@ * $ W( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED2 merges the two sets of eigenvalues together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -44,11 +44,10 @@ *> eigenvalues are close together or if there is a tiny entry in the *> Z vector. For each such occurrence the order of the related secular *> equation problem is reduced by one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] K *> \verbatim @@ -189,10 +188,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 @@ -203,18 +201,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE DLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W, diff --git a/SRC/dlaed3.f b/SRC/dlaed3.f index 3e5699b..7e18d01 100644 --- a/SRC/dlaed3.f +++ b/SRC/dlaed3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX, * CTOT, W, S, INFO ) @@ -31,11 +31,11 @@ * $ S( * ), W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED3 finds the roots of the secular equation, as defined by the *> values in D, W, and RHO, between 1 and K. It makes the @@ -50,11 +50,10 @@ *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] K *> \verbatim @@ -162,10 +161,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -176,18 +174,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE DLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX, diff --git a/SRC/dlaed4.f b/SRC/dlaed4.f index d0c6bd1..8aad6e9 100644 --- a/SRC/dlaed4.f +++ b/SRC/dlaed4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), DELTA( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the I-th updated eigenvalue of a symmetric *> rank-one modification to a diagonal matrix whose elements are @@ -49,11 +49,10 @@ *> *> The method consists of approximating the rational functions in the *> secular equation by simpler interpolating rational functions. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -106,10 +105,12 @@ *> INFO is INTEGER *> = 0: successful exit *> > 0: if INFO = 1, the updating process failed. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> Logical variable ORGATI (origin-at-i?) is used for distinguishing *> whether D(i) or D(i+1) is treated as the origin. *> @@ -122,10 +123,9 @@ *> MAXIT is the maximum number of iterations allowed for each *> eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,18 +136,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO ) * diff --git a/SRC/dlaed5.f b/SRC/dlaed5.f index 7ccbf85..43d10bc 100644 --- a/SRC/dlaed5.f +++ b/SRC/dlaed5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED5( I, D, Z, DELTA, RHO, DLAM ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( 2 ), DELTA( 2 ), Z( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the I-th eigenvalue of a symmetric rank-one *> modification of a 2-by-2 diagonal matrix @@ -45,11 +45,10 @@ *> *> We also assume RHO > 0 and that the Euclidean norm of the vector *> Z is one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I *> \verbatim @@ -87,10 +86,9 @@ *> DLAM is DOUBLE PRECISION *> The computed lambda_I, the I-th updated eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,18 +99,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLAED5( I, D, Z, DELTA, RHO, DLAM ) * diff --git a/SRC/dlaed6.f b/SRC/dlaed6.f index f76805f..cff3703 100644 --- a/SRC/dlaed6.f +++ b/SRC/dlaed6.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION D( 3 ), Z( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED6 computes the positive or negative root (closest to the origin) *> of @@ -49,11 +49,10 @@ *> This routine will be called by DLAED4 when necessary. In most cases, *> the root sought is the smallest in magnitude, though it might not be *> in some extremely rare situations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] KNITER *> \verbatim @@ -107,10 +106,9 @@ *> = 0: successful exit *> > 0: if INFO = 1, failure to converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,23 +119,23 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 30/06/99: Based on contributions by -*> Ren-Cang Li, Computer Science Division, University of California -*> at Berkeley, USA +*> \verbatim *> *> 10/02/03: This version has a few statements commented out for thread *> safety (machine parameters are computed on each entry). SJH. *> *> 05/10/06: Modified from a new version of Ren-Cang Li, use *> Gragg-Thornton-Warner cubic convergent scheme for better stability. -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Ren-Cang Li, Computer Science Division, University of California +*> at Berkeley, USA *> * ===================================================================== SUBROUTINE DLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO ) diff --git a/SRC/dlaed7.f b/SRC/dlaed7.f index 5f5694f..861c4d3 100644 --- a/SRC/dlaed7.f +++ b/SRC/dlaed7.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, * LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR, @@ -35,11 +35,11 @@ * $ QSTORE( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED7 computes the updated eigensystem of a diagonal *> matrix after modification by a rank-one symmetric matrix. This @@ -73,11 +73,10 @@ *> directly using the updated eigenvalues. The eigenvectors for *> the current problem are multiplied with the eigenvectors from *> the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -236,10 +235,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -250,18 +248,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE DLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, $ LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR, diff --git a/SRC/dlaed8.f b/SRC/dlaed8.f index 78699bb..73e9d3c 100644 --- a/SRC/dlaed8.f +++ b/SRC/dlaed8.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO, * CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR, @@ -34,11 +34,11 @@ * $ Q( LDQ, * ), Q2( LDQ2, * ), W( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED8 merges the two sets of eigenvalues together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -46,11 +46,10 @@ *> eigenvalues are close together or if there is a tiny element in the *> Z vector. For each such occurrence the order of the related secular *> equation problem is reduced by one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -220,10 +219,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 @@ -234,18 +232,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE DLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO, $ CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR, diff --git a/SRC/dlaed9.f b/SRC/dlaed9.f index deebc66..491791a 100644 --- a/SRC/dlaed9.f +++ b/SRC/dlaed9.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W, * S, LDS, INFO ) @@ -30,21 +30,20 @@ * $ W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAED9 finds the roots of the secular equation, as defined by the *> values in D, Z, and RHO, between KSTART and KSTOP. It makes the *> appropriate calls to DLAED4 and then stores the new matrix of *> eigenvectors for use in calculating the next level of Z vectors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] K *> \verbatim @@ -134,10 +133,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -148,18 +146,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE DLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W, $ S, LDS, INFO ) diff --git a/SRC/dlaeda.f b/SRC/dlaeda.f index 25193c4..d64222f 100644 --- a/SRC/dlaeda.f +++ b/SRC/dlaeda.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR, * GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO ) @@ -30,20 +30,19 @@ * DOUBLE PRECISION GIVNUM( 2, * ), Q( * ), Z( * ), ZTEMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAEDA computes the Z vector corresponding to the merge step in the *> CURLVLth step of the merge process with TLVLS steps for the CURPBMth *> problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -144,10 +143,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 @@ -158,18 +156,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE DLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR, $ GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO ) diff --git a/SRC/dlaein.f b/SRC/dlaein.f index 50152f3..fc5edef 100644 --- a/SRC/dlaein.f +++ b/SRC/dlaein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAEIN( RIGHTV, NOINIT, N, H, LDH, WR, WI, VR, VI, B, * LDB, WORK, EPS3, SMLNUM, BIGNUM, INFO ) @@ -31,20 +31,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAEIN uses inverse iteration to find a right or left eigenvector *> corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg *> matrix H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RIGHTV *> \verbatim @@ -156,10 +155,9 @@ *> = 1: inverse iteration did not converge; VR is set to the *> last iterate, and so is VI if WI.ne.0.0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaev2.f b/SRC/dlaev2.f index 99111db..e692736 100644 --- a/SRC/dlaev2.f +++ b/SRC/dlaev2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAEV2( A, B, C, RT1, RT2, CS1, SN1 ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION A, B, C, CS1, RT1, RT2, SN1 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAEV2 computes the eigendecomposition of a 2-by-2 symmetric matrix *> [ A B ] @@ -39,11 +39,10 @@ *> *> [ CS1 SN1 ] [ A B ] [ CS1 -SN1 ] = [ RT1 0 ] *> [-SN1 CS1 ] [ B C ] [ SN1 CS1 ] [ 0 RT2 ]. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -86,10 +85,9 @@ *> SN1 is DOUBLE PRECISION *> The vector (CS1, SN1) is a unit right eigenvector for RT1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -100,10 +98,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> RT1 is accurate to a few ulps barring over/underflow. @@ -118,7 +115,6 @@ *> Overflow is possible only if RT1 is within a factor of 5 of overflow. *> Underflow is harmless if the input data is 0 or exceeds *> underflow_threshold / macheps. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlaexc.f b/SRC/dlaexc.f index 250845c..58aaeb0 100644 --- a/SRC/dlaexc.f +++ b/SRC/dlaexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAEXC( WANTQ, N, T, LDT, Q, LDQ, J1, N1, N2, WORK, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION Q( LDQ, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAEXC swaps adjacent diagonal blocks T11 and T22 of order 1 or 2 in *> an upper quasi-triangular matrix T by an orthogonal similarity @@ -43,11 +43,10 @@ *> with 1-by-1 and 2-by-2 diagonal blocks; each 2-by-2 diagonal block *> has its diagonal elemnts equal and its off-diagonal elements of *> opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -122,10 +121,9 @@ *> form; the blocks are not swapped and T and Q are *> unchanged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlag2.f b/SRC/dlag2.f index 3dd39c7..c711d79 100644 --- a/SRC/dlag2.f +++ b/SRC/dlag2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAG2( A, LDA, B, LDB, SAFMIN, SCALE1, SCALE2, WR1, * WR2, WI ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAG2 computes the eigenvalues of a 2 x 2 generalized eigenvalue *> problem A - w B, with scaling as necessary to avoid over-/underflow. @@ -44,11 +44,10 @@ *> *> where s is a non-negative scaling factor chosen so that w, w B, *> and s A do not overflow and, if possible, do not underflow, either. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -140,10 +139,9 @@ *> eigenvalue is complex, then WI is SCALE1 times the imaginary *> part of the eigenvalues. WI will always be non-negative. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlag2s.f b/SRC/dlag2s.f index 7e480ad..d274038 100644 --- a/SRC/dlag2s.f +++ b/SRC/dlag2s.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAG2S( M, N, A, LDA, SA, LDSA, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAG2S converts a DOUBLE PRECISION matrix, SA, to a SINGLE *> PRECISION matrix, A. @@ -42,11 +42,10 @@ *> RMAX. If not the convertion is aborted and a flag is raised. *> *> This is an auxiliary routine so there is no argument checking. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> PRECISION overflow threshold, in this case, the content *> of SA in exit is unspecified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlags2.f b/SRC/dlags2.f index 9746320..5b22738 100644 --- a/SRC/dlags2.f +++ b/SRC/dlags2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV, * SNV, CSQ, SNQ ) @@ -27,11 +27,11 @@ * $ SNU, SNV * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGS2 computes 2-by-2 orthogonal matrices U, V and Q, such *> that if ( UPPER ) then @@ -57,11 +57,10 @@ *> *> Z**T denotes the transpose of Z. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPPER *> \verbatim @@ -136,10 +135,9 @@ *> SNQ is DOUBLE PRECISION *> The desired orthogonal matrix Q. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlagtf.f b/SRC/dlagtf.f index eb4e25d..346a8c1 100644 --- a/SRC/dlagtf.f +++ b/SRC/dlagtf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGTF( N, A, LAMBDA, B, C, TOL, D, IN, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( * ), B( * ), C( * ), D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGTF factorizes the matrix (T - lambda*I), where T is an n by n *> tridiagonal matrix and lambda is a scalar, as @@ -51,11 +51,10 @@ *> The parameter LAMBDA is included in the routine so that DLAGTF may *> be used, in conjunction with DLAGTS, to obtain eigenvectors of T by *> inverse iteration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -141,10 +140,9 @@ *> = 0 : successful exit *> .lt. 0: if INFO = -k, the kth argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlagtm.f b/SRC/dlagtm.f index 5405408..ead65da 100644 --- a/SRC/dlagtm.f +++ b/SRC/dlagtm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA, * B, LDB ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGTM performs a matrix-vector product of the form *> @@ -44,11 +44,10 @@ *> where A is a tridiagonal matrix of order N, B and X are N by NRHS *> matrices, and alpha and beta are real scalars, each of which may be *> 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -129,10 +128,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/SRC/dlagts.f b/SRC/dlagts.f index 691d7a7..4f375cb 100644 --- a/SRC/dlagts.f +++ b/SRC/dlagts.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGTS( JOB, N, A, B, C, D, IN, Y, TOL, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( * ), B( * ), C( * ), D( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGTS may be used to solve one of the systems of equations *> @@ -48,11 +48,10 @@ *> controlled by the argument JOB, and in each case there is an option *> to perturb zero or very small diagonal elements of U, this option *> being intended for use in applications such as inverse iteration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -146,10 +145,9 @@ *> the elements of the right-hand side vector y are very *> large. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlagv2.f b/SRC/dlagv2.f index c195c40..e3fbf5a 100644 --- a/SRC/dlagv2.f +++ b/SRC/dlagv2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL, * CSR, SNR ) @@ -30,11 +30,11 @@ * $ B( LDB, * ), BETA( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAGV2 computes the Generalized Schur factorization of a real 2-by-2 *> matrix pencil (A,B) where B is upper triangular. This routine @@ -61,11 +61,10 @@ *> *> where b11 >= b22 > 0. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] A *> \verbatim @@ -136,10 +135,9 @@ *> SNR is DOUBLE PRECISION *> The sine of the right rotation matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -150,17 +148,11 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL, $ CSR, SNR ) diff --git a/SRC/dlahqr.f b/SRC/dlahqr.f index 8ed28bb..336d400 100644 --- a/SRC/dlahqr.f +++ b/SRC/dlahqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, * ILOZ, IHIZ, Z, LDZ, INFO ) @@ -29,23 +29,20 @@ * DOUBLE PRECISION H( LDH, * ), WI( * ), WR( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAHQR is an auxiliary routine called by DHSEQR to update the *> eigenvalues and Schur decomposition already computed by DHSEQR, by *> dealing with the Hessenberg submatrix in rows and columns ILO to *> IHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -177,10 +174,9 @@ *> where U is the orthogonal matrix in (*) *> (regardless of the value of WANTT.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -191,10 +187,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 02-96 Based on modifications by @@ -206,7 +201,6 @@ *> It is (1) more robust against overflow and underflow and *> (2) adopts the more conservative Ahues & Tisseur stopping *> criterion (LAWN 122, 1997). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlahr2.f b/SRC/dlahr2.f index 1b231d2..535749b 100644 --- a/SRC/dlahr2.f +++ b/SRC/dlahr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAHR2 reduces the first NB columns of A real general n-BY-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -41,11 +41,10 @@ *> Q as a block reflector I - V*T*V**T, and also the matrix Y = A * V * T. *> *> This is an auxiliary routine called by DGEHRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -115,10 +114,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -172,16 +169,15 @@ *> Gejin. Note that the entries of A(1:K,2:NB) differ from those *> returned by the original LAPACK-3.0's DLAHRD routine. (This *> subroutine is not backward compatible with LAPACK-3.0's DLAHRD.) -*> -*> References -*> ========== +*> \endverbatim +* +*> \par References: +* ================ *> *> Gregorio Quintana-Orti and Robert van de Geijn, "Improving the *> performance of reduction to Hessenberg form," ACM Transactions on *> Mathematical Software, 32(2):180-194, June 2006. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * diff --git a/SRC/dlahrd.f b/SRC/dlahrd.f index 4c11613..75c4ed7 100644 --- a/SRC/dlahrd.f +++ b/SRC/dlahrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAHRD reduces the first NB columns of a real general n-by-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -43,11 +43,10 @@ *> This is an OBSOLETE auxiliary routine. *> This routine will be 'deprecated' in a future release. *> Please use the new routine DLAHR2 instead. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -116,10 +115,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -130,10 +128,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -167,7 +164,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlaic1.f b/SRC/dlaic1.f index 1b942ca..1800684 100644 --- a/SRC/dlaic1.f +++ b/SRC/dlaic1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION W( J ), X( J ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAIC1 applies one step of incremental condition estimation in *> its simplest version: @@ -59,11 +59,10 @@ *> [ gamma ] *> *> where alpha = x**T*w. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -119,10 +118,9 @@ *> C is DOUBLE PRECISION *> Cosine needed in forming xhat. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaisnan.f b/SRC/dlaisnan.f index 3c2baee..86a1496 100644 --- a/SRC/dlaisnan.f +++ b/SRC/dlaisnan.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION DLAISNAN( DIN1, DIN2 ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION DIN1, DIN2 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is not for general use. It exists solely to avoid *> over-optimization in DISNAN. @@ -43,11 +43,10 @@ *> Interprocedural or whole-program optimization may delete this *> test. The ISNAN functions will be replaced by the correct *> Fortran 03 intrinsic once the intrinsic is widely available. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIN1 *> \verbatim @@ -59,10 +58,9 @@ *> DIN2 is DOUBLE PRECISION *> Two numbers to compare for inequality. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaln2.f b/SRC/dlaln2.f index 3ba89e8..9e5177b 100644 --- a/SRC/dlaln2.f +++ b/SRC/dlaln2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLALN2( LTRANS, NA, NW, SMIN, CA, A, LDA, D1, D2, B, * LDB, WR, WI, X, LDX, SCALE, XNORM, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLALN2 solves a system of the form (ca A - w D ) X = s B *> or (ca A**T - w D) X = s B with possible scaling ("s") and @@ -66,11 +66,10 @@ *> *> Note: all input quantities are assumed to be smaller than overflow *> by a reasonable factor. (See BIGNUM.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LTRANS *> \verbatim @@ -202,10 +201,9 @@ *> NOTE: In the interests of speed, this routine does not *> check the inputs for errors. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlals0.f b/SRC/dlals0.f index 728584f..d032145 100644 --- a/SRC/dlals0.f +++ b/SRC/dlals0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, * PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, @@ -34,11 +34,11 @@ * $ POLES( LDGNUM, * ), WORK( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLALS0 applies back the multiplying factors of either the left or the *> right singular vector matrix of a diagonal matrix appended by a row @@ -69,11 +69,10 @@ *> (3R) The inverse transformation of (2L). *> *> (4R) The inverse transformation of (1L). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -244,10 +243,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 @@ -258,19 +256,13 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE DLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, $ PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, diff --git a/SRC/dlalsa.f b/SRC/dlalsa.f index 266a75f..da78450 100644 --- a/SRC/dlalsa.f +++ b/SRC/dlalsa.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, * LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, @@ -37,11 +37,11 @@ * $ Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLALSA is an itermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The @@ -53,11 +53,10 @@ *> ICOMPQ = 1, DLALSA applies the right singular vector matrix to the *> right hand side. The singular vector matrices were generated in *> compact form by DLALSA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -244,10 +243,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 @@ -258,19 +256,13 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE DLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, $ LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, diff --git a/SRC/dlalsd.f b/SRC/dlalsd.f index 10fc877..22645c3 100644 --- a/SRC/dlalsd.f +++ b/SRC/dlalsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, * RANK, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), E( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLALSD uses the singular value decomposition of A to solve the least *> squares problem of finding X to minimize the Euclidean norm of each @@ -53,11 +53,10 @@ *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,10 +155,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through MOD(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,19 +168,13 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE DLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, $ RANK, WORK, IWORK, INFO ) diff --git a/SRC/dlamrg.f b/SRC/dlamrg.f index 104981c..0cda23e 100644 --- a/SRC/dlamrg.f +++ b/SRC/dlamrg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAMRG( N1, N2, A, DTRD1, DTRD2, INDEX ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAMRG will create a permutation list which will merge the elements *> of A (which is composed of two independently sorted sets) into a *> single set which is sorted in ascending order. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N1 *> \verbatim @@ -84,10 +83,9 @@ *> if B( I ) = A( INDEX( I ) ) for I=1,N1+N2, then B will be *> sorted in ascending order. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaneg.f b/SRC/dlaneg.f index 08286d8..90b1f3c 100644 --- a/SRC/dlaneg.f +++ b/SRC/dlaneg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION DLANEG( N, D, LLD, SIGMA, PIVMIN, R ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), LLD( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANEG computes the Sturm count, the number of negative pivots *> encountered while factoring tridiagonal T - sigma I = L D L^T. @@ -52,11 +52,10 @@ *> Modern Symmetric Tridiagonal Eigensolvers," SIAM Journal on *> Scientific Computing, v28, n5, 2006. DOI 10.1137/050641624 *> (Tech report version in LAWN 172 with the same title.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -96,10 +95,9 @@ *> The twist index for the twisted factorization that is used *> for the negcount. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -110,18 +108,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> Jason Riedy, University of California, Berkeley, USA -*> -*> \endverbatim +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n +*> Jason Riedy, University of California, Berkeley, USA \n *> * ===================================================================== INTEGER FUNCTION DLANEG( N, D, LLD, SIGMA, PIVMIN, R ) diff --git a/SRC/dlangb.f b/SRC/dlangb.f index ee84903..b4e21c0 100644 --- a/SRC/dlangb.f +++ b/SRC/dlangb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANGB( NORM, N, KL, KU, AB, LDAB, * WORK ) @@ -29,20 +29,19 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANGB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n band matrix A, with kl sub-diagonals and ku super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANGB returns the value +*> \return DLANGB +*> \verbatim *> *> DLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -109,10 +107,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlange.f b/SRC/dlange.f index 983c254..d12ba8a 100644 --- a/SRC/dlange.f +++ b/SRC/dlange.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANGE( NORM, M, N, A, LDA, WORK ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANGE returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANGE returns the value +*> \return DLANGE +*> \verbatim *> *> DLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -100,10 +98,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlangt.f b/SRC/dlangt.f index a26c973..2dadab5 100644 --- a/SRC/dlangt.f +++ b/SRC/dlangt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANGT( NORM, N, DL, D, DU ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANGT returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANGT returns the value +*> \return DLANGT +*> \verbatim *> *> DLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -92,10 +90,9 @@ *> DU is DOUBLE PRECISION array, dimension (N-1) *> The (n-1) super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlanhs.f b/SRC/dlanhs.f index 4c065c2..030fc5f 100644 --- a/SRC/dlanhs.f +++ b/SRC/dlanhs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANHS( NORM, N, A, LDA, WORK ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANHS returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> Hessenberg matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANHS returns the value +*> \return DLANHS +*> \verbatim *> *> DLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -94,10 +92,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlansb.f b/SRC/dlansb.f index e084a45..37e31e2 100644 --- a/SRC/dlansb.f +++ b/SRC/dlansb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANSB( NORM, UPLO, N, K, AB, LDAB, * WORK ) @@ -29,20 +29,19 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANSB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n symmetric band matrix A, with k super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANSB returns the value +*> \return DLANSB +*> \verbatim *> *> DLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -114,10 +112,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlansf.f b/SRC/dlansf.f index 151a34c..1569585 100644 --- a/SRC/dlansf.f +++ b/SRC/dlansf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( 0: * ), WORK( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANSF returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric matrix A in RFP format. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANSF returns the value +*> \return DLANSF +*> \verbatim *> *> DLANSF = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +106,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -122,10 +119,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -208,12 +204,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK ) * diff --git a/SRC/dlansp.f b/SRC/dlansp.f index d0f6844..71e7139 100644 --- a/SRC/dlansp.f +++ b/SRC/dlansp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANSP( NORM, UPLO, N, AP, WORK ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANSP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANSP returns the value +*> \return DLANSP +*> \verbatim *> *> DLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -100,10 +98,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlanst.f b/SRC/dlanst.f index 03a23bd..3185318 100644 --- a/SRC/dlanst.f +++ b/SRC/dlanst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANST( NORM, N, D, E ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANST returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANST returns the value +*> \return DLANST +*> \verbatim *> *> DLANST = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -86,10 +84,9 @@ *> E is DOUBLE PRECISION array, dimension (N-1) *> The (n-1) sub-diagonal or super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlansy.f b/SRC/dlansy.f index b69cfea..8d6679a 100644 --- a/SRC/dlansy.f +++ b/SRC/dlansy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANSY( NORM, UPLO, N, A, LDA, WORK ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANSY returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANSY returns the value +*> \return DLANSY +*> \verbatim *> *> DLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +106,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlantb.f b/SRC/dlantb.f index 6ab3256..e2bb370 100644 --- a/SRC/dlantb.f +++ b/SRC/dlantb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANTB( NORM, UPLO, DIAG, N, K, AB, * LDAB, WORK ) @@ -29,20 +29,19 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANTB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n triangular band matrix A, with ( k + 1 ) diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANTB returns the value +*> \return DLANTB +*> \verbatim *> *> DLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -125,10 +123,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlantp.f b/SRC/dlantp.f index 6d62223..696f8cc 100644 --- a/SRC/dlantp.f +++ b/SRC/dlantp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANTP( NORM, UPLO, DIAG, N, AP, WORK ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANTP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> triangular matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANTP returns the value +*> \return DLANTP +*> \verbatim *> *> DLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -110,10 +108,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlantr.f b/SRC/dlantr.f index d9629e7..17ff2a1 100644 --- a/SRC/dlantr.f +++ b/SRC/dlantr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLANTR( NORM, UPLO, DIAG, M, N, A, LDA, * WORK ) @@ -29,20 +29,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANTR returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> trapezoidal or triangular matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> DLANTR returns the value +*> \return DLANTR +*> \verbatim *> *> DLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -126,10 +124,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlanv2.f b/SRC/dlanv2.f index d33ceeb..561323e 100644 --- a/SRC/dlanv2.f +++ b/SRC/dlanv2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLANV2( A, B, C, D, RT1R, RT1I, RT2R, RT2I, CS, SN ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION A, B, C, CS, D, RT1I, RT1R, RT2I, RT2R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLANV2 computes the Schur factorization of a real 2-by-2 nonsymmetric *> matrix in standard form: @@ -40,11 +40,10 @@ *> 1) CC = 0 so that AA and DD are real eigenvalues of the matrix, or *> 2) AA = DD and BB*CC < 0, so that AA + or - sqrt(BB*CC) are complex *> conjugate eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] A *> \verbatim @@ -101,10 +100,9 @@ *> SN is DOUBLE PRECISION *> Parameters of the rotation matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,17 +113,15 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by V. Sima, Research Institute for Informatics, Bucharest, *> Romania, to reduce the risk of cancellation errors, *> when computing real eigenvalues, and to ensure, if possible, that *> abs(RT1R) >= abs(RT2R). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlapll.f b/SRC/dlapll.f index dc31c2f..a3817b4 100644 --- a/SRC/dlapll.f +++ b/SRC/dlapll.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAPLL( N, X, INCX, Y, INCY, SSMIN ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given two column vectors X and Y, let *> @@ -42,11 +42,10 @@ *> and then computes the SVD of the 2-by-2 upper triangular matrix R. *> The smaller singular value of R is returned in SSMIN, which is used *> as the measurement of the linear dependency of the vectors X and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> SSMIN is DOUBLE PRECISION *> The smallest singular value of the N-by-2 matrix A = ( X Y ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlapmr.f b/SRC/dlapmr.f index f67cffe..a071463 100644 --- a/SRC/dlapmr.f +++ b/SRC/dlapmr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAPMR( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAPMR rearranges the rows of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(I,*) is moved to X(K(I),*) for I = 1,2,...,M. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlapmt.f b/SRC/dlapmt.f index b67af83..89d6df0 100644 --- a/SRC/dlapmt.f +++ b/SRC/dlapmt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAPMT( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAPMT rearranges the columns of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlapy2.f b/SRC/dlapy2.f index 029e0c0..25d060e 100644 --- a/SRC/dlapy2.f +++ b/SRC/dlapy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLAPY2( X, Y ) * @@ -24,19 +24,18 @@ * DOUBLE PRECISION X, Y * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAPY2 returns sqrt(x**2+y**2), taking care not to cause unnecessary *> overflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -48,10 +47,9 @@ *> Y is DOUBLE PRECISION *> X and Y specify the values x and y. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlapy3.f b/SRC/dlapy3.f index f2763ff..11ab74c 100644 --- a/SRC/dlapy3.f +++ b/SRC/dlapy3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DLAPY3( X, Y, Z ) * @@ -24,19 +24,18 @@ * DOUBLE PRECISION X, Y, Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAPY3 returns sqrt(x**2+y**2+z**2), taking care not to cause *> unnecessary overflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -53,10 +52,9 @@ *> Z is DOUBLE PRECISION *> X, Y and Z specify the values x, y and z. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqgb.f b/SRC/dlaqgb.f index d742512..6e4652d 100644 --- a/SRC/dlaqgb.f +++ b/SRC/dlaqgb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, EQUED ) @@ -30,20 +30,19 @@ * DOUBLE PRECISION AB( LDAB, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQGB equilibrates a general M by N band matrix A with KL *> subdiagonals and KU superdiagonals using the row and scaling factors *> in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -128,10 +127,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -141,10 +142,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqge.f b/SRC/dlaqge.f index 3fce578..48970d5 100644 --- a/SRC/dlaqge.f +++ b/SRC/dlaqge.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * EQUED ) @@ -30,19 +30,18 @@ * DOUBLE PRECISION A( LDA, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQGE equilibrates a general M by N matrix A using the row and *> column scaling factors in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -111,10 +110,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -124,10 +125,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqp2.f b/SRC/dlaqp2.f index f762c1a..7a7a731 100644 --- a/SRC/dlaqp2.f +++ b/SRC/dlaqp2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, * WORK ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQP2 computes a QR factorization with column pivoting of *> the block A(OFFSET+1:M,1:N). *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -114,10 +113,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -128,23 +126,25 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA -*> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE DLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, $ WORK ) diff --git a/SRC/dlaqps.f b/SRC/dlaqps.f index 612c736..f960850 100644 --- a/SRC/dlaqps.f +++ b/SRC/dlaqps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, * VN2, AUXV, F, LDF ) @@ -30,11 +30,11 @@ * $ VN1( * ), VN2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQPS computes a step of QR factorization with column pivoting *> of a real M-by-N matrix A by using Blas-3. It tries to factorize @@ -46,11 +46,10 @@ *> columns is returned in KB. *> *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -142,10 +141,9 @@ *> LDF is INTEGER *> The leading dimension of the array F. LDF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -156,23 +154,25 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA -*> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE DLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, $ VN2, AUXV, F, LDF ) diff --git a/SRC/dlaqr0.f b/SRC/dlaqr0.f index 985dd9f..125d895 100644 --- a/SRC/dlaqr0.f +++ b/SRC/dlaqr0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, * ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQR0 computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -45,11 +45,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -221,26 +220,28 @@ *> *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. +*> \endverbatim +* +*> \par Contributors: +* ================== *> +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. -*> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqr1.f b/SRC/dlaqr1.f index e31f61f..eef96a2 100644 --- a/SRC/dlaqr1.f +++ b/SRC/dlaqr1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION H( LDH, * ), V( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given a 2-by-2 or 3-by-3 matrix H, DLAQR1 sets v to a *> scalar multiple of the first column of the product @@ -48,11 +48,10 @@ *> *> This is useful for starting double implicit shift bulges *> in the QR algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -100,10 +99,9 @@ *> A scalar multiple of the first column of the *> matrix K in (*). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -114,17 +112,11 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE DLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V ) diff --git a/SRC/dlaqr2.f b/SRC/dlaqr2.f index 8af7c6a..e3651db 100644 --- a/SRC/dlaqr2.f +++ b/SRC/dlaqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQR2 is identical to DLAQR3 except that it avoids *> recursion by calling DLAHQR instead of DLAQR4. @@ -52,11 +52,10 @@ *> an orthogonal similarity transformation of H. It is to be *> hoped that the final version of H has many zero subdiagonal *> entries. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -255,10 +254,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -269,17 +267,11 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE DLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/dlaqr3.f b/SRC/dlaqr3.f index 63c98c6..12d081e 100644 --- a/SRC/dlaqr3.f +++ b/SRC/dlaqr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Aggressive early deflation: *> @@ -49,11 +49,10 @@ *> an orthogonal similarity transformation of H. It is to be *> hoped that the final version of H has many zero subdiagonal *> entries. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -252,10 +251,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -266,17 +264,11 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE DLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/dlaqr4.f b/SRC/dlaqr4.f index 2cfbc81..6e20bb3 100644 --- a/SRC/dlaqr4.f +++ b/SRC/dlaqr4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, * ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQR4 implements one level of recursion for DLAQR0. *> It is a complete implementation of the small bulge multi-shift @@ -52,11 +52,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -229,10 +228,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -243,28 +241,24 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, $ ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/dlaqr5.f b/SRC/dlaqr5.f index 28c2367..08d1cce 100644 --- a/SRC/dlaqr5.f +++ b/SRC/dlaqr5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, * SR, SI, H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, @@ -33,19 +33,18 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQR5, called by DLAQR0, performs a *> single small-bulge multi-shift QR sweep. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -228,10 +227,9 @@ *> LDWV is the leading dimension of WV as declared in the *> in the calling subroutine. LDWV.GE.NV. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -242,24 +240,19 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> \par Contributors: +* ================== *> -*> Reference: -*> -*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -*> Algorithm Part I: Maintaining Well Focused Shifts, and -*> Level 3 Performance, SIAM Journal of Matrix Analysis, -*> volume 23, pages 929--947, 2002. +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> \endverbatim +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. *> * ===================================================================== SUBROUTINE DLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, diff --git a/SRC/dlaqsb.f b/SRC/dlaqsb.f index 4c49597..5695057 100644 --- a/SRC/dlaqsb.f +++ b/SRC/dlaqsb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED ) * @@ -29,19 +29,18 @@ * DOUBLE PRECISION AB( LDAB, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQSB equilibrates a symmetric band matrix A using the scaling *> factors in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -123,10 +124,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqsp.f b/SRC/dlaqsp.f index 9dddd35..06a34cf 100644 --- a/SRC/dlaqsp.f +++ b/SRC/dlaqsp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED ) * @@ -29,19 +29,18 @@ * DOUBLE PRECISION AP( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQSP equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -96,10 +95,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -108,10 +109,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqsy.f b/SRC/dlaqsy.f index 0b141c2..2060143 100644 --- a/SRC/dlaqsy.f +++ b/SRC/dlaqsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED ) * @@ -29,19 +29,18 @@ * DOUBLE PRECISION A( LDA, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQSY equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -104,10 +103,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -116,10 +117,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaqtr.f b/SRC/dlaqtr.f index eb7595f..8270ff3 100644 --- a/SRC/dlaqtr.f +++ b/SRC/dlaqtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAQTR( LTRAN, LREAL, N, T, LDT, B, W, SCALE, X, WORK, * INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION B( * ), T( LDT, * ), WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAQTR solves the real quasi-triangular system *> @@ -62,11 +62,10 @@ *> *> This subroutine is designed for the condition number estimation *> in routine DTRSNA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LTRAN *> \verbatim @@ -149,10 +148,9 @@ *> NOTE: In the interests of speed, this routine does not *> check the inputs for errors. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlar1v.f b/SRC/dlar1v.f index ceeb7d0..d92e728 100644 --- a/SRC/dlar1v.f +++ b/SRC/dlar1v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, * PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, @@ -35,11 +35,11 @@ * DOUBLE PRECISION Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAR1V computes the (scaled) r-th column of the inverse of *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix @@ -56,11 +56,10 @@ *> (d) Computation of the (scaled) r-th column of the inverse using the *> twisted factorization obtained by combining the top part of the *> the stationary and the bottom part of the progressive transform. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -204,10 +203,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (4*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -218,21 +216,15 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, $ PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, diff --git a/SRC/dlar2v.f b/SRC/dlar2v.f index 6d40675..eb87fc9 100644 --- a/SRC/dlar2v.f +++ b/SRC/dlar2v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAR2V( N, X, Y, Z, INCX, C, S, INCC ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION C( * ), S( * ), X( * ), Y( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAR2V applies a vector of real plane rotations from both sides to *> a sequence of 2-by-2 real symmetric matrices, defined by the elements @@ -39,11 +39,10 @@ *> *> ( x(i) z(i) ) := ( c(i) s(i) ) ( x(i) z(i) ) ( c(i) -s(i) ) *> ( z(i) y(i) ) ( -s(i) c(i) ) ( z(i) y(i) ) ( s(i) c(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -95,10 +94,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarf.f b/SRC/dlarf.f index 4967ffc..a5776d8 100644 --- a/SRC/dlarf.f +++ b/SRC/dlarf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARF applies a real elementary reflector H to a real m by n matrix *> C, from either the left or the right. H is represented in the form @@ -43,11 +43,10 @@ *> where tau is a real scalar and v is a real vector. *> *> If tau = 0, then H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -109,10 +108,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarfb.f b/SRC/dlarfb.f index 542b672..c3dda56 100644 --- a/SRC/dlarfb.f +++ b/SRC/dlarfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, * T, LDT, C, LDC, WORK, LDWORK ) @@ -30,19 +30,18 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARFB applies a real block reflector H or its transpose H**T to a *> real m by n matrix C, from either the left or the right. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -192,7 +189,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlarfg.f b/SRC/dlarfg.f index c24f40b..cf95e3a 100644 --- a/SRC/dlarfg.f +++ b/SRC/dlarfg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARFG( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARFG generates a real elementary reflector H of order n, such *> that @@ -53,11 +53,10 @@ *> the unit matrix. *> *> Otherwise 1 <= tau <= 2. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -91,10 +90,9 @@ *> TAU is DOUBLE PRECISION *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarfgp.f b/SRC/dlarfgp.f index 65fbe3f..eae04dc 100644 --- a/SRC/dlarfgp.f +++ b/SRC/dlarfgp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARFGP( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARFGP generates a real elementary reflector H of order n, such *> that @@ -51,11 +51,10 @@ *> *> If the elements of x are all zero, then tau = 0 and H is taken to be *> the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> TAU is DOUBLE PRECISION *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarft.f b/SRC/dlarft.f index 7ded09a..46c21a1 100644 --- a/SRC/dlarft.f +++ b/SRC/dlarft.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARFT forms the triangular factor T of a real block reflector H *> of order n, which is defined as a product of k elementary reflectors. @@ -50,11 +50,10 @@ *> H(i) is stored in the i-th row of the array V, and *> *> H = I - V**T * T * V -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -122,10 +121,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -163,7 +160,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlarfx.f b/SRC/dlarfx.f index 77d9808..cf28e2c 100644 --- a/SRC/dlarfx.f +++ b/SRC/dlarfx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARFX applies a real elementary reflector H to a real m by n *> matrix C, from either the left or the right. H is represented in the @@ -46,11 +46,10 @@ *> If tau = 0, then H is taken to be the unit matrix *> *> This version uses inline code if H has order < 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -105,10 +104,9 @@ *> or (M) if SIDE = 'R' *> WORK is not referenced if H has order < 11. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlargv.f b/SRC/dlargv.f index f066dbd..1c66f79 100644 --- a/SRC/dlargv.f +++ b/SRC/dlargv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARGV( N, X, INCX, Y, INCY, C, INCC ) * @@ -27,22 +27,21 @@ * DOUBLE PRECISION C( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARGV generates a vector of real plane rotations, determined by *> elements of the real vectors x and y. For i = 1,2,...,n *> *> ( c(i) s(i) ) ( x(i) ) = ( a(i) ) *> ( -s(i) c(i) ) ( y(i) ) = ( 0 ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> INCC is INTEGER *> The increment between elements of C. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarnv.f b/SRC/dlarnv.f index da359c8..ce898c5 100644 --- a/SRC/dlarnv.f +++ b/SRC/dlarnv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARNV( IDIST, ISEED, N, X ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARNV returns a vector of n random real numbers from a uniform or *> normal distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -71,10 +70,9 @@ *> X is DOUBLE PRECISION array, dimension (N) *> The generated random numbers. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -85,17 +83,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine DLARUV to generate random *> real numbers from a uniform (0,1) distribution, in batches of up to *> 128 using vectorisable code. The Box-Muller method is used to *> transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlarra.f b/SRC/dlarra.f index 39c7051..b6f92f3 100644 --- a/SRC/dlarra.f +++ b/SRC/dlarra.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRA( N, D, E, E2, SPLTOL, TNRM, * NSPLIT, ISPLIT, INFO ) @@ -30,19 +30,18 @@ * DOUBLE PRECISION D( * ), E( * ), E2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute the splitting points with threshold SPLTOL. *> DLARRA sets any "small" off-diagonal elements to zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,9 @@ *> INFO is INTEGER *> = 0: successful exit *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -125,21 +123,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRA( N, D, E, E2, SPLTOL, TNRM, $ NSPLIT, ISPLIT, INFO ) diff --git a/SRC/dlarrb.f b/SRC/dlarrb.f index 5a92f26..cae8f7b 100644 --- a/SRC/dlarrb.f +++ b/SRC/dlarrb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRB( N, D, LLD, IFIRST, ILAST, RTOL1, * RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK, @@ -32,11 +32,11 @@ * $ WERR( * ), WGAP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given the relatively robust representation(RRR) L D L^T, DLARRB *> does "limited" bisection to refine the eigenvalues of L D L^T, @@ -46,11 +46,10 @@ *> and WGAP, respectively. During bisection, intervals *> [left, right] are maintained by storing their mid-points and *> semi-widths in the arrays W and WERR respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -170,10 +169,9 @@ *> INFO is INTEGER *> Error flag. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -184,21 +182,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRB( N, D, LLD, IFIRST, ILAST, RTOL1, $ RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK, diff --git a/SRC/dlarrc.f b/SRC/dlarrc.f index 8e0a843..5ec876a 100644 --- a/SRC/dlarrc.f +++ b/SRC/dlarrc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRC( JOBT, N, VL, VU, D, E, PIVMIN, * EIGCNT, LCNT, RCNT, INFO ) @@ -30,20 +30,19 @@ * DOUBLE PRECISION D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Find the number of eigenvalues of the symmetric tridiagonal matrix T *> that are in the interval (VL,VU] if JOBT = 'T', and of L D L^T *> if JOBT = 'L'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBT *> \verbatim @@ -111,10 +110,9 @@ *> \verbatim *> INFO is INTEGER *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -125,21 +123,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRC( JOBT, N, VL, VU, D, E, PIVMIN, $ EIGCNT, LCNT, RCNT, INFO ) diff --git a/SRC/dlarrd.f b/SRC/dlarrd.f index 2cfdd26..7e6031a 100644 --- a/SRC/dlarrd.f +++ b/SRC/dlarrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRD( RANGE, ORDER, N, VL, VU, IL, IU, GERS, * RELTOL, D, E, E2, PIVMIN, NSPLIT, ISPLIT, @@ -35,11 +35,11 @@ * $ GERS( * ), W( * ), WERR( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARRD computes the eigenvalues of a symmetric tridiagonal *> matrix T to suitable accuracy. This is an auxiliary code to be @@ -55,11 +55,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] RANGE *> \verbatim @@ -279,10 +278,12 @@ *> floating-point arithmetic. *> Cure: Increase the PARAMETER "FUDGE", *> recompile, and try again. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> FUDGE DOUBLE PRECISION, default = 2 *> A "fudge factor" to widen the Gershgorin intervals. Ideally, *> a value of 1 should work, but on machines with sloppy @@ -290,19 +291,20 @@ *> publicly released versions should be large enough to handle *> the worst machine around. Note that this has no effect *> on accuracy of the solution. -*> -*> Based on contributions by -*> W. Kahan, University of California, Berkeley, USA -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA *> \endverbatim *> +*> \par Contributors: +* ================== +*> +*> W. Kahan, University of California, Berkeley, USA \n +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarre.f b/SRC/dlarre.f index 946e0c4..1b07985 100644 --- a/SRC/dlarre.f +++ b/SRC/dlarre.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2, * RTOL1, RTOL2, SPLTOL, NSPLIT, ISPLIT, M, @@ -35,11 +35,11 @@ * $ W( * ),WERR( * ), WGAP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> To find the desired eigenvalues of a given real symmetric *> tridiagonal matrix T, DLARRE sets any "small" off-diagonal @@ -54,11 +54,10 @@ *> conpute all and then discard any unwanted one. *> As an added benefit, DLARRE also outputs the n *> Gerschgorin intervals for the matrices L_i D_i L_i^T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RANGE *> \verbatim @@ -260,10 +259,9 @@ *> =-5: Problem in DLASQ2. *> =-6: Problem in DLASQ2. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -274,24 +272,24 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The base representations are required to suffer very little *> element growth and consequently define all their eigenvalues to *> high relative accuracy. -*> =============== -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n *> * ===================================================================== SUBROUTINE DLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2, diff --git a/SRC/dlarrf.f b/SRC/dlarrf.f index 38bf888..d1ffbb2 100644 --- a/SRC/dlarrf.f +++ b/SRC/dlarrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRF( N, D, L, LD, CLSTRT, CLEND, * W, WGAP, WERR, @@ -32,22 +32,21 @@ * $ LPLUS( * ), W( * ), WGAP( * ), WERR( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given the initial representation L D L^T and its cluster of close *> eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ... *> W( CLEND ), DLARRF finds a new relatively robust representation *> L D L^T - SIGMA I = L(+) D(+) L(+)^T such that at least one of the *> eigenvalues of L(+) D(+) L(+)^T is relatively isolated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -166,10 +165,9 @@ *> INFO is INTEGER *> Signals processing OK (=0) or failure (=1) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -180,21 +178,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRF( N, D, L, LD, CLSTRT, CLEND, $ W, WGAP, WERR, diff --git a/SRC/dlarrj.f b/SRC/dlarrj.f index 4e96e4c..64c0c52 100644 --- a/SRC/dlarrj.f +++ b/SRC/dlarrj.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRJ( N, D, E2, IFIRST, ILAST, * RTOL, OFFSET, W, WERR, WORK, IWORK, @@ -32,11 +32,11 @@ * $ WERR( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given the initial eigenvalue approximations of T, DLARRJ *> does bisection to refine the eigenvalues of T, @@ -45,11 +45,10 @@ *> of the error in these guesses in WERR. During bisection, intervals *> [left, right] are maintained by storing their mid-points and *> semi-widths in the arrays W and WERR respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -142,10 +141,9 @@ *> INFO is INTEGER *> Error flag. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -156,21 +154,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRJ( N, D, E2, IFIRST, ILAST, $ RTOL, OFFSET, W, WERR, WORK, IWORK, diff --git a/SRC/dlarrk.f b/SRC/dlarrk.f index b04dfca..666244f 100644 --- a/SRC/dlarrk.f +++ b/SRC/dlarrk.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRK( N, IW, GL, GU, * D, E2, PIVMIN, RELTOL, W, WERR, INFO) @@ -29,11 +29,11 @@ * DOUBLE PRECISION D( * ), E2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARRK computes one eigenvalue of a symmetric tridiagonal *> matrix T to suitable accuracy. This is an auxiliary code to be @@ -46,11 +46,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 @@ -120,17 +119,18 @@ *> INFO is INTEGER *> = 0: Eigenvalue converged *> = -1: Eigenvalue did NOT converge +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> FUDGE DOUBLE PRECISION, default = 2 *> A "fudge factor" to widen the Gershgorin intervals. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlarrr.f b/SRC/dlarrr.f index e9bba06..d4b0c1a 100644 --- a/SRC/dlarrr.f +++ b/SRC/dlarrr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRR( N, D, E, INFO ) * @@ -28,20 +28,19 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Perform tests to decide whether the symmetric tridiagonal matrix T *> warrants expensive computations which guarantee high relative accuracy *> in the eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -70,10 +69,9 @@ *> INFO = 1 : the matrix warrants computations guaranteeing *> only absolute accuracy. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,21 +82,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRR( N, D, E, INFO ) * diff --git a/SRC/dlarrv.f b/SRC/dlarrv.f index 5cbbc4f..c7e85cc 100644 --- a/SRC/dlarrv.f +++ b/SRC/dlarrv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARRV( N, VL, VU, D, L, PIVMIN, * ISPLIT, M, DOL, DOU, MINRGP, @@ -36,20 +36,19 @@ * DOUBLE PRECISION Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARRV computes the eigenvectors of the tridiagonal matrix *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T. *> The input eigenvalues should have been computed by DLARRE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -255,10 +254,9 @@ *> = 5: The Rayleigh Quotient Iteration failed to converge to *> full accuracy in MAXITR steps. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -269,21 +267,15 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DLARRV( N, VL, VU, D, L, PIVMIN, $ ISPLIT, M, DOL, DOU, MINRGP, diff --git a/SRC/dlarscl2.f b/SRC/dlarscl2.f index 01e9f13..9bbe1b5 100644 --- a/SRC/dlarscl2.f +++ b/SRC/dlarscl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARSCL2 ( M, N, D, X, LDX ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION D( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARSCL2 performs a reciprocal diagonal scaling on an vector: *> x <-- inv(D) * x @@ -39,11 +39,10 @@ *> *> Eventually to be replaced by BLAS_dge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlartg.f b/SRC/dlartg.f index 82f301b..11bda9d 100644 --- a/SRC/dlartg.f +++ b/SRC/dlartg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARTG( F, G, CS, SN, R ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION CS, F, G, R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARTG generate a plane rotation so that *> @@ -44,11 +44,10 @@ *> there are zeros on the diagonal). *> *> If F exceeds G in magnitude, CS will be positive. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -82,10 +81,9 @@ *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlartgp.f b/SRC/dlartgp.f index 7935ded..0ec9c89 100644 --- a/SRC/dlartgp.f +++ b/SRC/dlartgp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARTGP( F, G, CS, SN, R ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION CS, F, G, R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARTGP generates a plane rotation so that *> @@ -42,11 +42,10 @@ *> If F=0 and (G .ne. 0), then CS=0 and SN=(+/-)1. *> *> The sign is chosen so that R >= 0. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -80,10 +79,9 @@ *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlartgs.f b/SRC/dlartgs.f index 5fa3b12..801a420 100644 --- a/SRC/dlartgs.f +++ b/SRC/dlartgs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARTGS( X, Y, SIGMA, CS, SN ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION CS, SIGMA, SN, X, Y * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARTGS generates a plane rotation designed to introduce a bulge in *> Golub-Reinsch-style implicit QR iteration for the bidiagonal SVD @@ -40,11 +40,10 @@ *> *> with R nonnegative. If X^2 - SIGMA and X * Y are 0, then the *> rotation is by PI/2. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -75,10 +74,9 @@ *> SN is DOUBLE PRECISION *> The sine of the rotation. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlartv.f b/SRC/dlartv.f index 436b7c5..8702d3a 100644 --- a/SRC/dlartv.f +++ b/SRC/dlartv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARTV( N, X, INCX, Y, INCY, C, S, INCC ) * @@ -27,22 +27,21 @@ * DOUBLE PRECISION C( * ), S( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARTV applies a vector of real plane rotations to elements of the *> real vectors x and y. For i = 1,2,...,n *> *> ( x(i) ) := ( c(i) s(i) ) ( x(i) ) *> ( y(i) ) ( -s(i) c(i) ) ( y(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlaruv.f b/SRC/dlaruv.f index fe845bf..958405f 100644 --- a/SRC/dlaruv.f +++ b/SRC/dlaruv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARUV( ISEED, N, X ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION X( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARUV returns a vector of n random real numbers from a uniform (0,1) *> distribution (n <= 128). *> *> This is an auxiliary routine called by DLARNV and ZLARNV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] ISEED *> \verbatim @@ -64,10 +63,9 @@ *> X is DOUBLE PRECISION array, dimension (N) *> The generated random numbers. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -78,10 +76,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine uses a multiplicative congruential method with modulus @@ -93,7 +90,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/SRC/dlarz.f b/SRC/dlarz.f index 5c148d5..7f34ccf 100644 --- a/SRC/dlarz.f +++ b/SRC/dlarz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARZ applies a real elementary reflector H to a real M-by-N *> matrix C, from either the left or the right. H is represented in the @@ -47,11 +47,10 @@ *> *> *> H is a product of k elementary reflectors as returned by DTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -119,10 +118,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -133,15 +131,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlarzb.f b/SRC/dlarzb.f index 66a8a45..e3d4f7b 100644 --- a/SRC/dlarzb.f +++ b/SRC/dlarzb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, * LDV, T, LDT, C, LDC, WORK, LDWORK ) @@ -30,21 +30,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARZB applies a real block reflector H or its transpose H**T to *> a real distributed M-by-N C from the left or the right. *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -156,10 +155,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,15 +168,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlarzt.f b/SRC/dlarzt.f index 51ceb0e..f3ea513 100644 --- a/SRC/dlarzt.f +++ b/SRC/dlarzt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLARZT forms the triangular factor T of a real block reflector *> H of order > n, which is defined as a product of k elementary @@ -53,11 +53,10 @@ *> H = I - V**T * T * V *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -125,10 +124,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,14 +137,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define *> the H(i) is best illustrated by the following example with n = 5 and @@ -181,7 +180,6 @@ *> V = ( v1 v2 v3 ) *> ( v1 v2 v3 ) *> ( v1 v2 v3 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlas2.f b/SRC/dlas2.f index a6a5f71..7c6fb8d 100644 --- a/SRC/dlas2.f +++ b/SRC/dlas2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAS2( F, G, H, SSMIN, SSMAX ) * @@ -24,22 +24,21 @@ * DOUBLE PRECISION F, G, H, SSMAX, SSMIN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAS2 computes the singular values of the 2-by-2 matrix *> [ F G ] *> [ 0 H ]. *> On return, SSMIN is the smaller singular value and SSMAX is the *> larger singular value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -70,10 +69,9 @@ *> SSMAX is DOUBLE PRECISION *> The larger singular value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,10 +82,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Barring over/underflow, all output quantities are correct to within @@ -105,7 +102,6 @@ *> Underflow is harmless if underflow is gradual. Otherwise, results *> may correspond to a matrix modified by perturbations of size near *> the underflow threshold. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlascl.f b/SRC/dlascl.f index f7748b4..99776c7 100644 --- a/SRC/dlascl.f +++ b/SRC/dlascl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) * @@ -29,22 +29,21 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASCL multiplies the M by N real matrix A by the real scalar *> CTO/CFROM. This is done without over/underflow as long as the final *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that *> A may be full, upper triangular, lower triangular, upper Hessenberg, *> or banded. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -124,10 +123,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/SRC/dlascl2.f b/SRC/dlascl2.f index 7ab5712..1fc0af1 100644 --- a/SRC/dlascl2.f +++ b/SRC/dlascl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASCL2 ( M, N, D, X, LDX ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION D( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASCL2 performs a diagonal scaling on a vector: *> x <-- D * x @@ -39,11 +39,10 @@ *> *> Eventually to be replaced by BLAS_dge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasd0.f b/SRC/dlasd0.f index acddc3a..e0531cd 100644 --- a/SRC/dlasd0.f +++ b/SRC/dlasd0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK, * WORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Using a divide and conquer approach, DLASD0 computes the singular *> value decomposition (SVD) of a real upper bidiagonal N-by-M @@ -44,11 +44,10 @@ *> *> A related subroutine, DLASDA, computes only the singular values, *> and optionally, the singular vectors in compact form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -130,10 +129,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -144,18 +142,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK, $ WORK, INFO ) diff --git a/SRC/dlasd1.f b/SRC/dlasd1.f index d8626c2..0c3d07e 100644 --- a/SRC/dlasd1.f +++ b/SRC/dlasd1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT, * IDXQ, IWORK, WORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION D( * ), U( LDU, * ), VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASD1 computes the SVD of an upper bidiagonal N-by-M matrix B, *> where N = NL + NR + 1 and M = N + SQRE. DLASD1 is called from DLASD0. @@ -74,11 +74,10 @@ *> directly using the updated singular values. The singular vectors *> for the current problem are multiplied with the singular vectors *> from the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NL *> \verbatim @@ -182,10 +181,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -196,18 +194,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT, $ IDXQ, IWORK, WORK, INFO ) diff --git a/SRC/dlasd2.f b/SRC/dlasd2.f index 0565d36..e854fda 100644 --- a/SRC/dlasd2.f +++ b/SRC/dlasd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT, * LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX, @@ -34,11 +34,11 @@ * $ Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASD2 merges the two sets of singular values together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -48,11 +48,10 @@ *> equation problem is reduced by one. *> *> DLASD2 is called from DLASD1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NL *> \verbatim @@ -246,10 +245,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 @@ -260,18 +258,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT, $ LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX, diff --git a/SRC/dlasd3.f b/SRC/dlasd3.f index 1904591..9596b7a 100644 --- a/SRC/dlasd3.f +++ b/SRC/dlasd3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2, * LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z, @@ -33,11 +33,11 @@ * $ Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASD3 finds all the square roots of the roots of the secular *> equation, as defined by the values in D and Z. It makes the @@ -52,11 +52,10 @@ *> without guard digits, but we know of none. *> *> DLASD3 is called from DLASD1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NL *> \verbatim @@ -202,10 +201,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -216,18 +214,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2, $ LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z, diff --git a/SRC/dlasd4.f b/SRC/dlasd4.f index 79a0b0b..5323e74 100644 --- a/SRC/dlasd4.f +++ b/SRC/dlasd4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), DELTA( * ), WORK( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the square root of the I-th updated *> eigenvalue of a positive symmetric rank-one modification to @@ -50,11 +50,10 @@ *> *> The method consists of approximating the rational functions in the *> secular equation by simpler interpolating rational functions. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -114,10 +113,12 @@ *> INFO is INTEGER *> = 0: successful exit *> > 0: if INFO = 1, the updating process failed. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> Logical variable ORGATI (origin-at-i?) is used for distinguishing *> whether D(i) or D(i+1) is treated as the origin. *> @@ -130,10 +131,9 @@ *> MAXIT is the maximum number of iterations allowed for each *> eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -144,18 +144,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO ) * diff --git a/SRC/dlasd5.f b/SRC/dlasd5.f index 4ea869f..67a76c1 100644 --- a/SRC/dlasd5.f +++ b/SRC/dlasd5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( 2 ), DELTA( 2 ), WORK( 2 ), Z( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the square root of the I-th eigenvalue *> of a positive symmetric rank-one modification of a 2-by-2 diagonal @@ -46,11 +46,10 @@ *> *> We also assume RHO > 0 and that the Euclidean norm of the vector *> Z is one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I *> \verbatim @@ -95,10 +94,9 @@ *> WORK is DOUBLE PRECISION array, dimension ( 2 ) *> WORK contains (D(j) + sigma_I) in its j-th component. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -109,18 +107,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK ) * diff --git a/SRC/dlasd6.f b/SRC/dlasd6.f index 5f34d79..7a8c799 100644 --- a/SRC/dlasd6.f +++ b/SRC/dlasd6.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA, * IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, @@ -36,11 +36,11 @@ * $ VF( * ), VL( * ), WORK( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASD6 computes the SVD of an updated upper bidiagonal matrix B *> obtained by merging two smaller ones by appending a row. This @@ -86,11 +86,10 @@ *> values. *> *> DLASD6 is called from DLASDA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -290,10 +289,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -304,18 +302,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA, $ IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, diff --git a/SRC/dlasd7.f b/SRC/dlasd7.f index de432ff..e471f82 100644 --- a/SRC/dlasd7.f +++ b/SRC/dlasd7.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL, * VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ, @@ -36,11 +36,11 @@ * $ ZW( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASD7 merges the two sets of singular values together into a single *> sorted set. Then it tries to deflate the size of the problem. There @@ -50,11 +50,10 @@ *> secular equation problem is reduced by one. *> *> DLASD7 is called from DLASD6. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -256,10 +255,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 @@ -270,18 +268,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL, $ VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ, diff --git a/SRC/dlasd8.f b/SRC/dlasd8.f index 4873c5a..9572782 100644 --- a/SRC/dlasd8.f +++ b/SRC/dlasd8.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR, * DSIGMA, WORK, INFO ) @@ -30,11 +30,11 @@ * $ Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASD8 finds the square roots of the roots of the secular equation, *> as defined by the values in DSIGMA and Z. It makes the appropriate @@ -44,11 +44,10 @@ *> right singular vectors of the original bidiagonal matrix. *> *> DLASD8 is called from DLASD6. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -144,10 +143,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -158,18 +156,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR, $ DSIGMA, WORK, INFO ) diff --git a/SRC/dlasda.f b/SRC/dlasda.f index cd074b4..9f3c7e6 100644 --- a/SRC/dlasda.f +++ b/SRC/dlasda.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K, * DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL, @@ -34,11 +34,11 @@ * $ Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Using a divide and conquer approach, DLASDA computes the singular *> value decomposition (SVD) of a real upper bidiagonal N-by-M matrix @@ -49,11 +49,10 @@ *> *> A related subroutine, DLASD0, computes the singular values and *> the singular vectors in explicit form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -251,10 +250,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -265,18 +263,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K, $ DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL, diff --git a/SRC/dlasdq.f b/SRC/dlasdq.f index 36b8c4c..ad50163 100644 --- a/SRC/dlasdq.f +++ b/SRC/dlasdq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT, * U, LDU, C, LDC, WORK, INFO ) @@ -30,11 +30,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASDQ computes the singular value decomposition (SVD) of a real *> (upper or lower) bidiagonal matrix with diagonal D and offdiagonal @@ -50,11 +50,10 @@ *> See "Computing Small Singular Values of Bidiagonal Matrices With *> Guaranteed High Relative Accuracy," by J. Demmel and W. Kahan, *> LAPACK Working Note #3, for a detailed description of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -189,10 +188,9 @@ *> If INFO > 0, the algorithm did not converge, and INFO *> specifies how many superdiagonals did not converge. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -203,18 +201,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT, $ U, LDU, C, LDC, WORK, INFO ) diff --git a/SRC/dlasdt.f b/SRC/dlasdt.f index db85d80..962472e 100644 --- a/SRC/dlasdt.f +++ b/SRC/dlasdt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB ) * @@ -27,19 +27,18 @@ * INTEGER INODE( * ), NDIML( * ), NDIMR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASDT creates a tree of subproblems for bidiagonal divide and *> conquer. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -84,10 +83,9 @@ *> On entry, the maximum row dimension each subproblem at the *> bottom of the tree can be of. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -98,18 +96,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB ) * diff --git a/SRC/dlaset.f b/SRC/dlaset.f index 1246869..be917e8 100644 --- a/SRC/dlaset.f +++ b/SRC/dlaset.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASET( UPLO, M, N, ALPHA, BETA, A, LDA ) * @@ -29,19 +29,18 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASET initializes an m-by-n matrix A to BETA on the diagonal and *> ALPHA on the offdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasq1.f b/SRC/dlasq1.f index 34dbf03..b8289f8 100644 --- a/SRC/dlasq1.f +++ b/SRC/dlasq1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASQ1( N, D, E, WORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASQ1 computes the singular values of a real N-by-N bidiagonal *> matrix with diagonal D and off-diagonal E. The singular values @@ -45,11 +45,10 @@ *> *> and the present implementation is described in "An implementation of *> the dqds Algorithm (Positive Case)", LAPACK Working Note. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> = 3, termination criterion of outer while loop not met *> (program created more than N unreduced blocks) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasq2.f b/SRC/dlasq2.f index 391124f..d16b404 100644 --- a/SRC/dlasq2.f +++ b/SRC/dlasq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASQ2( N, Z, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASQ2 computes all the eigenvalues of the symmetric positive *> definite tridiagonal matrix associated with the qd array Z to high @@ -48,11 +48,10 @@ *> on machines which follow ieee-754 floating-point standard in their *> handling of infinities and NaNs, and false otherwise. This variable *> is passed to DLASQ3. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> = 3, termination criterion of outer while loop not met *> (program created more than N unreduced blocks) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,16 +99,14 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Local Variables: I0:N0 defines a current unreduced segment of Z. *> The shifts are accumulated in SIGMA. Iteration count is in ITER. *> Ping-pong is controlled by PP (alternates between 0 and 1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlasq3.f b/SRC/dlasq3.f index 2711c15..13437c2 100644 --- a/SRC/dlasq3.f +++ b/SRC/dlasq3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASQ3( I0, N0, Z, PP, DMIN, SIGMA, DESIG, QMAX, NFAIL, * ITER, NDIV, IEEE, TTYPE, DMIN1, DMIN2, DN, DN1, @@ -32,20 +32,19 @@ * DOUBLE PRECISION Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASQ3 checks for deflation, computes a shift (TAU) and calls dqds. *> In case of failure it changes shifts, and tries again until output *> is positive. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -165,10 +164,9 @@ *> These are passed as arguments in order to save their values *> between calls to DLASQ3. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasq4.f b/SRC/dlasq4.f index 05feb8e..8fc33ed 100644 --- a/SRC/dlasq4.f +++ b/SRC/dlasq4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASQ4( I0, N0, Z, PP, N0IN, DMIN, DMIN1, DMIN2, DN, * DN1, DN2, TAU, TTYPE, G ) @@ -29,19 +29,18 @@ * DOUBLE PRECISION Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASQ4 computes an approximation TAU to the smallest eigenvalue *> using values of d from the previous transform. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -127,10 +126,9 @@ *> G is passed as an argument in order to save its value between *> calls to DLASQ4. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,14 +139,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> CNST1 = 9/16 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlasq5.f b/SRC/dlasq5.f index 2791320..b1abc9d 100644 --- a/SRC/dlasq5.f +++ b/SRC/dlasq5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASQ5( I0, N0, Z, PP, TAU, DMIN, DMIN1, DMIN2, DN, * DNM1, DNM2, IEEE ) @@ -30,19 +30,18 @@ * DOUBLE PRECISION Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASQ5 computes one dqds transform in ping-pong form, one *> version for IEEE machines another for non IEEE machines. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -116,10 +115,9 @@ *> IEEE is LOGICAL *> Flag for IEEE or non IEEE arithmetic. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasq6.f b/SRC/dlasq6.f index 342f617..4ec5c13 100644 --- a/SRC/dlasq6.f +++ b/SRC/dlasq6.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASQ6( I0, N0, Z, PP, DMIN, DMIN1, DMIN2, DN, * DNM1, DNM2 ) @@ -29,19 +29,18 @@ * DOUBLE PRECISION Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASQ6 computes one dqd (shift equal to zero) transform in *> ping-pong form, with protection against underflow and overflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -103,10 +102,9 @@ *> DNM2 is DOUBLE PRECISION *> d(N0-2). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasr.f b/SRC/dlasr.f index 4902e92..6f71d21 100644 --- a/SRC/dlasr.f +++ b/SRC/dlasr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), C( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASR applies a sequence of plane rotations to a real matrix A, *> from either the left or the right. @@ -105,11 +105,10 @@ *> *> where R(k) appears in rows and columns k and z. The rotations are *> performed without ever forming P(k) explicitly. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -184,10 +183,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasrt.f b/SRC/dlasrt.f index 135a71d..170192a 100644 --- a/SRC/dlasrt.f +++ b/SRC/dlasrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASRT( ID, N, D, INFO ) * @@ -28,22 +28,21 @@ * DOUBLE PRECISION D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Sort the numbers in D in increasing order (if ID = 'I') or *> in decreasing order (if ID = 'D' ). *> *> Use Quick Sort, reverting to Insertion sort on arrays of *> size <= 20. Dimension of STACK limits N to about 2**32. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ID *> \verbatim @@ -73,10 +72,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/SRC/dlassq.f b/SRC/dlassq.f index 508b634..5ad7539 100644 --- a/SRC/dlassq.f +++ b/SRC/dlassq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASSQ( N, X, INCX, SCALE, SUMSQ ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASSQ returns the values scl and smsq such that *> @@ -47,11 +47,10 @@ *> scl and smsq are overwritten on SCALE and SUMSQ respectively. *> *> The routine makes only one pass through the vector x. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -88,10 +87,9 @@ *> On exit, SUMSQ is overwritten with smsq , the basic sum of *> squares from which scl has been factored out. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasv2.f b/SRC/dlasv2.f index fdc438a..2077cde 100644 --- a/SRC/dlasv2.f +++ b/SRC/dlasv2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASV2( F, G, H, SSMIN, SSMAX, SNR, CSR, SNL, CSL ) * @@ -24,11 +24,11 @@ * DOUBLE PRECISION CSL, CSR, F, G, H, SNL, SNR, SSMAX, SSMIN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASV2 computes the singular value decomposition of a 2-by-2 *> triangular matrix @@ -40,11 +40,10 @@ *> *> [ CSL SNL ] [ F G ] [ CSR -SNR ] = [ SSMAX 0 ] *> [-SNL CSL ] [ 0 H ] [ SNR CSR ] [ 0 SSMIN ]. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -99,10 +98,9 @@ *> The vector (CSR, SNR) is a unit right singular vector for the *> singular value abs(SSMAX). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,10 +111,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Any input parameter may be aliased with any output parameter. @@ -136,7 +133,6 @@ *> Underflow is harmless if underflow is gradual. Otherwise, results *> may correspond to a matrix modified by perturbations of size near *> the underflow threshold. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlaswp.f b/SRC/dlaswp.f index a1253a9..549ef81 100644 --- a/SRC/dlaswp.f +++ b/SRC/dlaswp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASWP( N, A, LDA, K1, K2, IPIV, INCX ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASWP performs a series of row interchanges on the matrix A. *> One row interchange is initiated for each of rows K1 through K2 of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> The increment between successive values of IPIV. If IPIV *> is negative, the pivots are applied in reverse order. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,15 +102,13 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by *> R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlasy2.f b/SRC/dlasy2.f index 9fb84fd..f618ab5 100644 --- a/SRC/dlasy2.f +++ b/SRC/dlasy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASY2( LTRANL, LTRANR, ISGN, N1, N2, TL, LDTL, TR, * LDTR, B, LDB, SCALE, X, LDX, XNORM, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASY2 solves for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in *> @@ -43,11 +43,10 @@ *> *> where TL is N1 by N1, TR is N2 by N2, B is N1 by N2, and ISGN = 1 or *> -1. op(T) = T or T**T, where T**T denotes the transpose of T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LTRANL *> \verbatim @@ -158,10 +157,9 @@ *> NOTE: In the interests of speed, this routine does not *> check the inputs for errors. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlasyf.f b/SRC/dlasyf.f index ae4b252..a5a147a 100644 --- a/SRC/dlasyf.f +++ b/SRC/dlasyf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLASYF computes a partial factorization of a real symmetric matrix A *> using the Bunch-Kaufman diagonal pivoting method. The partial @@ -51,11 +51,10 @@ *> DLASYF is an auxiliary routine called by DSYTRF. It uses blocked code *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or *> A22 (if UPLO = 'L'). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlat2s.f b/SRC/dlat2s.f index dbd6ec6..f4be4c9 100644 --- a/SRC/dlat2s.f +++ b/SRC/dlat2s.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAT2S( UPLO, N, A, LDA, SA, LDSA, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAT2S converts a DOUBLE PRECISION triangular matrix, SA, to a SINGLE *> PRECISION triangular matrix, A. @@ -43,11 +43,10 @@ *> RMAX. If not the convertion is aborted and a flag is raised. *> *> This is an auxiliary routine so there is no argument checking. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -96,10 +95,9 @@ *> PRECISION overflow threshold, in this case, the content *> of the UPLO part of SA in exit is unspecified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlatbs.f b/SRC/dlatbs.f index c24841f..cf55cc2 100644 --- a/SRC/dlatbs.f +++ b/SRC/dlatbs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X, * SCALE, CNORM, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION AB( LDAB, * ), CNORM( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATBS solves one of the triangular systems *> @@ -48,11 +48,10 @@ *> overflow, the Level 2 BLAS routine DTBSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -154,10 +153,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 @@ -168,10 +166,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, DTBSV @@ -239,7 +236,6 @@ *> *> and we can safely call DTBSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlatdf.f b/SRC/dlatdf.f index 6aabafe..20fda7c 100644 --- a/SRC/dlatdf.f +++ b/SRC/dlatdf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, * JPIV ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION RHS( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATDF uses the LU factorization of the n-by-n matrix Z computed by *> DGETC2 and computes a contribution to the reciprocal Dif-estimate @@ -45,11 +45,10 @@ *> The factorization of Z returned by DGETC2 has the form Z = P*L*U*Q, *> where P and Q are permutation matrices. L is lower triangular with *> unit diagonal elements and U is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -125,10 +124,9 @@ *> The pivot indices; for 1 <= j <= N, column j of the *> matrix has been interchanged with column JPIV(j). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,18 +137,23 @@ * *> \ingroup doubleOTHERauxiliary * +*> \par Further Details: +* ===================== +*> +*> This routine is a further developed implementation of algorithm +*> BSOLVE in [1] using complete pivoting in the LU factorization. * -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> -*> This routine is a further developed implementation of algorithm -*> BSOLVE in [1] using complete pivoting in the LU factorization. *> *> [1] Bo Kagstrom and Lars Westin, *> Generalized Schur Methods with Condition Estimators for @@ -162,7 +165,6 @@ *> between two Regular Matrix Pairs with Applications in *> Condition Estimation. Report IMINF-95.05, Departement of *> Computing Science, Umea University, S-901 87 Umea, Sweden, 1995. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlatps.f b/SRC/dlatps.f index 6b28c24..f956917 100644 --- a/SRC/dlatps.f +++ b/SRC/dlatps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE, * CNORM, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION AP( * ), CNORM( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATPS solves one of the triangular systems *> @@ -48,11 +48,10 @@ *> unscaled problem will not cause overflow, the Level 2 BLAS routine *> DTPSV is called. If the matrix A is singular (A(j,j) = 0 for some j), *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,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 @@ -155,10 +153,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, DTPSV @@ -226,7 +223,6 @@ *> *> and we can safely call DTPSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlatrd.f b/SRC/dlatrd.f index d1b5701..aa083d2 100644 --- a/SRC/dlatrd.f +++ b/SRC/dlatrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), E( * ), TAU( * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATRD reduces NB rows and columns of a real symmetric matrix A to *> symmetric tridiagonal form by an orthogonal similarity @@ -45,11 +45,10 @@ *> matrix, of which the lower triangle is supplied. *> *> This is an auxiliary routine called by DSYTRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,9 @@ *> LDW is INTEGER *> The leading dimension of the array W. LDW >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -145,10 +143,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -196,7 +193,6 @@ *> where d denotes a diagonal element of the reduced matrix, a denotes *> an element of the original matrix that is unchanged, and vi denotes *> an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlatrs.f b/SRC/dlatrs.f index b347f82..ea92a60 100644 --- a/SRC/dlatrs.f +++ b/SRC/dlatrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, * CNORM, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), CNORM( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATRS solves one of the triangular systems *> @@ -48,11 +48,10 @@ *> overflow, the Level 2 BLAS routine DTRSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -150,10 +149,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 @@ -164,10 +162,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, DTRSV @@ -235,7 +232,6 @@ *> *> and we can safely call DTRSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlatrz.f b/SRC/dlatrz.f index b14539c..03b19f3 100644 --- a/SRC/dlatrz.f +++ b/SRC/dlatrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATRZ( M, N, L, A, LDA, TAU, WORK ) * @@ -27,21 +27,20 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLATRZ factors the M-by-(M+L) real upper trapezoidal matrix *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R 0 ) * Z, by means *> of orthogonal transformations. Z is an (M+L)-by-(M+L) orthogonal *> matrix and, R and A1 are M-by-M upper triangular matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,14 +101,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -136,7 +135,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dlatzm.f b/SRC/dlatzm.f index 7bcc3c3..cec63d3 100644 --- a/SRC/dlatzm.f +++ b/SRC/dlatzm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine DORMRZ. *> @@ -54,11 +54,10 @@ *> C = [ C1, C2 ] m *> 1 n-1 *> Then C is overwritten by C*P. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -136,10 +135,9 @@ *> (N) if SIDE = 'L' *> (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dlauu2.f b/SRC/dlauu2.f index 5803d29..b403e94 100644 --- a/SRC/dlauu2.f +++ b/SRC/dlauu2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAUU2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAUU2 computes the product U * U**T or L**T * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the unblocked form of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/dlauum.f b/SRC/dlauum.f index a059513..29ea86b 100644 --- a/SRC/dlauum.f +++ b/SRC/dlauum.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DLAUUM( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DLAUUM computes the product U * U**T or L**T * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the blocked form of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/dopgtr.f b/SRC/dopgtr.f index 62b5d0b..d0725fa 100644 --- a/SRC/dopgtr.f +++ b/SRC/dopgtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DOPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AP( * ), Q( LDQ, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DOPGTR generates a real orthogonal matrix Q which is defined as the *> product of n-1 elementary reflectors H(i) of order n, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/dopmtr.f b/SRC/dopmtr.f index 1c35a58..50e920b 100644 --- a/SRC/dopmtr.f +++ b/SRC/dopmtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DOPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION AP( * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DOPMTR overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -134,10 +133,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/SRC/dorbdb.f b/SRC/dorbdb.f index a6aae37..7cd9c1d 100644 --- a/SRC/dorbdb.f +++ b/SRC/dorbdb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, * X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, @@ -34,11 +34,11 @@ * $ X21( LDX21, * ), X22( LDX22, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORBDB simultaneously bidiagonalizes the blocks of an M-by-M *> partitioned orthogonal matrix X: @@ -60,11 +60,10 @@ *> *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented *> implicitly by angles THETA, PHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -247,10 +246,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 @@ -261,10 +259,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The bidiagonal blocks B11, B12, B21, and B22 are represented @@ -277,15 +274,14 @@ *> P1, P2, Q1, and Q2 are represented as products of elementary *> reflectors. See DORCSD for details on generating P1, P2, Q1, and Q2 *> using DORGQR and DORGLQ. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, $ X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, diff --git a/SRC/dorcsd.f b/SRC/dorcsd.f index 1345bbb..1b14084 100644 --- a/SRC/dorcsd.f +++ b/SRC/dorcsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE DORCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, * SIGNS, M, P, Q, X11, LDX11, X12, @@ -38,11 +38,11 @@ * $ * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORCSD computes the CS decomposition of an M-by-M partitioned *> orthogonal matrix X: @@ -59,11 +59,10 @@ *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in *> which R = MIN(P,M-P,Q,M-Q). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -274,17 +273,16 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: DBBCSD did not converge. See the description of WORK *> above for details. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. -*> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorg2l.f b/SRC/dorg2l.f index 2a11d42..c672940 100644 --- a/SRC/dorg2l.f +++ b/SRC/dorg2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORG2L( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORG2L generates an m by n real matrix Q with orthonormal columns, *> which is defined as the last n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by DGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorg2r.f b/SRC/dorg2r.f index df9a5e1..9f7fac0 100644 --- a/SRC/dorg2r.f +++ b/SRC/dorg2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORG2R( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORG2R generates an m by n real matrix Q with orthonormal columns, *> which is defined as the first n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by DGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorgbr.f b/SRC/dorgbr.f index c65bc07..8cb9344 100644 --- a/SRC/dorgbr.f +++ b/SRC/dorgbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGBR generates one of the real orthogonal matrices Q or P**T *> determined by DGEBRD when reducing a real matrix A to bidiagonal @@ -52,11 +52,10 @@ *> rows of P**T, where n >= m >= k; *> if k >= n, P**T = G(n-1) . . . G(2) G(1) and DORGBR returns P**T as *> an N-by-N matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -142,10 +141,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/SRC/dorghr.f b/SRC/dorghr.f index 738ec8f..eb5a922 100644 --- a/SRC/dorghr.f +++ b/SRC/dorghr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,22 +27,21 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGHR generates a real orthogonal matrix Q which is defined as the *> product of IHI-ILO elementary reflectors of order N, as returned by *> DGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,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/SRC/dorgl2.f b/SRC/dorgl2.f index 816fd3e..8b16ce6 100644 --- a/SRC/dorgl2.f +++ b/SRC/dorgl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGL2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGL2 generates an m by n real matrix Q with orthonormal rows, *> which is defined as the first m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by DGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -98,10 +97,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorglq.f b/SRC/dorglq.f index 19d8345..1781473 100644 --- a/SRC/dorglq.f +++ b/SRC/dorglq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGLQ generates an M-by-N real matrix Q with orthonormal rows, *> which is defined as the first M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by DGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorgql.f b/SRC/dorgql.f index 2baeb53..b73f33a 100644 --- a/SRC/dorgql.f +++ b/SRC/dorgql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGQL generates an M-by-N real matrix Q with orthonormal columns, *> which is defined as the last N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by DGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorgqr.f b/SRC/dorgqr.f index 5c9b5bf..da0469a 100644 --- a/SRC/dorgqr.f +++ b/SRC/dorgqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGQR generates an M-by-N real matrix Q with orthonormal columns, *> which is defined as the first N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by DGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorgr2.f b/SRC/dorgr2.f index de41d94..c1ab741 100644 --- a/SRC/dorgr2.f +++ b/SRC/dorgr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGR2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGR2 generates an m by n real matrix Q with orthonormal rows, *> which is defined as the last m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by DGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorgrq.f b/SRC/dorgrq.f index bfb319e..5569086 100644 --- a/SRC/dorgrq.f +++ b/SRC/dorgrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGRQ generates an M-by-N real matrix Q with orthonormal rows, *> which is defined as the last M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by DGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dorgtr.f b/SRC/dorgtr.f index dff9bf4..03d416a 100644 --- a/SRC/dorgtr.f +++ b/SRC/dorgtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORGTR generates a real orthogonal matrix Q which is defined as the *> product of n-1 elementary reflectors of order N, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,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/SRC/dorm2l.f b/SRC/dorm2l.f index d706afc..8e5d436 100644 --- a/SRC/dorm2l.f +++ b/SRC/dorm2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORM2L overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by DGEQLF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/dorm2r.f b/SRC/dorm2r.f index a21f161..600c6e5 100644 --- a/SRC/dorm2r.f +++ b/SRC/dorm2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORM2R overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by DGEQRF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/dormbr.f b/SRC/dormbr.f index 523e095..43d867f 100644 --- a/SRC/dormbr.f +++ b/SRC/dormbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> If VECT = 'Q', DORMBR overwrites the general real M-by-N matrix C *> with @@ -62,11 +62,10 @@ *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix: *> if k < nq, P = G(1) G(2) . . . G(k); *> if k >= nq, P = G(1) G(2) . . . G(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -179,10 +178,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/SRC/dormhr.f b/SRC/dormhr.f index c2a6645..a1589b8 100644 --- a/SRC/dormhr.f +++ b/SRC/dormhr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMHR overwrites the general real M-by-N matrix C with *> @@ -46,11 +46,10 @@ *> IHI-ILO elementary reflectors, as returned by DGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,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/SRC/dorml2.f b/SRC/dorml2.f index 422ff8e..4038292 100644 --- a/SRC/dorml2.f +++ b/SRC/dorml2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORML2 overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by DGELQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/dormlq.f b/SRC/dormlq.f index 482b676..96d7795 100644 --- a/SRC/dormlq.f +++ b/SRC/dormlq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMLQ overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by DGELQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/dormql.f b/SRC/dormql.f index 6894044..247de9e 100644 --- a/SRC/dormql.f +++ b/SRC/dormql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMQL overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by DGEQLF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/dormqr.f b/SRC/dormqr.f index 011c566..e5b7e51 100644 --- a/SRC/dormqr.f +++ b/SRC/dormqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMQR overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by DGEQRF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/dormr2.f b/SRC/dormr2.f index 377d344..50a0600 100644 --- a/SRC/dormr2.f +++ b/SRC/dormr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMR2 overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by DGERQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/dormr3.f b/SRC/dormr3.f index c4dd500..c40f250 100644 --- a/SRC/dormr3.f +++ b/SRC/dormr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMR3 overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by DTZRZF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,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 @@ -165,15 +163,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/dormrq.f b/SRC/dormrq.f index e4e1beb..c266629 100644 --- a/SRC/dormrq.f +++ b/SRC/dormrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMRQ overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by DGERQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/dormrz.f b/SRC/dormrz.f index 52d3e11..4c5d9b1 100644 --- a/SRC/dormrz.f +++ b/SRC/dormrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMRZ overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by DTZRZF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,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 @@ -176,15 +174,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/dormtr.f b/SRC/dormtr.f index 32852b6..d7ac8d7 100644 --- a/SRC/dormtr.f +++ b/SRC/dormtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DORMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DORMTR overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/dpbcon.f b/SRC/dpbcon.f index 0817355..019ba69 100644 --- a/SRC/dpbcon.f +++ b/SRC/dpbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite band matrix using the @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -116,10 +115,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/SRC/dpbequ.f b/SRC/dpbequ.f index 3820da1..611c3be 100644 --- a/SRC/dpbequ.f +++ b/SRC/dpbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION AB( LDAB, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite band matrix A and reduce its condition @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpbrfs.f b/SRC/dpbrfs.f index 4440aae..fd04618 100644 --- a/SRC/dpbrfs.f +++ b/SRC/dpbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B, * LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite *> and banded, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,16 +164,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpbstf.f b/SRC/dpbstf.f index 4d7429e..d7d6c57 100644 --- a/SRC/dpbstf.f +++ b/SRC/dpbstf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBSTF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBSTF computes a split Cholesky factorization of a real *> symmetric positive definite band matrix A. @@ -47,11 +47,10 @@ *> *> where U is upper triangular of order m = (n+kd)/2, and L is lower *> triangular of order n-m. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> because the updated element a(i,i) was negative; the *> matrix A is not positive definite. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -150,7 +147,6 @@ *> a31 a42 a53 a64 a64 * * s13 s24 s53 s64 s75 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpbsv.f b/SRC/dpbsv.f index b22b8f8..b8695d8 100644 --- a/SRC/dpbsv.f +++ b/SRC/dpbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBSV computes the solution to a real system of linear equations *> A * X = B, @@ -46,11 +46,10 @@ *> triangular band matrix, with the same number of superdiagonals or *> subdiagonals as A. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup doubleOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -162,7 +159,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpbsvx.f b/SRC/dpbsvx.f index bb1cf55..16cabdd 100644 --- a/SRC/dpbsvx.f +++ b/SRC/dpbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, * EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -34,11 +34,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to *> compute the solution to a real system of linear equations @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -86,11 +89,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -291,10 +293,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -305,10 +306,9 @@ * *> \ingroup doubleOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -336,7 +336,6 @@ *> a31 a42 a53 a64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpbtf2.f b/SRC/dpbtf2.f index 898be3f..bfbbc57 100644 --- a/SRC/dpbtf2.f +++ b/SRC/dpbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBTF2( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBTF2 computes the Cholesky factorization of a real symmetric *> positive definite band matrix A. @@ -44,11 +44,10 @@ *> L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -140,7 +137,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpbtrf.f b/SRC/dpbtrf.f index 575e5de..06de6c5 100644 --- a/SRC/dpbtrf.f +++ b/SRC/dpbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBTRF computes the Cholesky factorization of a real symmetric *> positive definite band matrix A. @@ -41,11 +41,10 @@ *> A = U**T * U, if UPLO = 'U', or *> A = L * L**T, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -111,10 +109,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -135,12 +132,13 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> -*> Contributed by -*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 -*> *> \endverbatim +* +*> \par Contributors: +* ================== *> +*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 +* * ===================================================================== SUBROUTINE DPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * diff --git a/SRC/dpbtrs.f b/SRC/dpbtrs.f index 30598a7..5050dcd 100644 --- a/SRC/dpbtrs.f +++ b/SRC/dpbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPBTRS solves a system of linear equations A*X = B with a symmetric *> positive definite band matrix A using the Cholesky factorization *> A = U**T*U or A = L*L**T computed by DPBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/dpftrf.f b/SRC/dpftrf.f index 477bbb0..58470b2 100644 --- a/SRC/dpftrf.f +++ b/SRC/dpftrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPFTRF( TRANSR, UPLO, N, A, INFO ) * @@ -27,11 +27,11 @@ * .. Array Arguments .. * DOUBLE PRECISION A( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPFTRF computes the Cholesky factorization of a real symmetric *> positive definite matrix A. @@ -42,11 +42,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -96,10 +95,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -110,10 +108,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -196,7 +193,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpftri.f b/SRC/dpftri.f index f173f41..3342f0f 100644 --- a/SRC/dpftri.f +++ b/SRC/dpftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPFTRI( TRANSR, UPLO, N, A, INFO ) * @@ -27,20 +27,19 @@ * DOUBLE PRECISION A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPFTRI computes the inverse of a (real) symmetric positive definite *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T *> computed by DPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -89,10 +88,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,10 +101,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -189,7 +186,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpftrs.f b/SRC/dpftrs.f index 5bdfa91..3eac679 100644 --- a/SRC/dpftrs.f +++ b/SRC/dpftrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( 0: * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPFTRS solves a system of linear equations A*X = B with a symmetric *> positive definite matrix A using the Cholesky factorization *> A = U**T*U or A = L*L**T computed by DPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -97,10 +96,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 @@ -111,10 +109,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -197,7 +194,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpocon.f b/SRC/dpocon.f index d341ea4..7ad6c9c 100644 --- a/SRC/dpocon.f +++ b/SRC/dpocon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite matrix using the @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/dpoequ.f b/SRC/dpoequ.f index e6b5db7..6ecf2a6 100644 --- a/SRC/dpoequ.f +++ b/SRC/dpoequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOEQU( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A and reduce its condition number @@ -42,11 +42,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -97,10 +96,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpoequb.f b/SRC/dpoequb.f index 84a6f48..daecebd 100644 --- a/SRC/dpoequb.f +++ b/SRC/dpoequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A and reduce its condition number @@ -42,11 +42,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -97,10 +96,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dporfs.f b/SRC/dporfs.f index 5a213ce..c5e074b 100644 --- a/SRC/dporfs.f +++ b/SRC/dporfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X, * LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPORFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite, *> and provides error bounds and backward error estimates for the *> solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,16 +158,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dporfsx.f b/SRC/dporfsx.f index 3772991..a3b3ed3 100644 --- a/SRC/dporfsx.f +++ b/SRC/dporfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B, * LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPORFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive @@ -58,11 +56,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -378,10 +375,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dposv.f b/SRC/dposv.f index 1e8963f..784bd6a 100644 --- a/SRC/dposv.f +++ b/SRC/dposv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOSV computes the solution to a real system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dposvx.f b/SRC/dposvx.f index 55dff5b..4e6f09d 100644 --- a/SRC/dposvx.f +++ b/SRC/dposvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, @@ -34,11 +34,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to *> compute the solution to a real system of linear equations @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -86,11 +89,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -287,10 +289,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dposvxx.f b/SRC/dposvxx.f index 8c3ff0f..8af16bd 100644 --- a/SRC/dposvxx.f +++ b/SRC/dposvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T *> to compute the solution to a double precision system of linear equations @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what DPOSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -105,11 +106,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -475,10 +475,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpotf2.f b/SRC/dpotf2.f index 4604659..acf564a 100644 --- a/SRC/dpotf2.f +++ b/SRC/dpotf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOTF2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOTF2 computes the Cholesky factorization of a real symmetric *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpotrf.f b/SRC/dpotrf.f index 0e7010d..7b9cfa4 100644 --- a/SRC/dpotrf.f +++ b/SRC/dpotrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOTRF( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOTRF computes the Cholesky factorization of a real symmetric *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -92,10 +91,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpotri.f b/SRC/dpotri.f index ce3ac0a..a704ecf 100644 --- a/SRC/dpotri.f +++ b/SRC/dpotri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOTRI( UPLO, N, A, LDA, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOTRI computes the inverse of a real symmetric positive definite *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T *> computed by DPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -80,10 +79,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpotrs.f b/SRC/dpotrs.f index 5efb8dc..d8032e8 100644 --- a/SRC/dpotrs.f +++ b/SRC/dpotrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPOTRS solves a system of linear equations A*X = B with a symmetric *> positive definite matrix A using the Cholesky factorization *> A = U**T*U or A = L*L**T computed by DPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/dppcon.f b/SRC/dppcon.f index 9c38072..fe0d60d 100644 --- a/SRC/dppcon.f +++ b/SRC/dppcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPCON( UPLO, N, AP, ANORM, RCOND, WORK, IWORK, INFO ) * @@ -30,11 +30,11 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite packed matrix using @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/dppequ.f b/SRC/dppequ.f index 148214d..d46b34f 100644 --- a/SRC/dppequ.f +++ b/SRC/dppequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION AP( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A in packed storage and reduce @@ -43,11 +43,10 @@ *> This choice of S puts the condition number of B within a factor N of *> the smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -101,10 +100,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpprfs.f b/SRC/dpprfs.f index 1f0c58c..93314af 100644 --- a/SRC/dpprfs.f +++ b/SRC/dpprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR, * BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -147,16 +146,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dppsv.f b/SRC/dppsv.f index bea94b3..2197701 100644 --- a/SRC/dppsv.f +++ b/SRC/dppsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPSV( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPSV computes the solution to a real system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -123,10 +121,9 @@ * *> \ingroup doubleOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -142,7 +139,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dppsvx.f b/SRC/dppsvx.f index a4031f9..57bea1c 100644 --- a/SRC/dppsvx.f +++ b/SRC/dppsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB, * X, LDX, RCOND, FERR, BERR, WORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * $ FERR( * ), S( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to *> compute the solution to a real system of linear equations @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -84,11 +87,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -273,10 +275,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -287,10 +288,9 @@ * *> \ingroup doubleOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -306,7 +306,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpptrf.f b/SRC/dpptrf.f index e6f05e6..77a77c2 100644 --- a/SRC/dpptrf.f +++ b/SRC/dpptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPTRF( UPLO, N, AP, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPTRF computes the Cholesky factorization of a real symmetric *> positive definite matrix A stored in packed format. @@ -41,11 +41,10 @@ *> A = U**T * U, if UPLO = 'U', or *> A = L * L**T, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -84,10 +83,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -98,10 +96,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -117,7 +114,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpptri.f b/SRC/dpptri.f index 10f77ce..e12f531 100644 --- a/SRC/dpptri.f +++ b/SRC/dpptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPTRI( UPLO, N, AP, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPTRI computes the inverse of a real symmetric positive definite *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T *> computed by DPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -78,10 +77,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpptrs.f b/SRC/dpptrs.f index 2844e05..575334e 100644 --- a/SRC/dpptrs.f +++ b/SRC/dpptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPPTRS solves a system of linear equations A*X = B with a symmetric *> positive definite matrix A in packed storage using the Cholesky *> factorization A = U**T*U or A = L*L**T computed by DPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,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/SRC/dpstf2.f b/SRC/dpstf2.f index feae5e9..9ef1b2b 100644 --- a/SRC/dpstf2.f +++ b/SRC/dpstf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -30,11 +30,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPSTF2 computes the Cholesky factorization with complete *> pivoting of a real symmetric positive semidefinite matrix A. @@ -47,11 +47,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpstrf.f b/SRC/dpstrf.f index 0842d78..9f44b43 100644 --- a/SRC/dpstrf.f +++ b/SRC/dpstrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -30,11 +30,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPSTRF computes the Cholesky factorization with complete *> pivoting of a real symmetric positive semidefinite matrix A. @@ -47,11 +47,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dptcon.f b/SRC/dptcon.f index 948baa1..2799737 100644 --- a/SRC/dptcon.f +++ b/SRC/dptcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTCON( N, D, E, ANORM, RCOND, WORK, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTCON computes the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite tridiagonal matrix @@ -42,11 +42,10 @@ *> Norm(inv(A)) is computed by a direct method, and the reciprocal of *> the condition number is computed as *> RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,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 @@ -107,16 +105,14 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The method used is described in Nicholas J. Higham, "Efficient *> Algorithms for Computing the Condition Number of a Tridiagonal *> Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dpteqr.f b/SRC/dpteqr.f index 373f538..293c46e 100644 --- a/SRC/dpteqr.f +++ b/SRC/dpteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric positive definite tridiagonal matrix by first factoring the @@ -51,11 +51,10 @@ *> form, however, may preclude the possibility of obtaining high *> relative accuracy in the small eigenvalues of the original matrix, if *> these eigenvalues range over many orders of magnitude.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -130,10 +129,9 @@ *> if INFO = N+i, i off-diagonal elements of the *> bidiagonal factor did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dptrfs.f b/SRC/dptrfs.f index cbbcdd3..3a9d1de 100644 --- a/SRC/dptrfs.f +++ b/SRC/dptrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTRFS( N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, * BERR, WORK, INFO ) @@ -30,21 +30,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite *> and tridiagonal, and provides error bounds and backward error *> estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -139,16 +138,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dptsv.f b/SRC/dptsv.f index 09cf100..99b2b1d 100644 --- a/SRC/dptsv.f +++ b/SRC/dptsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTSV( N, NRHS, D, E, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTSV computes the solution to a real system of linear equations *> A*X = B, where A is an N-by-N symmetric positive definite tridiagonal @@ -39,11 +39,10 @@ *> *> A is factored as A = L*D*L**T, and the factored form of A is then *> used to solve the system of equations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -99,10 +98,9 @@ *> computed. The factorization has not been completed *> unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dptsvx.f b/SRC/dptsvx.f index 5427ae3..b80da73 100644 --- a/SRC/dptsvx.f +++ b/SRC/dptsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, * RCOND, FERR, BERR, WORK, INFO ) @@ -32,11 +32,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTSVX uses the factorization A = L*D*L**T to compute the solution *> to a real system of linear equations A*X = B, where A is an N-by-N @@ -45,9 +45,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -70,11 +73,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -209,10 +211,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpttrf.f b/SRC/dpttrf.f index fe58f12..a18dac8 100644 --- a/SRC/dpttrf.f +++ b/SRC/dpttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTTRF( N, D, E, INFO ) * @@ -27,20 +27,19 @@ * DOUBLE PRECISION D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTTRF computes the L*D*L**T factorization of a real symmetric *> positive definite tridiagonal matrix A. The factorization may also *> be regarded as having the form A = U**T*D*U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -76,10 +75,9 @@ *> be completed, while if k = N, the factorization was *> completed, but D(N) <= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dpttrs.f b/SRC/dpttrs.f index 898f897..9ef0d8a 100644 --- a/SRC/dpttrs.f +++ b/SRC/dpttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTTRS( N, NRHS, D, E, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTTRS solves a tridiagonal system of the form *> A * X = B @@ -39,11 +39,10 @@ *> diagonal matrix specified in the vector D, L is a unit bidiagonal *> matrix whose subdiagonal is specified in the vector E, and X and B *> are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,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/SRC/dptts2.f b/SRC/dptts2.f index 0ea8ab8..c3929d5 100644 --- a/SRC/dptts2.f +++ b/SRC/dptts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DPTTS2( N, NRHS, D, E, B, LDB ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION B( LDB, * ), D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DPTTS2 solves a tridiagonal system of the form *> A * X = B @@ -39,11 +39,10 @@ *> diagonal matrix specified in the vector D, L is a unit bidiagonal *> matrix whose subdiagonal is specified in the vector E, and X and B *> are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/drscl.f b/SRC/drscl.f index 4e5a80b..2688f12 100644 --- a/SRC/drscl.f +++ b/SRC/drscl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DRSCL( N, SA, SX, INCX ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION SX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DRSCL multiplies an n-element real vector x by the real scalar 1/a. *> This is done without overflow or underflow as long as *> the final result x/a does not overflow or underflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -69,10 +68,9 @@ *> The increment between successive values of the vector SX. *> > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsbev.f b/SRC/dsbev.f index dc490fc..79de1c4 100644 --- a/SRC/dsbev.f +++ b/SRC/dsbev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * INFO ) @@ -29,19 +29,18 @@ * DOUBLE PRECISION AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBEV computes all the eigenvalues and, optionally, eigenvectors of *> a real symmetric band matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -130,10 +129,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsbevd.f b/SRC/dsbevd.f index c4e6aa9..41351c0 100644 --- a/SRC/dsbevd.f +++ b/SRC/dsbevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * LWORK, IWORK, LIWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBEVD computes all the eigenvalues and, optionally, eigenvectors of *> a real symmetric band matrix A. If eigenvectors are desired, it uses @@ -46,11 +46,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -177,10 +176,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsbevx.f b/SRC/dsbevx.f index 1bd8403..42b30ca 100644 --- a/SRC/dsbevx.f +++ b/SRC/dsbevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL, * VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, @@ -33,21 +33,20 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric band matrix A. Eigenvalues and eigenvectors can *> be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -241,10 +240,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsbgst.f b/SRC/dsbgst.f index d7974b6..c134736 100644 --- a/SRC/dsbgst.f +++ b/SRC/dsbgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X, * LDX, WORK, INFO ) @@ -30,11 +30,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBGST reduces a real symmetric-definite banded generalized *> eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, @@ -44,11 +44,10 @@ *> split Cholesky factorization. A is overwritten by C = X**T*A*X, where *> X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the *> bandwidth of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -143,10 +142,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/SRC/dsbgv.f b/SRC/dsbgv.f index 96be241..0c547dc 100644 --- a/SRC/dsbgv.f +++ b/SRC/dsbgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z, * LDZ, WORK, INFO ) @@ -30,21 +30,20 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBGV computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite banded eigenproblem, of *> the form A*x=(lambda)*B*x. Here A and B are assumed to be symmetric *> and banded, and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -161,10 +160,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsbgvd.f b/SRC/dsbgvd.f index 901e7cd..edb077c 100644 --- a/SRC/dsbgvd.f +++ b/SRC/dsbgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, * Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite banded eigenproblem, of the @@ -49,11 +49,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -206,10 +205,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -220,17 +218,11 @@ * *> \ingroup doubleOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, $ Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/dsbgvx.f b/SRC/dsbgvx.f index 1b78371..cda94a6 100644 --- a/SRC/dsbgvx.f +++ b/SRC/dsbgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, * LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, @@ -34,11 +34,11 @@ * $ W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBGVX computes selected eigenvalues, and optionally, eigenvectors *> of a real generalized symmetric-definite banded eigenproblem, of @@ -46,11 +46,10 @@ *> and banded, and B is also positive definite. Eigenvalues and *> eigenvectors can be selected by specifying either all eigenvalues, *> a range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -263,10 +262,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -277,17 +275,11 @@ * *> \ingroup doubleOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, $ LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, diff --git a/SRC/dsbtrd.f b/SRC/dsbtrd.f index b97a907..468ea87 100644 --- a/SRC/dsbtrd.f +++ b/SRC/dsbtrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ, * WORK, INFO ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSBTRD reduces a real symmetric band matrix A to symmetric *> tridiagonal form T by an orthogonal similarity transformation: *> Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -139,10 +138,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 @@ -153,14 +151,12 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by Linda Kaufman, Bell Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dsfrk.f b/SRC/dsfrk.f index fcd7555..fc1a507 100644 --- a/SRC/dsfrk.f +++ b/SRC/dsfrk.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, * C ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for C in RFP Format. *> @@ -49,11 +49,10 @@ *> where alpha and beta are real scalars, C is an n--by--n symmetric *> matrix and A is an n--by--k matrix in the first case and a k--by--n *> matrix in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -150,10 +149,9 @@ *> NT = N*(N+1)/2. On entry, the symmetric matrix C in RFP *> Format. RFP Format is described by TRANSR, UPLO and N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsgesv.f b/SRC/dsgesv.f index 4ea5fcc..985e11a 100644 --- a/SRC/dsgesv.f +++ b/SRC/dsgesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK, * SWORK, ITER, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSGESV computes the solution to a real system of linear equations *> A * X = B, @@ -67,11 +67,10 @@ *> o EPS is the machine epsilon returned by DLAMCH('Epsilon') *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00 *> respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -179,10 +178,9 @@ *> but the factor U is exactly singular, so the solution *> could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dspcon.f b/SRC/dspcon.f index 74f1ae9..e3bf5f3 100644 --- a/SRC/dspcon.f +++ b/SRC/dspcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric packed matrix A using the factorization @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,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/SRC/dspev.f b/SRC/dspev.f index 484f50c..2ade595 100644 --- a/SRC/dspev.f +++ b/SRC/dspev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION AP( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPEV computes all the eigenvalues and, optionally, eigenvectors of a *> real symmetric matrix A in packed storage. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -115,10 +114,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dspevd.f b/SRC/dspevd.f index 679a65d..24de2b0 100644 --- a/SRC/dspevd.f +++ b/SRC/dspevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK, * IWORK, LIWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION AP( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPEVD computes all the eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A in packed storage. If eigenvectors are @@ -46,11 +46,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -163,10 +162,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dspevx.f b/SRC/dspevx.f index 9d31549..bd81df8 100644 --- a/SRC/dspevx.f +++ b/SRC/dspevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, IWORK, IFAIL, @@ -32,21 +32,20 @@ * DOUBLE PRECISION AP( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A in packed storage. Eigenvalues/vectors *> can be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -210,10 +209,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dspgst.f b/SRC/dspgst.f index d9e7f70..b29387c 100644 --- a/SRC/dspgst.f +++ b/SRC/dspgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPGST( ITYPE, UPLO, N, AP, BP, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AP( * ), BP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPGST reduces a real symmetric-definite generalized eigenproblem *> to standard form, using packed storage. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L. *> *> B must have been previously factorized as U**T*U or L*L**T by DPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \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/SRC/dspgv.f b/SRC/dspgv.f index 74c7b5d..8d927e5 100644 --- a/SRC/dspgv.f +++ b/SRC/dspgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * INFO ) @@ -30,22 +30,21 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPGV computes all the eigenvalues and, optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be symmetric, stored in packed format, *> and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -145,10 +144,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dspgvd.f b/SRC/dspgvd.f index fb7d3e9..f07a862 100644 --- a/SRC/dspgvd.f +++ b/SRC/dspgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * LWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -50,11 +50,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -189,10 +188,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -203,17 +201,11 @@ * *> \ingroup doubleOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, $ LWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/dspgvx.f b/SRC/dspgvx.f index 178e0d1..6b968c5 100644 --- a/SRC/dspgvx.f +++ b/SRC/dspgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, * IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPGVX computes selected eigenvalues, and optionally, eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -46,11 +46,10 @@ *> is also positive definite. Eigenvalues and eigenvectors can be *> selected by specifying either a range of values or a range of indices *> for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -241,10 +240,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -255,17 +253,11 @@ * *> \ingroup doubleOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, $ IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, diff --git a/SRC/dsposv.f b/SRC/dsposv.f index 6b22f82..e7ffc83 100644 --- a/SRC/dsposv.f +++ b/SRC/dsposv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPOSV( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, WORK, * SWORK, ITER, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPOSV computes the solution to a real system of linear equations *> A * X = B, @@ -68,11 +68,10 @@ *> o EPS is the machine epsilon returned by DLAMCH('Epsilon') *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00 *> respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -183,10 +182,9 @@ *> factorization could not be completed, and the solution *> has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsprfs.f b/SRC/dsprfs.f index 1641fe2..d96764a 100644 --- a/SRC/dsprfs.f +++ b/SRC/dsprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, * FERR, BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,16 +154,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dspsv.f b/SRC/dspsv.f index e55c4b5..f560353 100644 --- a/SRC/dspsv.f +++ b/SRC/dspsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPSV computes the solution to a real system of linear equations *> A * X = B, @@ -47,11 +47,10 @@ *> triangular matrices, D is symmetric and block diagonal with 1-by-1 *> and 2-by-2 diagonal blocks. The factored form of A is then used to *> solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, so the solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup doubleOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -160,7 +157,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dspsvx.f b/SRC/dspsvx.f index 865492e..1beaf73 100644 --- a/SRC/dspsvx.f +++ b/SRC/dspsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, * LDX, RCOND, FERR, BERR, WORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPSVX uses the diagonal pivoting factorization A = U*D*U**T or *> A = L*D*L**T to compute the solution to a real system of linear @@ -45,9 +45,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -71,11 +74,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -238,10 +240,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -252,10 +253,9 @@ * *> \ingroup doubleOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -271,7 +271,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dsptrd.f b/SRC/dsptrd.f index 49bfd18..c9dc2dd 100644 --- a/SRC/dsptrd.f +++ b/SRC/dsptrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPTRD( UPLO, N, AP, D, E, TAU, INFO ) * @@ -28,20 +28,19 @@ * DOUBLE PRECISION AP( * ), D( * ), E( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPTRD reduces a real symmetric matrix A stored in packed form to *> symmetric tridiagonal form T by an orthogonal similarity *> transformation: Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -148,7 +145,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP, *> overwriting A(i+2:n,i), and tau is stored in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dsptrf.f b/SRC/dsptrf.f index b5c420d..73fe1f2 100644 --- a/SRC/dsptrf.f +++ b/SRC/dsptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPTRF( UPLO, N, AP, IPIV, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPTRF computes the factorization of a real symmetric matrix A stored *> in packed format using the Bunch-Kaufman diagonal pivoting method: @@ -43,11 +43,10 @@ *> where U (or L) is a product of permutation and unit upper (lower) *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,14 +111,10 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 5-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -155,8 +149,12 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> J. Lewis, Boeing Computer Services Company *> * ===================================================================== SUBROUTINE DSPTRF( UPLO, N, AP, IPIV, INFO ) diff --git a/SRC/dsptri.f b/SRC/dsptri.f index 03a8dff..74d6acd 100644 --- a/SRC/dsptri.f +++ b/SRC/dsptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPTRI( UPLO, N, AP, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPTRI computes the inverse of a real symmetric indefinite matrix *> A in packed storage using the factorization A = U*D*U**T or *> A = L*D*L**T computed by DSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsptrs.f b/SRC/dsptrs.f index b623a0b..1a9b492 100644 --- a/SRC/dsptrs.f +++ b/SRC/dsptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * DOUBLE PRECISION AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSPTRS solves a system of linear equations A*X = B with a real *> symmetric matrix A stored in packed format using the factorization *> A = U*D*U**T or A = L*D*L**T computed by DSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,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/SRC/dstebz.f b/SRC/dstebz.f index a893310..9aafd56 100644 --- a/SRC/dstebz.f +++ b/SRC/dstebz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEBZ( RANGE, ORDER, N, VL, VU, IL, IU, ABSTOL, D, E, * M, NSPLIT, W, IBLOCK, ISPLIT, WORK, IWORK, @@ -32,11 +32,11 @@ * DOUBLE PRECISION D( * ), E( * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEBZ computes the eigenvalues of a symmetric tridiagonal *> matrix T. The user may ask for all eigenvalues, all eigenvalues @@ -50,11 +50,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] RANGE *> \verbatim @@ -226,10 +225,12 @@ *> floating-point arithmetic. *> Cure: Increase the PARAMETER "FUDGE", *> recompile, and try again. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> RELFAC DOUBLE PRECISION, default = 2.0e0 *> The relative tolerance. An interval (a,b] lies within *> "relative tolerance" if b-a < RELFAC*ulp*max(|a|,|b|), @@ -244,10 +245,9 @@ *> the worst machine around. Note that this has no effect *> on accuracy of the solution. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dstedc.f b/SRC/dstedc.f index 541b122..465f516 100644 --- a/SRC/dstedc.f +++ b/SRC/dstedc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK, * LIWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEDC computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the divide and conquer method. @@ -48,11 +48,10 @@ *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. See DLAED3 for details. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -166,10 +165,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -180,18 +178,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE DSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK, diff --git a/SRC/dstegr.f b/SRC/dstegr.f index e5f5835..fddbc06 100644 --- a/SRC/dstegr.f +++ b/SRC/dstegr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, @@ -33,11 +33,11 @@ * DOUBLE PRECISION Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEGR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -59,11 +59,10 @@ *> NaNs. Normal execution may create these exceptiona values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -232,10 +231,9 @@ *> the nonzero error code returned by DLARRE or *> DLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -246,19 +244,13 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, LBNL/NERSC, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE DSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, diff --git a/SRC/dstein.f b/SRC/dstein.f index 34abb7f..498eb52 100644 --- a/SRC/dstein.f +++ b/SRC/dstein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK, * IWORK, IFAIL, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEIN computes the eigenvectors of a real symmetric tridiagonal *> matrix T corresponding to specified eigenvalues, using inverse @@ -42,11 +42,10 @@ *> *> The maximum number of iterations allowed for each eigenvector is *> specified by an internal parameter MAXITS (currently set to 5). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -145,10 +144,12 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge *> in MAXITS iterations. Their indices are stored in *> array IFAIL. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> MAXITS INTEGER, default = 5 *> The maximum number of iterations performed. *> @@ -156,10 +157,9 @@ *> The number of iterations performed after norm growth *> criterion is satisfied, should be at least 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dstemr.f b/SRC/dstemr.f index ad044db..1d501a7 100644 --- a/SRC/dstemr.f +++ b/SRC/dstemr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, @@ -34,11 +34,11 @@ * DOUBLE PRECISION Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEMR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -90,11 +90,10 @@ *> floating-point standard in their handling of infinities and NaNs. *> This permits the use of efficient inner loops avoiding a check for *> zero divisors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -286,10 +285,9 @@ *> the nonzero error code returned by DLARRE or *> DLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -300,21 +298,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE DSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, diff --git a/SRC/dsteqr.f b/SRC/dsteqr.f index 79d7691..92f6ef3 100644 --- a/SRC/dsteqr.f +++ b/SRC/dsteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -28,22 +28,21 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the implicit QL or QR method. *> The eigenvectors of a full or band symmetric matrix can also be found *> if DSYTRD or DSPTRD or DSBTRD has been used to reduce this matrix to *> tridiagonal form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -116,10 +115,9 @@ *> matrix which is orthogonally similar to the original *> matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsterf.f b/SRC/dsterf.f index 4a2d84d..4a08391 100644 --- a/SRC/dsterf.f +++ b/SRC/dsterf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTERF( N, D, E, INFO ) * @@ -27,19 +27,18 @@ * DOUBLE PRECISION D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTERF computes all eigenvalues of a symmetric tridiagonal matrix *> using the Pal-Walker-Kahan variant of the QL or QR algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -71,10 +70,9 @@ *> a total of 30*N iterations; if INFO = i, then i *> elements of E have not converged to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dstev.f b/SRC/dstev.f index e2e7683..ad4a9ee 100644 --- a/SRC/dstev.f +++ b/SRC/dstev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEV( JOBZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEV computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric tridiagonal matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -101,10 +100,9 @@ *> > 0: if INFO = i, the algorithm failed to converge; i *> off-diagonal elements of E did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dstevd.f b/SRC/dstevd.f index 31f98ac..0d327f3 100644 --- a/SRC/dstevd.f +++ b/SRC/dstevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEVD( JOBZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK, * LIWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEVD computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric tridiagonal matrix. If eigenvectors are desired, it @@ -46,11 +46,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -147,10 +146,9 @@ *> > 0: if INFO = i, the algorithm failed to converge; i *> off-diagonal elements of E did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dstevr.f b/SRC/dstevr.f index a266fbd..0316a92 100644 --- a/SRC/dstevr.f +++ b/SRC/dstevr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, * M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, @@ -32,11 +32,11 @@ * DOUBLE PRECISION D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEVR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Eigenvalues and @@ -78,11 +78,10 @@ *> hence may abort due to a floating point exception in environments *> which do not handle NaNs and infinities in the ieee standard default *> manner. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -272,10 +271,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: Internal error *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -286,19 +284,13 @@ * *> \ingroup doubleOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n *> Ken Stanley, Computer Science Division, University of -*> California at Berkeley, USA -*> -*> \endverbatim +*> California at Berkeley, USA \n *> * ===================================================================== SUBROUTINE DSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, diff --git a/SRC/dstevx.f b/SRC/dstevx.f index af02662..de22872 100644 --- a/SRC/dstevx.f +++ b/SRC/dstevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSTEVX( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, * M, W, Z, LDZ, WORK, IWORK, IFAIL, INFO ) @@ -31,21 +31,20 @@ * DOUBLE PRECISION D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSTEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix A. Eigenvalues and *> eigenvectors can be selected by specifying either a range of values *> or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -204,10 +203,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsycon.f b/SRC/dsycon.f index afd4bf4..a5d0072 100644 --- a/SRC/dsycon.f +++ b/SRC/dsycon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric matrix A using the factorization @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,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/SRC/dsyconv.f b/SRC/dsyconv.f index 2738076..861bb6f 100644 --- a/SRC/dsyconv.f +++ b/SRC/dsyconv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYCONV convert A given by TRF into L and D and vice-versa. *> Get Non-diag elements of D (returned in workspace) and *> apply or reverse permutation done in TRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,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/SRC/dsyequb.f b/SRC/dsyequb.f index 4cdddbc..2ed2aa9 100644 --- a/SRC/dsyequb.f +++ b/SRC/dsyequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYEQUB computes row and column scalings intended to equilibrate a *> symmetric matrix A and reduce its condition number @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,19 +124,14 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par References: +* ================ *> -*> Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization", -*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. -*> DOI 10.1023/B:NUMA.0000016606.32820.69 +*> Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n +*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n +*> DOI 10.1023/B:NUMA.0000016606.32820.69 \n *> Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE DSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * diff --git a/SRC/dsyev.f b/SRC/dsyev.f index d30d4d0..047e006 100644 --- a/SRC/dsyev.f +++ b/SRC/dsyev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYEV computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -117,10 +116,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsyevd.f b/SRC/dsyevd.f index 7a8b139..0d0ff7b 100644 --- a/SRC/dsyevd.f +++ b/SRC/dsyevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK, * LIWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYEVD computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric matrix A. If eigenvectors are desired, it uses a @@ -49,11 +49,10 @@ *> *> Because of large use of BLAS of level 3, DSYEVD needs N**2 more *> workspace than DSYEVX. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -159,10 +158,9 @@ *> lying in rows and columns INFO/(N+1) through *> mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -173,19 +171,15 @@ * *> \ingroup doubleSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> Modified description of INFO. Sven, 16 Feb 05. -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee \n +*> Modified description of INFO. Sven, 16 Feb 05. \n + + *> * ===================================================================== SUBROUTINE DSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK, diff --git a/SRC/dsyevr.f b/SRC/dsyevr.f index 7683315..ad3a2ef 100644 --- a/SRC/dsyevr.f +++ b/SRC/dsyevr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, @@ -32,11 +32,11 @@ * DOUBLE PRECISION A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYEVR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A. Eigenvalues and eigenvectors can be @@ -95,11 +95,10 @@ *> hence may abort due to a floating point exception in environments *> which do not handle NaNs and infinities in the ieee standard default *> manner. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -298,10 +297,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: Internal error *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -312,21 +310,15 @@ * *> \ingroup doubleSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n *> Ken Stanley, Computer Science Division, University of -*> California at Berkeley, USA +*> California at Berkeley, USA \n *> Jason Riedy, Computer Science Division, University of -*> California at Berkeley, USA -*> -*> \endverbatim +*> California at Berkeley, USA \n *> * ===================================================================== SUBROUTINE DSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, diff --git a/SRC/dsyevx.f b/SRC/dsyevx.f index 90861c0..500a3e4 100644 --- a/SRC/dsyevx.f +++ b/SRC/dsyevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, LWORK, IWORK, @@ -32,21 +32,20 @@ * DOUBLE PRECISION A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A. Eigenvalues and eigenvectors can be *> selected by specifying either a range of values or a range of indices *> for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -229,10 +228,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsygs2.f b/SRC/dsygs2.f index 2b7bf1d..8dd4b0a 100644 --- a/SRC/dsygs2.f +++ b/SRC/dsygs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYGS2 reduces a real symmetric-definite generalized eigenproblem *> to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T *A*L. *> *> B must have been previously factorized as U**T *U or L*L**T by DPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/dsygst.f b/SRC/dsygst.f index 792a807..4717be8 100644 --- a/SRC/dsygst.f +++ b/SRC/dsygst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYGST reduces a real symmetric-definite generalized eigenproblem *> to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L. *> *> B must have been previously factorized as U**T*U or L*L**T by DPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/dsygv.f b/SRC/dsygv.f index dc5e059..32bfb32 100644 --- a/SRC/dsygv.f +++ b/SRC/dsygv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, INFO ) @@ -29,22 +29,21 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYGV computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be symmetric and B is also *> positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -159,10 +158,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsygvd.f b/SRC/dsygvd.f index 0fde04c..fa95e31 100644 --- a/SRC/dsygvd.f +++ b/SRC/dsygvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, IWORK, LIWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -48,11 +48,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -195,10 +194,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -209,20 +207,21 @@ * *> \ingroup doubleSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> Based on contributions by -*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA +*> \verbatim *> *> Modified so that no backsubstitution is performed if DSYEVD fails to *> converge (NEIG in old code could be greater than N causing out of *> bounds reference to A - reported by Ralf Meyer). Also corrected the *> description of INFO and the test on ITYPE. Sven, 16 Feb 05. *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA *> * ===================================================================== SUBROUTINE DSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, diff --git a/SRC/dsygvx.f b/SRC/dsygvx.f index 6f02247..e092775 100644 --- a/SRC/dsygvx.f +++ b/SRC/dsygvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, * VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYGVX computes selected eigenvalues, and optionally, eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -45,11 +45,10 @@ *> and B are assumed to be symmetric and B is also positive definite. *> Eigenvalues and eigenvectors can be selected by specifying either a *> range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -268,10 +267,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -282,17 +280,11 @@ * *> \ingroup doubleSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, $ VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, diff --git a/SRC/dsyrfs.f b/SRC/dsyrfs.f index 9333713..ceea92d 100644 --- a/SRC/dsyrfs.f +++ b/SRC/dsyrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,20 +31,19 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and *> provides error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -167,16 +166,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsyrfsx.f b/SRC/dsyrfsx.f index 14e64b1..d597e8f 100644 --- a/SRC/dsyrfsx.f +++ b/SRC/dsyrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYRFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -386,10 +383,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsysv.f b/SRC/dsysv.f index f4d2acf..8621e24 100644 --- a/SRC/dsysv.f +++ b/SRC/dsysv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, * LWORK, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYSV computes the solution to a real system of linear equations *> A * X = B, @@ -48,11 +48,10 @@ *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then *> used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsysvx.f b/SRC/dsysvx.f index 7b92f4e..e8f3f5a 100644 --- a/SRC/dsysvx.f +++ b/SRC/dsysvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, @@ -33,11 +33,11 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYSVX uses the diagonal pivoting factorization to compute the *> solution to a real system of linear equations A * X = B, @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -73,11 +76,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -264,10 +266,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsysvxx.f b/SRC/dsysvxx.f index 84953d3..2e7976d 100644 --- a/SRC/dsysvxx.f +++ b/SRC/dsysvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYSVXX uses the diagonal pivoting factorization to compute the *> solution to a double precision system of linear equations A * X = B, where A @@ -64,9 +62,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what DSYSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -107,11 +108,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(R) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -486,10 +486,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsyswapr.f b/SRC/dsyswapr.f index 8b0bd6a..10b850a 100644 --- a/SRC/dsyswapr.f +++ b/SRC/dsyswapr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYSWAPR( UPLO, N, A, LDA, I1, I2) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * DOUBLE PRECISION A( LDA, N ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYSWAPR applies an elementary permutation on the rows and the columns of *> a symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,9 @@ *> I2 is INTEGER *> Index of the second row to swap *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsytd2.f b/SRC/dsytd2.f index c85c412..9215d47 100644 --- a/SRC/dsytd2.f +++ b/SRC/dsytd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTD2( UPLO, N, A, LDA, D, E, TAU, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ), D( * ), E( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTD2 reduces a real symmetric matrix A to symmetric tridiagonal *> form T by an orthogonal similarity transformation: Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,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 @@ -126,10 +124,9 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -171,7 +168,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dsytf2.f b/SRC/dsytf2.f index 3bdf48c..be5bf04 100644 --- a/SRC/dsytf2.f +++ b/SRC/dsytf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTF2 computes the factorization of a real symmetric matrix A using *> the Bunch-Kaufman diagonal pivoting method: @@ -45,11 +45,10 @@ *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -124,25 +122,10 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 09-29-06 - patch from -*> Bobby Cheng, MathWorks -*> -*> Replace l.204 and l.372 -*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN -*> by -*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN -*> -*> 01-01-96 - Based on modifications by -*> J. Lewis, Boeing Computer Services Company -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -177,9 +160,28 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> \verbatim *> +*> 09-29-06 - patch from +*> Bobby Cheng, MathWorks +*> +*> Replace l.204 and l.372 +*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN +*> by +*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN +*> +*> 01-01-96 - Based on modifications by +*> J. Lewis, Boeing Computer Services Company +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services +*> Company +*> \endverbatim +* * ===================================================================== SUBROUTINE DSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * diff --git a/SRC/dsytrd.f b/SRC/dsytrd.f index 51bb57a..53fce30 100644 --- a/SRC/dsytrd.f +++ b/SRC/dsytrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO ) * @@ -29,20 +29,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRD reduces a real symmetric matrix A to real symmetric *> tridiagonal form T by an orthogonal similarity transformation: *> Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,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 @@ -145,10 +143,9 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -190,7 +187,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dsytrf.f b/SRC/dsytrf.f index 07341b1..6c835f7 100644 --- a/SRC/dsytrf.f +++ b/SRC/dsytrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRF computes the factorization of a real symmetric matrix A using *> the Bunch-Kaufman diagonal pivoting method. The form of the @@ -46,11 +46,10 @@ *> 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where @@ -180,7 +177,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dsytri.f b/SRC/dsytri.f index da96cbe..6154093 100644 --- a/SRC/dsytri.f +++ b/SRC/dsytri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRI computes the inverse of a real symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> DSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsytri2.f b/SRC/dsytri2.f index c34c8f4..a54a67d 100644 --- a/SRC/dsytri2.f +++ b/SRC/dsytri2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,21 +29,20 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRI2 computes the inverse of a DOUBLE PRECISION hermitian indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> DSYTRF. DSYTRI2 sets the LEADING DIMENSION of the workspace *> before calling DSYTRI2X that actually computes the inverse. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsytri2x.f b/SRC/dsytri2x.f index 71a7985..b569c9a 100644 --- a/SRC/dsytri2x.f +++ b/SRC/dsytri2x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) * @@ -29,20 +29,19 @@ * DOUBLE PRECISION A( LDA, * ), WORK( N+NB+1,* ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRI2X computes the inverse of a real symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> DSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dsytrs.f b/SRC/dsytrs.f index e564c4e..42dc23a 100644 --- a/SRC/dsytrs.f +++ b/SRC/dsytrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRS solves a system of linear equations A*X = B with a real *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by DSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/dsytrs2.f b/SRC/dsytrs2.f index 4ccbb83..3ca7777 100644 --- a/SRC/dsytrs2.f +++ b/SRC/dsytrs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, * WORK, INFO ) @@ -30,20 +30,19 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DSYTRS2 solves a system of linear equations A*X = B with a real *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by DSYTRF and converted by DSYCONV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/SRC/dtbcon.f b/SRC/dtbcon.f index 8c929ce..20d2a82 100644 --- a/SRC/dtbcon.f +++ b/SRC/dtbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBCON estimates the reciprocal of the condition number of a *> triangular band matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -127,10 +126,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/SRC/dtbrfs.f b/SRC/dtbrfs.f index 7d0ddf7..68d2a39 100644 --- a/SRC/dtbrfs.f +++ b/SRC/dtbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular band @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by DTBTRS or some other *> means before entering this routine. DTBRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -172,10 +171,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/SRC/dtbtrs.f b/SRC/dtbtrs.f index e3abf1b..c4a26b3 100644 --- a/SRC/dtbtrs.f +++ b/SRC/dtbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTBTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular band matrix of order N, and B is an *> N-by NRHS matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dtfsm.f b/SRC/dtfsm.f index 57e174f..8d46616 100644 --- a/SRC/dtfsm.f +++ b/SRC/dtfsm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, * B, LDB ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( 0: * ), B( 0: LDB-1, 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for A in RFP Format. *> @@ -50,11 +50,10 @@ *> A is in Rectangular Full Packed (RFP) Format. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -174,10 +173,9 @@ *> max( 1, m ). *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -188,10 +186,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -274,12 +271,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== SUBROUTINE DTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, $ B, LDB ) diff --git a/SRC/dtftri.f b/SRC/dtftri.f index 03c8bca..70dea4d 100644 --- a/SRC/dtftri.f +++ b/SRC/dtftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTFTRI computes the inverse of a triangular matrix A stored in RFP *> format. *> *> This is a Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,10 +111,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -199,7 +196,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtfttp.f b/SRC/dtfttp.f index d321850..608fa58 100644 --- a/SRC/dtfttp.f +++ b/SRC/dtfttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTFTTP( TRANSR, UPLO, N, ARF, AP, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION AP( 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTFTTP copies a triangular matrix A from rectangular full packed *> format (TF) to standard packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -85,10 +84,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 @@ -99,10 +97,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -185,7 +182,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtfttr.f b/SRC/dtfttr.f index f92b979..2629bd2 100644 --- a/SRC/dtfttr.f +++ b/SRC/dtfttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTFTTR copies a triangular matrix A from rectangular full packed *> format (TF) to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -94,10 +93,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 @@ -108,10 +106,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -194,12 +191,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== SUBROUTINE DTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO ) * diff --git a/SRC/dtgevc.f b/SRC/dtgevc.f index 7b5553c..aa6c3be 100644 --- a/SRC/dtgevc.f +++ b/SRC/dtgevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL, * LDVL, VR, LDVR, MM, M, WORK, INFO ) @@ -32,11 +32,11 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGEVC computes some or all of the right and/or left eigenvectors of *> a pair of real matrices (S,P), where S is a quasi-triangular matrix @@ -63,10 +63,10 @@ *> factorization of a matrix pair (A,B), then Z*X and Q*Y *> are the matrices of right and left eigenvectors of (A,B). *> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -219,10 +219,9 @@ *> > 0: the 2-by-2 block (INFO:INFO+1) does not have a complex *> eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -233,10 +232,9 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Allocation of workspace: @@ -291,7 +289,6 @@ *> transpose of the one in storage, so the rowwise method then *> actually accesses columns of A and B at each step, and so is the *> preferred method. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtgex2.f b/SRC/dtgex2.f index 5ae21b1..b033d77 100644 --- a/SRC/dtgex2.f +++ b/SRC/dtgex2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, J1, N1, N2, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGEX2 swaps adjacent diagonal blocks (A11, B11) and (A22, B22) *> of size 1-by-1 or 2-by-2 in an upper (quasi) triangular matrix pair @@ -50,11 +50,10 @@ *> Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T *> Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -173,10 +172,9 @@ *> <0: If INFO = -16: LWORK is too small. Appropriate value *> for LWORK is returned in WORK(1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -187,20 +185,24 @@ * *> \ingroup doubleGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, -*> Umea University, S-901 87 Umea, Sweden. +*> \par Further Details: +* ===================== *> *> In the current code both weak and strong stability tests are *> performed. The user can omit the strong stability test by changing *> the internal logical parameter WANDS to .FALSE.. See ref. [2] for *> details. +* +*> \par Contributors: +* ================== +*> +*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, +*> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -213,7 +215,6 @@ *> Report UMINF - 94.04, Department of Computing Science, Umea *> University, S-901 87 Umea, Sweden, 1994. Also as LAPACK Working *> Note 87. To appear in Numerical Algorithms, 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtgexc.f b/SRC/dtgexc.f index 6a4fa36..7804252 100644 --- a/SRC/dtgexc.f +++ b/SRC/dtgexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, IFST, ILST, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGEXC reorders the generalized real Schur decomposition of a real *> matrix pair (A,B) using an orthogonal equivalence transformation @@ -54,11 +54,10 @@ *> Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T *> Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -187,10 +186,9 @@ *> and ILST points to the first row of the current *> position of the block being moved. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -201,21 +199,21 @@ * *> \ingroup doubleGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtgsen.f b/SRC/dtgsen.f index e3e2110..ccd4d6a 100644 --- a/SRC/dtgsen.f +++ b/SRC/dtgsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB, * ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, M, PL, @@ -36,11 +36,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGSEN reorders the generalized real Schur decomposition of a real *> matrix pair (A, B) (in terms of an orthonormal equivalence trans- @@ -66,11 +66,10 @@ *> the selected cluster and the eigenvalues outside the cluster, resp., *> and norms of "projections" onto left and right eigenspaces w.r.t. *> the selected cluster in the (1,1)-block. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -297,10 +296,9 @@ *> (A, B) may have been partially reordered. *> If requested, 0 is returned in DIF(*), PL and PR. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -311,10 +309,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> DTGSEN first collects the selected eigenvalues by computing @@ -416,13 +413,18 @@ *> based estimate DIF is not wanted (see DLATDF), then the parameter *> IDIFJB (see below) should be changed from 3 to 4 (routine DLATDF *> (IJOB = 2 will be used)). See DTGSYL for more details. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -443,7 +445,6 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, *> 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtgsja.f b/SRC/dtgsja.f index fdf5d29..786f892 100644 --- a/SRC/dtgsja.f +++ b/SRC/dtgsja.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B, * LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV, @@ -34,11 +34,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGSJA computes the generalized singular value decomposition (GSVD) *> of two real upper triangular (or trapezoidal) matrices A and B. @@ -123,11 +123,10 @@ *> The computation of the orthogonal transformation matrices U, V or Q *> is optional. These matrices may either be formed explicitly, or they *> may be postmultiplied into input matrices U1, V1, or Q1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -342,10 +341,9 @@ *> may take. If after MAXIT cycles, the routine fails to *> converge, we return INFO = 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -356,10 +354,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> DTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce @@ -374,7 +371,6 @@ *> C1**2 + S1**2 = I, *> *> and R1 is an L-by-L nonsingular upper triangular matrix. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtgsna.f b/SRC/dtgsna.f index 3818668..194e364 100644 --- a/SRC/dtgsna.f +++ b/SRC/dtgsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL, * LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK, @@ -33,11 +33,11 @@ * $ VL( LDVL, * ), VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or eigenvectors of a matrix pair (A, B) in @@ -49,11 +49,10 @@ *> i.e. A is block upper triangular with 1-by-1 and 2-by-2 diagonal *> blocks. B is upper triangular. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -222,10 +221,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 @@ -236,10 +234,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of a generalized eigenvalue @@ -345,13 +342,18 @@ *> EPS * norm(A, B) / DIF(i). *> *> See ref. [2-3] for more details and further references. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -372,7 +374,6 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, *> No 1, 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtgsy2.f b/SRC/dtgsy2.f index 86294dc..4023aa6 100644 --- a/SRC/dtgsy2.f +++ b/SRC/dtgsy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, @@ -34,11 +34,11 @@ * $ D( LDD, * ), E( LDE, * ), F( LDF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGSY2 solves the generalized Sylvester equation: *> @@ -77,11 +77,10 @@ *> of an upper bound on the separation between to matrix pairs. Then *> the input (A, D), (B, E) are sub-pencils of the matrix pair in *> DTGSYL. See DTGSYL for details. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -251,10 +250,9 @@ *> >0: The matrix pairs (A, D) and (B, E) have common or very *> close eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -265,18 +263,12 @@ * *> \ingroup doubleSYauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE DTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, $ LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, diff --git a/SRC/dtgsyl.f b/SRC/dtgsyl.f index b59acfe..1f29b8c 100644 --- a/SRC/dtgsyl.f +++ b/SRC/dtgsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK, @@ -35,11 +35,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTGSYL solves the generalized Sylvester equation: *> @@ -80,11 +80,10 @@ *> information. *> *> This is a level 3 BLAS algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -253,10 +252,9 @@ *> <0: If INFO = -i, the i-th argument had an illegal value. *> >0: (A, D) and (B, E) have common or close eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -267,15 +265,16 @@ * *> \ingroup doubleSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> *> [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the @@ -293,7 +292,6 @@ *> Condition Estimators for Solving the Generalized Sylvester *> Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7, *> July 1989, pp 745-751. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtpcon.f b/SRC/dtpcon.f index c6590d5..db5e85a 100644 --- a/SRC/dtpcon.f +++ b/SRC/dtpcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPCON estimates the reciprocal of the condition number of a packed *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -114,10 +113,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/SRC/dtpmqrt.f b/SRC/dtpmqrt.f index bc61bd2..9b23b15 100644 --- a/SRC/dtpmqrt.f +++ b/SRC/dtpmqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT, * A, LDA, B, LDB, WORK, INFO ) @@ -30,20 +30,19 @@ * $ T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPMQRT applies a real orthogonal matrix Q obtained from a *> "triangular-pentagonal" real block reflector H to a general *> real matrix C, which consists of two blocks A and B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -167,10 +166,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 @@ -181,10 +179,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The columns of the pentagonal matrix V contain the elementary reflectors @@ -213,7 +210,6 @@ *> If TRANS='N' and SIDE='R', C is on exit replaced with C * Q. *> *> If TRANS='T' and SIDE='R', C is on exit replaced with C * Q**T. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtpqrt.f b/SRC/dtpqrt.f index 7160834..21aed00 100644 --- a/SRC/dtpqrt.f +++ b/SRC/dtpqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK, * INFO ) @@ -28,21 +28,20 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPQRT computes a blocked QR factorization of a real *> "triangular-pentagonal" matrix C, which is composed of a *> triangular block A and pentagonal block B, using the compact *> WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,11 +136,11 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The input matrix C is a (N+M)-by-N matrix *> *> C = [ A ] @@ -185,7 +183,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = [T1 T2 ... TB]. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtpqrt2.f b/SRC/dtpqrt2.f index d7dd3e7..1556ca8 100644 --- a/SRC/dtpqrt2.f +++ b/SRC/dtpqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) * @@ -27,20 +27,19 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPQRT2 computes a QR factorization of a real "triangular-pentagonal" *> matrix C, which is composed of a triangular block A and pentagonal block B, *> using the compact WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -111,10 +110,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 @@ -125,10 +123,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The input matrix C is a (N+M)-by-N matrix @@ -171,7 +168,6 @@ *> *> where W^H is the conjugate transpose of W and T is the upper triangular *> factor of the block reflector. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtprfb.f b/SRC/dtprfb.f index 07bd5b2..3b15964 100644 --- a/SRC/dtprfb.f +++ b/SRC/dtprfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, * V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK ) @@ -30,20 +30,20 @@ * $ V( LDV, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPRFB applies a real "triangular-pentagonal" block reflector H or its *> transpose H**T to a real matrix C, which is composed of two *> blocks A and B, either from the left or right. *> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -185,10 +185,9 @@ *> If SIDE = 'L', LDWORK >= K; *> if SIDE = 'R', LDWORK >= M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -199,10 +198,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix C is a composite matrix formed from blocks A and B. @@ -247,7 +245,6 @@ *> If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L. *> *> If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtprfs.f b/SRC/dtprfs.f index d9f2985..807fbcb 100644 --- a/SRC/dtprfs.f +++ b/SRC/dtprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * FERR, BERR, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular packed @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by DTPTRS or some other *> means before entering this routine. DTPRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,10 +158,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/SRC/dtptri.f b/SRC/dtptri.f index 0e47d2e..a1434f1 100644 --- a/SRC/dtptri.f +++ b/SRC/dtptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPTRI( UPLO, DIAG, N, AP, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPTRI computes the inverse of a real upper or lower triangular *> matrix A stored in packed format. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -83,10 +82,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -97,10 +95,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A triangular matrix A can be transferred to packed storage using one @@ -115,7 +112,6 @@ *> 1 CONTINUE 1 CONTINUE *> JC = JC + J JC = JC + N - J + 1 *> 2 CONTINUE 2 CONTINUE -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtptrs.f b/SRC/dtptrs.f index 180241d..d9a97c4 100644 --- a/SRC/dtptrs.f +++ b/SRC/dtptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> where A is a triangular matrix of order N stored in packed format, *> and B is an N-by-NRHS matrix. A check is made to verify that A is *> nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dtpttf.f b/SRC/dtpttf.f index 168c17a..e76538f 100644 --- a/SRC/dtpttf.f +++ b/SRC/dtpttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * DOUBLE PRECISION AP( 0: * ), ARF( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPTTF copies a triangular matrix A from standard packed format (TP) *> to rectangular full packed format (TF). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -84,10 +83,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 @@ -98,10 +96,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -184,7 +181,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtpttr.f b/SRC/dtpttr.f index 4ee145b..4cc4dd3 100644 --- a/SRC/dtpttr.f +++ b/SRC/dtpttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTPTTR( UPLO, N, AP, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTPTTR copies a triangular matrix A from standard packed format (TP) *> to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/dtrcon.f b/SRC/dtrcon.f index 3568a61..5e0a8c8 100644 --- a/SRC/dtrcon.f +++ b/SRC/dtrcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRCON estimates the reciprocal of the condition number of a *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -121,10 +120,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/SRC/dtrevc.f b/SRC/dtrevc.f index cd775b8..1c4b210 100644 --- a/SRC/dtrevc.f +++ b/SRC/dtrevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, MM, M, WORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTREVC computes some or all of the right and/or left eigenvectors of *> a real upper quasi-triangular matrix T. @@ -56,11 +56,10 @@ *> input matrix. If Q is the orthogonal factor that reduces a matrix *> A to Schur form T, then Q*X and Q*Y are the matrices of right and *> left eigenvectors of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -192,10 +191,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 @@ -206,10 +204,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The algorithm used in this program is basically backward (forward) @@ -219,7 +216,6 @@ *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x| + |y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtrexc.f b/SRC/dtrexc.f index 6623e1a..50374d3 100644 --- a/SRC/dtrexc.f +++ b/SRC/dtrexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, WORK, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION Q( LDQ, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTREXC reorders the real Schur factorization of a real matrix *> A = Q*T*Q**T, so that the diagonal block of T with row index IFST is @@ -47,11 +47,10 @@ *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each *> 2-by-2 diagonal block has its diagonal elements equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -130,10 +129,9 @@ *> reordered, and ILST points to the first row of the *> current position of the block being moved. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dtrrfs.f b/SRC/dtrrfs.f index 153d988..5ac1248 100644 --- a/SRC/dtrrfs.f +++ b/SRC/dtrrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by DTRTRS or some other *> means before entering this routine. DTRRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,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/SRC/dtrsen.f b/SRC/dtrsen.f index 8e79e90..8b0ec23 100644 --- a/SRC/dtrsen.f +++ b/SRC/dtrsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, WR, WI, * M, S, SEP, WORK, LWORK, IWORK, LIWORK, INFO ) @@ -33,11 +33,11 @@ * $ WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRSEN reorders the real Schur factorization of a real matrix *> A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in @@ -52,11 +52,10 @@ *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each *> 2-by-2 diagonal block has its diagonal elemnts equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -222,10 +221,9 @@ *> contain the eigenvalues in the same order as in T; S and *> SEP (if requested) are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -236,10 +234,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> DTRSEN first collects the selected eigenvalues by computing an @@ -310,7 +307,6 @@ *> error in the computed right invariant subspace is *> *> EPS * norm(T) / SEP -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtrsna.f b/SRC/dtrsna.f index 0356ee1..44de99d 100644 --- a/SRC/dtrsna.f +++ b/SRC/dtrsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, S, SEP, MM, M, WORK, LDWORK, IWORK, @@ -33,11 +33,11 @@ * $ VR( LDVR, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or right eigenvectors of a real upper @@ -48,11 +48,10 @@ *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each *> 2-by-2 diagonal block has its diagonal elements equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -205,10 +204,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 @@ -219,10 +217,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of an eigenvalue lambda is @@ -261,7 +258,6 @@ *> is given by *> *> EPS * norm(T) / SEP(i) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtrsyl.f b/SRC/dtrsyl.f index 2deb437..2b02000 100644 --- a/SRC/dtrsyl.f +++ b/SRC/dtrsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, * LDC, SCALE, INFO ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRSYL solves the real Sylvester matrix equation: *> @@ -50,11 +50,10 @@ *> is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; *> each 2-by-2 diagonal block has its diagonal elements equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANA *> \verbatim @@ -148,10 +147,9 @@ *> values were used to solve the equation (but the matrices *> A and B are unchanged). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dtrti2.f b/SRC/dtrti2.f index bba6491..b874e37 100644 --- a/SRC/dtrti2.f +++ b/SRC/dtrti2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRTI2( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRTI2 computes the inverse of a real upper or lower triangular *> matrix. *> *> This is the Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/dtrtri.f b/SRC/dtrtri.f index ff7c97a..423b5a1 100644 --- a/SRC/dtrtri.f +++ b/SRC/dtrtri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRTRI( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRTRI computes the inverse of a real upper or lower triangular *> matrix A. *> *> This is the Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dtrtrs.f b/SRC/dtrtrs.f index bb598c9..cbc760e 100644 --- a/SRC/dtrtrs.f +++ b/SRC/dtrtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, * INFO ) @@ -29,11 +29,11 @@ * DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular matrix of order N, and B is an N-by-NRHS *> matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> indicating that the matrix is singular and the solutions *> X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/dtrttf.f b/SRC/dtrttf.f index 5a6820b..85e2c74 100644 --- a/SRC/dtrttf.f +++ b/SRC/dtrttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRTTF copies a triangular matrix A from standard full format (TR) *> to rectangular full packed format (TF) . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -92,10 +91,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 @@ -106,10 +104,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -192,12 +189,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== SUBROUTINE DTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO ) * diff --git a/SRC/dtrttp.f b/SRC/dtrttp.f index 822db5b..901b30b 100644 --- a/SRC/dtrttp.f +++ b/SRC/dtrttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTRTTP( UPLO, N, A, LDA, AP, INFO ) * @@ -28,19 +28,18 @@ * DOUBLE PRECISION A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTRTTP copies a triangular matrix A from full format (TR) to standard *> packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/dtzrqf.f b/SRC/dtzrqf.f index ebc4125..3c0a74e 100644 --- a/SRC/dtzrqf.f +++ b/SRC/dtzrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTZRQF( M, N, A, LDA, TAU, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine DTZRZF. *> @@ -44,11 +44,10 @@ *> *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -91,10 +90,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 @@ -105,10 +103,9 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The factorization is obtained by Householder's method. The kth @@ -136,7 +133,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dtzrzf.f b/SRC/dtzrzf.f index 9661e37..2941473 100644 --- a/SRC/dtzrzf.f +++ b/SRC/dtzrzf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE DTZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DTZRZF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A *> to upper triangular form by means of orthogonal transformations. @@ -42,11 +42,10 @@ *> *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -108,10 +107,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 @@ -122,14 +120,15 @@ * *> \ingroup doubleOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -156,7 +155,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/dzsum1.f b/SRC/dzsum1.f index c8e9364..9dc835a 100644 --- a/SRC/dzsum1.f +++ b/SRC/dzsum1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX ) * @@ -27,24 +27,21 @@ * COMPLEX*16 CX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> DZSUM1 takes the sum of the absolute values of a complex *> vector and returns a double precision result. *> *> Based on DZASUM from the Level 1 BLAS. *> The change is to use the 'genuine' absolute value. -*> -*> Contributed by Nick Higham for use with ZLACON. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -63,10 +60,9 @@ *> INCX is INTEGER *> The spacing between successive values of CX. INCX > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -77,6 +73,11 @@ * *> \ingroup complex16OTHERauxiliary * +*> \par Contributors: +* ================== +*> +*> Nick Higham for use with ZLACON. +* * ===================================================================== DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX ) * diff --git a/SRC/icmax1.f b/SRC/icmax1.f index 0ef8dc8..187c3f5 100644 --- a/SRC/icmax1.f +++ b/SRC/icmax1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ICMAX1( N, CX, INCX ) * @@ -27,24 +27,21 @@ * COMPLEX CX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ICMAX1 finds the index of the element whose real part has maximum *> absolute value. *> *> Based on ICAMAX from Level 1 BLAS. *> The change is to use the 'genuine' absolute value. -*> -*> Contributed by Nick Higham for use with CLACON. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -63,10 +60,9 @@ *> INCX is INTEGER *> The spacing between successive values of CX. INCX >= 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -77,6 +73,11 @@ * *> \ingroup complexOTHERauxiliary * +*> \par Contributors: +* ================== +*> +*> Nick Higham for use with CLACON. +* * ===================================================================== INTEGER FUNCTION ICMAX1( N, CX, INCX ) * diff --git a/SRC/ieeeck.f b/SRC/ieeeck.f index 06d0f51..c5faddd 100644 --- a/SRC/ieeeck.f +++ b/SRC/ieeeck.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION IEEECK( ISPEC, ZERO, ONE ) * @@ -25,19 +25,18 @@ * REAL ONE, ZERO * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> IEEECK is called from the ILAENV to verify that Infinity and *> possibly NaN arithmetic is safe (i.e. will not trap). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ISPEC *> \verbatim @@ -67,10 +66,9 @@ *> = 0: Arithmetic failed to produce the correct answers *> = 1: Arithmetic produced the correct answers *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilaclc.f b/SRC/ilaclc.f index 8441c5b..cf8550c 100644 --- a/SRC/ilaclc.f +++ b/SRC/ilaclc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILACLC( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILACLC scans A for its last non-zero column. +*> \verbatim *> -*>\endverbatim +*> ILACLC scans A for its last non-zero column. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilaclr.f b/SRC/ilaclr.f index 74a0b62..bf429ab 100644 --- a/SRC/ilaclr.f +++ b/SRC/ilaclr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILACLR( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * COMPLEX A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILACLR scans A for its last non-zero row. +*> \verbatim *> -*>\endverbatim +*> ILACLR scans A for its last non-zero row. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/iladiag.f b/SRC/iladiag.f index 5dc7656..14d0b87 100644 --- a/SRC/iladiag.f +++ b/SRC/iladiag.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILADIAG( DIAG ) * @@ -24,11 +24,11 @@ * CHARACTER DIAG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine translated from a character string specifying if a *> matrix has unit diagonal or not to the relevant BLAST-specified @@ -37,15 +37,14 @@ *> ILADIAG returns an INTEGER. If ILADIAG < 0, then the input is not a *> character indicating a unit or non-unit diagonal. Otherwise ILADIAG *> returns the constant value corresponding to DIAG. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/iladlc.f b/SRC/iladlc.f index fcf4dee..c5d8a9a 100644 --- a/SRC/iladlc.f +++ b/SRC/iladlc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILADLC( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILADLC scans A for its last non-zero column. +*> \verbatim *> -*>\endverbatim +*> ILADLC scans A for its last non-zero column. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/iladlr.f b/SRC/iladlr.f index 28c3350..3e4a731 100644 --- a/SRC/iladlr.f +++ b/SRC/iladlr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILADLR( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILADLR scans A for its last non-zero row. +*> \verbatim *> -*>\endverbatim +*> ILADLR scans A for its last non-zero row. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilaenv.f b/SRC/ilaenv.f index 734c918..d1976f9 100644 --- a/SRC/ilaenv.f +++ b/SRC/ilaenv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILAENV( ISPEC, NAME, OPTS, N1, N2, N3, N4 ) * @@ -25,11 +25,11 @@ * INTEGER ISPEC, N1, N2, N3, N4 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ILAENV is called from the LAPACK routines to choose problem-dependent *> parameters for the local environment. See ISPEC for a description of @@ -47,11 +47,10 @@ *> *> This routine will not function correctly if it is converted to all *> lower case. Converting it to all upper case is allowed. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ISPEC *> \verbatim @@ -124,10 +123,9 @@ *> Problem dimensions for the subroutine NAME; these may not all *> be required. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The following conventions have been used when calling ILAENV from the @@ -160,7 +157,6 @@ *> *> NB = ILAENV( 1, 'STRTRI', UPLO // DIAG, N, -1, -1, -1 ) *> IF( NB.LE.1 ) NB = MAX( 1, N ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ilaprec.f b/SRC/ilaprec.f index 3d07cf3..2d65482 100644 --- a/SRC/ilaprec.f +++ b/SRC/ilaprec.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILAPREC( PREC ) * @@ -24,11 +24,11 @@ * CHARACTER PREC * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine translated from a character string specifying an *> intermediate precision to the relevant BLAST-specified integer @@ -37,15 +37,14 @@ *> ILAPREC returns an INTEGER. If ILAPREC < 0, then the input is not a *> character indicating a supported intermediate precision. Otherwise *> ILAPREC returns the constant value corresponding to PREC. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilaslc.f b/SRC/ilaslc.f index 99fa553..a74a045 100644 --- a/SRC/ilaslc.f +++ b/SRC/ilaslc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILASLC( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILASLC scans A for its last non-zero column. +*> \verbatim *> -*>\endverbatim +*> ILASLC scans A for its last non-zero column. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilaslr.f b/SRC/ilaslr.f index 29ab3fb..93f0ff8 100644 --- a/SRC/ilaslr.f +++ b/SRC/ilaslr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILASLR( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILASLR scans A for its last non-zero row. +*> \verbatim *> -*>\endverbatim +*> ILASLR scans A for its last non-zero row. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilatrans.f b/SRC/ilatrans.f index 6ce3689..5259063 100644 --- a/SRC/ilatrans.f +++ b/SRC/ilatrans.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILATRANS( TRANS ) * @@ -24,11 +24,11 @@ * CHARACTER TRANS * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine translates from a character string specifying a *> transposition operation to the relevant BLAST-specified integer @@ -37,15 +37,14 @@ *> ILATRANS returns an INTEGER. If ILATRANS < 0, then the input is not *> a character indicating a transposition operator. Otherwise ILATRANS *> returns the constant value corresponding to TRANS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilauplo.f b/SRC/ilauplo.f index 494ad74..b21d6fc 100644 --- a/SRC/ilauplo.f +++ b/SRC/ilauplo.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILAUPLO( UPLO ) * @@ -24,11 +24,11 @@ * CHARACTER UPLO * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine translated from a character string specifying a *> upper- or lower-triangular matrix to the relevant BLAST-specified @@ -37,15 +37,14 @@ *> ILAUPLO returns an INTEGER. If ILAUPLO < 0, then the input is not *> a character indicating an upper- or lower-triangular matrix. *> Otherwise ILAUPLO returns the constant value corresponding to UPLO. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilaver.f b/SRC/ilaver.f index 51ffb49..0213334 100644 --- a/SRC/ilaver.f +++ b/SRC/ilaver.f @@ -1,11 +1,9 @@ *> \brief \b ILAVER returns the LAPACK version. -*>\details +*> \details *> \b Purpose: -*>\verbatim -*> +*> \verbatim *> This subroutine returns the LAPACK version. -*> -*>\endverbatim +*> \endverbatim *> *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd.. *> \date November 2011 diff --git a/SRC/ilazlc.f b/SRC/ilazlc.f index b23ca89..faa3ede 100644 --- a/SRC/ilazlc.f +++ b/SRC/ilazlc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILAZLC( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILAZLC scans A for its last non-zero column. +*> \verbatim *> -*>\endverbatim +*> ILAZLC scans A for its last non-zero column. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ilazlr.f b/SRC/ilazlr.f index 3be990d..543b1df 100644 --- a/SRC/ilazlr.f +++ b/SRC/ilazlr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION ILAZLR( M, N, A, LDA ) * @@ -27,18 +27,17 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ILAZLR scans A for its last non-zero row. +*> \verbatim *> -*>\endverbatim +*> ILAZLR scans A for its last non-zero row. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -63,10 +62,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/iparmq.f b/SRC/iparmq.f index 9f6d0c8..6071add 100644 --- a/SRC/iparmq.f +++ b/SRC/iparmq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION IPARMQ( ISPEC, NAME, OPTS, N, ILO, IHI, LWORK ) * @@ -24,20 +24,19 @@ * INTEGER IHI, ILO, ISPEC, LWORK, N * CHARACTER NAME*( * ), OPTS*( * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This program sets problem and machine dependent parameters *> useful for xHSEQR and its subroutines. It is called whenever *> ILAENV is called with 12 <= ISPEC <= 16 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ISPEC *> \verbatim @@ -131,10 +130,9 @@ *> LWORK is integer scalar *> The amount of workspace available. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -145,10 +143,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Little is known about how best to choose these parameters. @@ -212,7 +209,6 @@ *> IPARMQ(ISPEC=16) Select structured matrix multiply. *> (See ISPEC=16 above for details.) *> Default: 3. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/izmax1.f b/SRC/izmax1.f index 267cd2b..a7477df 100644 --- a/SRC/izmax1.f +++ b/SRC/izmax1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION IZMAX1( N, CX, INCX ) * @@ -27,24 +27,21 @@ * COMPLEX*16 CX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> IZMAX1 finds the index of the element whose real part has maximum *> absolute value. *> *> Based on IZAMAX from Level 1 BLAS. *> The change is to use the 'genuine' absolute value. -*> -*> Contributed by Nick Higham for use with ZLACON. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -63,10 +60,9 @@ *> INCX is INTEGER *> The spacing between successive values of CX. INCX >= 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -77,6 +73,11 @@ * *> \ingroup complex16OTHERauxiliary * +*> \par Contributors: +* ================== +*> +*> Nick Higham for use with ZLACON. +* * ===================================================================== INTEGER FUNCTION IZMAX1( N, CX, INCX ) * diff --git a/SRC/lsamen.f b/SRC/lsamen.f index 35c5a4b..3fa06ad 100644 --- a/SRC/lsamen.f +++ b/SRC/lsamen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION LSAMEN( N, CA, CB ) * @@ -25,22 +25,21 @@ * INTEGER N * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> LSAMEN tests if the first N letters of CA are the same as the *> first N letters of CB, regardless of case. *> LSAMEN returns .TRUE. if CA and CB are equivalent except for case *> and .FALSE. otherwise. LSAMEN also returns .FALSE. if LEN( CA ) *> or LEN( CB ) is less than N. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -59,10 +58,9 @@ *> CA and CB specify two character strings of length at least N. *> Only the first N characters of each string will be accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sbbcsd.f b/SRC/sbbcsd.f index 9099d02..f214dbd 100644 --- a/SRC/sbbcsd.f +++ b/SRC/sbbcsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q, * THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T, @@ -35,11 +35,11 @@ * $ V2T( LDV2T, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SBBCSD computes the CS decomposition of an orthogonal matrix in *> bidiagonal-block form, @@ -68,11 +68,10 @@ *> The orthogonal matrices U1, U2, V1T, and V2T are input/output. *> The input matrices are pre- or post-multiplied by the appropriate *> singular vector matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -297,25 +296,26 @@ *> > 0: if SBBCSD did not converge, INFO specifies the number *> of nonzero entries in PHI, and B11D, B11E, etc., *> contain the partially reduced matrix. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Reference -*> ========= -*> -*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. -*> Algorithms, 50(1):33-65, 2009. -*> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL REAL, default = MAX(10,MIN(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they *> are within TOLMUL*EPS of either bound. *> \endverbatim +* +*> \par References: +* ================ *> +*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. +*> Algorithms, 50(1):33-65, 2009. * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sbdsdc.f b/SRC/sbdsdc.f index 19569ad..a2eba92 100644 --- a/SRC/sbdsdc.f +++ b/SRC/sbdsdc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ, * WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SBDSDC computes the singular value decomposition (SVD) of a real *> N-by-N (upper or lower) bidiagonal matrix B: B = U * S * VT, @@ -55,11 +55,10 @@ *> The code currently calls SLASDQ if singular values only are desired. *> However, it can be slightly modified to compute singular values *> using the divide and conquer method. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -183,10 +182,9 @@ *> > 0: The algorithm failed to compute a singular value. *> The update process of divide and conquer failed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -197,16 +195,11 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA -*> \endverbatim *> * ===================================================================== SUBROUTINE SBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ, diff --git a/SRC/sbdsqr.f b/SRC/sbdsqr.f index 5d7fbcf..eed536f 100644 --- a/SRC/sbdsqr.f +++ b/SRC/sbdsqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, * LDU, C, LDC, WORK, INFO ) @@ -30,11 +30,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SBDSQR computes the singular values and, optionally, the right and/or *> left singular vectors from the singular value decomposition (SVD) of @@ -65,11 +65,10 @@ *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics *> Department, University of California at Berkeley, July 1992 *> for a detailed description of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -187,10 +186,12 @@ *> elements of a bidiagonal matrix which is orthogonally *> similar to the input matrix B; if INFO = i, i *> elements of E have not converged to zero. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL REAL, default = max(10,min(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> If it is positive, TOLMUL*EPS is the desired relative @@ -212,10 +213,9 @@ *> (and so fails to converge) if the number of passes *> through the inner loop exceeds MAXITR*N**2. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/scsum1.f b/SRC/scsum1.f index e6742e0..beed7b4 100644 --- a/SRC/scsum1.f +++ b/SRC/scsum1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SCSUM1( N, CX, INCX ) * @@ -27,24 +27,21 @@ * COMPLEX CX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SCSUM1 takes the sum of the absolute values of a complex *> vector and returns a single precision result. *> *> Based on SCASUM from the Level 1 BLAS. *> The change is to use the 'genuine' absolute value. -*> -*> Contributed by Nick Higham for use with CLACON. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -63,10 +60,9 @@ *> INCX is INTEGER *> The spacing between successive values of CX. INCX > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -77,6 +73,11 @@ * *> \ingroup complexOTHERauxiliary * +*> \par Contributors: +* ================== +*> +*> Nick Higham for use with CLACON. +* * ===================================================================== REAL FUNCTION SCSUM1( N, CX, INCX ) * diff --git a/SRC/sdisna.f b/SRC/sdisna.f index bc22252..f150c7a 100644 --- a/SRC/sdisna.f +++ b/SRC/sdisna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SDISNA( JOB, M, N, D, SEP, INFO ) * @@ -28,11 +28,11 @@ * REAL D( * ), SEP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SDISNA computes the reciprocal condition numbers for the eigenvectors *> of a real symmetric or complex Hermitian matrix or for the left or @@ -51,11 +51,10 @@ *> *> SDISNA may also be used to compute error bounds for eigenvectors of *> the generalized symmetric definite eigenproblem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -102,10 +101,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/SRC/sgbbrd.f b/SRC/sgbbrd.f index a6f61ea..c9de2a3 100644 --- a/SRC/sgbbrd.f +++ b/SRC/sgbbrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q, * LDQ, PT, LDPT, C, LDC, WORK, INFO ) @@ -30,22 +30,21 @@ * $ PT( LDPT, * ), Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBBRD reduces a real general m-by-n band matrix A to upper *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. *> *> The routine computes B, and optionally forms Q or P**T, or computes *> Q**T*C for a given matrix C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -171,10 +170,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/SRC/sgbcon.f b/SRC/sgbcon.f index abd2703..b1974eb 100644 --- a/SRC/sgbcon.f +++ b/SRC/sgbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND, * WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBCON estimates the reciprocal of the condition number of a real *> general band matrix A, in either the 1-norm or the infinity-norm, @@ -44,11 +44,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -130,10 +129,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/SRC/sgbequ.f b/SRC/sgbequ.f index c0c8825..8980324 100644 --- a/SRC/sgbequ.f +++ b/SRC/sgbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -29,11 +29,11 @@ * REAL AB( LDAB, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBEQU computes row and column scalings intended to equilibrate an *> M-by-N band matrix A and reduce its condition number. R returns the @@ -45,11 +45,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -137,10 +136,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgbequb.f b/SRC/sgbequb.f index 3cdef6f..b9de2ec 100644 --- a/SRC/sgbequb.f +++ b/SRC/sgbequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -29,11 +29,11 @@ * REAL AB( LDAB, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -52,11 +52,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -144,10 +143,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgbrfs.f b/SRC/sgbrfs.f index 17c0993..b4f480c 100644 --- a/SRC/sgbrfs.f +++ b/SRC/sgbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, @@ -32,20 +32,19 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is banded, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -180,16 +179,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgbrfsx.f b/SRC/sgbrfsx.f index 8a5e17f..69d4bcd 100644 --- a/SRC/sgbrfsx.f +++ b/SRC/sgbrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBRFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -58,11 +56,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -423,10 +420,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgbsv.f b/SRC/sgbsv.f index 1c837ac..76b9c2c 100644 --- a/SRC/sgbsv.f +++ b/SRC/sgbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBSV computes the solution to a real system of linear equations *> A * X = B, where A is a band matrix of order N with KL subdiagonals @@ -43,11 +43,10 @@ *> and unit lower triangular matrices with KL subdiagonals, and U is *> upper triangular with KL+KU superdiagonals. The factored form of A *> is then used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -125,10 +124,9 @@ *> has been completed, but the factor U is exactly *> singular, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,10 +137,9 @@ * *> \ingroup realGBsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -160,7 +157,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgbsvx.f b/SRC/sgbsvx.f index 81fbaa4..1336b7a 100644 --- a/SRC/sgbsvx.f +++ b/SRC/sgbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBSVX uses the LU factorization to compute the solution to a real *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed by this subroutine: *> @@ -87,11 +90,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -348,10 +350,9 @@ *> there are a number of situations where the *> computed solution can be more accurate than the *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgbsvxx.f b/SRC/sgbsvxx.f index ddf4e60..3a4ee9b 100644 --- a/SRC/sgbsvxx.f +++ b/SRC/sgbsvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBSVXX uses the LU factorization to compute the solution to a *> real system of linear equations A * X = B, where A is an @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what SGBSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -109,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -543,10 +543,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgbtf2.f b/SRC/sgbtf2.f index 871bca5..2e83fc9 100644 --- a/SRC/sgbtf2.f +++ b/SRC/sgbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * REAL AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBTF2 computes an LU factorization of a real m-by-n band matrix A *> using partial pivoting with row interchanges. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup realGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -143,7 +140,6 @@ *> + need not be set on entry, but are required by the routine to store *> elements of U, because of fill-in resulting from the row *> interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgbtrf.f b/SRC/sgbtrf.f index 9add535..3b6d19e 100644 --- a/SRC/sgbtrf.f +++ b/SRC/sgbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * REAL AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBTRF computes an LU factorization of a real m-by-n band matrix A *> using partial pivoting with row interchanges. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup realGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -142,7 +139,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgbtrs.f b/SRC/sgbtrs.f index 478bb81..84deab3 100644 --- a/SRC/sgbtrs.f +++ b/SRC/sgbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * REAL AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGBTRS solves a system of linear equations *> A * X = B or A**T * X = B *> with a general band matrix A using the LU factorization computed *> by SGBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/sgebak.f b/SRC/sgebak.f index 2535e21..0f18212 100644 --- a/SRC/sgebak.f +++ b/SRC/sgebak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV, * INFO ) @@ -29,20 +29,19 @@ * REAL V( LDV, * ), SCALE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEBAK forms the right or left eigenvectors of a real general matrix *> by backward transformation on the computed eigenvectors of the *> balanced matrix output by SGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -114,10 +113,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/SRC/sgebal.f b/SRC/sgebal.f index af41d37..92b9bef 100644 --- a/SRC/sgebal.f +++ b/SRC/sgebal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), SCALE( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEBAL balances a general real matrix A. This involves, first, *> permuting A by a similarity transformation to isolate eigenvalues @@ -43,11 +43,10 @@ *> *> Balancing may reduce the 1-norm of the matrix, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -113,10 +112,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 @@ -127,10 +125,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The permutations consist of row and column interchanges which put @@ -158,7 +155,6 @@ *> *> Modified by Tzu-Yi Chen, Computer Science Division, University of *> California at Berkeley, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgebd2.f b/SRC/sgebd2.f index 0647533..5a04ba8 100644 --- a/SRC/sgebd2.f +++ b/SRC/sgebd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO ) * @@ -28,21 +28,20 @@ * $ TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEBD2 reduces a real general m by n matrix A to upper or lower *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,10 +136,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -187,7 +184,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgebrd.f b/SRC/sgebrd.f index ad5a8f6..0b6d84f 100644 --- a/SRC/sgebrd.f +++ b/SRC/sgebrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, * INFO ) @@ -29,21 +29,20 @@ * $ TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEBRD reduces a general real M-by-N matrix A to upper or lower *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -139,10 +138,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 @@ -153,10 +151,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -202,7 +199,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgecon.f b/SRC/sgecon.f index 9f814f0..954d3b4 100644 --- a/SRC/sgecon.f +++ b/SRC/sgecon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGECON estimates the reciprocal of the condition number of a general *> real matrix A, in either the 1-norm or the infinity-norm, using @@ -44,11 +44,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +107,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/SRC/sgeequ.f b/SRC/sgeequ.f index 4b842b9..0bf2e9b 100644 --- a/SRC/sgeequ.f +++ b/SRC/sgeequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEEQU computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -45,11 +45,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -123,10 +122,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgeequb.f b/SRC/sgeequb.f index 3060118..13309e1 100644 --- a/SRC/sgeequb.f +++ b/SRC/sgeequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -52,11 +52,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -130,10 +129,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgees.f b/SRC/sgees.f index 8b564da..df1db42 100644 --- a/SRC/sgees.f +++ b/SRC/sgees.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, WR, WI, * VS, LDVS, WORK, LWORK, BWORK, INFO ) @@ -35,11 +35,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEES computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues, the real Schur form T, and, optionally, the matrix of @@ -57,11 +57,10 @@ *> [ c a ] *> *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -200,10 +199,9 @@ *> the Schur form no longer satisfy SELECT=.TRUE. This *> could also be caused by underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgeesx.f b/SRC/sgeesx.f index dba6cc9..18c6039 100644 --- a/SRC/sgeesx.f +++ b/SRC/sgeesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, * WR, WI, VS, LDVS, RCONDE, RCONDV, WORK, LWORK, @@ -38,11 +38,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEESX computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues, the real Schur form T, and, optionally, the matrix of @@ -67,11 +67,10 @@ *> [ c a ] *> *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -264,10 +263,9 @@ *> the Schur form no longer satisfy SELECT=.TRUE. This *> could also be caused by underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgeev.f b/SRC/sgeev.f index 68f666c..4de6ae7 100644 --- a/SRC/sgeev.f +++ b/SRC/sgeev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEEV( JOBVL, JOBVR, N, A, LDA, WR, WI, VL, LDVL, VR, * LDVR, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WI( * ), WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEEV computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -48,11 +48,10 @@ *> *> The computed eigenvectors are normalized to have Euclidean norm *> equal to 1 and largest component real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -173,10 +172,9 @@ *> elements i+1:N of WR and WI contain eigenvalues which *> have converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgeevx.f b/SRC/sgeevx.f index bd3c223..db62c66 100644 --- a/SRC/sgeevx.f +++ b/SRC/sgeevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, WR, WI, * VL, LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, @@ -34,11 +34,11 @@ * $ WI( * ), WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEEVX computes for an N-by-N real nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -69,11 +69,10 @@ *> (in exact arithmetic) but diagonal scaling will. For further *> explanation of balancing, see section 4.10.2 of the LAPACK *> Users' Guide. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -286,10 +285,9 @@ *> have been computed; elements 1:ILO-1 and i+1:N of WR *> and WI contain eigenvalues which have converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgegs.f b/SRC/sgegs.f index 21b46fe..ff2c21e 100644 --- a/SRC/sgegs.f +++ b/SRC/sgegs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHAR, * ALPHAI, BETA, VSL, LDVSL, VSR, LDVSR, WORK, @@ -32,11 +32,11 @@ * $ VSR( LDVSR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine SGGES. *> @@ -57,11 +57,10 @@ *> SGEGV should be used instead. See SGEGV for a description of the *> eigenvalues of the generalized nonsymmetric eigenvalue problem *> (GNEP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -210,10 +209,9 @@ *> =N+8: error return from SGGBAK (computing VSR) *> =N+9: error return from SLASCL (various places) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgegv.f b/SRC/sgegv.f index 435316b..b2aba6c 100644 --- a/SRC/sgegv.f +++ b/SRC/sgegv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI, * BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * $ VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine SGGEV. *> @@ -67,11 +67,10 @@ *> are left eigenvectors of (A,B). *> *> Note: this routine performs "full balancing" on A and B -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -257,10 +256,9 @@ *> =N+9: error return from SGGBAK (computing VR) *> =N+10: error return from SLASCL (various calls) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -271,10 +269,9 @@ * *> \ingroup realGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing @@ -303,7 +300,6 @@ *> *> [*] See SHGEQZ, SGEGS, or read the book "Matrix Computations", *> by Golub & van Loan, pub. by Johns Hopkins U. Press. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgehd2.f b/SRC/sgehd2.f index af00d4c..8b1729a 100644 --- a/SRC/sgehd2.f +++ b/SRC/sgehd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEHD2 reduces a real general matrix A to upper Hessenberg form H by *> an orthogonal similarity transformation: Q**T * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \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 @@ -112,10 +110,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -147,7 +144,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgehrd.f b/SRC/sgehrd.f index f426823..f90a6ac 100644 --- a/SRC/sgehrd.f +++ b/SRC/sgehrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEHRD reduces a real general matrix A to upper Hessenberg form H by *> an orthogonal similarity transformation: Q**T * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -113,10 +112,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 @@ -127,10 +125,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -166,7 +163,6 @@ *> This file is a slight modification of LAPACK-3.0's DGEHRD *> subroutine incorporating improvements proposed by Quintana-Orti and *> Van de Geijn (2006). (See DLAHR2.) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgejsv.f b/SRC/sgejsv.f index a8b9685..b2bdd23 100644 --- a/SRC/sgejsv.f +++ b/SRC/sgejsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, * M, N, A, LDA, SVA, U, LDU, V, LDV, @@ -33,11 +33,11 @@ * CHARACTER*1 JOBA, JOBP, JOBR, JOBT, JOBU, JOBV * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEJSV computes the singular value decomposition (SVD) of a real M-by-N *> matrix [A], where M >= N. The SVD of [A] is written as @@ -51,11 +51,10 @@ *> the right singular vectors of [A], respectively. The matrices [U] and [V] *> are computed and stored in the arrays U and V, respectively. The diagonal *> of [SIGMA] is computed and stored in the array SVA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBA *> \verbatim @@ -381,10 +380,9 @@ *> > 0 : SGEJSV did not converge in the maximal allowed number *> of sweeps. The computed values may be inaccurate. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -395,10 +393,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> SGEJSV implements a preconditioned Jacobi SVD algorithm. It uses SGEQP3, @@ -439,12 +436,17 @@ *> this extra QRF step easily. The implementer can also improve data movement *> (matrix transpose, matrix copy, matrix transposed copy) - this *> implementation of SGEJSV uses only the simplest, naive data movement. -*> -*> Contributors +*> \endverbatim +* +*> \par Contributors: +* ================== *> *> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +* +*> \par References: +* ================ *> -*> References +*> \verbatim *> *> [1] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I. *> SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342. @@ -459,14 +461,14 @@ *> [4] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV, *> QSVD, (H,K)-SVD computations. *> Department of Mathematics, University of Zagreb, 2008. -*> -*> Bugs, examples and comments +*> \endverbatim +* +*> \par Bugs, examples and comments: +* ================================= *> *> Please report all bugs and send interesting examples and/or comments to *> drmac@math.hr. Thank you. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, $ M, N, A, LDA, SVA, U, LDU, V, LDV, diff --git a/SRC/sgelq2.f b/SRC/sgelq2.f index 9d76746..9331362 100644 --- a/SRC/sgelq2.f +++ b/SRC/sgelq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGELQ2 computes an LQ factorization of a real m by n matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgelqf.f b/SRC/sgelqf.f index adc948b..4db7c3e 100644 --- a/SRC/sgelqf.f +++ b/SRC/sgelqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGELQF computes an LQ factorization of a real M-by-N matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -102,10 +101,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 @@ -116,10 +114,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -133,7 +130,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgels.f b/SRC/sgels.f index a892941..7ffb7af 100644 --- a/SRC/sgels.f +++ b/SRC/sgels.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGELS solves overdetermined or underdetermined real linear systems *> involving an M-by-N matrix A, or its transpose, using a QR or LQ @@ -59,11 +59,10 @@ *> handled in a single call; they are stored as the columns of the *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution *> matrix X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -167,10 +166,9 @@ *> full rank; the least squares solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgelsd.f b/SRC/sgelsd.f index 8e7f5ea..dacd98d 100644 --- a/SRC/sgelsd.f +++ b/SRC/sgelsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, * RANK, WORK, LWORK, IWORK, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGELSD computes the minimum-norm solution to a real linear least *> squares problem: @@ -65,11 +65,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -201,19 +199,13 @@ * *> \ingroup realGEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE SGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, $ RANK, WORK, LWORK, IWORK, INFO ) diff --git a/SRC/sgelss.f b/SRC/sgelss.f index 8550b41..1c2c241 100644 --- a/SRC/sgelss.f +++ b/SRC/sgelss.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), B( LDB, * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGELSS computes the minimum norm solution to a real linear least *> squares problem: @@ -51,11 +51,10 @@ *> The effective rank of A is determined by treating as zero those *> singular values which are less than RCOND times the largest singular *> value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -156,10 +155,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgelsx.f b/SRC/sgelsx.f index d65d17b..7d4e9ea 100644 --- a/SRC/sgelsx.f +++ b/SRC/sgelsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine SGELSY. *> @@ -65,11 +65,10 @@ *> X = P * Z**T [ inv(T11)*Q1**T*B ] *> [ 0 ] *> where Q1 consists of the first RANK columns of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -162,10 +161,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/SRC/sgelsy.f b/SRC/sgelsy.f index 4f77b70..8fb4f64 100644 --- a/SRC/sgelsy.f +++ b/SRC/sgelsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGELSY computes the minimum-norm solution to a real linear least *> squares problem: @@ -72,11 +72,10 @@ *> o Matrix B (the right hand side) is updated with Blas-3. *> o The permutation of matrix B (the right hand side) is faster and *> more simple. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -181,10 +180,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 @@ -195,18 +193,12 @@ * *> \ingroup realGEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> -*> \endverbatim +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n +*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n +*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n *> * ===================================================================== SUBROUTINE SGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, diff --git a/SRC/sgemqrt.f b/SRC/sgemqrt.f index 6c5d8e8..53f2837 100644 --- a/SRC/sgemqrt.f +++ b/SRC/sgemqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, * C, LDC, WORK, INFO ) @@ -29,11 +29,11 @@ * REAL V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEMQRT overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> generated using the compact WY representation as returned by SGEQRT. *> *> Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -152,10 +151,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/SRC/sgeql2.f b/SRC/sgeql2.f index b89d47a..e022a77 100644 --- a/SRC/sgeql2.f +++ b/SRC/sgeql2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQL2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQL2 computes a QL factorization of a real m by n matrix A: *> A = Q * L. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqlf.f b/SRC/sgeqlf.f index 7792461..7ea961e 100644 --- a/SRC/sgeqlf.f +++ b/SRC/sgeqlf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQLF computes a QL factorization of a real M-by-N matrix A: *> A = Q * L. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqp3.f b/SRC/sgeqp3.f index 2a2497e..4bedff7 100644 --- a/SRC/sgeqp3.f +++ b/SRC/sgeqp3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQP3 computes a QR factorization with column pivoting of a *> matrix A: A*P = Q*R using Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,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 @@ -126,10 +124,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -143,13 +140,14 @@ *> where tau is a real/complex scalar, and v is a real/complex vector *> with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in *> A(i+1:m,i), and tau in TAU(i). +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO ) * diff --git a/SRC/sgeqpf.f b/SRC/sgeqpf.f index 83557ad..8a31c2c 100644 --- a/SRC/sgeqpf.f +++ b/SRC/sgeqpf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQPF( M, N, A, LDA, JPVT, TAU, WORK, INFO ) * @@ -28,21 +28,20 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine SGEQP3. *> *> SGEQPF computes a QR factorization with column pivoting of a *> real M-by-N matrix A: A*P = Q*R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -100,10 +99,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 @@ -114,10 +112,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -140,7 +137,6 @@ *> University of Zagreb, Croatia. *> -- April 2011 -- *> For more details see LAPACK Working Note 176. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqr2.f b/SRC/sgeqr2.f index 1e99270..5097190 100644 --- a/SRC/sgeqr2.f +++ b/SRC/sgeqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQR2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQR2 computes a QR factorization of a real m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqr2p.f b/SRC/sgeqr2p.f index d68d9ef..9162bca 100644 --- a/SRC/sgeqr2p.f +++ b/SRC/sgeqr2p.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQR2P( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQR2P computes a QR factorization of a real m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqrf.f b/SRC/sgeqrf.f index 2d2499d..b30b4a6 100644 --- a/SRC/sgeqrf.f +++ b/SRC/sgeqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQRF computes a QR factorization of a real M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqrfp.f b/SRC/sgeqrfp.f index 9fbf1d0..55921d2 100644 --- a/SRC/sgeqrfp.f +++ b/SRC/sgeqrfp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQRFP computes a QR factorization of a real M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqrt.f b/SRC/sgeqrt.f index 1d2b648..bb26c8c 100644 --- a/SRC/sgeqrt.f +++ b/SRC/sgeqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQRT computes a blocked QR factorization of a real M-by-N matrix A *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -100,10 +99,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 @@ -114,11 +112,11 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The matrix V stores the elementary reflectors H(i) in the i-th column *> below the diagonal. For example, if M=5 and N=3, the matrix V is *> @@ -138,7 +136,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = (T1 T2 ... TB). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqrt2.f b/SRC/sgeqrt2.f index f6feaa0..10b4afa 100644 --- a/SRC/sgeqrt2.f +++ b/SRC/sgeqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGEQRT2( M, N, A, LDA, T, LDT, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQRT2 computes a QR factorization of a real M-by-N matrix A, *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,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 @@ -103,10 +101,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -125,7 +122,6 @@ *> H = I - V * T * V**T *> *> where V**T is the transpose of V. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgeqrt3.f b/SRC/sgeqrt3.f index 747b998..26cfe06 100644 --- a/SRC/sgeqrt3.f +++ b/SRC/sgeqrt3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE SGEQRT3( M, N, A, LDA, T, LDT, INFO ) * @@ -27,22 +27,21 @@ * REAL A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGEQRT3 recursively computes a QR factorization of a real M-by-N *> matrix A, using the compact WY representation of Q. *> *> Based on the algorithm of Elmroth and Gustavson, *> IBM J. Res. Develop. Vol 44 No. 4 July 2000. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,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 @@ -106,10 +104,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -130,7 +127,6 @@ *> where V**T is the transpose of V. *> *> For details of the algorithm, see Elmroth and Gustavson (cited above). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgerfs.f b/SRC/sgerfs.f index cd0220d..b570d40 100644 --- a/SRC/sgerfs.f +++ b/SRC/sgerfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,20 +31,19 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGERFS improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates for *> the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -161,16 +160,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgerfsx.f b/SRC/sgerfsx.f index 12f0a1b..8903556 100644 --- a/SRC/sgerfsx.f +++ b/SRC/sgerfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGERFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -398,10 +395,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgerq2.f b/SRC/sgerq2.f index 42d0126..54ad0b9 100644 --- a/SRC/sgerq2.f +++ b/SRC/sgerq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGERQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGERQ2 computes an RQ factorization of a real m by n matrix A: *> A = R * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in *> A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgerqf.f b/SRC/sgerqf.f index 19b162e..64d2284 100644 --- a/SRC/sgerqf.f +++ b/SRC/sgerqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGERQF computes an RQ factorization of a real M-by-N matrix A: *> A = R * Q. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in *> A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgesc2.f b/SRC/sgesc2.f index cbfa967..735a9ca 100644 --- a/SRC/sgesc2.f +++ b/SRC/sgesc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * @@ -29,11 +29,11 @@ * REAL A( LDA, * ), RHS( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESC2 solves a system of linear equations *> @@ -41,11 +41,10 @@ *> *> with a general N-by-N matrix A using the LU factorization with *> complete pivoting computed by SGETC2. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> On exit, SCALE contains the scale factor. SCALE is chosen *> 0 <= SCALE <= 1 to prevent owerflow in the solution. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -107,18 +105,12 @@ * *> \ingroup realGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * diff --git a/SRC/sgesdd.f b/SRC/sgesdd.f index 9e45e53..9972ab0 100644 --- a/SRC/sgesdd.f +++ b/SRC/sgesdd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, * LWORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESDD computes the singular value decomposition (SVD) of a real *> M-by-N matrix A, optionally computing the left and right singular @@ -61,11 +61,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -195,10 +194,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: SBDSDC did not converge, updating process failed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -209,18 +207,12 @@ * *> \ingroup realGEsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, $ LWORK, IWORK, INFO ) diff --git a/SRC/sgesv.f b/SRC/sgesv.f index 98d1288..a6a0376 100644 --- a/SRC/sgesv.f +++ b/SRC/sgesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESV computes the solution to a real system of linear equations *> A * X = B, @@ -44,11 +44,10 @@ *> where P is a permutation matrix, L is unit lower triangular, and U is *> upper triangular. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -107,10 +106,9 @@ *> has been completed, but the factor U is exactly *> singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgesvd.f b/SRC/sgesvd.f index 2362c4a..5ef13c2 100644 --- a/SRC/sgesvd.f +++ b/SRC/sgesvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESVD computes the singular value decomposition (SVD) of a real *> M-by-N matrix A, optionally computing the left and/or right singular @@ -50,11 +50,10 @@ *> U and V are the left and right singular vectors of A. *> *> Note that the routine returns V**T, not V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -195,10 +194,9 @@ *> did not converge to zero. See the description of WORK *> above for details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgesvj.f b/SRC/sgesvj.f index 902dff9..627949e 100644 --- a/SRC/sgesvj.f +++ b/SRC/sgesvj.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, * LDV, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESVJ computes the singular value decomposition (SVD) of a real *> M-by-N matrix A, where M >= N. The SVD of A is written as @@ -45,62 +45,10 @@ *> matrix, and V is an N-by-N orthogonal matrix. The diagonal elements *> of SIGMA are the singular values of A. The columns of U and V are the *> left and the right singular vectors of A, respectively. -*> -*> Further Details -*> ~~~~~~~~~~~~~~~ -*> The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane -*> rotations. The rotations are implemented as fast scaled rotations of -*> Anda and Park [1]. In the case of underflow of the Jacobi angle, a -*> modified Jacobi transformation of Drmac [4] is used. Pivot strategy uses -*> column interchanges of de Rijk [2]. The relative accuracy of the computed -*> singular values and the accuracy of the computed singular vectors (in -*> angle metric) is as guaranteed by the theory of Demmel and Veselic [3]. -*> The condition number that determines the accuracy in the full rank case -*> is essentially min_{D=diag} kappa(A*D), where kappa(.) is the -*> spectral condition number. The best performance of this Jacobi SVD -*> procedure is achieved if used in an accelerated version of Drmac and -*> Veselic [5,6], and it is the kernel routine in the SIGMA library [7]. -*> Some tunning parameters (marked with [TP]) are available for the -*> implementer. -*> The computational range for the nonzero singular values is the machine -*> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even -*> denormalized singular values can be computed with the corresponding -*> gradual loss of accurate digits. -*> -*> Contributors -*> ~~~~~~~~~~~~ -*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) -*> -*> References -*> ~~~~~~~~~~ -*> [1] A. A. Anda and H. Park: Fast plane rotations with dynamic scaling. -*> SIAM J. matrix Anal. Appl., Vol. 15 (1994), pp. 162-174. -*> [2] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the -*> singular value decomposition on a vector computer. -*> SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371. -*> [3] J. Demmel and K. Veselic: Jacobi method is more accurate than QR. -*> [4] Z. Drmac: Implementation of Jacobi rotations for accurate singular -*> value computation in floating point arithmetic. -*> SIAM J. Sci. Comp., Vol. 18 (1997), pp. 1200-1222. -*> [5] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I. -*> SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342. -*> LAPACK Working note 169. -*> [6] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm II. -*> SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1343-1362. -*> LAPACK Working note 170. -*> [7] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV, -*> QSVD, (H,K)-SVD computations. -*> Department of Mathematics, University of Zagreb, 2008. -*> -*> Bugs, Examples and Comments -*> ~~~~~~~~~~~~~~~~~~~~~~~~~~~ -*> Please report all bugs and send interesting test examples and comments to -*> drmac@math.hr. Thank you. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBA *> \verbatim @@ -301,10 +249,9 @@ *> of sweeps. The output may still be useful. See the *> description of WORK. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -315,6 +262,61 @@ * *> \ingroup realGEcomputational * +*> \par Further Details: +* ===================== +*> +*> The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane +*> rotations. The rotations are implemented as fast scaled rotations of +*> Anda and Park [1]. In the case of underflow of the Jacobi angle, a +*> modified Jacobi transformation of Drmac [4] is used. Pivot strategy uses +*> column interchanges of de Rijk [2]. The relative accuracy of the computed +*> singular values and the accuracy of the computed singular vectors (in +*> angle metric) is as guaranteed by the theory of Demmel and Veselic [3]. +*> The condition number that determines the accuracy in the full rank case +*> is essentially min_{D=diag} kappa(A*D), where kappa(.) is the +*> spectral condition number. The best performance of this Jacobi SVD +*> procedure is achieved if used in an accelerated version of Drmac and +*> Veselic [5,6], and it is the kernel routine in the SIGMA library [7]. +*> Some tunning parameters (marked with [TP]) are available for the +*> implementer. \n +*> The computational range for the nonzero singular values is the machine +*> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even +*> denormalized singular values can be computed with the corresponding +*> gradual loss of accurate digits. +*> +*> \par Contributors: +* ================== +*> +*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +*> +*> \par References: +* ================ +*> +*> [1] A. A. Anda and H. Park: Fast plane rotations with dynamic scaling. \n +*> SIAM J. matrix Anal. Appl., Vol. 15 (1994), pp. 162-174. \n\n +*> [2] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the +*> singular value decomposition on a vector computer. \n +*> SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371. \n\n +*> [3] J. Demmel and K. Veselic: Jacobi method is more accurate than QR. \n +*> [4] Z. Drmac: Implementation of Jacobi rotations for accurate singular +*> value computation in floating point arithmetic. \n +*> SIAM J. Sci. Comp., Vol. 18 (1997), pp. 1200-1222. \n\n +*> [5] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I. \n +*> SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342. \n +*> LAPACK Working note 169. \n\n +*> [6] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm II. \n +*> SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1343-1362. \n +*> LAPACK Working note 170. \n\n +*> [7] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV, +*> QSVD, (H,K)-SVD computations.\n +*> Department of Mathematics, University of Zagreb, 2008. +*> +*> \par Bugs, Examples and Comments: +* ================================= +*> +*> Please report all bugs and send interesting test examples and comments to +*> drmac@math.hr. Thank you. +* * ===================================================================== SUBROUTINE SGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V, $ LDV, WORK, LWORK, INFO ) diff --git a/SRC/sgesvx.f b/SRC/sgesvx.f index 88940fb..c30d209 100644 --- a/SRC/sgesvx.f +++ b/SRC/sgesvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESVX uses the LU factorization to compute the solution to a real *> system of linear equations @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -86,11 +89,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -329,10 +331,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgesvxx.f b/SRC/sgesvxx.f index a163635..8feeeb8 100644 --- a/SRC/sgesvxx.f +++ b/SRC/sgesvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGESVXX uses the LU factorization to compute the solution to a *> real system of linear equations A * X = B, where A is an @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what SGESVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -109,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -523,10 +523,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgetc2.f b/SRC/sgetc2.f index d76402b..4e897ee 100644 --- a/SRC/sgetc2.f +++ b/SRC/sgetc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETC2( N, A, LDA, IPIV, JPIV, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGETC2 computes an LU factorization with complete pivoting of the *> n-by-n matrix A. The factorization has the form A = P * L * U * Q, @@ -40,11 +40,10 @@ *> unit diagonal elements and U is upper triangular. *> *> This is the Level 2 BLAS algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> we try to solve for x in Ax = b. So U is perturbed to *> avoid the overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,18 +102,12 @@ * *> \ingroup realGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SGETC2( N, A, LDA, IPIV, JPIV, INFO ) * diff --git a/SRC/sgetf2.f b/SRC/sgetf2.f index 2d6c173..3833cc2 100644 --- a/SRC/sgetf2.f +++ b/SRC/sgetf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETF2( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGETF2 computes an LU factorization of a general m-by-n matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgetrf.f b/SRC/sgetrf.f index 8abbed3..ce812e5 100644 --- a/SRC/sgetrf.f +++ b/SRC/sgetrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGETRF computes an LU factorization of a general M-by-N matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgetri.f b/SRC/sgetri.f index 1c1e340..9444953 100644 --- a/SRC/sgetri.f +++ b/SRC/sgetri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -28,22 +28,21 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGETRI computes the inverse of a matrix using the LU factorization *> computed by SGETRF. *> *> This method inverts U and then computes inv(A) by solving the system *> inv(A)*L = inv(U) for inv(A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, U(i,i) is exactly zero; the matrix is *> singular and its inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgetrs.f b/SRC/sgetrs.f index 809e133..f566a10 100644 --- a/SRC/sgetrs.f +++ b/SRC/sgetrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,21 +29,20 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGETRS solves a system of linear equations *> A * X = B or A**T * X = B *> with a general N-by-N matrix A using the LU factorization computed *> by SGETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/sggbak.f b/SRC/sggbak.f index bb5b89b..5a9167b 100644 --- a/SRC/sggbak.f +++ b/SRC/sggbak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V, * LDV, INFO ) @@ -29,21 +29,20 @@ * REAL LSCALE( * ), RSCALE( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGBAK forms the right or left eigenvectors of a real generalized *> eigenvalue problem A*x = lambda*B*x, by backward transformation on *> the computed eigenvectors of the balanced pair of matrices output by *> SGGBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \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 @@ -136,15 +134,13 @@ * *> \ingroup realGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. Ward, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sggbal.f b/SRC/sggbal.f index 1be41ed..8df6655 100644 --- a/SRC/sggbal.f +++ b/SRC/sggbal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE, * RSCALE, WORK, INFO ) @@ -30,11 +30,11 @@ * $ RSCALE( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGBAL balances a pair of general real matrices (A,B). This *> involves, first, permuting A and B by similarity transformations to @@ -46,11 +46,10 @@ *> Balancing may reduce the 1-norm of the matrices, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors in the *> generalized eigenvalue problem A*x = lambda*B*x. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -152,10 +151,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 @@ -166,15 +164,13 @@ * *> \ingroup realGBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. WARD, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgges.f b/SRC/sgges.f index 7bba330..c6dd510 100644 --- a/SRC/sgges.f +++ b/SRC/sgges.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB, * SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, VSR, @@ -37,11 +37,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGES computes for a pair of N-by-N real nonsymmetric matrices (A,B), *> the generalized eigenvalues, the generalized real Schur form (S,T), @@ -76,11 +76,10 @@ *> and the pair of corresponding 2-by-2 blocks in S and T will have a *> complex conjugate pair of generalized eigenvalues. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -267,10 +266,9 @@ *> be caused due to scaling. *> =N+3: reordering failed in STGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sggesx.f b/SRC/sggesx.f index c0b8a54..a24549e 100644 --- a/SRC/sggesx.f +++ b/SRC/sggesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA, * B, LDB, SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, @@ -41,11 +41,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGESX computes for a pair of N-by-N real nonsymmetric matrices *> (A,B), the generalized eigenvalues, the real Schur form (S,T), and, @@ -81,11 +81,10 @@ *> and the pair of corresponding 2-by-2 blocks in S and T will have a *> complex conjugate pair of generalized eigenvalues. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -329,10 +328,9 @@ *> be caused due to scaling. *> =N+3: reordering failed in STGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -343,10 +341,9 @@ * *> \ingroup realGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> An approximate (asymptotic) bound on the average absolute error of @@ -360,7 +357,6 @@ *> EPS * norm((A, B)) / RCONDV( 2 ). *> *> See LAPACK User's Guide, section 4.11 for more information. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sggev.f b/SRC/sggev.f index 07fbd3b..bf545ef 100644 --- a/SRC/sggev.f +++ b/SRC/sggev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI, * BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * $ VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGEV computes for a pair of N-by-N real nonsymmetric matrices (A,B) *> the generalized eigenvalues, and optionally, the left and/or right @@ -59,11 +59,10 @@ *> *> where u(j)**H is the conjugate-transpose of u(j). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -210,10 +209,9 @@ *> > N: =N+1: other than QZ iteration failed in SHGEQZ. *> =N+2: error return from STGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sggevx.f b/SRC/sggevx.f index daa51c4..8475ebe 100644 --- a/SRC/sggevx.f +++ b/SRC/sggevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB, * ALPHAR, ALPHAI, BETA, VL, LDVL, VR, LDVR, ILO, @@ -37,11 +37,11 @@ * $ VL( LDVL, * ), VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGEVX computes for a pair of N-by-N real nonsymmetric matrices (A,B) *> the generalized eigenvalues, and optionally, the left and/or right @@ -71,11 +71,10 @@ *> *> where u(j)**H is the conjugate-transpose of u(j). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -344,10 +343,9 @@ *> > N: =N+1: other than QZ iteration failed in SHGEQZ. *> =N+2: error return from STGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -358,10 +356,9 @@ * *> \ingroup realGEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing a matrix pair (A,B) includes, first, permuting rows and @@ -386,7 +383,6 @@ *> *> For further explanation of the reciprocal condition numbers RCONDE *> and RCONDV, see section 4.11 of LAPACK User's Guide. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sggglm.f b/SRC/sggglm.f index d276de9..25c9575 100644 --- a/SRC/sggglm.f +++ b/SRC/sggglm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGGLM solves a general Gauss-Markov linear model (GLM) problem: *> @@ -61,11 +61,10 @@ *> x *> *> where inv(B) denotes the inverse of B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -169,10 +168,9 @@ *> rank( A B ) < N; the least squares solution could not *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgghrd.f b/SRC/sgghrd.f index fa54857..3314206 100644 --- a/SRC/sgghrd.f +++ b/SRC/sgghrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q, * LDQ, Z, LDZ, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGHRD reduces a pair of real matrices (A,B) to generalized upper *> Hessenberg form using orthogonal transformations, where A is a @@ -64,11 +64,10 @@ *> If Q1 is the orthogonal matrix from the QR factorization of B in the *> original equation A*x = lambda*B*x, then SGGHRD reduces the original *> problem to generalized Hessenberg form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -181,10 +180,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 @@ -195,16 +193,14 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine reduces A to Hessenberg and B to triangular form by *> an unblocked reduction, as described in _Matrix_Computations_, *> by Golub and Van Loan (Johns Hopkins Press.) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sgglse.f b/SRC/sgglse.f index 6a1bf5e..6eb478b 100644 --- a/SRC/sgglse.f +++ b/SRC/sgglse.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGLSE solves the linear equality-constrained least squares (LSE) *> problem: @@ -52,11 +52,10 @@ *> matrices (B, A) given by *> *> B = (0 R)*Q, A = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,9 @@ *> ( (B) ) *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sggqrf.f b/SRC/sggqrf.f index 29c526d..0378a1a 100644 --- a/SRC/sggqrf.f +++ b/SRC/sggqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGQRF computes a generalized QR factorization of an N-by-M matrix A *> and an N-by-P matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the *> transpose of the matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -165,10 +164,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 @@ -179,10 +177,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -212,7 +209,6 @@ *> B(n-k+i,1:p-k+i-1), and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine SORGRQ. *> To use Z to update another matrix, use LAPACK subroutine SORMRQ. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sggrqf.f b/SRC/sggrqf.f index 7d6c920..6051349 100644 --- a/SRC/sggrqf.f +++ b/SRC/sggrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGRQF computes a generalized RQ factorization of an M-by-N matrix A *> and a P-by-N matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the *> transpose of the matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,9 @@ *> = 0: successful exit *> < 0: if INF0= -i, the i-th argument had an illegal value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -178,10 +176,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -211,7 +208,6 @@ *> and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine SORGQR. *> To use Z to update another matrix, use LAPACK subroutine SORMQR. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sggsvd.f b/SRC/sggsvd.f index 0863324..cb9c3f1 100644 --- a/SRC/sggsvd.f +++ b/SRC/sggsvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, * LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, @@ -33,11 +33,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGSVD computes the generalized singular value decomposition (GSVD) *> of an M-by-N real matrix A and P-by-N real matrix B: @@ -117,11 +117,10 @@ *> *> X = Q*( I 0 ) *> ( 0 inv(R) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -294,10 +293,12 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, the Jacobi-type procedure failed to *> converge. For further details, see subroutine STGSJA. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLA REAL *> TOLB REAL *> TOLA and TOLB are the thresholds to determine the effective @@ -307,10 +308,9 @@ *> The size of TOLA and TOLB may affect the size of backward *> errors of the decomposition. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -321,18 +321,12 @@ * *> \ingroup realOTHERsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> 2-96 Based on modifications by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, $ LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, diff --git a/SRC/sggsvp.f b/SRC/sggsvp.f index ae48121..2e897e5 100644 --- a/SRC/sggsvp.f +++ b/SRC/sggsvp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, * TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, @@ -33,11 +33,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGGSVP computes orthogonal matrices U, V and Q such that *> @@ -62,11 +62,10 @@ *> This decomposition is the preprocessing step for computing the *> Generalized Singular Value Decomposition (GSVD), see subroutine *> SGGSVD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -230,10 +229,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 @@ -244,18 +242,13 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> *> The subroutine uses LAPACK subroutine SGEQPF for the QR factorization *> with column pivoting to detect the effective numerical rank of the *> a matrix. It may be replaced by a better rank determination strategy. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, $ TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, diff --git a/SRC/sgsvj0.f b/SRC/sgsvj0.f index c49c20c..0f5ad9c 100644 --- a/SRC/sgsvj0.f +++ b/SRC/sgsvj0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS, * SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) @@ -31,35 +31,20 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGSVJ0 is called from SGESVJ as a pre-processor and that is its main *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but *> it does not check convergence (stopping criterion). Few tuning *> parameters (marked by [TP]) are available for the implementer. -*> -*> Further Details -*> ~~~~~~~~~~~~~~~ -*> SGSVJ0 is used just to enable SGESVJ to call a simplified version of -*> itself to work on a submatrix of the original matrix. -*> -*> Contributors -*> ~~~~~~~~~~~~ -*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) -*> -*> Bugs, Examples and Comments -*> ~~~~~~~~~~~~~~~~~~~~~~~~~~~ -*> Please report all bugs and send interesting test examples and comments to -*> drmac@math.hr. Thank you. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBV *> \verbatim @@ -199,10 +184,9 @@ *> = 0 : successful exit. *> < 0 : if INFO = -i, then the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -213,6 +197,23 @@ * *> \ingroup realOTHERcomputational * +*> \par Further Details: +* ===================== +*> +*> SGSVJ0 is used just to enable SGESVJ to call a simplified version of +*> itself to work on a submatrix of the original matrix. +*> +*> \par Contributors: +* ================== +*> +*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +*> +*> \par Bugs, Examples and Comments: +* ================================= +*> +*> Please report all bugs and send interesting test examples and comments to +*> drmac@math.hr. Thank you. +* * ===================================================================== SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS, $ SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) diff --git a/SRC/sgsvj1.f b/SRC/sgsvj1.f index 31a2d91..59e04d3 100644 --- a/SRC/sgsvj1.f +++ b/SRC/sgsvj1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV, * EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( LWORK ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGSVJ1 is called from SGESVJ as a pre-processor and that is its main *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but @@ -64,15 +64,10 @@ *> tiled using quadratic tiles of side KBL. Here, KBL is a tunning parmeter. *> The number of sweeps is given in NSWEEP and the orthogonality threshold *> is given in TOL. -*> -*> Contributors -*> ~~~~~~~~~~~~ -*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBV *> \verbatim @@ -219,10 +214,9 @@ *> = 0 : successful exit. *> < 0 : if INFO = -i, then the i-th argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -233,6 +227,11 @@ * *> \ingroup realOTHERcomputational * +*> \par Contributors: +* ================== +*> +*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany) +* * ===================================================================== SUBROUTINE SGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV, $ EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO ) diff --git a/SRC/sgtcon.f b/SRC/sgtcon.f index 461c6ca..8d43f73 100644 --- a/SRC/sgtcon.f +++ b/SRC/sgtcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND, * WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL D( * ), DL( * ), DU( * ), DU2( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTCON estimates the reciprocal of the condition number of a real *> tridiagonal matrix A using the LU factorization as computed by @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -130,10 +129,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/SRC/sgtrfs.f b/SRC/sgtrfs.f index 98c22c7..05d2f91 100644 --- a/SRC/sgtrfs.f +++ b/SRC/sgtrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, @@ -33,20 +33,19 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is tridiagonal, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -184,16 +183,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgtsv.f b/SRC/sgtsv.f index 7c16fd4..219d47b 100644 --- a/SRC/sgtsv.f +++ b/SRC/sgtsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTSV( N, NRHS, DL, D, DU, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * REAL B( LDB, * ), D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTSV solves the equation *> @@ -42,11 +42,10 @@ *> *> Note that the equation A**T*X = B may be solved by interchanging the *> order of the arguments DU and DL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -112,10 +111,9 @@ *> has not been computed. The factorization has not been *> completed unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgtsvx.f b/SRC/sgtsvx.f index 766e683..91028d6 100644 --- a/SRC/sgtsvx.f +++ b/SRC/sgtsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, * DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -34,11 +34,11 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTSVX uses the LU factorization to compute the solution to a real *> system of linear equations A * X = B or A**T * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -71,11 +74,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -273,10 +275,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgttrf.f b/SRC/sgttrf.f index d85d51e..c23265b 100644 --- a/SRC/sgttrf.f +++ b/SRC/sgttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTTRF( N, DL, D, DU, DU2, IPIV, INFO ) * @@ -28,11 +28,11 @@ * REAL D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTTRF computes an LU factorization of a real tridiagonal matrix A *> using elimination with partial pivoting and row interchanges. @@ -42,11 +42,10 @@ *> where L is a product of permutation and unit lower bidiagonal *> matrices and U is upper triangular with nonzeros in only the main *> diagonal and first two superdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sgttrs.f b/SRC/sgttrs.f index 90b5df1..91efca8 100644 --- a/SRC/sgttrs.f +++ b/SRC/sgttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * REAL B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTTRS solves one of the systems of equations *> A*X = B or A**T*X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by SGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/sgtts2.f b/SRC/sgtts2.f index 2c3dc3c..8021ada 100644 --- a/SRC/sgtts2.f +++ b/SRC/sgtts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB ) * @@ -28,21 +28,20 @@ * REAL B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SGTTS2 solves one of the systems of equations *> A*X = B or A**T*X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by SGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITRANS *> \verbatim @@ -113,10 +112,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/shgeqz.f b/SRC/shgeqz.f index e573fcc..908b72c 100644 --- a/SRC/shgeqz.f +++ b/SRC/shgeqz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT, * ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, WORK, @@ -32,11 +32,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SHGEQZ computes the eigenvalues of a real matrix pair (H,T), *> where H is an upper Hessenberg matrix and T is upper triangular, @@ -92,11 +92,10 @@ *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix *> Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973), *> pp. 241--256. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -274,10 +273,9 @@ *> in Schur form, but ALPHAR(i), ALPHAI(i), and *> BETA(i), i=INFO-N+1,...,N should be correct. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -288,10 +286,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Iteration counters: @@ -300,7 +297,6 @@ *> IITER -- counts iterations run since ILAST was last *> changed. This is therefore reset only when a 1-by-1 or *> 2-by-2 block deflates off the bottom. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/shsein.f b/SRC/shsein.f index 0ac9bf6..0bfa168 100644 --- a/SRC/shsein.f +++ b/SRC/shsein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, WR, WI, * VL, LDVL, VR, LDVR, MM, M, WORK, IFAILL, @@ -33,11 +33,11 @@ * $ WI( * ), WORK( * ), WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SHSEIN uses inverse iteration to find specified right and/or left *> eigenvectors of a real upper Hessenberg matrix H. @@ -48,11 +48,10 @@ *> H * x = w * x, y**h * H = w * y**h *> *> where y**h denotes the conjugate transpose of the vector y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -235,10 +234,9 @@ *> failed to converge; see IFAILL and IFAILR for further *> details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -249,16 +247,14 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x|+|y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/shseqr.f b/SRC/shseqr.f index 0cf4a1e..d44759e 100644 --- a/SRC/shseqr.f +++ b/SRC/shseqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z, * LDZ, WORK, LWORK, INFO ) @@ -29,13 +29,12 @@ * REAL H( LDH, * ), WI( * ), WORK( * ), WR( * ), * $ Z( LDZ, * ) * .. -* Purpose -* ======= +* * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SHSEQR computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -46,11 +45,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -226,10 +224,9 @@ *> If INFO .GT. 0 and COMPZ = 'N', then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -240,6 +237,81 @@ * *> \ingroup realOTHERcomputational * +*> \par Contributors: +* ================== +*> +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim +*> +*> Default values supplied by +*> ILAENV(ISPEC,'SHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). +*> It is suggested that these defaults be adjusted in order +*> to attain best performance in each particular +*> computational environment. +*> +*> ISPEC=12: The SLAHQR vs SLAQR0 crossover point. +*> Default: 75. (Must be at least 11.) +*> +*> ISPEC=13: Recommended deflation window size. +*> This depends on ILO, IHI and NS. NS is the +*> number of simultaneous shifts returned +*> by ILAENV(ISPEC=15). (See ISPEC=15 below.) +*> The default for (IHI-ILO+1).LE.500 is NS. +*> The default for (IHI-ILO+1).GT.500 is 3*NS/2. +*> +*> ISPEC=14: Nibble crossover point. (See IPARMQ for +*> details.) Default: 14% of deflation window +*> size. +*> +*> ISPEC=15: Number of simultaneous shifts in a multishift +*> QR iteration. +*> +*> If IHI-ILO+1 is ... +*> +*> greater than ...but less ... the +*> or equal to ... than default is +*> +*> 1 30 NS = 2(+) +*> 30 60 NS = 4(+) +*> 60 150 NS = 10(+) +*> 150 590 NS = ** +*> 590 3000 NS = 64 +*> 3000 6000 NS = 128 +*> 6000 infinity NS = 256 +*> +*> (+) By default some or all matrices of this order +*> are passed to the implicit double shift routine +*> SLAHQR and this parameter is ignored. See +*> ISPEC=12 above and comments in IPARMQ for +*> details. +*> +*> (**) The asterisks (**) indicate an ad-hoc +*> function of N increasing from 10 to 64. +*> +*> ISPEC=16: Select structured matrix multiply. +*> If the number of simultaneous shifts (specified +*> by ISPEC=15) is less than 14, then the default +*> for ISPEC=16 is 0. Otherwise the default for +*> ISPEC=16 is 2. +*> \endverbatim +* +*> \par References: +* ================ +*> +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. +*> \n +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part II: Aggressive Early Deflation, SIAM Journal +*> of Matrix Analysis, volume 23, pages 948--973, 2002. +* * ===================================================================== SUBROUTINE SHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z, $ LDZ, WORK, LWORK, INFO ) @@ -257,75 +329,9 @@ REAL H( LDH, * ), WI( * ), WORK( * ), WR( * ), $ Z( LDZ, * ) * .. -* ================================================================ -* Default values supplied by -* ILAENV(ISPEC,'SHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). -* It is suggested that these defaults be adjusted in order -* to attain best performance in each particular -* computational environment. -* -* ISPEC=12: The SLAHQR vs SLAQR0 crossover point. -* Default: 75. (Must be at least 11.) -* -* ISPEC=13: Recommended deflation window size. -* This depends on ILO, IHI and NS. NS is the -* number of simultaneous shifts returned -* by ILAENV(ISPEC=15). (See ISPEC=15 below.) -* The default for (IHI-ILO+1).LE.500 is NS. -* The default for (IHI-ILO+1).GT.500 is 3*NS/2. -* -* ISPEC=14: Nibble crossover point. (See IPARMQ for -* details.) Default: 14% of deflation window -* size. -* -* ISPEC=15: Number of simultaneous shifts in a multishift -* QR iteration. -* -* If IHI-ILO+1 is ... -* -* greater than ...but less ... the -* or equal to ... than default is -* -* 1 30 NS = 2(+) -* 30 60 NS = 4(+) -* 60 150 NS = 10(+) -* 150 590 NS = ** -* 590 3000 NS = 64 -* 3000 6000 NS = 128 -* 6000 infinity NS = 256 -* -* (+) By default some or all matrices of this order -* are passed to the implicit double shift routine -* SLAHQR and this parameter is ignored. See -* ISPEC=12 above and comments in IPARMQ for -* details. -* -* (**) The asterisks (**) indicate an ad-hoc -* function of N increasing from 10 to 64. -* -* ISPEC=16: Select structured matrix multiply. -* If the number of simultaneous shifts (specified -* by ISPEC=15) is less than 14, then the default -* for ISPEC=16 is 0. Otherwise the default for -* ISPEC=16 is 2. -* -* ================================================================ -* Based on contributions by -* Karen Braman and Ralph Byers, Department of Mathematics, -* University of Kansas, USA -* -* ================================================================ -* References: -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 -* Performance, SIAM Journal of Matrix Analysis, volume 23, pages -* 929--947, 2002. -* -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part II: Aggressive Early Deflation, SIAM Journal -* of Matrix Analysis, volume 23, pages 948--973, 2002. -* -* ================================================================ +* +* ===================================================================== +* * .. Parameters .. * * ==== Matrices of order NTINY or smaller must be processed by diff --git a/SRC/sisnan.f b/SRC/sisnan.f index 2fef67e..0fe1760 100644 --- a/SRC/sisnan.f +++ b/SRC/sisnan.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION SISNAN( SIN ) * @@ -24,30 +24,28 @@ * REAL SIN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SISNAN returns .TRUE. if its argument is NaN, and .FALSE. *> otherwise. To be replaced by the Fortran 2003 intrinsic in the *> future. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIN *> \verbatim *> SIN is REAL *> Input to test for NaN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_gbamv.f b/SRC/sla_gbamv.f index 42579b9..09d5bf1 100644 --- a/SRC/sla_gbamv.f +++ b/SRC/sla_gbamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X, * INCX, BETA, Y, INCY ) @@ -29,11 +29,11 @@ * REAL AB( LDAB, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GBAMV performs one of the matrix-vector operations *> @@ -51,11 +51,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -169,10 +168,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -201,7 +199,6 @@ * .. * * ===================================================================== - * .. Parameters .. REAL ONE, ZERO PARAMETER ( ONE = 1.0E+0, ZERO = 0.0E+0 ) diff --git a/SRC/sla_gbrcond.f b/SRC/sla_gbrcond.f index 13faf6c..f5e27b2 100644 --- a/SRC/sla_gbrcond.f +++ b/SRC/sla_gbrcond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_GBRCOND( TRANS, N, KL, KU, AB, LDAB, AFB, LDAFB, * IPIV, CMODE, C, INFO, WORK, IWORK ) @@ -31,11 +31,11 @@ * $ C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GBRCOND Estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -46,11 +46,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -152,10 +151,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_gbrfsx_extended.f b/SRC/sla_gbrfsx_extended.f index 99434e0..20b7d2c 100644 --- a/SRC/sla_gbrfsx_extended.f +++ b/SRC/sla_gbrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, * NRHS, AB, LDAB, AFB, LDAFB, IPIV, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GBRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -391,10 +390,9 @@ *> < 0: if INFO = -i, the ith argument to SGBTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_gbrpvgrw.f b/SRC/sla_gbrpvgrw.f index 86355aa..4fc7bff 100644 --- a/SRC/sla_gbrpvgrw.f +++ b/SRC/sla_gbrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_GBRPVGRW( N, KL, KU, NCOLS, AB, LDAB, AFB, * LDAFB ) @@ -28,11 +28,11 @@ * REAL AB( LDAB, * ), AFB( LDAFB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GBRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +40,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -101,10 +100,9 @@ *> LDAFB is INTEGER *> The leading dimension of the array AFB. LDAFB >= 2*KL+KU+1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_geamv.f b/SRC/sla_geamv.f index b8376ca..f3ec242 100644 --- a/SRC/sla_geamv.f +++ b/SRC/sla_geamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA, * Y, INCY ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GEAMV performs one of the matrix-vector operations *> @@ -51,11 +51,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -158,10 +157,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_gercond.f b/SRC/sla_gercond.f index 9a909bb..665fe59 100644 --- a/SRC/sla_gercond.f +++ b/SRC/sla_gercond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_GERCOND ( TRANS, N, A, LDA, AF, LDAF, IPIV, * CMODE, C, INFO, WORK, IWORK ) @@ -31,11 +31,11 @@ * $ C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GERCOND estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -46,11 +46,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -134,10 +133,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace.2 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_gerfsx_extended.f b/SRC/sla_gerfsx_extended.f index 6030a09..0e9127e 100644 --- a/SRC/sla_gerfsx_extended.f +++ b/SRC/sla_gerfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, * LDA, AF, LDAF, IPIV, COLEQU, C, B, @@ -41,11 +41,11 @@ * $ ERRS_C( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GERFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERRS_C for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERRS_N and ERRS_C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -377,10 +376,9 @@ *> < 0: if INFO = -i, the ith argument to SGETRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_gerpvgrw.f b/SRC/sla_gerpvgrw.f index 138cc37..775a4b5 100644 --- a/SRC/sla_gerpvgrw.f +++ b/SRC/sla_gerpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_GERPVGRW( N, NCOLS, A, LDA, AF, LDAF ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), AF( LDAF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_GERPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -39,11 +39,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -82,10 +81,9 @@ *> LDAF is INTEGER *> The leading dimension of the array AF. LDAF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_lin_berr.f b/SRC/sla_lin_berr.f index bae4bda..01c731c 100644 --- a/SRC/sla_lin_berr.f +++ b/SRC/sla_lin_berr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR ) * @@ -28,22 +28,21 @@ * REAL RES( N, NRHS ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_LIN_BERR computes componentwise relative backward error from *> the formula *> max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) ) *> where abs(Z) is the componentwise absolute value of the matrix *> or vector Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> BERR is REAL array, dimension (NRHS) *> The componentwise relative backward error from the formula above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_porcond.f b/SRC/sla_porcond.f index 93124c2..d321597 100644 --- a/SRC/sla_porcond.f +++ b/SRC/sla_porcond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_PORCOND( UPLO, N, A, LDA, AF, LDAF, CMODE, C, * INFO, WORK, IWORK ) @@ -31,11 +31,11 @@ * INTEGER IWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_PORCOND Estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -46,11 +46,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_porfsx_extended.f b/SRC/sla_porfsx_extended.f index a7d7d42..b3b26f0 100644 --- a/SRC/sla_porfsx_extended.f +++ b/SRC/sla_porfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, COLEQU, C, B, LDB, Y, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_PORFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -366,10 +365,9 @@ *> < 0: if INFO = -i, the ith argument to SPOTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_porpvgrw.f b/SRC/sla_porpvgrw.f index 9486479..e4a1b3f 100644 --- a/SRC/sla_porpvgrw.f +++ b/SRC/sla_porpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, LDAF, WORK ) * @@ -28,11 +28,12 @@ * REAL A( LDA, * ), AF( LDAF, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> SLA_PORPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +41,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -88,10 +88,9 @@ *> \verbatim *> WORK is REAL array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_syamv.f b/SRC/sla_syamv.f index 02e9150..e9eb7e0 100644 --- a/SRC/sla_syamv.f +++ b/SRC/sla_syamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_SYAMV performs the matrix-vector operation *> @@ -50,11 +50,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -145,10 +144,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -159,10 +157,9 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -174,7 +171,6 @@ *> Richard Hanson, Sandia National Labs. *> -- Modified for the absolute-value product, April 2006 *> Jason Riedy, UC Berkeley -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sla_syrcond.f b/SRC/sla_syrcond.f index e0ee682..9c40a56 100644 --- a/SRC/sla_syrcond.f +++ b/SRC/sla_syrcond.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_SYRCOND( UPLO, N, A, LDA, AF, LDAF, IPIV, CMODE, * C, INFO, WORK, IWORK ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), AF( LDAF, * ), WORK( * ), C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_SYRCOND estimates the Skeel condition number of op(A) * op2(C) *> where op2 is determined by CMODE as follows @@ -45,11 +45,10 @@ *> is computed by computing scaling factors R such that *> diag(R)*A*op2(C) is row equilibrated and computing the standard *> infinity-norm condition number. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> IWORK is INTEGER array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_syrfsx_extended.f b/SRC/sla_syrfsx_extended.f index 3894d31..9530cc1 100644 --- a/SRC/sla_syrfsx_extended.f +++ b/SRC/sla_syrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, IPIV, COLEQU, C, B, LDB, @@ -42,11 +42,12 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> SLA_SYRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -57,11 +58,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -374,10 +374,9 @@ *> < 0: if INFO = -i, the ith argument to SSYTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_syrpvgrw.f b/SRC/sla_syrpvgrw.f index f967470..b766776 100644 --- a/SRC/sla_syrpvgrw.f +++ b/SRC/sla_syrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF, LDAF, IPIV, * WORK ) @@ -30,11 +30,12 @@ * REAL A( LDA, * ), AF( LDAF, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> SLA_SYRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -42,11 +43,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +105,9 @@ *> \verbatim *> WORK is REAL array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sla_wwaddw.f b/SRC/sla_wwaddw.f index 1b74b54..846213a 100644 --- a/SRC/sla_wwaddw.f +++ b/SRC/sla_wwaddw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLA_WWADDW( N, X, Y, W ) * @@ -27,23 +27,20 @@ * REAL X( * ), Y( * ), W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLA_WWADDW adds a vector W into a doubled-single vector (X, Y). *> *> This works for all extant IBM's hex and binary floating point *> arithmetics, but not for decimal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -68,10 +65,9 @@ *> W is REAL array, dimension (N) *> The vector to be added. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slabad.f b/SRC/slabad.f index c5395f6..24ee604 100644 --- a/SRC/slabad.f +++ b/SRC/slabad.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLABAD( SMALL, LARGE ) * @@ -24,11 +24,11 @@ * REAL LARGE, SMALL * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLABAD takes as input the values computed by SLAMCH for underflow and *> overflow, and returns the square root of each of these values if the @@ -38,11 +38,10 @@ *> the values computed by SLAMCH. This subroutine is needed because *> SLAMCH does not compensate for poor arithmetic in the upper half of *> the exponent range, as is found on a Cray. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] SMALL *> \verbatim @@ -59,10 +58,9 @@ *> On exit, if LOG10(LARGE) is sufficiently large, the square *> root of LARGE, otherwise unchanged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slabrd.f b/SRC/slabrd.f index 414212a..af87463 100644 --- a/SRC/slabrd.f +++ b/SRC/slabrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, * LDY ) @@ -29,11 +29,11 @@ * $ TAUQ( * ), X( LDX, * ), Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLABRD reduces the first NB rows and columns of a real general *> m by n matrix A to upper or lower bidiagonal form by an orthogonal @@ -44,11 +44,10 @@ *> bidiagonal form. *> *> This is an auxiliary routine called by SGEBRD -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -148,10 +147,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -162,10 +160,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -207,7 +204,6 @@ *> where a denotes an element of the original matrix which is unchanged, *> vi denotes an element of the vector defining H(i), and ui an element *> of the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slacn2.f b/SRC/slacn2.f index d2e1b1b..63b021d 100644 --- a/SRC/slacn2.f +++ b/SRC/slacn2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLACN2( N, V, X, ISGN, EST, KASE, ISAVE ) * @@ -29,19 +29,18 @@ * REAL V( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLACN2 estimates the 1-norm of a square, real matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> ISAVE is INTEGER array, dimension (3) *> ISAVE is used to save variables between calls to SLACN2 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -107,19 +105,13 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> -*> Contributed by Nick Higham, University of Manchester. *> Originally named SONEST, dated March 16, 1988. *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of -*> a real or complex matrix, with applications to condition estimation", -*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. -*> *> This is a thread safe version of SLACON, which uses the array ISAVE *> in place of a SAVE statement, as follows: *> @@ -127,8 +119,19 @@ *> JUMP ISAVE(1) *> J ISAVE(2) *> ITER ISAVE(3) -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Nick Higham, University of Manchester +* +*> \par References: +* ================ +*> +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> a real or complex matrix, with applications to condition estimation", +*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> * ===================================================================== SUBROUTINE SLACN2( N, V, X, ISGN, EST, KASE, ISAVE ) diff --git a/SRC/slacon.f b/SRC/slacon.f index 2a922c9..f21de87 100644 --- a/SRC/slacon.f +++ b/SRC/slacon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLACON( N, V, X, ISGN, EST, KASE ) * @@ -29,19 +29,18 @@ * REAL V( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLACON estimates the 1-norm of a square, real matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> whether X should be overwritten by A * X or A**T * X. *> On the final return from SLACON, KASE will again be 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,21 +99,19 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Contributed by Nick Higham, University of Manchester. +*> Nick Higham, University of Manchester. \n *> Originally named SONEST, dated March 16, 1988. +* +*> \par References: +* ================ *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of *> a real or complex matrix, with applications to condition estimation", *> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLACON( N, V, X, ISGN, EST, KASE ) * diff --git a/SRC/slacpy.f b/SRC/slacpy.f index 1ad584a..1312862 100644 --- a/SRC/slacpy.f +++ b/SRC/slacpy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLACPY( UPLO, M, N, A, LDA, B, LDB ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLACPY copies all or part of a two-dimensional matrix A to another *> matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -88,10 +87,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sladiv.f b/SRC/sladiv.f index 4a4e7c8..cca5ca0 100644 --- a/SRC/sladiv.f +++ b/SRC/sladiv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLADIV( A, B, C, D, P, Q ) * @@ -24,11 +24,11 @@ * REAL A, B, C, D, P, Q * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLADIV performs complex division in real arithmetic *> @@ -38,11 +38,10 @@ *> *> The algorithm is due to Robert L. Smith and can be found *> in D. Knuth, The art of Computer Programming, Vol.2, p.195 -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -75,10 +74,9 @@ *> Q is REAL *> The scalars p and q in the above expression. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slae2.f b/SRC/slae2.f index 25b6fed..53cb42a 100644 --- a/SRC/slae2.f +++ b/SRC/slae2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAE2( A, B, C, RT1, RT2 ) * @@ -24,22 +24,21 @@ * REAL A, B, C, RT1, RT2 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAE2 computes the eigenvalues of a 2-by-2 symmetric matrix *> [ A B ] *> [ B C ]. *> On return, RT1 is the eigenvalue of larger absolute value, and RT2 *> is the eigenvalue of smaller absolute value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -70,10 +69,9 @@ *> RT2 is REAL *> The eigenvalue of smaller absolute value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,10 +82,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> RT1 is accurate to a few ulps barring over/underflow. @@ -100,7 +97,6 @@ *> Overflow is possible only if RT1 is within a factor of 5 of overflow. *> Underflow is harmless if the input data is 0 or exceeds *> underflow_threshold / macheps. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slaebz.f b/SRC/slaebz.f index ce0075c..5b91530 100644 --- a/SRC/slaebz.f +++ b/SRC/slaebz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAEBZ( IJOB, NITMAX, N, MMAX, MINP, NBMIN, ABSTOL, * RELTOL, PIVMIN, D, E, E2, NVAL, AB, C, MOUT, @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAEBZ contains the iteration loops which compute and use the *> function N(w), which is the count of eigenvalues of a symmetric @@ -75,11 +75,10 @@ *> *> Note: the arguments are, in general, *not* checked for unreasonable *> values. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -265,10 +264,9 @@ *> = 1--MMAX: The last INFO intervals did not converge. *> = MMAX+1: More than MMAX intervals were generated. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -279,10 +277,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine is intended to be called only by other LAPACK @@ -315,7 +312,6 @@ *> >= 0, then the interval will have N(AB(j,1))=NAB(j,1)=f-k and *> N(AB(j,2))=NAB(j,2)=f+r. The cases w(l) < w(l+1) and *> w(l-r)=...=w(l+k) are handled similarly. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slaed0.f b/SRC/slaed0.f index 119f4eb..7b41711 100644 --- a/SRC/slaed0.f +++ b/SRC/slaed0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, * WORK, IWORK, INFO ) @@ -30,19 +30,18 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED0 computes all eigenvalues and corresponding eigenvectors of a *> symmetric tridiagonal matrix using the divide and conquer method. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -150,10 +149,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -164,18 +162,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE SLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, $ WORK, IWORK, INFO ) diff --git a/SRC/slaed1.f b/SRC/slaed1.f index e551786..f17fa9f 100644 --- a/SRC/slaed1.f +++ b/SRC/slaed1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK, * INFO ) @@ -30,11 +30,11 @@ * REAL D( * ), Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED1 computes the updated eigensystem of a diagonal *> matrix after modification by a rank-one symmetric matrix. This @@ -68,11 +68,10 @@ *> directly using the updated eigenvalues. The eigenvectors for *> the current problem are multiplied with the eigenvectors from *> the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -140,10 +139,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -154,18 +152,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE SLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK, diff --git a/SRC/slaed2.f b/SRC/slaed2.f index 41f4102..fe232ac 100644 --- a/SRC/slaed2.f +++ b/SRC/slaed2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W, * Q2, INDX, INDXC, INDXP, COLTYP, INFO ) @@ -32,11 +32,11 @@ * $ W( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED2 merges the two sets of eigenvalues together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -44,11 +44,10 @@ *> eigenvalues are close together or if there is a tiny entry in the *> Z vector. For each such occurrence the order of the related secular *> equation problem is reduced by one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] K *> \verbatim @@ -189,10 +188,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 @@ -203,18 +201,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE SLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W, diff --git a/SRC/slaed3.f b/SRC/slaed3.f index 8d0250c..d71bd17 100644 --- a/SRC/slaed3.f +++ b/SRC/slaed3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX, * CTOT, W, S, INFO ) @@ -31,11 +31,11 @@ * $ S( * ), W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED3 finds the roots of the secular equation, as defined by the *> values in D, W, and RHO, between 1 and K. It makes the @@ -50,11 +50,10 @@ *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] K *> \verbatim @@ -162,10 +161,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -176,18 +174,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE SLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX, diff --git a/SRC/slaed4.f b/SRC/slaed4.f index f365c55..e28c3e2 100644 --- a/SRC/slaed4.f +++ b/SRC/slaed4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO ) * @@ -28,11 +28,11 @@ * REAL D( * ), DELTA( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the I-th updated eigenvalue of a symmetric *> rank-one modification to a diagonal matrix whose elements are @@ -49,11 +49,10 @@ *> *> The method consists of approximating the rational functions in the *> secular equation by simpler interpolating rational functions. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -106,10 +105,12 @@ *> INFO is INTEGER *> = 0: successful exit *> > 0: if INFO = 1, the updating process failed. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> Logical variable ORGATI (origin-at-i?) is used for distinguishing *> whether D(i) or D(i+1) is treated as the origin. *> @@ -122,10 +123,9 @@ *> MAXIT is the maximum number of iterations allowed for each *> eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,18 +136,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO ) * diff --git a/SRC/slaed5.f b/SRC/slaed5.f index 973bb0e..db16ddc 100644 --- a/SRC/slaed5.f +++ b/SRC/slaed5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED5( I, D, Z, DELTA, RHO, DLAM ) * @@ -28,11 +28,11 @@ * REAL D( 2 ), DELTA( 2 ), Z( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the I-th eigenvalue of a symmetric rank-one *> modification of a 2-by-2 diagonal matrix @@ -45,11 +45,10 @@ *> *> We also assume RHO > 0 and that the Euclidean norm of the vector *> Z is one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I *> \verbatim @@ -87,10 +86,9 @@ *> DLAM is REAL *> The computed lambda_I, the I-th updated eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,18 +99,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLAED5( I, D, Z, DELTA, RHO, DLAM ) * diff --git a/SRC/slaed6.f b/SRC/slaed6.f index 753f78c..bd51473 100644 --- a/SRC/slaed6.f +++ b/SRC/slaed6.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO ) * @@ -29,11 +29,11 @@ * REAL D( 3 ), Z( 3 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED6 computes the positive or negative root (closest to the origin) *> of @@ -49,11 +49,10 @@ *> This routine will be called by SLAED4 when necessary. In most cases, *> the root sought is the smallest in magnitude, though it might not be *> in some extremely rare situations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] KNITER *> \verbatim @@ -107,10 +106,9 @@ *> = 0: successful exit *> > 0: if INFO = 1, failure to converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,23 +119,23 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 30/06/99: Based on contributions by -*> Ren-Cang Li, Computer Science Division, University of California -*> at Berkeley, USA +*> \verbatim *> -*> 10/02/03: This version has a few statements commented out for thread safety -*> (machine parameters are computed on each entry). SJH. +*> 10/02/03: This version has a few statements commented out for thread +*> safety (machine parameters are computed on each entry). SJH. *> *> 05/10/06: Modified from a new version of Ren-Cang Li, use *> Gragg-Thornton-Warner cubic convergent scheme for better stability. -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Ren-Cang Li, Computer Science Division, University of California +*> at Berkeley, USA *> * ===================================================================== SUBROUTINE SLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO ) diff --git a/SRC/slaed7.f b/SRC/slaed7.f index b3293ff..2ba207d 100644 --- a/SRC/slaed7.f +++ b/SRC/slaed7.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, * LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR, @@ -35,11 +35,11 @@ * $ QSTORE( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED7 computes the updated eigensystem of a diagonal *> matrix after modification by a rank-one symmetric matrix. This @@ -73,11 +73,10 @@ *> directly using the updated eigenvalues. The eigenvectors for *> the current problem are multiplied with the eigenvectors from *> the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -236,10 +235,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -250,18 +248,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE SLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, $ LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR, diff --git a/SRC/slaed8.f b/SRC/slaed8.f index 3ca47e9..9b89f48 100644 --- a/SRC/slaed8.f +++ b/SRC/slaed8.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO, * CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR, @@ -34,11 +34,11 @@ * $ Q( LDQ, * ), Q2( LDQ2, * ), W( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED8 merges the two sets of eigenvalues together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -46,11 +46,10 @@ *> eigenvalues are close together or if there is a tiny element in the *> Z vector. For each such occurrence the order of the related secular *> equation problem is reduced by one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -220,10 +219,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 @@ -234,18 +232,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE SLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO, $ CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR, diff --git a/SRC/slaed9.f b/SRC/slaed9.f index 7b09e45..afad67d 100644 --- a/SRC/slaed9.f +++ b/SRC/slaed9.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W, * S, LDS, INFO ) @@ -30,21 +30,20 @@ * $ W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAED9 finds the roots of the secular equation, as defined by the *> values in D, Z, and RHO, between KSTART and KSTOP. It makes the *> appropriate calls to SLAED4 and then stores the new matrix of *> eigenvectors for use in calculating the next level of Z vectors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] K *> \verbatim @@ -134,10 +133,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -148,18 +146,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE SLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W, $ S, LDS, INFO ) diff --git a/SRC/slaeda.f b/SRC/slaeda.f index b94985b..10e3100 100644 --- a/SRC/slaeda.f +++ b/SRC/slaeda.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR, * GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO ) @@ -30,20 +30,19 @@ * REAL GIVNUM( 2, * ), Q( * ), Z( * ), ZTEMP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAEDA computes the Z vector corresponding to the merge step in the *> CURLVLth step of the merge process with TLVLS steps for the CURPBMth *> problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -144,10 +143,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 @@ -158,18 +156,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE SLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR, $ GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO ) diff --git a/SRC/slaein.f b/SRC/slaein.f index d067b2e..e8c8856 100644 --- a/SRC/slaein.f +++ b/SRC/slaein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAEIN( RIGHTV, NOINIT, N, H, LDH, WR, WI, VR, VI, B, * LDB, WORK, EPS3, SMLNUM, BIGNUM, INFO ) @@ -31,20 +31,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAEIN uses inverse iteration to find a right or left eigenvector *> corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg *> matrix H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RIGHTV *> \verbatim @@ -156,10 +155,9 @@ *> = 1: inverse iteration did not converge; VR is set to the *> last iterate, and so is VI if WI.ne.0.0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaev2.f b/SRC/slaev2.f index 437553b..7a364fd 100644 --- a/SRC/slaev2.f +++ b/SRC/slaev2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAEV2( A, B, C, RT1, RT2, CS1, SN1 ) * @@ -24,11 +24,11 @@ * REAL A, B, C, CS1, RT1, RT2, SN1 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAEV2 computes the eigendecomposition of a 2-by-2 symmetric matrix *> [ A B ] @@ -39,11 +39,10 @@ *> *> [ CS1 SN1 ] [ A B ] [ CS1 -SN1 ] = [ RT1 0 ] *> [-SN1 CS1 ] [ B C ] [ SN1 CS1 ] [ 0 RT2 ]. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -86,10 +85,9 @@ *> SN1 is REAL *> The vector (CS1, SN1) is a unit right eigenvector for RT1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -100,10 +98,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> RT1 is accurate to a few ulps barring over/underflow. @@ -118,7 +115,6 @@ *> Overflow is possible only if RT1 is within a factor of 5 of overflow. *> Underflow is harmless if the input data is 0 or exceeds *> underflow_threshold / macheps. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slaexc.f b/SRC/slaexc.f index d5087dd..ca43479 100644 --- a/SRC/slaexc.f +++ b/SRC/slaexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAEXC( WANTQ, N, T, LDT, Q, LDQ, J1, N1, N2, WORK, * INFO ) @@ -29,11 +29,11 @@ * REAL Q( LDQ, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAEXC swaps adjacent diagonal blocks T11 and T22 of order 1 or 2 in *> an upper quasi-triangular matrix T by an orthogonal similarity @@ -43,11 +43,10 @@ *> with 1-by-1 and 2-by-2 diagonal blocks; each 2-by-2 diagonal block *> has its diagonal elemnts equal and its off-diagonal elements of *> opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -122,10 +121,9 @@ *> form; the blocks are not swapped and T and Q are *> unchanged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slag2.f b/SRC/slag2.f index 8b89296..6ea0dc3 100644 --- a/SRC/slag2.f +++ b/SRC/slag2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAG2( A, LDA, B, LDB, SAFMIN, SCALE1, SCALE2, WR1, * WR2, WI ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAG2 computes the eigenvalues of a 2 x 2 generalized eigenvalue *> problem A - w B, with scaling as necessary to avoid over-/underflow. @@ -44,11 +44,10 @@ *> *> where s is a non-negative scaling factor chosen so that w, w B, *> and s A do not overflow and, if possible, do not underflow, either. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -140,10 +139,9 @@ *> eigenvalue is complex, then WI is SCALE1 times the imaginary *> part of the eigenvalues. WI will always be non-negative. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slag2d.f b/SRC/slag2d.f index 0a578d6..f491782 100644 --- a/SRC/slag2d.f +++ b/SRC/slag2d.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAG2D( M, N, SA, LDSA, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAG2D converts a SINGLE PRECISION matrix, SA, to a DOUBLE *> PRECISION matrix, A. @@ -42,11 +42,10 @@ *> converting from single to double. *> *> This is an auxiliary routine so there is no argument checking. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,9 @@ *> INFO is INTEGER *> = 0: successful exit *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slags2.f b/SRC/slags2.f index c6ca3a9..f9f95c0 100644 --- a/SRC/slags2.f +++ b/SRC/slags2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV, * SNV, CSQ, SNQ ) @@ -27,11 +27,11 @@ * $ SNU, SNV * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGS2 computes 2-by-2 orthogonal matrices U, V and Q, such *> that if ( UPPER ) then @@ -57,11 +57,10 @@ *> *> Z**T denotes the transpose of Z. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPPER *> \verbatim @@ -136,10 +135,9 @@ *> SNQ is REAL *> The desired orthogonal matrix Q. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slagtf.f b/SRC/slagtf.f index e8c7c68..e5ca39c 100644 --- a/SRC/slagtf.f +++ b/SRC/slagtf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGTF( N, A, LAMBDA, B, C, TOL, D, IN, INFO ) * @@ -29,11 +29,11 @@ * REAL A( * ), B( * ), C( * ), D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGTF factorizes the matrix (T - lambda*I), where T is an n by n *> tridiagonal matrix and lambda is a scalar, as @@ -51,11 +51,10 @@ *> The parameter LAMBDA is included in the routine so that SLAGTF may *> be used, in conjunction with SLAGTS, to obtain eigenvectors of T by *> inverse iteration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -141,10 +140,9 @@ *> = 0 : successful exit *> .lt. 0: if INFO = -k, the kth argument had an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slagtm.f b/SRC/slagtm.f index 863ca55..31f9524 100644 --- a/SRC/slagtm.f +++ b/SRC/slagtm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA, * B, LDB ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGTM performs a matrix-vector product of the form *> @@ -44,11 +44,10 @@ *> where A is a tridiagonal matrix of order N, B and X are N by NRHS *> matrices, and alpha and beta are real scalars, each of which may be *> 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -129,10 +128,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/SRC/slagts.f b/SRC/slagts.f index 3afaae7..81d10af 100644 --- a/SRC/slagts.f +++ b/SRC/slagts.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGTS( JOB, N, A, B, C, D, IN, Y, TOL, INFO ) * @@ -29,11 +29,11 @@ * REAL A( * ), B( * ), C( * ), D( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGTS may be used to solve one of the systems of equations *> @@ -48,11 +48,10 @@ *> controlled by the argument JOB, and in each case there is an option *> to perturb zero or very small diagonal elements of U, this option *> being intended for use in applications such as inverse iteration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -146,10 +145,9 @@ *> the elements of the right-hand side vector y are very *> large. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slagv2.f b/SRC/slagv2.f index 8d7e5b2..7895917 100644 --- a/SRC/slagv2.f +++ b/SRC/slagv2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL, * CSR, SNR ) @@ -30,11 +30,11 @@ * $ B( LDB, * ), BETA( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAGV2 computes the Generalized Schur factorization of a real 2-by-2 *> matrix pencil (A,B) where B is upper triangular. This routine @@ -61,11 +61,10 @@ *> *> where b11 >= b22 > 0. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] A *> \verbatim @@ -136,10 +135,9 @@ *> SNR is REAL *> The sine of the right rotation matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -150,17 +148,11 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL, $ CSR, SNR ) diff --git a/SRC/slahqr.f b/SRC/slahqr.f index 6cb3a6a..5a4e9e7 100644 --- a/SRC/slahqr.f +++ b/SRC/slahqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, * ILOZ, IHIZ, Z, LDZ, INFO ) @@ -29,23 +29,20 @@ * REAL H( LDH, * ), WI( * ), WR( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAHQR is an auxiliary routine called by SHSEQR to update the *> eigenvalues and Schur decomposition already computed by SHSEQR, by *> dealing with the Hessenberg submatrix in rows and columns ILO to *> IHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -177,10 +174,9 @@ *> where U is the orthogonal matrix in (*) *> (regardless of the value of WANTT.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -191,10 +187,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 02-96 Based on modifications by @@ -206,7 +201,6 @@ *> It is (1) more robust against overflow and underflow and *> (2) adopts the more conservative Ahues & Tisseur stopping *> criterion (LAWN 122, 1997). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slahr2.f b/SRC/slahr2.f index 1619f0f..816afa1 100644 --- a/SRC/slahr2.f +++ b/SRC/slahr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAHR2 reduces the first NB columns of A real general n-BY-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -41,11 +41,10 @@ *> Q as a block reflector I - V*T*V**T, and also the matrix Y = A * V * T. *> *> This is an auxiliary routine called by SGEHRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -115,10 +114,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -172,16 +169,15 @@ *> Gejin. Note that the entries of A(1:K,2:NB) differ from those *> returned by the original LAPACK-3.0's DLAHRD routine. (This *> subroutine is not backward compatible with LAPACK-3.0's DLAHRD.) -*> -*> References -*> ========== +*> \endverbatim +* +*> \par References: +* ================ *> *> Gregorio Quintana-Orti and Robert van de Geijn, "Improving the *> performance of reduction to Hessenberg form," ACM Transactions on *> Mathematical Software, 32(2):180-194, June 2006. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * diff --git a/SRC/slahrd.f b/SRC/slahrd.f index 70feef8..249dc0d 100644 --- a/SRC/slahrd.f +++ b/SRC/slahrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAHRD reduces the first NB columns of a real general n-by-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -43,11 +43,10 @@ *> This is an OBSOLETE auxiliary routine. *> This routine will be 'deprecated' in a future release. *> Please use the new routine SLAHR2 instead. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -116,10 +115,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -130,10 +128,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -167,7 +164,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slaic1.f b/SRC/slaic1.f index 4232468..88807c8 100644 --- a/SRC/slaic1.f +++ b/SRC/slaic1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C ) * @@ -28,11 +28,11 @@ * REAL W( J ), X( J ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAIC1 applies one step of incremental condition estimation in *> its simplest version: @@ -59,11 +59,10 @@ *> [ gamma ] *> *> where alpha = x**T*w. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -119,10 +118,9 @@ *> C is REAL *> Cosine needed in forming xhat. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaisnan.f b/SRC/slaisnan.f index 1c286ff..9b99037 100644 --- a/SRC/slaisnan.f +++ b/SRC/slaisnan.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * LOGICAL FUNCTION SLAISNAN( SIN1, SIN2 ) * @@ -24,11 +24,11 @@ * REAL SIN1, SIN2 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is not for general use. It exists solely to avoid *> over-optimization in SISNAN. @@ -43,11 +43,10 @@ *> Interprocedural or whole-program optimization may delete this *> test. The ISNAN functions will be replaced by the correct *> Fortran 03 intrinsic once the intrinsic is widely available. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIN1 *> \verbatim @@ -59,10 +58,9 @@ *> SIN2 is REAL *> Two numbers to compare for inequality. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaln2.f b/SRC/slaln2.f index f9beca1..dde291d 100644 --- a/SRC/slaln2.f +++ b/SRC/slaln2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLALN2( LTRANS, NA, NW, SMIN, CA, A, LDA, D1, D2, B, * LDB, WR, WI, X, LDX, SCALE, XNORM, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLALN2 solves a system of the form (ca A - w D ) X = s B *> or (ca A**T - w D) X = s B with possible scaling ("s") and @@ -66,11 +66,10 @@ *> *> Note: all input quantities are assumed to be smaller than overflow *> by a reasonable factor. (See BIGNUM.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LTRANS *> \verbatim @@ -202,10 +201,9 @@ *> NOTE: In the interests of speed, this routine does not *> check the inputs for errors. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slals0.f b/SRC/slals0.f index b091144..f2f59a5 100644 --- a/SRC/slals0.f +++ b/SRC/slals0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, * PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, @@ -34,11 +34,11 @@ * $ POLES( LDGNUM, * ), WORK( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLALS0 applies back the multiplying factors of either the left or the *> right singular vector matrix of a diagonal matrix appended by a row @@ -69,11 +69,10 @@ *> (3R) The inverse transformation of (2L). *> *> (4R) The inverse transformation of (1L). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -244,10 +243,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 @@ -258,19 +256,13 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE SLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, $ PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, diff --git a/SRC/slalsa.f b/SRC/slalsa.f index 8f6d2ad..9cea9ea 100644 --- a/SRC/slalsa.f +++ b/SRC/slalsa.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, * LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, @@ -37,11 +37,11 @@ * $ Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLALSA is an itermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The @@ -53,11 +53,10 @@ *> ICOMPQ = 1, SLALSA applies the right singular vector matrix to the *> right hand side. The singular vector matrices were generated in *> compact form by SLALSA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -244,10 +243,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 @@ -258,19 +256,13 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE SLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, $ LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, diff --git a/SRC/slalsd.f b/SRC/slalsd.f index bb542ba..daf838e 100644 --- a/SRC/slalsd.f +++ b/SRC/slalsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, * RANK, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL B( LDB, * ), D( * ), E( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLALSD uses the singular value decomposition of A to solve the least *> squares problem of finding X to minimize the Euclidean norm of each @@ -53,11 +53,10 @@ *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,10 +155,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through MOD(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,19 +168,13 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE SLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, $ RANK, WORK, IWORK, INFO ) diff --git a/SRC/slamrg.f b/SRC/slamrg.f index 03a70af..373e3eb 100644 --- a/SRC/slamrg.f +++ b/SRC/slamrg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAMRG( N1, N2, A, STRD1, STRD2, INDEX ) * @@ -28,20 +28,19 @@ * REAL A( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAMRG will create a permutation list which will merge the elements *> of A (which is composed of two independently sorted sets) into a *> single set which is sorted in ascending order. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N1 *> \verbatim @@ -84,10 +83,9 @@ *> if B( I ) = A( INDEX( I ) ) for I=1,N1+N2, then B will be *> sorted in ascending order. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaneg.f b/SRC/slaneg.f index 8cc6ffe..e0fb3aa 100644 --- a/SRC/slaneg.f +++ b/SRC/slaneg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * INTEGER FUNCTION SLANEG( N, D, LLD, SIGMA, PIVMIN, R ) * @@ -28,11 +28,11 @@ * REAL D( * ), LLD( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANEG computes the Sturm count, the number of negative pivots *> encountered while factoring tridiagonal T - sigma I = L D L^T. @@ -52,11 +52,10 @@ *> Modern Symmetric Tridiagonal Eigensolvers," SIAM Journal on *> Scientific Computing, v28, n5, 2006. DOI 10.1137/050641624 *> (Tech report version in LAWN 172 with the same title.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -96,10 +95,9 @@ *> The twist index for the twisted factorization that is used *> for the negcount. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -110,18 +108,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> Jason Riedy, University of California, Berkeley, USA -*> -*> \endverbatim +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n +*> Jason Riedy, University of California, Berkeley, USA \n *> * ===================================================================== INTEGER FUNCTION SLANEG( N, D, LLD, SIGMA, PIVMIN, R ) diff --git a/SRC/slangb.f b/SRC/slangb.f index ca4403a..b3075fc 100644 --- a/SRC/slangb.f +++ b/SRC/slangb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANGB( NORM, N, KL, KU, AB, LDAB, * WORK ) @@ -29,20 +29,19 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANGB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n band matrix A, with kl sub-diagonals and ku super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANGB returns the value +*> \return SLANGB +*> \verbatim *> *> SLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -109,10 +107,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slange.f b/SRC/slange.f index bbc71bc..699921b 100644 --- a/SRC/slange.f +++ b/SRC/slange.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANGE( NORM, M, N, A, LDA, WORK ) * @@ -28,20 +28,19 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANGE returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANGE returns the value +*> \return SLANGE +*> \verbatim *> *> SLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -100,10 +98,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slangt.f b/SRC/slangt.f index a26cc92..efc18c6 100644 --- a/SRC/slangt.f +++ b/SRC/slangt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANGT( NORM, N, DL, D, DU ) * @@ -28,20 +28,19 @@ * REAL D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANGT returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANGT returns the value +*> \return SLANGT +*> \verbatim *> *> SLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -92,10 +90,9 @@ *> DU is REAL array, dimension (N-1) *> The (n-1) super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slanhs.f b/SRC/slanhs.f index b7ca3d4..32edc57 100644 --- a/SRC/slanhs.f +++ b/SRC/slanhs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANHS( NORM, N, A, LDA, WORK ) * @@ -28,20 +28,19 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANHS returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> Hessenberg matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANHS returns the value +*> \return SLANHS +*> \verbatim *> *> SLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -94,10 +92,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slansb.f b/SRC/slansb.f index 2cd604c..bcbad98 100644 --- a/SRC/slansb.f +++ b/SRC/slansb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANSB( NORM, UPLO, N, K, AB, LDAB, * WORK ) @@ -29,20 +29,19 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANSB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n symmetric band matrix A, with k super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANSB returns the value +*> \return SLANSB +*> \verbatim *> *> SLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -114,10 +112,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slansf.f b/SRC/slansf.f index 061b7f5..bc803a0 100644 --- a/SRC/slansf.f +++ b/SRC/slansf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANSF( NORM, TRANSR, UPLO, N, A, WORK ) * @@ -28,20 +28,19 @@ * REAL A( 0: * ), WORK( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANSF returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric matrix A in RFP format. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANSF returns the value +*> \return SLANSF +*> \verbatim *> *> SLANSF = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +106,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -122,10 +119,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -208,12 +204,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== REAL FUNCTION SLANSF( NORM, TRANSR, UPLO, N, A, WORK ) * diff --git a/SRC/slansp.f b/SRC/slansp.f index 6d6c685..e85dcfe 100644 --- a/SRC/slansp.f +++ b/SRC/slansp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANSP( NORM, UPLO, N, AP, WORK ) * @@ -28,20 +28,19 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANSP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANSP returns the value +*> \return SLANSP +*> \verbatim *> *> SLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -100,10 +98,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slanst.f b/SRC/slanst.f index 40d5411..464f738 100644 --- a/SRC/slanst.f +++ b/SRC/slanst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANST( NORM, N, D, E ) * @@ -28,20 +28,19 @@ * REAL D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANST returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANST returns the value +*> \return SLANST +*> \verbatim *> *> SLANST = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -86,10 +84,9 @@ *> E is REAL array, dimension (N-1) *> The (n-1) sub-diagonal or super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slansy.f b/SRC/slansy.f index 243acf9..fa8dd0c 100644 --- a/SRC/slansy.f +++ b/SRC/slansy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANSY( NORM, UPLO, N, A, LDA, WORK ) * @@ -28,20 +28,19 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANSY returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> real symmetric matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANSY returns the value +*> \return SLANSY +*> \verbatim *> *> SLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +106,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slantb.f b/SRC/slantb.f index ae998ae..bfc8a65 100644 --- a/SRC/slantb.f +++ b/SRC/slantb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANTB( NORM, UPLO, DIAG, N, K, AB, * LDAB, WORK ) @@ -29,20 +29,19 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANTB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n triangular band matrix A, with ( k + 1 ) diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANTB returns the value +*> \return SLANTB +*> \verbatim *> *> SLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -125,10 +123,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slantp.f b/SRC/slantp.f index d8f48a0..cb72400 100644 --- a/SRC/slantp.f +++ b/SRC/slantp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANTP( NORM, UPLO, DIAG, N, AP, WORK ) * @@ -28,20 +28,19 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANTP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> triangular matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANTP returns the value +*> \return SLANTP +*> \verbatim *> *> SLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -110,10 +108,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slantr.f b/SRC/slantr.f index 1c32058..949f22a 100644 --- a/SRC/slantr.f +++ b/SRC/slantr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLANTR( NORM, UPLO, DIAG, M, N, A, LDA, * WORK ) @@ -29,20 +29,19 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANTR returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> trapezoidal or triangular matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> SLANTR returns the value +*> \return SLANTR +*> \verbatim *> *> SLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -126,10 +124,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slanv2.f b/SRC/slanv2.f index 064b4e1..5835b1d 100644 --- a/SRC/slanv2.f +++ b/SRC/slanv2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLANV2( A, B, C, D, RT1R, RT1I, RT2R, RT2I, CS, SN ) * @@ -24,11 +24,11 @@ * REAL A, B, C, CS, D, RT1I, RT1R, RT2I, RT2R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLANV2 computes the Schur factorization of a real 2-by-2 nonsymmetric *> matrix in standard form: @@ -40,11 +40,10 @@ *> 1) CC = 0 so that AA and DD are real eigenvalues of the matrix, or *> 2) AA = DD and BB*CC < 0, so that AA + or - sqrt(BB*CC) are complex *> conjugate eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] A *> \verbatim @@ -101,10 +100,9 @@ *> SN is REAL *> Parameters of the rotation matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -115,17 +113,15 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by V. Sima, Research Institute for Informatics, Bucharest, *> Romania, to reduce the risk of cancellation errors, *> when computing real eigenvalues, and to ensure, if possible, that *> abs(RT1R) >= abs(RT2R). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slapll.f b/SRC/slapll.f index cee936f..554c2ea 100644 --- a/SRC/slapll.f +++ b/SRC/slapll.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAPLL( N, X, INCX, Y, INCY, SSMIN ) * @@ -28,11 +28,11 @@ * REAL X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given two column vectors X and Y, let *> @@ -42,11 +42,10 @@ *> and then computes the SVD of the 2-by-2 upper triangular matrix R. *> The smaller singular value of R is returned in SSMIN, which is used *> as the measurement of the linear dependency of the vectors X and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> SSMIN is REAL *> The smallest singular value of the N-by-2 matrix A = ( X Y ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slapmr.f b/SRC/slapmr.f index bb0a1d1..640d8a0 100644 --- a/SRC/slapmr.f +++ b/SRC/slapmr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAPMR( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * REAL X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAPMR rearranges the rows of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(I,*) is moved to X(K(I),*) for I = 1,2,...,M. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slapmt.f b/SRC/slapmt.f index 482da44..186aeaa 100644 --- a/SRC/slapmt.f +++ b/SRC/slapmt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAPMT( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * REAL X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAPMT rearranges the columns of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slapy2.f b/SRC/slapy2.f index b41dd22..6d31ba9 100644 --- a/SRC/slapy2.f +++ b/SRC/slapy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLAPY2( X, Y ) * @@ -24,19 +24,18 @@ * REAL X, Y * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAPY2 returns sqrt(x**2+y**2), taking care not to cause unnecessary *> overflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -48,10 +47,9 @@ *> Y is REAL *> X and Y specify the values x and y. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slapy3.f b/SRC/slapy3.f index 7ebc773..9cf9006 100644 --- a/SRC/slapy3.f +++ b/SRC/slapy3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * REAL FUNCTION SLAPY3( X, Y, Z ) * @@ -24,19 +24,18 @@ * REAL X, Y, Z * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAPY3 returns sqrt(x**2+y**2+z**2), taking care not to cause *> unnecessary overflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -53,10 +52,9 @@ *> Z is REAL *> X, Y and Z specify the values x, y and z. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaqgb.f b/SRC/slaqgb.f index 886ab22..f544a99 100644 --- a/SRC/slaqgb.f +++ b/SRC/slaqgb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, EQUED ) @@ -30,20 +30,19 @@ * REAL AB( LDAB, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQGB equilibrates a general M by N band matrix A with KL *> subdiagonals and KU superdiagonals using the row and scaling factors *> in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -128,10 +127,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -141,10 +142,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaqge.f b/SRC/slaqge.f index b11e1de..99f3150 100644 --- a/SRC/slaqge.f +++ b/SRC/slaqge.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * EQUED ) @@ -30,19 +30,18 @@ * REAL A( LDA, * ), C( * ), R( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQGE equilibrates a general M by N matrix A using the row and *> column scaling factors in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -111,10 +110,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -124,10 +125,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaqp2.f b/SRC/slaqp2.f index 3960ce1..7a83027 100644 --- a/SRC/slaqp2.f +++ b/SRC/slaqp2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, * WORK ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQP2 computes a QR factorization with column pivoting of *> the block A(OFFSET+1:M,1:N). *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -114,10 +113,9 @@ *> \verbatim *> WORK is REAL array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -128,23 +126,25 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA -*> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE SLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, $ WORK ) diff --git a/SRC/slaqps.f b/SRC/slaqps.f index 1e5e53a..7c11578 100644 --- a/SRC/slaqps.f +++ b/SRC/slaqps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, * VN2, AUXV, F, LDF ) @@ -30,11 +30,11 @@ * $ VN1( * ), VN2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQPS computes a step of QR factorization with column pivoting *> of a real M-by-N matrix A by using Blas-3. It tries to factorize @@ -46,11 +46,10 @@ *> columns is returned in KB. *> *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -142,10 +141,9 @@ *> LDF is INTEGER *> The leading dimension of the array F. LDF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -156,23 +154,26 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA *> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE SLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, $ VN2, AUXV, F, LDF ) diff --git a/SRC/slaqr0.f b/SRC/slaqr0.f index 94c1d3d..4bf5d3f 100644 --- a/SRC/slaqr0.f +++ b/SRC/slaqr0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, * ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQR0 computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -45,11 +45,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -222,10 +221,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -236,28 +234,24 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, $ ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/slaqr1.f b/SRC/slaqr1.f index 94403cc..d637561 100644 --- a/SRC/slaqr1.f +++ b/SRC/slaqr1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V ) * @@ -28,11 +28,11 @@ * REAL H( LDH, * ), V( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given a 2-by-2 or 3-by-3 matrix H, SLAQR1 sets v to a *> scalar multiple of the first column of the product @@ -48,11 +48,10 @@ *> *> This is useful for starting double implicit shift bulges *> in the QR algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -100,10 +99,9 @@ *> A scalar multiple of the first column of the *> matrix K in (*). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -114,17 +112,11 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE SLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V ) diff --git a/SRC/slaqr2.f b/SRC/slaqr2.f index 3c96a20..b887745 100644 --- a/SRC/slaqr2.f +++ b/SRC/slaqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQR2 is identical to SLAQR3 except that it avoids *> recursion by calling SLAHQR instead of SLAQR4. @@ -52,11 +52,10 @@ *> an orthogonal similarity transformation of H. It is to be *> hoped that the final version of H has many zero subdiagonal *> entries. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -255,10 +254,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -269,17 +267,11 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE SLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/slaqr3.f b/SRC/slaqr3.f index 4841606..2a38ad2 100644 --- a/SRC/slaqr3.f +++ b/SRC/slaqr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Aggressive early deflation: *> @@ -49,11 +49,10 @@ *> an orthogonal similarity transformation of H. It is to be *> hoped that the final version of H has many zero subdiagonal *> entries. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -252,10 +251,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -266,17 +264,11 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE SLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/slaqr4.f b/SRC/slaqr4.f index cd26120..00cf9b6 100644 --- a/SRC/slaqr4.f +++ b/SRC/slaqr4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, * ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQR4 implements one level of recursion for SLAQR0. *> It is a complete implementation of the small bulge multi-shift @@ -52,11 +52,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the orthogonal matrix Q: A = Q*H*Q**T = (QZ)*T*(QZ)**T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -231,10 +230,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -245,28 +243,24 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, $ ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/slaqr5.f b/SRC/slaqr5.f index 7935b58..408cf10 100644 --- a/SRC/slaqr5.f +++ b/SRC/slaqr5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, * SR, SI, H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, @@ -33,19 +33,18 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQR5, called by SLAQR0, performs a *> single small-bulge multi-shift QR sweep. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -228,10 +227,9 @@ *> LDWV is the leading dimension of WV as declared in the *> in the calling subroutine. LDWV.GE.NV. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -242,24 +240,19 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> \par Contributors: +* ================== *> -*> Reference: -*> -*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -*> Algorithm Part I: Maintaining Well Focused Shifts, and -*> Level 3 Performance, SIAM Journal of Matrix Analysis, -*> volume 23, pages 929--947, 2002. +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> \endverbatim +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. *> * ===================================================================== SUBROUTINE SLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, diff --git a/SRC/slaqsb.f b/SRC/slaqsb.f index 2a5ffb4..45857a0 100644 --- a/SRC/slaqsb.f +++ b/SRC/slaqsb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED ) * @@ -29,19 +29,18 @@ * REAL AB( LDAB, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQSB equilibrates a symmetric band matrix A using the scaling *> factors in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -123,10 +124,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaqsp.f b/SRC/slaqsp.f index 7facd59..9256805 100644 --- a/SRC/slaqsp.f +++ b/SRC/slaqsp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED ) * @@ -29,19 +29,18 @@ * REAL AP( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQSP equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -96,10 +95,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -108,10 +109,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaqsy.f b/SRC/slaqsy.f index 1939048..953e176 100644 --- a/SRC/slaqsy.f +++ b/SRC/slaqsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED ) * @@ -29,19 +29,18 @@ * REAL A( LDA, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQSY equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -104,10 +103,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -116,10 +117,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaqtr.f b/SRC/slaqtr.f index 9f7e367..b3d21d6 100644 --- a/SRC/slaqtr.f +++ b/SRC/slaqtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAQTR( LTRAN, LREAL, N, T, LDT, B, W, SCALE, X, WORK, * INFO ) @@ -30,11 +30,11 @@ * REAL B( * ), T( LDT, * ), WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAQTR solves the real quasi-triangular system *> @@ -62,11 +62,10 @@ *> *> This subroutine is designed for the condition number estimation *> in routine STRSNA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LTRAN *> \verbatim @@ -149,10 +148,9 @@ *> NOTE: In the interests of speed, this routine does not *> check the inputs for errors. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slar1v.f b/SRC/slar1v.f index 7242d0e..721aba7 100644 --- a/SRC/slar1v.f +++ b/SRC/slar1v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, * PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, @@ -35,11 +35,11 @@ * REAL Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAR1V computes the (scaled) r-th column of the inverse of *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix @@ -56,11 +56,10 @@ *> (d) Computation of the (scaled) r-th column of the inverse using the *> twisted factorization obtained by combining the top part of the *> the stationary and the bottom part of the progressive transform. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -204,10 +203,9 @@ *> \verbatim *> WORK is REAL array, dimension (4*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -218,21 +216,15 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, $ PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, diff --git a/SRC/slar2v.f b/SRC/slar2v.f index 05197c8..bd2b543 100644 --- a/SRC/slar2v.f +++ b/SRC/slar2v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAR2V( N, X, Y, Z, INCX, C, S, INCC ) * @@ -27,11 +27,11 @@ * REAL C( * ), S( * ), X( * ), Y( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAR2V applies a vector of real plane rotations from both sides to *> a sequence of 2-by-2 real symmetric matrices, defined by the elements @@ -39,11 +39,10 @@ *> *> ( x(i) z(i) ) := ( c(i) s(i) ) ( x(i) z(i) ) ( c(i) -s(i) ) *> ( z(i) y(i) ) ( -s(i) c(i) ) ( z(i) y(i) ) ( s(i) c(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -95,10 +94,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarf.f b/SRC/slarf.f index 723f0e1..8538386 100644 --- a/SRC/slarf.f +++ b/SRC/slarf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * REAL C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARF applies a real elementary reflector H to a real m by n matrix *> C, from either the left or the right. H is represented in the form @@ -43,11 +43,10 @@ *> where tau is a real scalar and v is a real vector. *> *> If tau = 0, then H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -109,10 +108,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarfb.f b/SRC/slarfb.f index 783960f..985e91f 100644 --- a/SRC/slarfb.f +++ b/SRC/slarfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, * T, LDT, C, LDC, WORK, LDWORK ) @@ -30,19 +30,18 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARFB applies a real block reflector H or its transpose H**T to a *> real m by n matrix C, from either the left or the right. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -192,7 +189,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slarfg.f b/SRC/slarfg.f index a4adbc4..738b20a 100644 --- a/SRC/slarfg.f +++ b/SRC/slarfg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARFG( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * REAL X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARFG generates a real elementary reflector H of order n, such *> that @@ -53,11 +53,10 @@ *> the unit matrix. *> *> Otherwise 1 <= tau <= 2. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -91,10 +90,9 @@ *> TAU is REAL *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarfgp.f b/SRC/slarfgp.f index 61c0ec9..2de7777 100644 --- a/SRC/slarfgp.f +++ b/SRC/slarfgp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARFGP( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * REAL X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARFGP generates a real elementary reflector H of order n, such *> that @@ -51,11 +51,10 @@ *> *> If the elements of x are all zero, then tau = 0 and H is taken to be *> the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> TAU is REAL *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarft.f b/SRC/slarft.f index ba5c2db..ded233a 100644 --- a/SRC/slarft.f +++ b/SRC/slarft.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * REAL T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARFT forms the triangular factor T of a real block reflector H *> of order n, which is defined as a product of k elementary reflectors. @@ -50,11 +50,10 @@ *> H(i) is stored in the i-th row of the array V, and *> *> H = I - V**T * T * V -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -122,10 +121,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -163,7 +160,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slarfx.f b/SRC/slarfx.f index d39d747..53671a3 100644 --- a/SRC/slarfx.f +++ b/SRC/slarfx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * REAL C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARFX applies a real elementary reflector H to a real m by n *> matrix C, from either the left or the right. H is represented in the @@ -46,11 +46,10 @@ *> If tau = 0, then H is taken to be the unit matrix *> *> This version uses inline code if H has order < 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -105,10 +104,9 @@ *> or (M) if SIDE = 'R' *> WORK is not referenced if H has order < 11. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slargv.f b/SRC/slargv.f index 1d8bffb..acbd8bc 100644 --- a/SRC/slargv.f +++ b/SRC/slargv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARGV( N, X, INCX, Y, INCY, C, INCC ) * @@ -27,22 +27,21 @@ * REAL C( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARGV generates a vector of real plane rotations, determined by *> elements of the real vectors x and y. For i = 1,2,...,n *> *> ( c(i) s(i) ) ( x(i) ) = ( a(i) ) *> ( -s(i) c(i) ) ( y(i) ) = ( 0 ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> INCC is INTEGER *> The increment between elements of C. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarnv.f b/SRC/slarnv.f index 504c045..7b7b274 100644 --- a/SRC/slarnv.f +++ b/SRC/slarnv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARNV( IDIST, ISEED, N, X ) * @@ -28,19 +28,18 @@ * REAL X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARNV returns a vector of n random real numbers from a uniform or *> normal distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -71,10 +70,9 @@ *> X is REAL array, dimension (N) *> The generated random numbers. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -85,17 +83,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine SLARUV to generate random *> real numbers from a uniform (0,1) distribution, in batches of up to *> 128 using vectorisable code. The Box-Muller method is used to *> transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slarra.f b/SRC/slarra.f index 3d391d8..60b30b7 100644 --- a/SRC/slarra.f +++ b/SRC/slarra.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRA( N, D, E, E2, SPLTOL, TNRM, * NSPLIT, ISPLIT, INFO ) @@ -30,19 +30,18 @@ * REAL D( * ), E( * ), E2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Compute the splitting points with threshold SPLTOL. *> SLARRA sets any "small" off-diagonal elements to zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,9 @@ *> INFO is INTEGER *> = 0: successful exit *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -125,21 +123,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRA( N, D, E, E2, SPLTOL, TNRM, $ NSPLIT, ISPLIT, INFO ) diff --git a/SRC/slarrb.f b/SRC/slarrb.f index f12b861..1ee9755 100644 --- a/SRC/slarrb.f +++ b/SRC/slarrb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRB( N, D, LLD, IFIRST, ILAST, RTOL1, * RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK, @@ -32,11 +32,11 @@ * $ WERR( * ), WGAP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given the relatively robust representation(RRR) L D L^T, SLARRB *> does "limited" bisection to refine the eigenvalues of L D L^T, @@ -46,11 +46,10 @@ *> and WGAP, respectively. During bisection, intervals *> [left, right] are maintained by storing their mid-points and *> semi-widths in the arrays W and WERR respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -170,10 +169,9 @@ *> INFO is INTEGER *> Error flag. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -184,21 +182,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRB( N, D, LLD, IFIRST, ILAST, RTOL1, $ RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK, diff --git a/SRC/slarrc.f b/SRC/slarrc.f index aaf3dbf..0318bbe 100644 --- a/SRC/slarrc.f +++ b/SRC/slarrc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRC( JOBT, N, VL, VU, D, E, PIVMIN, * EIGCNT, LCNT, RCNT, INFO ) @@ -30,20 +30,19 @@ * REAL D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Find the number of eigenvalues of the symmetric tridiagonal matrix T *> that are in the interval (VL,VU] if JOBT = 'T', and of L D L^T *> if JOBT = 'L'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBT *> \verbatim @@ -111,10 +110,9 @@ *> \verbatim *> INFO is INTEGER *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -125,21 +123,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRC( JOBT, N, VL, VU, D, E, PIVMIN, $ EIGCNT, LCNT, RCNT, INFO ) diff --git a/SRC/slarrd.f b/SRC/slarrd.f index 43b261e..e050705 100644 --- a/SRC/slarrd.f +++ b/SRC/slarrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRD( RANGE, ORDER, N, VL, VU, IL, IU, GERS, * RELTOL, D, E, E2, PIVMIN, NSPLIT, ISPLIT, @@ -35,11 +35,11 @@ * $ GERS( * ), W( * ), WERR( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARRD computes the eigenvalues of a symmetric tridiagonal *> matrix T to suitable accuracy. This is an auxiliary code to be @@ -55,11 +55,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] RANGE *> \verbatim @@ -279,30 +278,33 @@ *> floating-point arithmetic. *> Cure: Increase the PARAMETER "FUDGE", *> recompile, and try again. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> -*> FUDGE REAL , default = 2 +*> \verbatim +*> FUDGE REAL, default = 2 *> A "fudge factor" to widen the Gershgorin intervals. Ideally, *> a value of 1 should work, but on machines with sloppy *> arithmetic, this needs to be larger. The default for *> publicly released versions should be large enough to handle *> the worst machine around. Note that this has no effect *> on accuracy of the solution. -*> -*> Based on contributions by -*> W. Kahan, University of California, Berkeley, USA -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA *> \endverbatim *> +*> \par Contributors: +* ================== +*> +*> W. Kahan, University of California, Berkeley, USA \n +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarre.f b/SRC/slarre.f index 1c468d5..bc006d6 100644 --- a/SRC/slarre.f +++ b/SRC/slarre.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2, * RTOL1, RTOL2, SPLTOL, NSPLIT, ISPLIT, M, @@ -35,11 +35,11 @@ * $ W( * ),WERR( * ), WGAP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> To find the desired eigenvalues of a given real symmetric *> tridiagonal matrix T, SLARRE sets any "small" off-diagonal @@ -54,11 +54,10 @@ *> conpute all and then discard any unwanted one. *> As an added benefit, SLARRE also outputs the n *> Gerschgorin intervals for the matrices L_i D_i L_i^T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RANGE *> \verbatim @@ -260,10 +259,9 @@ *> =-5: Problem in SLASQ2. *> =-6: Problem in SLASQ2. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -274,24 +272,24 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The base representations are required to suffer very little *> element growth and consequently define all their eigenvalues to *> high relative accuracy. -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n *> * ===================================================================== SUBROUTINE SLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2, diff --git a/SRC/slarrf.f b/SRC/slarrf.f index 33bd315..2eb495b 100644 --- a/SRC/slarrf.f +++ b/SRC/slarrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRF( N, D, L, LD, CLSTRT, CLEND, * W, WGAP, WERR, @@ -32,22 +32,21 @@ * $ LPLUS( * ), W( * ), WGAP( * ), WERR( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given the initial representation L D L^T and its cluster of close *> eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ... *> W( CLEND ), SLARRF finds a new relatively robust representation *> L D L^T - SIGMA I = L(+) D(+) L(+)^T such that at least one of the *> eigenvalues of L(+) D(+) L(+)^T is relatively isolated. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -167,8 +166,8 @@ *> Signals processing OK (=0) or failure (=1) *> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -179,21 +178,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRF( N, D, L, LD, CLSTRT, CLEND, $ W, WGAP, WERR, diff --git a/SRC/slarrj.f b/SRC/slarrj.f index 9911eef..3bb17ed 100644 --- a/SRC/slarrj.f +++ b/SRC/slarrj.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRJ( N, D, E2, IFIRST, ILAST, * RTOL, OFFSET, W, WERR, WORK, IWORK, @@ -32,11 +32,11 @@ * $ WERR( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given the initial eigenvalue approximations of T, SLARRJ *> does bisection to refine the eigenvalues of T, @@ -45,11 +45,10 @@ *> of the error in these guesses in WERR. During bisection, intervals *> [left, right] are maintained by storing their mid-points and *> semi-widths in the arrays W and WERR respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -142,10 +141,9 @@ *> INFO is INTEGER *> Error flag. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -156,21 +154,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRJ( N, D, E2, IFIRST, ILAST, $ RTOL, OFFSET, W, WERR, WORK, IWORK, diff --git a/SRC/slarrk.f b/SRC/slarrk.f index aaf5d63..41571da 100644 --- a/SRC/slarrk.f +++ b/SRC/slarrk.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRK( N, IW, GL, GU, * D, E2, PIVMIN, RELTOL, W, WERR, INFO) @@ -29,11 +29,11 @@ * REAL D( * ), E2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARRK computes one eigenvalue of a symmetric tridiagonal *> matrix T to suitable accuracy. This is an auxiliary code to be @@ -46,11 +46,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 @@ -120,17 +119,18 @@ *> INFO is INTEGER *> = 0: Eigenvalue converged *> = -1: Eigenvalue did NOT converge +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> FUDGE REAL , default = 2 *> A "fudge factor" to widen the Gershgorin intervals. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slarrr.f b/SRC/slarrr.f index 027d3f0..b757db3 100644 --- a/SRC/slarrr.f +++ b/SRC/slarrr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRR( N, D, E, INFO ) * @@ -28,20 +28,19 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Perform tests to decide whether the symmetric tridiagonal matrix T *> warrants expensive computations which guarantee high relative accuracy *> in the eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -70,10 +69,9 @@ *> INFO = 1 : the matrix warrants computations guaranteeing *> only absolute accuracy. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,21 +82,15 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRR( N, D, E, INFO ) * diff --git a/SRC/slarrv.f b/SRC/slarrv.f index b153dd8..0fe6978 100644 --- a/SRC/slarrv.f +++ b/SRC/slarrv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARRV( N, VL, VU, D, L, PIVMIN, * ISPLIT, M, DOL, DOU, MINRGP, @@ -36,20 +36,19 @@ * REAL Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARRV computes the eigenvectors of the tridiagonal matrix *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T. *> The input eigenvalues should have been computed by SLARRE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -255,10 +254,9 @@ *> = 5: The Rayleigh Quotient Iteration failed to converge to *> full accuracy in MAXITR steps. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -269,21 +267,15 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SLARRV( N, VL, VU, D, L, PIVMIN, $ ISPLIT, M, DOL, DOU, MINRGP, diff --git a/SRC/slarscl2.f b/SRC/slarscl2.f index 351d1d5..1d816a1 100644 --- a/SRC/slarscl2.f +++ b/SRC/slarscl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARSCL2 ( M, N, D, X, LDX ) * @@ -27,11 +27,11 @@ * REAL D( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARSCL2 performs a reciprocal diagonal scaling on an vector: *> x <-- inv(D) * x @@ -39,11 +39,10 @@ *> *> Eventually to be replaced by BLAS_sge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slartg.f b/SRC/slartg.f index f024f91..ebe0850 100644 --- a/SRC/slartg.f +++ b/SRC/slartg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARTG( F, G, CS, SN, R ) * @@ -24,11 +24,11 @@ * REAL CS, F, G, R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARTG generate a plane rotation so that *> @@ -44,11 +44,10 @@ *> there are zeros on the diagonal). *> *> If F exceeds G in magnitude, CS will be positive. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -82,10 +81,9 @@ *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slartgp.f b/SRC/slartgp.f index 03b84b6..e862b38 100644 --- a/SRC/slartgp.f +++ b/SRC/slartgp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARTGP( F, G, CS, SN, R ) * @@ -24,11 +24,11 @@ * REAL CS, F, G, R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARTGP generates a plane rotation so that *> @@ -42,11 +42,10 @@ *> If F=0 and (G .ne. 0), then CS=0 and SN=(+/-)1. *> *> The sign is chosen so that R >= 0. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -80,10 +79,9 @@ *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slartgs.f b/SRC/slartgs.f index 5d4bac1..754bd53 100644 --- a/SRC/slartgs.f +++ b/SRC/slartgs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARTGS( X, Y, SIGMA, CS, SN ) * @@ -24,11 +24,11 @@ * REAL CS, SIGMA, SN, X, Y * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARTGS generates a plane rotation designed to introduce a bulge in *> Golub-Reinsch-style implicit QR iteration for the bidiagonal SVD @@ -40,11 +40,10 @@ *> *> with R nonnegative. If X^2 - SIGMA and X * Y are 0, then the *> rotation is by PI/2. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -75,10 +74,9 @@ *> SN is REAL *> The sine of the rotation. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slartv.f b/SRC/slartv.f index 8df487a..fb0794e 100644 --- a/SRC/slartv.f +++ b/SRC/slartv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARTV( N, X, INCX, Y, INCY, C, S, INCC ) * @@ -27,22 +27,21 @@ * REAL C( * ), S( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARTV applies a vector of real plane rotations to elements of the *> real vectors x and y. For i = 1,2,...,n *> *> ( x(i) ) := ( c(i) s(i) ) ( x(i) ) *> ( y(i) ) ( -s(i) c(i) ) ( y(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slaruv.f b/SRC/slaruv.f index bf0910d..e941dd9 100644 --- a/SRC/slaruv.f +++ b/SRC/slaruv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARUV( ISEED, N, X ) * @@ -28,21 +28,20 @@ * REAL X( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARUV returns a vector of n random real numbers from a uniform (0,1) *> distribution (n <= 128). *> *> This is an auxiliary routine called by SLARNV and CLARNV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in,out] ISEED *> \verbatim @@ -64,10 +63,9 @@ *> X is REAL array, dimension (N) *> The generated random numbers. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -78,10 +76,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine uses a multiplicative congruential method with modulus @@ -93,7 +90,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/SRC/slarz.f b/SRC/slarz.f index 256fa23..29b51e7 100644 --- a/SRC/slarz.f +++ b/SRC/slarz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * REAL C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARZ applies a real elementary reflector H to a real M-by-N *> matrix C, from either the left or the right. H is represented in the @@ -47,11 +47,10 @@ *> *> *> H is a product of k elementary reflectors as returned by STZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -119,10 +118,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -133,15 +131,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/slarzb.f b/SRC/slarzb.f index e9e37b9..8b28786 100644 --- a/SRC/slarzb.f +++ b/SRC/slarzb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, * LDV, T, LDT, C, LDC, WORK, LDWORK ) @@ -30,21 +30,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARZB applies a real block reflector H or its transpose H**T to *> a real distributed M-by-N C from the left or the right. *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -156,10 +155,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,15 +168,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/slarzt.f b/SRC/slarzt.f index 4c9dd2a..7ec2276 100644 --- a/SRC/slarzt.f +++ b/SRC/slarzt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * REAL T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLARZT forms the triangular factor T of a real block reflector *> H of order > n, which is defined as a product of k elementary @@ -53,11 +53,10 @@ *> H = I - V**T * T * V *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -125,10 +124,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,14 +137,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define *> the H(i) is best illustrated by the following example with n = 5 and @@ -181,7 +180,6 @@ *> V = ( v1 v2 v3 ) *> ( v1 v2 v3 ) *> ( v1 v2 v3 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slas2.f b/SRC/slas2.f index 683620c..a6009b9 100644 --- a/SRC/slas2.f +++ b/SRC/slas2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAS2( F, G, H, SSMIN, SSMAX ) * @@ -24,22 +24,21 @@ * REAL F, G, H, SSMAX, SSMIN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAS2 computes the singular values of the 2-by-2 matrix *> [ F G ] *> [ 0 H ]. *> On return, SSMIN is the smaller singular value and SSMAX is the *> larger singular value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -70,10 +69,9 @@ *> SSMAX is REAL *> The larger singular value. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -84,10 +82,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Barring over/underflow, all output quantities are correct to within @@ -105,7 +102,6 @@ *> Underflow is harmless if underflow is gradual. Otherwise, results *> may correspond to a matrix modified by perturbations of size near *> the underflow threshold. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slascl.f b/SRC/slascl.f index 7ad115b..83194e3 100644 --- a/SRC/slascl.f +++ b/SRC/slascl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) * @@ -29,22 +29,21 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASCL multiplies the M by N real matrix A by the real scalar *> CTO/CFROM. This is done without over/underflow as long as the final *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that *> A may be full, upper triangular, lower triangular, upper Hessenberg, *> or banded. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -124,10 +123,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/SRC/slascl2.f b/SRC/slascl2.f index 41f8724..412c73d 100644 --- a/SRC/slascl2.f +++ b/SRC/slascl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASCL2 ( M, N, D, X, LDX ) * @@ -27,11 +27,11 @@ * REAL D( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASCL2 performs a diagonal scaling on a vector: *> x <-- D * x @@ -39,11 +39,10 @@ *> *> Eventually to be replaced by BLAS_sge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -75,10 +74,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasd0.f b/SRC/slasd0.f index 54a216f..227947a 100644 --- a/SRC/slasd0.f +++ b/SRC/slasd0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK, * WORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Using a divide and conquer approach, SLASD0 computes the singular *> value decomposition (SVD) of a real upper bidiagonal N-by-M @@ -44,11 +44,10 @@ *> *> A related subroutine, SLASDA, computes only the singular values, *> and optionally, the singular vectors in compact form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -128,10 +127,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -142,18 +140,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK, $ WORK, INFO ) diff --git a/SRC/slasd1.f b/SRC/slasd1.f index 98711d1..e1bb200 100644 --- a/SRC/slasd1.f +++ b/SRC/slasd1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT, * IDXQ, IWORK, WORK, INFO ) @@ -30,11 +30,11 @@ * REAL D( * ), U( LDU, * ), VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASD1 computes the SVD of an upper bidiagonal N-by-M matrix B, *> where N = NL + NR + 1 and M = N + SQRE. SLASD1 is called from SLASD0. @@ -74,11 +74,10 @@ *> directly using the updated singular values. The singular vectors *> for the current problem are multiplied with the singular vectors *> from the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NL *> \verbatim @@ -182,10 +181,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -196,18 +194,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT, $ IDXQ, IWORK, WORK, INFO ) diff --git a/SRC/slasd2.f b/SRC/slasd2.f index 0baaaa1..3107f4d 100644 --- a/SRC/slasd2.f +++ b/SRC/slasd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT, * LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX, @@ -34,11 +34,11 @@ * $ Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASD2 merges the two sets of singular values together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -48,11 +48,10 @@ *> equation problem is reduced by one. *> *> SLASD2 is called from SLASD1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NL *> \verbatim @@ -246,10 +245,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 @@ -260,18 +258,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT, $ LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX, diff --git a/SRC/slasd3.f b/SRC/slasd3.f index ba89d98..2d29e9f 100644 --- a/SRC/slasd3.f +++ b/SRC/slasd3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2, * LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z, @@ -33,11 +33,11 @@ * $ Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASD3 finds all the square roots of the roots of the secular *> equation, as defined by the values in D and Z. It makes the @@ -52,11 +52,10 @@ *> without guard digits, but we know of none. *> *> SLASD3 is called from SLASD1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NL *> \verbatim @@ -202,10 +201,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -216,18 +214,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2, $ LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z, diff --git a/SRC/slasd4.f b/SRC/slasd4.f index ee96ca1..608a28d 100644 --- a/SRC/slasd4.f +++ b/SRC/slasd4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO ) * @@ -28,11 +28,11 @@ * REAL D( * ), DELTA( * ), WORK( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the square root of the I-th updated *> eigenvalue of a positive symmetric rank-one modification to @@ -50,11 +50,10 @@ *> *> The method consists of approximating the rational functions in the *> secular equation by simpler interpolating rational functions. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -114,10 +113,12 @@ *> INFO is INTEGER *> = 0: successful exit *> > 0: if INFO = 1, the updating process failed. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> Logical variable ORGATI (origin-at-i?) is used for distinguishing *> whether D(i) or D(i+1) is treated as the origin. *> @@ -130,10 +131,9 @@ *> MAXIT is the maximum number of iterations allowed for each *> eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -144,18 +144,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO ) * diff --git a/SRC/slasd5.f b/SRC/slasd5.f index b5ebbfb..bb58536 100644 --- a/SRC/slasd5.f +++ b/SRC/slasd5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK ) * @@ -28,11 +28,11 @@ * REAL D( 2 ), DELTA( 2 ), WORK( 2 ), Z( 2 ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This subroutine computes the square root of the I-th eigenvalue *> of a positive symmetric rank-one modification of a 2-by-2 diagonal @@ -46,11 +46,10 @@ *> *> We also assume RHO > 0 and that the Euclidean norm of the vector *> Z is one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I *> \verbatim @@ -95,10 +94,9 @@ *> WORK is REAL array, dimension (2) *> WORK contains (D(j) + sigma_I) in its j-th component. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -109,18 +107,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ren-Cang Li, Computer Science Division, University of California *> at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK ) * diff --git a/SRC/slasd6.f b/SRC/slasd6.f index 26561f3..9ddde57 100644 --- a/SRC/slasd6.f +++ b/SRC/slasd6.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA, * IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, @@ -36,11 +36,11 @@ * $ VF( * ), VL( * ), WORK( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASD6 computes the SVD of an updated upper bidiagonal matrix B *> obtained by merging two smaller ones by appending a row. This @@ -86,11 +86,10 @@ *> values. *> *> SLASD6 is called from SLASDA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -290,10 +289,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -304,18 +302,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA, $ IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, diff --git a/SRC/slasd7.f b/SRC/slasd7.f index 4f5e461..5153438 100644 --- a/SRC/slasd7.f +++ b/SRC/slasd7.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL, * VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ, @@ -36,11 +36,11 @@ * $ ZW( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASD7 merges the two sets of singular values together into a single *> sorted set. Then it tries to deflate the size of the problem. There @@ -50,11 +50,10 @@ *> secular equation problem is reduced by one. *> *> SLASD7 is called from SLASD6. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -256,10 +255,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 @@ -270,18 +268,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL, $ VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ, diff --git a/SRC/slasd8.f b/SRC/slasd8.f index 21dc6e0..56aeac3 100644 --- a/SRC/slasd8.f +++ b/SRC/slasd8.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR, * DSIGMA, WORK, INFO ) @@ -30,11 +30,11 @@ * $ Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASD8 finds the square roots of the roots of the secular equation, *> as defined by the values in DSIGMA and Z. It makes the appropriate @@ -44,11 +44,10 @@ *> right singular vectors of the original bidiagonal matrix. *> *> SLASD8 is called from SLASD6. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -144,10 +143,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -158,18 +156,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR, $ DSIGMA, WORK, INFO ) diff --git a/SRC/slasda.f b/SRC/slasda.f index c0dc0a5..3b36820 100644 --- a/SRC/slasda.f +++ b/SRC/slasda.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K, * DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL, @@ -34,11 +34,11 @@ * $ Z( LDU, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Using a divide and conquer approach, SLASDA computes the singular *> value decomposition (SVD) of a real upper bidiagonal N-by-M matrix @@ -49,11 +49,10 @@ *> *> A related subroutine, SLASD0, computes the singular values and *> the singular vectors in explicit form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -250,10 +249,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, a singular value did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -264,18 +262,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K, $ DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL, diff --git a/SRC/slasdq.f b/SRC/slasdq.f index 1157a48..79cdac9 100644 --- a/SRC/slasdq.f +++ b/SRC/slasdq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT, * U, LDU, C, LDC, WORK, INFO ) @@ -30,11 +30,11 @@ * $ VT( LDVT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASDQ computes the singular value decomposition (SVD) of a real *> (upper or lower) bidiagonal matrix with diagonal D and offdiagonal @@ -50,11 +50,10 @@ *> See "Computing Small Singular Values of Bidiagonal Matrices With *> Guaranteed High Relative Accuracy," by J. Demmel and W. Kahan, *> LAPACK Working Note #3, for a detailed description of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -189,10 +188,9 @@ *> If INFO > 0, the algorithm did not converge, and INFO *> specifies how many superdiagonals did not converge. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -203,18 +201,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT, $ U, LDU, C, LDC, WORK, INFO ) diff --git a/SRC/slasdt.f b/SRC/slasdt.f index cef21cc..de47905 100644 --- a/SRC/slasdt.f +++ b/SRC/slasdt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB ) * @@ -27,19 +27,18 @@ * INTEGER INODE( * ), NDIML( * ), NDIMR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASDT creates a tree of subproblems for bidiagonal divide and *> conquer. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -84,10 +83,9 @@ *> On entry, the maximum row dimension each subproblem at the *> bottom of the tree can be of. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -98,18 +96,12 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB ) * diff --git a/SRC/slaset.f b/SRC/slaset.f index ff5820e..bdd1320 100644 --- a/SRC/slaset.f +++ b/SRC/slaset.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASET( UPLO, M, N, ALPHA, BETA, A, LDA ) * @@ -29,19 +29,18 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASET initializes an m-by-n matrix A to BETA on the diagonal and *> ALPHA on the offdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasq1.f b/SRC/slasq1.f index 4a4dd18..104c68a 100644 --- a/SRC/slasq1.f +++ b/SRC/slasq1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASQ1( N, D, E, WORK, INFO ) * @@ -27,11 +27,11 @@ * REAL D( * ), E( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASQ1 computes the singular values of a real N-by-N bidiagonal *> matrix with diagonal D and off-diagonal E. The singular values @@ -45,11 +45,10 @@ *> *> and the present implementation is described in "An implementation of *> the dqds Algorithm (Positive Case)", LAPACK Working Note. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,9 @@ *> = 3, termination criterion of outer while loop not met *> (program created more than N unreduced blocks) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasq2.f b/SRC/slasq2.f index 95264b8..b057ab8 100644 --- a/SRC/slasq2.f +++ b/SRC/slasq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASQ2( N, Z, INFO ) * @@ -27,11 +27,11 @@ * REAL Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASQ2 computes all the eigenvalues of the symmetric positive *> definite tridiagonal matrix associated with the qd array Z to high @@ -48,11 +48,10 @@ *> on machines which follow ieee-754 floating-point standard in their *> handling of infinities and NaNs, and false otherwise. This variable *> is passed to SLASQ3. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> = 3, termination criterion of outer while loop not met *> (program created more than N unreduced blocks) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,15 +99,14 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> Local Variables: I0:N0 defines a current unreduced segment of Z. *> The shifts are accumulated in SIGMA. Iteration count is in ITER. *> Ping-pong is controlled by PP (alternates between 0 and 1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slasq3.f b/SRC/slasq3.f index 6f28583..bf8ead3 100644 --- a/SRC/slasq3.f +++ b/SRC/slasq3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASQ3( I0, N0, Z, PP, DMIN, SIGMA, DESIG, QMAX, NFAIL, * ITER, NDIV, IEEE, TTYPE, DMIN1, DMIN2, DN, DN1, @@ -32,20 +32,19 @@ * REAL Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASQ3 checks for deflation, computes a shift (TAU) and calls dqds. *> In case of failure it changes shifts, and tries again until output *> is positive. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -165,10 +164,9 @@ *> These are passed as arguments in order to save their values *> between calls to SLASQ3. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasq4.f b/SRC/slasq4.f index 3b2d4dd..d22ea85 100644 --- a/SRC/slasq4.f +++ b/SRC/slasq4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASQ4( I0, N0, Z, PP, N0IN, DMIN, DMIN1, DMIN2, DN, * DN1, DN2, TAU, TTYPE, G ) @@ -29,19 +29,18 @@ * REAL Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASQ4 computes an approximation TAU to the smallest eigenvalue *> using values of d from the previous transform. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -127,10 +126,9 @@ *> G is passed as an argument in order to save its value between *> calls to SLASQ4. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,13 +139,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim -*> CNST1 = 9/16 *> +*> CNST1 = 9/16 *> \endverbatim *> * ===================================================================== diff --git a/SRC/slasq5.f b/SRC/slasq5.f index c7ce25b..28ad561 100644 --- a/SRC/slasq5.f +++ b/SRC/slasq5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASQ5( I0, N0, Z, PP, TAU, DMIN, DMIN1, DMIN2, DN, * DNM1, DNM2, IEEE ) @@ -30,19 +30,18 @@ * REAL Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASQ5 computes one dqds transform in ping-pong form, one *> version for IEEE machines another for non IEEE machines. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -116,10 +115,9 @@ *> IEEE is LOGICAL *> Flag for IEEE or non IEEE arithmetic. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasq6.f b/SRC/slasq6.f index 085fe11..c60e0a5 100644 --- a/SRC/slasq6.f +++ b/SRC/slasq6.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASQ6( I0, N0, Z, PP, DMIN, DMIN1, DMIN2, DN, * DNM1, DNM2 ) @@ -29,19 +29,18 @@ * REAL Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASQ6 computes one dqd (shift equal to zero) transform in *> ping-pong form, with protection against underflow and overflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] I0 *> \verbatim @@ -103,10 +102,9 @@ *> DNM2 is REAL *> d(N0-2). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasr.f b/SRC/slasr.f index fe06f8a..d1e4710 100644 --- a/SRC/slasr.f +++ b/SRC/slasr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), C( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASR applies a sequence of plane rotations to a real matrix A, *> from either the left or the right. @@ -105,11 +105,10 @@ *> *> where R(k) appears in rows and columns k and z. The rotations are *> performed without ever forming P(k) explicitly. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -184,10 +183,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasrt.f b/SRC/slasrt.f index e528b6d..6ba5d57 100644 --- a/SRC/slasrt.f +++ b/SRC/slasrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASRT( ID, N, D, INFO ) * @@ -28,22 +28,21 @@ * REAL D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Sort the numbers in D in increasing order (if ID = 'I') or *> in decreasing order (if ID = 'D' ). *> *> Use Quick Sort, reverting to Insertion sort on arrays of *> size <= 20. Dimension of STACK limits N to about 2**32. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ID *> \verbatim @@ -73,10 +72,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/SRC/slassq.f b/SRC/slassq.f index db4dbd2..b3f2505 100644 --- a/SRC/slassq.f +++ b/SRC/slassq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASSQ( N, X, INCX, SCALE, SUMSQ ) * @@ -28,11 +28,11 @@ * REAL X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASSQ returns the values scl and smsq such that *> @@ -47,11 +47,10 @@ *> scl and smsq are overwritten on SCALE and SUMSQ respectively. *> *> The routine makes only one pass through the vector x. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -88,10 +87,9 @@ *> On exit, SUMSQ is overwritten with smsq , the basic sum of *> squares from which scl has been factored out. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasv2.f b/SRC/slasv2.f index 39cec50..61bf60a 100644 --- a/SRC/slasv2.f +++ b/SRC/slasv2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASV2( F, G, H, SSMIN, SSMAX, SNR, CSR, SNL, CSL ) * @@ -24,11 +24,11 @@ * REAL CSL, CSR, F, G, H, SNL, SNR, SSMAX, SSMIN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASV2 computes the singular value decomposition of a 2-by-2 *> triangular matrix @@ -40,11 +40,10 @@ *> *> [ CSL SNL ] [ F G ] [ CSR -SNR ] = [ SSMAX 0 ] *> [-SNL CSL ] [ 0 H ] [ SNR CSR ] [ 0 SSMIN ]. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -99,10 +98,9 @@ *> The vector (CSR, SNR) is a unit right singular vector for the *> singular value abs(SSMAX). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,10 +111,9 @@ * *> \ingroup auxOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Any input parameter may be aliased with any output parameter. @@ -136,7 +133,6 @@ *> Underflow is harmless if underflow is gradual. Otherwise, results *> may correspond to a matrix modified by perturbations of size near *> the underflow threshold. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slaswp.f b/SRC/slaswp.f index 3f1e3c9..03db09c 100644 --- a/SRC/slaswp.f +++ b/SRC/slaswp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASWP( N, A, LDA, K1, K2, IPIV, INCX ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASWP performs a series of row interchanges on the matrix A. *> One row interchange is initiated for each of rows K1 through K2 of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> The increment between successive values of IPIV. If IPIV *> is negative, the pivots are applied in reverse order. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,15 +102,13 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by *> R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slasy2.f b/SRC/slasy2.f index b08446f..349390c 100644 --- a/SRC/slasy2.f +++ b/SRC/slasy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASY2( LTRANL, LTRANR, ISGN, N1, N2, TL, LDTL, TR, * LDTR, B, LDB, SCALE, X, LDX, XNORM, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASY2 solves for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in *> @@ -43,11 +43,10 @@ *> *> where TL is N1 by N1, TR is N2 by N2, B is N1 by N2, and ISGN = 1 or *> -1. op(T) = T or T**T, where T**T denotes the transpose of T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] LTRANL *> \verbatim @@ -158,10 +157,9 @@ *> NOTE: In the interests of speed, this routine does not *> check the inputs for errors. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slasyf.f b/SRC/slasyf.f index 832f6a2..7d09ff9 100644 --- a/SRC/slasyf.f +++ b/SRC/slasyf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) * @@ -29,11 +29,11 @@ * REAL A( LDA, * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLASYF computes a partial factorization of a real symmetric matrix A *> using the Bunch-Kaufman diagonal pivoting method. The partial @@ -51,11 +51,10 @@ *> SLASYF is an auxiliary routine called by SSYTRF. It uses blocked code *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or *> A22 (if UPLO = 'L'). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slatbs.f b/SRC/slatbs.f index 09745c2..c3f2804 100644 --- a/SRC/slatbs.f +++ b/SRC/slatbs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X, * SCALE, CNORM, INFO ) @@ -30,11 +30,11 @@ * REAL AB( LDAB, * ), CNORM( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATBS solves one of the triangular systems *> @@ -48,11 +48,10 @@ *> overflow, the Level 2 BLAS routine STBSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -154,10 +153,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 @@ -168,10 +166,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, STBSV @@ -239,7 +236,6 @@ *> *> and we can safely call STBSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slatdf.f b/SRC/slatdf.f index a6d6deb..43277a2 100644 --- a/SRC/slatdf.f +++ b/SRC/slatdf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, * JPIV ) @@ -30,11 +30,11 @@ * REAL RHS( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATDF uses the LU factorization of the n-by-n matrix Z computed by *> SGETC2 and computes a contribution to the reciprocal Dif-estimate @@ -45,11 +45,10 @@ *> The factorization of Z returned by SGETC2 has the form Z = P*L*U*Q, *> where P and Q are permutation matrices. L is lower triangular with *> unit diagonal elements and U is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -125,10 +124,9 @@ *> The pivot indices; for 1 <= j <= N, column j of the *> matrix has been interchanged with column JPIV(j). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,18 +137,23 @@ * *> \ingroup realOTHERauxiliary * +*> \par Further Details: +* ===================== +*> +*> This routine is a further developed implementation of algorithm +*> BSOLVE in [1] using complete pivoting in the LU factorization. * -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> -*> This routine is a further developed implementation of algorithm -*> BSOLVE in [1] using complete pivoting in the LU factorization. *> *> [1] Bo Kagstrom and Lars Westin, *> Generalized Schur Methods with Condition Estimators for @@ -162,7 +165,6 @@ *> between two Regular Matrix Pairs with Applications in *> Condition Estimation. Report IMINF-95.05, Departement of *> Computing Science, Umea University, S-901 87 Umea, Sweden, 1995. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slatps.f b/SRC/slatps.f index 9e84b1d..3b0f0ea 100644 --- a/SRC/slatps.f +++ b/SRC/slatps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE, * CNORM, INFO ) @@ -30,11 +30,11 @@ * REAL AP( * ), CNORM( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATPS solves one of the triangular systems *> @@ -48,11 +48,10 @@ *> unscaled problem will not cause overflow, the Level 2 BLAS routine *> STPSV is called. If the matrix A is singular (A(j,j) = 0 for some j), *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -141,10 +140,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 @@ -155,10 +153,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, STPSV @@ -226,7 +223,6 @@ *> *> and we can safely call STPSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slatrd.f b/SRC/slatrd.f index 561f2c1..fc196e3 100644 --- a/SRC/slatrd.f +++ b/SRC/slatrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), E( * ), TAU( * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATRD reduces NB rows and columns of a real symmetric matrix A to *> symmetric tridiagonal form by an orthogonal similarity @@ -45,11 +45,10 @@ *> matrix, of which the lower triangle is supplied. *> *> This is an auxiliary routine called by SSYTRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,9 @@ *> LDW is INTEGER *> The leading dimension of the array W. LDW >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -145,10 +143,9 @@ * *> \ingroup doubleOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -196,7 +193,6 @@ *> where d denotes a diagonal element of the reduced matrix, a denotes *> an element of the original matrix that is unchanged, and vi denotes *> an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slatrs.f b/SRC/slatrs.f index 59bf0ec..5b53263 100644 --- a/SRC/slatrs.f +++ b/SRC/slatrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, * CNORM, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), CNORM( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATRS solves one of the triangular systems *> @@ -48,11 +48,10 @@ *> overflow, the Level 2 BLAS routine STRSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -150,10 +149,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 @@ -164,10 +162,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, STRSV @@ -235,7 +232,6 @@ *> *> and we can safely call STRSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slatrz.f b/SRC/slatrz.f index 4119cb4..51b7357 100644 --- a/SRC/slatrz.f +++ b/SRC/slatrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATRZ( M, N, L, A, LDA, TAU, WORK ) * @@ -27,21 +27,20 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLATRZ factors the M-by-(M+L) real upper trapezoidal matrix *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R 0 ) * Z, by means *> of orthogonal transformations. Z is an (M+L)-by-(M+L) orthogonal *> matrix and, R and A1 are M-by-M upper triangular matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,9 @@ *> \verbatim *> WORK is REAL array, dimension (M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,14 +101,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -136,7 +135,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/slatzm.f b/SRC/slatzm.f index 40d4864..1816175 100644 --- a/SRC/slatzm.f +++ b/SRC/slatzm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK ) * @@ -29,11 +29,11 @@ * REAL C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine SORMRZ. *> @@ -54,11 +54,10 @@ *> C = [ C1, C2 ] m *> 1 n-1 *> Then C is overwritten by C*P. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -136,10 +135,9 @@ *> (N) if SIDE = 'L' *> (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/slauu2.f b/SRC/slauu2.f index 9d2e919..6dc7e5a 100644 --- a/SRC/slauu2.f +++ b/SRC/slauu2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAUU2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAUU2 computes the product U * U**T or L**T * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the unblocked form of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/slauum.f b/SRC/slauum.f index 126aad0..c8c7353 100644 --- a/SRC/slauum.f +++ b/SRC/slauum.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SLAUUM( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SLAUUM computes the product U * U**T or L**T * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the blocked form of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/sopgtr.f b/SRC/sopgtr.f index 10a7283..948e574 100644 --- a/SRC/sopgtr.f +++ b/SRC/sopgtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SOPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO ) * @@ -28,11 +28,11 @@ * REAL AP( * ), Q( LDQ, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SOPGTR generates a real orthogonal matrix Q which is defined as the *> product of n-1 elementary reflectors H(i) of order n, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/sopmtr.f b/SRC/sopmtr.f index d431a4b..0616460 100644 --- a/SRC/sopmtr.f +++ b/SRC/sopmtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SOPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, * INFO ) @@ -29,11 +29,11 @@ * REAL AP( * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SOPMTR overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -134,10 +133,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/SRC/sorbdb.f b/SRC/sorbdb.f index a298ec8..08a4018 100644 --- a/SRC/sorbdb.f +++ b/SRC/sorbdb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, * X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, @@ -34,11 +34,11 @@ * $ X21( LDX21, * ), X22( LDX22, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORBDB simultaneously bidiagonalizes the blocks of an M-by-M *> partitioned orthogonal matrix X: @@ -60,11 +60,10 @@ *> *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented *> implicitly by angles THETA, PHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -247,10 +246,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 @@ -261,10 +259,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The bidiagonal blocks B11, B12, B21, and B22 are represented @@ -277,15 +274,14 @@ *> P1, P2, Q1, and Q2 are represented as products of elementary *> reflectors. See SORCSD for details on generating P1, P2, Q1, and Q2 *> using SORGQR and SORGLQ. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, $ X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, diff --git a/SRC/sorcsd.f b/SRC/sorcsd.f index 154342c..75dafdd 100644 --- a/SRC/sorcsd.f +++ b/SRC/sorcsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE SORCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, * SIGNS, M, P, Q, X11, LDX11, X12, @@ -38,11 +38,11 @@ * $ * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORCSD computes the CS decomposition of an M-by-M partitioned *> orthogonal matrix X: @@ -59,11 +59,10 @@ *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in *> which R = MIN(P,M-P,Q,M-Q). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -274,17 +273,16 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: SBBCSD did not converge. See the description of WORK *> above for details. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. -*> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorg2l.f b/SRC/sorg2l.f index feef1ad..e552ca8 100644 --- a/SRC/sorg2l.f +++ b/SRC/sorg2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORG2L( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORG2L generates an m by n real matrix Q with orthonormal columns, *> which is defined as the last n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by SGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorg2r.f b/SRC/sorg2r.f index 90b75e3..264472f 100644 --- a/SRC/sorg2r.f +++ b/SRC/sorg2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORG2R( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORG2R generates an m by n real matrix Q with orthonormal columns, *> which is defined as the first n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by SGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorgbr.f b/SRC/sorgbr.f index 2dbb47f..8c66ffc 100644 --- a/SRC/sorgbr.f +++ b/SRC/sorgbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGBR generates one of the real orthogonal matrices Q or P**T *> determined by SGEBRD when reducing a real matrix A to bidiagonal @@ -52,11 +52,10 @@ *> rows of P**T, where n >= m >= k; *> if k >= n, P**T = G(n-1) . . . G(2) G(1) and SORGBR returns P**T as *> an N-by-N matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -142,10 +141,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/SRC/sorghr.f b/SRC/sorghr.f index 3bfa684..a9c65f7 100644 --- a/SRC/sorghr.f +++ b/SRC/sorghr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,22 +27,21 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGHR generates a real orthogonal matrix Q which is defined as the *> product of IHI-ILO elementary reflectors of order N, as returned by *> SGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,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/SRC/sorgl2.f b/SRC/sorgl2.f index c7362b1..c8b2de7 100644 --- a/SRC/sorgl2.f +++ b/SRC/sorgl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGL2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGL2 generates an m by n real matrix Q with orthonormal rows, *> which is defined as the first m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by SGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -98,10 +97,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorglq.f b/SRC/sorglq.f index 1fa482d..3b8ef09 100644 --- a/SRC/sorglq.f +++ b/SRC/sorglq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGLQ generates an M-by-N real matrix Q with orthonormal rows, *> which is defined as the first M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by SGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorgql.f b/SRC/sorgql.f index fa0130e..d1448a2 100644 --- a/SRC/sorgql.f +++ b/SRC/sorgql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGQL generates an M-by-N real matrix Q with orthonormal columns, *> which is defined as the last N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by SGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorgqr.f b/SRC/sorgqr.f index 524fe8a..79e4ec6 100644 --- a/SRC/sorgqr.f +++ b/SRC/sorgqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGQR generates an M-by-N real matrix Q with orthonormal columns, *> which is defined as the first N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by SGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorgr2.f b/SRC/sorgr2.f index b7158af..b770e2a 100644 --- a/SRC/sorgr2.f +++ b/SRC/sorgr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGR2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGR2 generates an m by n real matrix Q with orthonormal rows, *> which is defined as the last m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by SGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorgrq.f b/SRC/sorgrq.f index 2784dcf..86ddceb 100644 --- a/SRC/sorgrq.f +++ b/SRC/sorgrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGRQ generates an M-by-N real matrix Q with orthonormal rows, *> which is defined as the last M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by SGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sorgtr.f b/SRC/sorgtr.f index f784215..d7fcd4f 100644 --- a/SRC/sorgtr.f +++ b/SRC/sorgtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORGTR generates a real orthogonal matrix Q which is defined as the *> product of n-1 elementary reflectors of order N, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,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/SRC/sorm2l.f b/SRC/sorm2l.f index acfa581..d2b1651 100644 --- a/SRC/sorm2l.f +++ b/SRC/sorm2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORM2L overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by SGEQLF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/sorm2r.f b/SRC/sorm2r.f index ea42db1..7411446 100644 --- a/SRC/sorm2r.f +++ b/SRC/sorm2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORM2R overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by SGEQRF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/sormbr.f b/SRC/sormbr.f index 36a80d5..5fc9502 100644 --- a/SRC/sormbr.f +++ b/SRC/sormbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> If VECT = 'Q', SORMBR overwrites the general real M-by-N matrix C *> with @@ -63,11 +63,10 @@ *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix: *> if k < nq, P = G(1) G(2) . . . G(k); *> if k >= nq, P = G(1) G(2) . . . G(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -180,10 +179,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/SRC/sormhr.f b/SRC/sormhr.f index ca87aa2..e373a9b 100644 --- a/SRC/sormhr.f +++ b/SRC/sormhr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMHR overwrites the general real M-by-N matrix C with *> @@ -47,11 +47,10 @@ *> IHI-ILO elementary reflectors, as returned by SGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -163,10 +162,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/SRC/sorml2.f b/SRC/sorml2.f index d8229ce..a539d50 100644 --- a/SRC/sorml2.f +++ b/SRC/sorml2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORML2 overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by SGELQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/sormlq.f b/SRC/sormlq.f index 10797f4..4b667b6 100644 --- a/SRC/sormlq.f +++ b/SRC/sormlq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMLQ overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by SGELQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/sormql.f b/SRC/sormql.f index 825fbdd..49ca2eb 100644 --- a/SRC/sormql.f +++ b/SRC/sormql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMQL overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by SGEQLF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/sormqr.f b/SRC/sormqr.f index 127ed65..4c01a5f 100644 --- a/SRC/sormqr.f +++ b/SRC/sormqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMQR overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by SGEQRF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/sormr2.f b/SRC/sormr2.f index ff1d8fa..5d6dcde 100644 --- a/SRC/sormr2.f +++ b/SRC/sormr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMR2 overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by SGERQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/sormr3.f b/SRC/sormr3.f index 198ccef..65250df 100644 --- a/SRC/sormr3.f +++ b/SRC/sormr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMR3 overwrites the general real m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by STZRZF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,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 @@ -165,15 +163,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/sormrq.f b/SRC/sormrq.f index 0b1e7ad..e3ef590 100644 --- a/SRC/sormrq.f +++ b/SRC/sormrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMRQ overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> *> as returned by SGERQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/sormrz.f b/SRC/sormrz.f index 2b3d48f..a67f902 100644 --- a/SRC/sormrz.f +++ b/SRC/sormrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMRZ overwrites the general real M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by STZRZF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,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 @@ -176,15 +174,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/sormtr.f b/SRC/sormtr.f index a309f0c..013121b 100644 --- a/SRC/sormtr.f +++ b/SRC/sormtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SORMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SORMTR overwrites the general real M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -156,10 +155,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/SRC/spbcon.f b/SRC/spbcon.f index 54d1551..6eff8c2 100644 --- a/SRC/spbcon.f +++ b/SRC/spbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite band matrix using the @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -116,10 +115,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/SRC/spbequ.f b/SRC/spbequ.f index ab7533f..c1e4afa 100644 --- a/SRC/spbequ.f +++ b/SRC/spbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * REAL AB( LDAB, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite band matrix A and reduce its condition @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spbrfs.f b/SRC/spbrfs.f index 5ce6964..a7bf249 100644 --- a/SRC/spbrfs.f +++ b/SRC/spbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B, * LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite *> and banded, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,16 +164,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spbstf.f b/SRC/spbstf.f index 5f7e864..784f193 100644 --- a/SRC/spbstf.f +++ b/SRC/spbstf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBSTF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * REAL AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBSTF computes a split Cholesky factorization of a real *> symmetric positive definite band matrix A. @@ -47,11 +47,10 @@ *> *> where U is upper triangular of order m = (n+kd)/2, and L is lower *> triangular of order n-m. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> because the updated element a(i,i) was negative; the *> matrix A is not positive definite. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -150,7 +147,6 @@ *> a31 a42 a53 a64 a64 * * s13 s24 s53 s64 s75 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spbsv.f b/SRC/spbsv.f index 37c076c..23a6155 100644 --- a/SRC/spbsv.f +++ b/SRC/spbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBSV computes the solution to a real system of linear equations *> A * X = B, @@ -46,11 +46,10 @@ *> triangular band matrix, with the same number of superdiagonals or *> subdiagonals as A. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup realOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -162,7 +159,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spbsvx.f b/SRC/spbsvx.f index 9c5c9e7..02b2853 100644 --- a/SRC/spbsvx.f +++ b/SRC/spbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, * EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -34,11 +34,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to *> compute the solution to a real system of linear equations @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -86,11 +89,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -291,10 +293,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -305,10 +306,9 @@ * *> \ingroup realOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -336,7 +336,6 @@ *> a31 a42 a53 a64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spbtf2.f b/SRC/spbtf2.f index 79c63c7..e03fe29 100644 --- a/SRC/spbtf2.f +++ b/SRC/spbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBTF2( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * REAL AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBTF2 computes the Cholesky factorization of a real symmetric *> positive definite band matrix A. @@ -44,11 +44,10 @@ *> L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -140,7 +137,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spbtrf.f b/SRC/spbtrf.f index 5fbe3ad..39a9b15 100644 --- a/SRC/spbtrf.f +++ b/SRC/spbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * REAL AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBTRF computes the Cholesky factorization of a real symmetric *> positive definite band matrix A. @@ -41,11 +41,10 @@ *> A = U**T * U, if UPLO = 'U', or *> A = L * L**T, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -111,10 +109,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -135,12 +132,13 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> -*> Contributed by -*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 -*> *> \endverbatim +* +*> \par Contributors: +* ================== *> +*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 +* * ===================================================================== SUBROUTINE SPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * diff --git a/SRC/spbtrs.f b/SRC/spbtrs.f index 8640825..9c45a20 100644 --- a/SRC/spbtrs.f +++ b/SRC/spbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * REAL AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPBTRS solves a system of linear equations A*X = B with a symmetric *> positive definite band matrix A using the Cholesky factorization *> A = U**T*U or A = L*L**T computed by SPBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/spftrf.f b/SRC/spftrf.f index 9902166..225f108 100644 --- a/SRC/spftrf.f +++ b/SRC/spftrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPFTRF( TRANSR, UPLO, N, A, INFO ) * @@ -27,11 +27,11 @@ * .. Array Arguments .. * REAL A( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPFTRF computes the Cholesky factorization of a real symmetric *> positive definite matrix A. @@ -42,11 +42,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -96,10 +95,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -110,10 +108,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -196,7 +193,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spftri.f b/SRC/spftri.f index 14dff1a..2744e15 100644 --- a/SRC/spftri.f +++ b/SRC/spftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPFTRI( TRANSR, UPLO, N, A, INFO ) * @@ -27,20 +27,19 @@ * REAL A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPFTRI computes the inverse of a real (symmetric) positive definite *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T *> computed by SPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -89,10 +88,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,10 +101,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -189,7 +186,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spftrs.f b/SRC/spftrs.f index 5c6b00e..19c96aa 100644 --- a/SRC/spftrs.f +++ b/SRC/spftrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * REAL A( 0: * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPFTRS solves a system of linear equations A*X = B with a symmetric *> positive definite matrix A using the Cholesky factorization *> A = U**T*U or A = L*L**T computed by SPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -97,10 +96,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 @@ -111,10 +109,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -197,7 +194,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spocon.f b/SRC/spocon.f index de30449..b5b6fec 100644 --- a/SRC/spocon.f +++ b/SRC/spocon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite matrix using the @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/spoequ.f b/SRC/spoequ.f index a418f71..0229425 100644 --- a/SRC/spoequ.f +++ b/SRC/spoequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOEQU( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A and reduce its condition number @@ -42,11 +42,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -97,10 +96,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spoequb.f b/SRC/spoequb.f index 8475e7d..bb57eee 100644 --- a/SRC/spoequb.f +++ b/SRC/spoequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A and reduce its condition number @@ -42,11 +42,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -97,10 +96,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sporfs.f b/SRC/sporfs.f index 8d837ed..7bde118 100644 --- a/SRC/sporfs.f +++ b/SRC/sporfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X, * LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPORFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite, *> and provides error bounds and backward error estimates for the *> solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,16 +158,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sporfsx.f b/SRC/sporfsx.f index 8cca00e..df3dac1 100644 --- a/SRC/sporfsx.f +++ b/SRC/sporfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B, * LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPORFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive @@ -58,11 +56,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -378,10 +375,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sposv.f b/SRC/sposv.f index 8b6394a..3fbd56e 100644 --- a/SRC/sposv.f +++ b/SRC/sposv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOSV computes the solution to a real system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sposvx.f b/SRC/sposvx.f index f8ec239..f17d404 100644 --- a/SRC/sposvx.f +++ b/SRC/sposvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, @@ -34,11 +34,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to *> compute the solution to a real system of linear equations @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -86,11 +89,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -287,10 +289,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sposvxx.f b/SRC/sposvxx.f index f04e61e..dfc8eb1 100644 --- a/SRC/sposvxx.f +++ b/SRC/sposvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T *> to compute the solution to a real system of linear equations @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what SPOSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -105,11 +106,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -478,10 +478,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spotf2.f b/SRC/spotf2.f index 9cf510e..8dae1ff 100644 --- a/SRC/spotf2.f +++ b/SRC/spotf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOTF2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOTF2 computes the Cholesky factorization of a real symmetric *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spotrf.f b/SRC/spotrf.f index 865fcca..8d5d9d3 100644 --- a/SRC/spotrf.f +++ b/SRC/spotrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOTRF( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOTRF computes the Cholesky factorization of a real symmetric *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -92,10 +91,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spotri.f b/SRC/spotri.f index e577061..f21e3f5 100644 --- a/SRC/spotri.f +++ b/SRC/spotri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOTRI( UPLO, N, A, LDA, INFO ) * @@ -28,20 +28,19 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOTRI computes the inverse of a real symmetric positive definite *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T *> computed by SPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -80,10 +79,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spotrs.f b/SRC/spotrs.f index d8ab789..0f7f3ab 100644 --- a/SRC/spotrs.f +++ b/SRC/spotrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPOTRS solves a system of linear equations A*X = B with a symmetric *> positive definite matrix A using the Cholesky factorization *> A = U**T*U or A = L*L**T computed by SPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/sppcon.f b/SRC/sppcon.f index 657baf1..e16119c 100644 --- a/SRC/sppcon.f +++ b/SRC/sppcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPCON( UPLO, N, AP, ANORM, RCOND, WORK, IWORK, INFO ) * @@ -30,11 +30,11 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite packed matrix using @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/sppequ.f b/SRC/sppequ.f index 211c4f3..162c339 100644 --- a/SRC/sppequ.f +++ b/SRC/sppequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * REAL AP( * ), S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPEQU computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A in packed storage and reduce @@ -43,11 +43,10 @@ *> This choice of S puts the condition number of B within a factor N of *> the smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -101,10 +100,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spprfs.f b/SRC/spprfs.f index 53fa3b8..16b0204 100644 --- a/SRC/spprfs.f +++ b/SRC/spprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR, * BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -147,16 +146,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sppsv.f b/SRC/sppsv.f index 192ff67..6e03b29 100644 --- a/SRC/sppsv.f +++ b/SRC/sppsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPSV( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPSV computes the solution to a real system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -123,10 +121,9 @@ * *> \ingroup realOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -142,7 +139,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sppsvx.f b/SRC/sppsvx.f index 9841eaa..67b5d6d 100644 --- a/SRC/sppsvx.f +++ b/SRC/sppsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB, * X, LDX, RCOND, FERR, BERR, WORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * $ FERR( * ), S( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to *> compute the solution to a real system of linear equations @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -84,11 +87,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -273,10 +275,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -287,10 +288,9 @@ * *> \ingroup realOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -306,7 +306,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spptrf.f b/SRC/spptrf.f index 70ffdc5..f59590d 100644 --- a/SRC/spptrf.f +++ b/SRC/spptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPTRF( UPLO, N, AP, INFO ) * @@ -28,11 +28,11 @@ * REAL AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPTRF computes the Cholesky factorization of a real symmetric *> positive definite matrix A stored in packed format. @@ -41,11 +41,10 @@ *> A = U**T * U, if UPLO = 'U', or *> A = L * L**T, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -84,10 +83,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -98,10 +96,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -117,7 +114,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spptri.f b/SRC/spptri.f index 444ca85..ad9514e 100644 --- a/SRC/spptri.f +++ b/SRC/spptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPTRI( UPLO, N, AP, INFO ) * @@ -28,20 +28,19 @@ * REAL AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPTRI computes the inverse of a real symmetric positive definite *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T *> computed by SPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -78,10 +77,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spptrs.f b/SRC/spptrs.f index 3e329ac..b9f63eb 100644 --- a/SRC/spptrs.f +++ b/SRC/spptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * REAL AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPPTRS solves a system of linear equations A*X = B with a symmetric *> positive definite matrix A in packed storage using the Cholesky *> factorization A = U**T*U or A = L*L**T computed by SPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,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/SRC/spstf2.f b/SRC/spstf2.f index 3d43eb7..fb853d3 100644 --- a/SRC/spstf2.f +++ b/SRC/spstf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -30,11 +30,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPSTF2 computes the Cholesky factorization with complete *> pivoting of a real symmetric positive semidefinite matrix A. @@ -47,11 +47,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spstrf.f b/SRC/spstrf.f index 7237737..536bf95 100644 --- a/SRC/spstrf.f +++ b/SRC/spstrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -30,11 +30,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPSTRF computes the Cholesky factorization with complete *> pivoting of a real symmetric positive semidefinite matrix A. @@ -47,11 +47,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -125,10 +124,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sptcon.f b/SRC/sptcon.f index be3a635..d7bbea8 100644 --- a/SRC/sptcon.f +++ b/SRC/sptcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTCON( N, D, E, ANORM, RCOND, WORK, INFO ) * @@ -28,11 +28,11 @@ * REAL D( * ), E( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTCON computes the reciprocal of the condition number (in the *> 1-norm) of a real symmetric positive definite tridiagonal matrix @@ -42,11 +42,10 @@ *> Norm(inv(A)) is computed by a direct method, and the reciprocal of *> the condition number is computed as *> RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -93,10 +92,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 @@ -107,16 +105,14 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The method used is described in Nicholas J. Higham, "Efficient *> Algorithms for Computing the Condition Number of a Tridiagonal *> Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/spteqr.f b/SRC/spteqr.f index c7fb814c..431e7c2 100644 --- a/SRC/spteqr.f +++ b/SRC/spteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -28,11 +28,11 @@ * REAL D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric positive definite tridiagonal matrix by first factoring the @@ -51,11 +51,10 @@ *> form, however, may preclude the possibility of obtaining high *> relative accuracy in the small eigenvalues of the original matrix, if *> these eigenvalues range over many orders of magnitude.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -130,10 +129,9 @@ *> if INFO = N+i, i off-diagonal elements of the *> bidiagonal factor did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sptrfs.f b/SRC/sptrfs.f index 402c80e..eeb0430 100644 --- a/SRC/sptrfs.f +++ b/SRC/sptrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTRFS( N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, * BERR, WORK, INFO ) @@ -30,21 +30,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive definite *> and tridiagonal, and provides error bounds and backward error *> estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -139,16 +138,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sptsv.f b/SRC/sptsv.f index 28d2573..aa1c598 100644 --- a/SRC/sptsv.f +++ b/SRC/sptsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTSV( N, NRHS, D, E, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * REAL B( LDB, * ), D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTSV computes the solution to a real system of linear equations *> A*X = B, where A is an N-by-N symmetric positive definite tridiagonal @@ -39,11 +39,10 @@ *> *> A is factored as A = L*D*L**T, and the factored form of A is then *> used to solve the system of equations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -99,10 +98,9 @@ *> computed. The factorization has not been completed *> unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sptsvx.f b/SRC/sptsvx.f index abd3080..9fda521 100644 --- a/SRC/sptsvx.f +++ b/SRC/sptsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, * RCOND, FERR, BERR, WORK, INFO ) @@ -32,11 +32,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTSVX uses the factorization A = L*D*L**T to compute the solution *> to a real system of linear equations A*X = B, where A is an N-by-N @@ -45,9 +45,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -70,11 +73,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -209,10 +211,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spttrf.f b/SRC/spttrf.f index 2db1746..359e832 100644 --- a/SRC/spttrf.f +++ b/SRC/spttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTTRF( N, D, E, INFO ) * @@ -27,20 +27,19 @@ * REAL D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTTRF computes the L*D*L**T factorization of a real symmetric *> positive definite tridiagonal matrix A. The factorization may also *> be regarded as having the form A = U**T*D*U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -76,10 +75,9 @@ *> be completed, while if k = N, the factorization was *> completed, but D(N) <= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/spttrs.f b/SRC/spttrs.f index 69ab70f..f756c65 100644 --- a/SRC/spttrs.f +++ b/SRC/spttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTTRS( N, NRHS, D, E, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * REAL B( LDB, * ), D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTTRS solves a tridiagonal system of the form *> A * X = B @@ -39,11 +39,10 @@ *> diagonal matrix specified in the vector D, L is a unit bidiagonal *> matrix whose subdiagonal is specified in the vector E, and X and B *> are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,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/SRC/sptts2.f b/SRC/sptts2.f index 9492344..d1c11c7 100644 --- a/SRC/sptts2.f +++ b/SRC/sptts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SPTTS2( N, NRHS, D, E, B, LDB ) * @@ -27,11 +27,11 @@ * REAL B( LDB, * ), D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SPTTS2 solves a tridiagonal system of the form *> A * X = B @@ -39,11 +39,10 @@ *> diagonal matrix specified in the vector D, L is a unit bidiagonal *> matrix whose subdiagonal is specified in the vector E, and X and B *> are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -87,10 +86,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/srscl.f b/SRC/srscl.f index b2f4966..d8ccade 100644 --- a/SRC/srscl.f +++ b/SRC/srscl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SRSCL( N, SA, SX, INCX ) * @@ -28,20 +28,19 @@ * REAL SX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SRSCL multiplies an n-element real vector x by the real scalar 1/a. *> This is done without overflow or underflow as long as *> the final result x/a does not overflow or underflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -69,10 +68,9 @@ *> The increment between successive values of the vector SX. *> > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssbev.f b/SRC/ssbev.f index 82e0da3..8a093f4 100644 --- a/SRC/ssbev.f +++ b/SRC/ssbev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * INFO ) @@ -29,19 +29,18 @@ * REAL AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBEV computes all the eigenvalues and, optionally, eigenvectors of *> a real symmetric band matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -130,10 +129,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssbevd.f b/SRC/ssbevd.f index 64645f7..6c74ee8 100644 --- a/SRC/ssbevd.f +++ b/SRC/ssbevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * LWORK, IWORK, LIWORK, INFO ) @@ -30,11 +30,11 @@ * REAL AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBEVD computes all the eigenvalues and, optionally, eigenvectors of *> a real symmetric band matrix A. If eigenvectors are desired, it uses @@ -46,11 +46,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -177,10 +176,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssbevx.f b/SRC/ssbevx.f index 28cf7a3..70346b5 100644 --- a/SRC/ssbevx.f +++ b/SRC/ssbevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL, * VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, @@ -33,21 +33,20 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric band matrix A. Eigenvalues and eigenvectors can *> be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -241,10 +240,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssbgst.f b/SRC/ssbgst.f index 2bd5dd0..bd53af7 100644 --- a/SRC/ssbgst.f +++ b/SRC/ssbgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X, * LDX, WORK, INFO ) @@ -30,11 +30,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBGST reduces a real symmetric-definite banded generalized *> eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, @@ -44,11 +44,10 @@ *> split Cholesky factorization. A is overwritten by C = X**T*A*X, where *> X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the *> bandwidth of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -143,10 +142,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/SRC/ssbgv.f b/SRC/ssbgv.f index 2f79900..e10fc65 100644 --- a/SRC/ssbgv.f +++ b/SRC/ssbgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z, * LDZ, WORK, INFO ) @@ -30,21 +30,20 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBGV computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite banded eigenproblem, of *> the form A*x=(lambda)*B*x. Here A and B are assumed to be symmetric *> and banded, and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -161,10 +160,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssbgvd.f b/SRC/ssbgvd.f index 28b9664..8a4c2cf 100644 --- a/SRC/ssbgvd.f +++ b/SRC/ssbgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, * Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite banded eigenproblem, of the @@ -49,11 +49,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -206,10 +205,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -220,17 +218,11 @@ * *> \ingroup realOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, $ Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/ssbgvx.f b/SRC/ssbgvx.f index 747b9a6..c6a7179 100644 --- a/SRC/ssbgvx.f +++ b/SRC/ssbgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, * LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, @@ -34,11 +34,11 @@ * $ W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBGVX computes selected eigenvalues, and optionally, eigenvectors *> of a real generalized symmetric-definite banded eigenproblem, of @@ -46,11 +46,10 @@ *> and banded, and B is also positive definite. Eigenvalues and *> eigenvectors can be selected by specifying either all eigenvalues, *> a range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -263,10 +262,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -277,17 +275,11 @@ * *> \ingroup realOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, $ LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, diff --git a/SRC/ssbtrd.f b/SRC/ssbtrd.f index 51e0d20..f663401 100644 --- a/SRC/ssbtrd.f +++ b/SRC/ssbtrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ, * WORK, INFO ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSBTRD reduces a real symmetric band matrix A to symmetric *> tridiagonal form T by an orthogonal similarity transformation: *> Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -139,10 +138,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 @@ -153,14 +151,12 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by Linda Kaufman, Bell Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssfrk.f b/SRC/ssfrk.f index f275402..e22c079 100644 --- a/SRC/ssfrk.f +++ b/SRC/ssfrk.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, * C ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for C in RFP Format. *> @@ -49,11 +49,10 @@ *> where alpha and beta are real scalars, C is an n--by--n symmetric *> matrix and A is an n--by--k matrix in the first case and a k--by--n *> matrix in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -150,10 +149,9 @@ *> NT = N*(N+1)/2. On entry, the symmetric matrix C in RFP *> Format. RFP Format is described by TRANSR, UPLO and N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sspcon.f b/SRC/sspcon.f index 38bbd73..031c809 100644 --- a/SRC/sspcon.f +++ b/SRC/sspcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric packed matrix A using the factorization @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,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/SRC/sspev.f b/SRC/sspev.f index e87bee3..8a8b86a 100644 --- a/SRC/sspev.f +++ b/SRC/sspev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, INFO ) * @@ -28,19 +28,18 @@ * REAL AP( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPEV computes all the eigenvalues and, optionally, eigenvectors of a *> real symmetric matrix A in packed storage. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -115,10 +114,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sspevd.f b/SRC/sspevd.f index 3abbc72..7b80d9e 100644 --- a/SRC/sspevd.f +++ b/SRC/sspevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK, * IWORK, LIWORK, INFO ) @@ -30,11 +30,11 @@ * REAL AP( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPEVD computes all the eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A in packed storage. If eigenvectors are @@ -46,11 +46,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -162,10 +161,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sspevx.f b/SRC/sspevx.f index bb059b7..a4d1a5e 100644 --- a/SRC/sspevx.f +++ b/SRC/sspevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, IWORK, IFAIL, @@ -32,21 +32,20 @@ * REAL AP( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A in packed storage. Eigenvalues/vectors *> can be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -210,10 +209,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sspgst.f b/SRC/sspgst.f index d011afc..4ff7a5c 100644 --- a/SRC/sspgst.f +++ b/SRC/sspgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPGST( ITYPE, UPLO, N, AP, BP, INFO ) * @@ -28,11 +28,11 @@ * REAL AP( * ), BP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPGST reduces a real symmetric-definite generalized eigenproblem *> to standard form, using packed storage. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L. *> *> B must have been previously factorized as U**T*U or L*L**T by SPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \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/SRC/sspgv.f b/SRC/sspgv.f index 27be82a..148f0d3 100644 --- a/SRC/sspgv.f +++ b/SRC/sspgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * INFO ) @@ -30,22 +30,21 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPGV computes all the eigenvalues and, optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be symmetric, stored in packed format, *> and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -145,10 +144,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sspgvd.f b/SRC/sspgvd.f index a03b358..8b01683 100644 --- a/SRC/sspgvd.f +++ b/SRC/sspgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * LWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -50,11 +50,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -189,10 +188,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -203,17 +201,11 @@ * *> \ingroup realOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, $ LWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/sspgvx.f b/SRC/sspgvx.f index 2da8325..4d3640e 100644 --- a/SRC/sspgvx.f +++ b/SRC/sspgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, * IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPGVX computes selected eigenvalues, and optionally, eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -46,11 +46,10 @@ *> is also positive definite. Eigenvalues and eigenvectors can be *> selected by specifying either a range of values or a range of indices *> for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -241,10 +240,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -255,17 +253,11 @@ * *> \ingroup realOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, $ IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK, diff --git a/SRC/ssprfs.f b/SRC/ssprfs.f index 8d27b39..be0319b 100644 --- a/SRC/ssprfs.f +++ b/SRC/ssprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, * FERR, BERR, WORK, IWORK, INFO ) @@ -31,21 +31,20 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,16 +154,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sspsv.f b/SRC/sspsv.f index 72fb062..187d5b5 100644 --- a/SRC/sspsv.f +++ b/SRC/sspsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * REAL AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPSV computes the solution to a real system of linear equations *> A * X = B, @@ -47,11 +47,10 @@ *> triangular matrices, D is symmetric and block diagonal with 1-by-1 *> and 2-by-2 diagonal blocks. The factored form of A is then used to *> solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, so the solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup realOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -160,7 +157,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/sspsvx.f b/SRC/sspsvx.f index aa82158..79904d8 100644 --- a/SRC/sspsvx.f +++ b/SRC/sspsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, * LDX, RCOND, FERR, BERR, WORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPSVX uses the diagonal pivoting factorization A = U*D*U**T or *> A = L*D*L**T to compute the solution to a real system of linear @@ -45,9 +45,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -71,11 +74,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -238,10 +240,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -252,10 +253,9 @@ * *> \ingroup realOTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -271,7 +271,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssptrd.f b/SRC/ssptrd.f index 9cf21c6..5ed8557 100644 --- a/SRC/ssptrd.f +++ b/SRC/ssptrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPTRD( UPLO, N, AP, D, E, TAU, INFO ) * @@ -28,20 +28,19 @@ * REAL AP( * ), D( * ), E( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPTRD reduces a real symmetric matrix A stored in packed form to *> symmetric tridiagonal form T by an orthogonal similarity *> transformation: Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -148,7 +145,6 @@ *> where tau is a real scalar, and v is a real vector with *> v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP, *> overwriting A(i+2:n,i), and tau is stored in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssptrf.f b/SRC/ssptrf.f index 9f12730..48238eb 100644 --- a/SRC/ssptrf.f +++ b/SRC/ssptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPTRF( UPLO, N, AP, IPIV, INFO ) * @@ -29,11 +29,11 @@ * REAL AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPTRF computes the factorization of a real symmetric matrix A stored *> in packed format using the Bunch-Kaufman diagonal pivoting method: @@ -43,11 +43,10 @@ *> where U (or L) is a product of permutation and unit upper (lower) *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,10 +111,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 5-96 - Based on modifications by J. Lewis, Boeing Computer Services @@ -155,7 +152,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssptri.f b/SRC/ssptri.f index b17a073..435df47 100644 --- a/SRC/ssptri.f +++ b/SRC/ssptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPTRI( UPLO, N, AP, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPTRI computes the inverse of a real symmetric indefinite matrix *> A in packed storage using the factorization A = U*D*U**T or *> A = L*D*L**T computed by SSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssptrs.f b/SRC/ssptrs.f index 803d645..1286f1e 100644 --- a/SRC/ssptrs.f +++ b/SRC/ssptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * REAL AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSPTRS solves a system of linear equations A*X = B with a real *> symmetric matrix A stored in packed format using the factorization *> A = U*D*U**T or A = L*D*L**T computed by SSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,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/SRC/sstebz.f b/SRC/sstebz.f index 41c1045..9aa6a6b 100644 --- a/SRC/sstebz.f +++ b/SRC/sstebz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEBZ( RANGE, ORDER, N, VL, VU, IL, IU, ABSTOL, D, E, * M, NSPLIT, W, IBLOCK, ISPLIT, WORK, IWORK, @@ -32,11 +32,11 @@ * REAL D( * ), E( * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEBZ computes the eigenvalues of a symmetric tridiagonal *> matrix T. The user may ask for all eigenvalues, all eigenvalues @@ -50,11 +50,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] RANGE *> \verbatim @@ -226,10 +225,12 @@ *> floating-point arithmetic. *> Cure: Increase the PARAMETER "FUDGE", *> recompile, and try again. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> RELFAC REAL, default = 2.0e0 *> The relative tolerance. An interval (a,b] lies within *> "relative tolerance" if b-a < RELFAC*ulp*max(|a|,|b|), @@ -244,10 +245,9 @@ *> the worst machine around. Note that this has no effect *> on accuracy of the solution. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sstedc.f b/SRC/sstedc.f index 5f689f0..8a82613 100644 --- a/SRC/sstedc.f +++ b/SRC/sstedc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK, * LIWORK, INFO ) @@ -30,11 +30,11 @@ * REAL D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEDC computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the divide and conquer method. @@ -48,11 +48,10 @@ *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. See SLAED3 for details. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -165,10 +164,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -179,18 +177,12 @@ * *> \ingroup auxOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee *> * ===================================================================== SUBROUTINE SSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK, diff --git a/SRC/sstegr.f b/SRC/sstegr.f index a00ed99..aa8ebab 100644 --- a/SRC/sstegr.f +++ b/SRC/sstegr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, @@ -33,11 +33,11 @@ * REAL Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEGR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -59,11 +59,10 @@ *> NaNs. Normal execution may create these exceptiona values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -232,10 +231,9 @@ *> the nonzero error code returned by SLARRE or *> SLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -246,19 +244,13 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, LBNL/NERSC, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE SSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, diff --git a/SRC/sstein.f b/SRC/sstein.f index d222847..3b9b92c 100644 --- a/SRC/sstein.f +++ b/SRC/sstein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK, * IWORK, IFAIL, INFO ) @@ -30,11 +30,11 @@ * REAL D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEIN computes the eigenvectors of a real symmetric tridiagonal *> matrix T corresponding to specified eigenvalues, using inverse @@ -42,11 +42,10 @@ *> *> The maximum number of iterations allowed for each eigenvector is *> specified by an internal parameter MAXITS (currently set to 5). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -145,10 +144,12 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge *> in MAXITS iterations. Their indices are stored in *> array IFAIL. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> MAXITS INTEGER, default = 5 *> The maximum number of iterations performed. *> @@ -156,10 +157,9 @@ *> The number of iterations performed after norm growth *> criterion is satisfied, should be at least 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sstemr.f b/SRC/sstemr.f index e09c068..163d287 100644 --- a/SRC/sstemr.f +++ b/SRC/sstemr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, @@ -34,11 +34,11 @@ * REAL Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEMR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -90,11 +90,10 @@ *> floating-point standard in their handling of infinities and NaNs. *> This permits the use of efficient inner loops avoiding a check for *> zero divisors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -286,10 +285,9 @@ *> the nonzero error code returned by SLARRE or *> SLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -300,21 +298,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE SSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, diff --git a/SRC/ssteqr.f b/SRC/ssteqr.f index 7a6e09d..1980e07 100644 --- a/SRC/ssteqr.f +++ b/SRC/ssteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -28,22 +28,21 @@ * REAL D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the implicit QL or QR method. *> The eigenvectors of a full or band symmetric matrix can also be found *> if SSYTRD or SSPTRD or SSBTRD has been used to reduce this matrix to *> tridiagonal form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -116,10 +115,9 @@ *> matrix which is orthogonally similar to the original *> matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssterf.f b/SRC/ssterf.f index 6bc8a85..639db35 100644 --- a/SRC/ssterf.f +++ b/SRC/ssterf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTERF( N, D, E, INFO ) * @@ -27,19 +27,18 @@ * REAL D( * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTERF computes all eigenvalues of a symmetric tridiagonal matrix *> using the Pal-Walker-Kahan variant of the QL or QR algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -71,10 +70,9 @@ *> a total of 30*N iterations; if INFO = i, then i *> elements of E have not converged to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sstev.f b/SRC/sstev.f index 6303125..968e433 100644 --- a/SRC/sstev.f +++ b/SRC/sstev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEV( JOBZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -28,19 +28,18 @@ * REAL D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEV computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric tridiagonal matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -101,10 +100,9 @@ *> > 0: if INFO = i, the algorithm failed to converge; i *> off-diagonal elements of E did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sstevd.f b/SRC/sstevd.f index d2b423e..40bae57 100644 --- a/SRC/sstevd.f +++ b/SRC/sstevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEVD( JOBZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK, * LIWORK, INFO ) @@ -30,11 +30,11 @@ * REAL D( * ), E( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEVD computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric tridiagonal matrix. If eigenvectors are desired, it @@ -46,11 +46,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -147,10 +146,9 @@ *> > 0: if INFO = i, the algorithm failed to converge; i *> off-diagonal elements of E did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/sstevr.f b/SRC/sstevr.f index c55a9f2..6dcb269 100644 --- a/SRC/sstevr.f +++ b/SRC/sstevr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, * M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, @@ -32,11 +32,11 @@ * REAL D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEVR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Eigenvalues and @@ -78,11 +78,10 @@ *> hence may abort due to a floating point exception in environments *> which do not handle NaNs and infinities in the ieee standard default *> manner. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -272,10 +271,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: Internal error *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -286,21 +284,15 @@ * *> \ingroup realOTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n *> Ken Stanley, Computer Science Division, University of -*> California at Berkeley, USA +*> California at Berkeley, USA \n *> Jason Riedy, Computer Science Division, University of -*> California at Berkeley, USA -*> -*> \endverbatim +*> California at Berkeley, USA \n *> * ===================================================================== SUBROUTINE SSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, diff --git a/SRC/sstevx.f b/SRC/sstevx.f index 42dd8d9..c5e2a64 100644 --- a/SRC/sstevx.f +++ b/SRC/sstevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSTEVX( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL, * M, W, Z, LDZ, WORK, IWORK, IFAIL, INFO ) @@ -31,21 +31,20 @@ * REAL D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSTEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix A. Eigenvalues and *> eigenvectors can be selected by specifying either a range of values *> or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -204,10 +203,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssycon.f b/SRC/ssycon.f index a12b4c7..01c95a2 100644 --- a/SRC/ssycon.f +++ b/SRC/ssycon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYCON estimates the reciprocal of the condition number (in the *> 1-norm) of a real symmetric matrix A using the factorization @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,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/SRC/ssyconv.f b/SRC/ssyconv.f index 0f67d95..758a92e 100644 --- a/SRC/ssyconv.f +++ b/SRC/ssyconv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYCONV convert A given by TRF into L and D and vice-versa. *> Get Non-diag elements of D (returned in workspace) and *> apply or reverse permutation done in TRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,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/SRC/ssyequb.f b/SRC/ssyequb.f index 3930e18..53ceb7e 100644 --- a/SRC/ssyequb.f +++ b/SRC/ssyequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * @@ -29,11 +29,11 @@ * REAL A( LDA, * ), S( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYEQUB computes row and column scalings intended to equilibrate a *> symmetric matrix A and reduce its condition number @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,19 +124,14 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par References: +* ================ *> -*> Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization", -*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. -*> DOI 10.1023/B:NUMA.0000016606.32820.69 +*> Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n +*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n +*> DOI 10.1023/B:NUMA.0000016606.32820.69 \n *> Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE SSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * diff --git a/SRC/ssyev.f b/SRC/ssyev.f index 82ee461..2e4f1ea 100644 --- a/SRC/ssyev.f +++ b/SRC/ssyev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, INFO ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYEV computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -117,10 +116,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssyevd.f b/SRC/ssyevd.f index 2c188a2..631d3dd 100644 --- a/SRC/ssyevd.f +++ b/SRC/ssyevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK, * LIWORK, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYEVD computes all eigenvalues and, optionally, eigenvectors of a *> real symmetric matrix A. If eigenvectors are desired, it uses a @@ -49,11 +49,10 @@ *> *> Because of large use of BLAS of level 3, SSYEVD needs N**2 more *> workspace than SSYEVX. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -159,10 +158,9 @@ *> lying in rows and columns INFO/(N+1) through *> mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -173,19 +171,13 @@ * *> \ingroup realSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> Modified by Francoise Tisseur, University of Tennessee. -*> -*> Modified description of INFO. Sven, 16 Feb 05. -*> \endverbatim +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA \n +*> Modified by Francoise Tisseur, University of Tennessee \n +*> Modified description of INFO. Sven, 16 Feb 05. \n *> * ===================================================================== SUBROUTINE SSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK, diff --git a/SRC/ssyevr.f b/SRC/ssyevr.f index 1ee7546..9963f84 100644 --- a/SRC/ssyevr.f +++ b/SRC/ssyevr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, @@ -32,11 +32,11 @@ * REAL A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYEVR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A. Eigenvalues and eigenvectors can be @@ -95,11 +95,10 @@ *> hence may abort due to a floating point exception in environments *> which do not handle NaNs and infinities in the ieee standard default *> manner. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -300,10 +299,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: Internal error *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -314,21 +312,15 @@ * *> \ingroup realSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n *> Ken Stanley, Computer Science Division, University of -*> California at Berkeley, USA +*> California at Berkeley, USA \n *> Jason Riedy, Computer Science Division, University of -*> California at Berkeley, USA -*> -*> \endverbatim +*> California at Berkeley, USA \n *> * ===================================================================== SUBROUTINE SSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, diff --git a/SRC/ssyevx.f b/SRC/ssyevx.f index 389f6f3..994ca5a 100644 --- a/SRC/ssyevx.f +++ b/SRC/ssyevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, LWORK, IWORK, @@ -32,21 +32,20 @@ * REAL A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYEVX computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric matrix A. Eigenvalues and eigenvectors can be *> selected by specifying either a range of values or a range of indices *> for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -229,10 +228,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssygs2.f b/SRC/ssygs2.f index 53e4d92..920e652 100644 --- a/SRC/ssygs2.f +++ b/SRC/ssygs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYGS2 reduces a real symmetric-definite generalized eigenproblem *> to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T *A*L. *> *> B must have been previously factorized as U**T *U or L*L**T by SPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/ssygst.f b/SRC/ssygst.f index 29afe23..a2a8f19 100644 --- a/SRC/ssygst.f +++ b/SRC/ssygst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYGST reduces a real symmetric-definite generalized eigenproblem *> to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L. *> *> B must have been previously factorized as U**T*U or L*L**T by SPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/ssygv.f b/SRC/ssygv.f index 79dd4bb..70b67bc 100644 --- a/SRC/ssygv.f +++ b/SRC/ssygv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, INFO ) @@ -29,22 +29,21 @@ * REAL A( LDA, * ), B( LDB, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYGV computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be symmetric and B is also *> positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -159,10 +158,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssygvd.f b/SRC/ssygvd.f index 28b9081..f799ce1 100644 --- a/SRC/ssygvd.f +++ b/SRC/ssygvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, IWORK, LIWORK, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -48,11 +48,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -195,10 +194,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -209,20 +207,21 @@ * *> \ingroup realSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> Based on contributions by -*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA +*> \verbatim *> *> Modified so that no backsubstitution is performed if SSYEVD fails to *> converge (NEIG in old code could be greater than N causing out of *> bounds reference to A - reported by Ralf Meyer). Also corrected the *> description of INFO and the test on ITYPE. Sven, 16 Feb 05. *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA *> * ===================================================================== SUBROUTINE SSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, diff --git a/SRC/ssygvx.f b/SRC/ssygvx.f index ffe4bf5..e64b9de 100644 --- a/SRC/ssygvx.f +++ b/SRC/ssygvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, * VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYGVX computes selected eigenvalues, and optionally, eigenvectors *> of a real generalized symmetric-definite eigenproblem, of the form @@ -45,11 +45,10 @@ *> and B are assumed to be symmetric and B is also positive definite. *> Eigenvalues and eigenvectors can be selected by specifying either a *> range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -268,10 +267,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -282,17 +280,11 @@ * *> \ingroup realSYeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE SSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, $ VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, diff --git a/SRC/ssyrfs.f b/SRC/ssyrfs.f index f5a0640..9ade859 100644 --- a/SRC/ssyrfs.f +++ b/SRC/ssyrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,20 +31,19 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and *> provides error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -167,16 +166,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssyrfsx.f b/SRC/ssyrfsx.f index 67830e4..f27c18d 100644 --- a/SRC/ssyrfsx.f +++ b/SRC/ssyrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYRFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -386,10 +383,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssysv.f b/SRC/ssysv.f index baf78b9..1c506c1 100644 --- a/SRC/ssysv.f +++ b/SRC/ssysv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, * LWORK, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYSV computes the solution to a real system of linear equations *> A * X = B, @@ -48,11 +48,10 @@ *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then *> used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssysvx.f b/SRC/ssysvx.f index 9494b18..364ba2e 100644 --- a/SRC/ssysvx.f +++ b/SRC/ssysvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, @@ -33,11 +33,11 @@ * $ BERR( * ), FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYSVX uses the diagonal pivoting factorization to compute the *> solution to a real system of linear equations A * X = B, @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -73,11 +76,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -264,10 +266,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssysvxx.f b/SRC/ssysvxx.f index aa45f3f..32f3ef3 100644 --- a/SRC/ssysvxx.f +++ b/SRC/ssysvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYSVXX uses the diagonal pivoting factorization to compute the *> solution to a real system of linear equations A * X = B, where A @@ -64,9 +62,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what SSYSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -107,11 +108,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(R) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -489,10 +489,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssyswapr.f b/SRC/ssyswapr.f index 2f4f85c..83d74cd 100644 --- a/SRC/ssyswapr.f +++ b/SRC/ssyswapr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYSWAPR( UPLO, N, A, LDA, I1, I2) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * REAL A( LDA, N ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYSWAPR applies an elementary permutation on the rows and the columns of *> a symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,9 @@ *> I2 is INTEGER *> Index of the second row to swap *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssytd2.f b/SRC/ssytd2.f index 66a1ee2..289c6ab 100644 --- a/SRC/ssytd2.f +++ b/SRC/ssytd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTD2( UPLO, N, A, LDA, D, E, TAU, INFO ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ), D( * ), E( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTD2 reduces a real symmetric matrix A to symmetric tridiagonal *> form T by an orthogonal similarity transformation: Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,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 @@ -126,10 +124,9 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -171,7 +168,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssytf2.f b/SRC/ssytf2.f index 2ac172a..0641343 100644 --- a/SRC/ssytf2.f +++ b/SRC/ssytf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * @@ -29,11 +29,11 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTF2 computes the factorization of a real symmetric matrix A using *> the Bunch-Kaufman diagonal pivoting method: @@ -45,11 +45,10 @@ *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -124,25 +122,10 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> 09-29-06 - patch from -*> Bobby Cheng, MathWorks -*> -*> Replace l.204 and l.372 -*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN -*> by -*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN +*> \par Further Details: +* ===================== *> -*> 01-01-96 - Based on modifications by -*> J. Lewis, Boeing Computer Services Company -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -177,9 +160,29 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== *> +*> \verbatim +*> +*> 09-29-06 - patch from +*> Bobby Cheng, MathWorks +*> +*> Replace l.204 and l.372 +*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN +*> by +*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN +*> +*> 01-01-96 - Based on modifications by +*> J. Lewis, Boeing Computer Services Company +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services +*> Company +*> +*> \endverbatim +* * ===================================================================== SUBROUTINE SSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * diff --git a/SRC/ssytrd.f b/SRC/ssytrd.f index 8a14a57..de37eff 100644 --- a/SRC/ssytrd.f +++ b/SRC/ssytrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO ) * @@ -29,20 +29,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRD reduces a real symmetric matrix A to real symmetric *> tridiagonal form T by an orthogonal similarity transformation: *> Q**T * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,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 @@ -145,10 +143,9 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -190,7 +187,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssytrf.f b/SRC/ssytrf.f index 7d33f85..cfca5df 100644 --- a/SRC/ssytrf.f +++ b/SRC/ssytrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,11 +29,11 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRF computes the factorization of a real symmetric matrix A using *> the Bunch-Kaufman diagonal pivoting method. The form of the @@ -46,11 +46,10 @@ *> 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where @@ -180,7 +177,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ssytri.f b/SRC/ssytri.f index ed93bdd..772330c 100644 --- a/SRC/ssytri.f +++ b/SRC/ssytri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRI computes the inverse of a real symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> SSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssytri2.f b/SRC/ssytri2.f index 021fd63..801f9c5 100644 --- a/SRC/ssytri2.f +++ b/SRC/ssytri2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,21 +29,20 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRI2 computes the inverse of a REAL hermitian indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> SSYTRF. SSYTRI2 sets the LEADING DIMENSION of the workspace *> before calling SSYTRI2X that actually computes the inverse. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssytri2x.f b/SRC/ssytri2x.f index 860366b..03bbc33 100644 --- a/SRC/ssytri2x.f +++ b/SRC/ssytri2x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) * @@ -29,20 +29,19 @@ * REAL A( LDA, * ), WORK( N+NB+1,* ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRI2X computes the inverse of a real symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> SSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ssytrs.f b/SRC/ssytrs.f index b196553..44ce20f 100644 --- a/SRC/ssytrs.f +++ b/SRC/ssytrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRS solves a system of linear equations A*X = B with a real *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by SSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/ssytrs2.f b/SRC/ssytrs2.f index 59e107a..a18528a 100644 --- a/SRC/ssytrs2.f +++ b/SRC/ssytrs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE SSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, * WORK, INFO ) @@ -30,20 +30,19 @@ * REAL A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> SSYTRS2 solves a system of linear equations A*X = B with a real *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by SSYTRF and converted by SSYCONV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/SRC/stbcon.f b/SRC/stbcon.f index e35e9aa..d9a3183 100644 --- a/SRC/stbcon.f +++ b/SRC/stbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBCON estimates the reciprocal of the condition number of a *> triangular band matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -127,10 +126,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/SRC/stbrfs.f b/SRC/stbrfs.f index d632edb..6343e9b 100644 --- a/SRC/stbrfs.f +++ b/SRC/stbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ FERR( * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular band @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by STBTRS or some other *> means before entering this routine. STBRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -172,10 +171,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/SRC/stbtrs.f b/SRC/stbtrs.f index d7c41df..ed44d79 100644 --- a/SRC/stbtrs.f +++ b/SRC/stbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, INFO ) @@ -29,11 +29,11 @@ * REAL AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STBTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular band matrix of order N, and B is an *> N-by NRHS matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/stfsm.f b/SRC/stfsm.f index e263954..14c8ed6 100644 --- a/SRC/stfsm.f +++ b/SRC/stfsm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, * B, LDB ) @@ -30,11 +30,11 @@ * REAL A( 0: * ), B( 0: LDB-1, 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for A in RFP Format. *> @@ -50,11 +50,10 @@ *> A is in Rectangular Full Packed (RFP) Format. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -174,10 +173,9 @@ *> max( 1, m ). *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -188,10 +186,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -274,12 +271,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== SUBROUTINE STFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, $ B, LDB ) diff --git a/SRC/stftri.f b/SRC/stftri.f index 15dfee7..9e14d38 100644 --- a/SRC/stftri.f +++ b/SRC/stftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) * @@ -28,21 +28,20 @@ * REAL A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STFTRI computes the inverse of a triangular matrix A stored in RFP *> format. *> *> This is a Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,10 +111,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -199,7 +196,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stfttp.f b/SRC/stfttp.f index e562ed3..99ae193 100644 --- a/SRC/stfttp.f +++ b/SRC/stfttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STFTTP( TRANSR, UPLO, N, ARF, AP, INFO ) * @@ -28,19 +28,18 @@ * REAL AP( 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STFTTP copies a triangular matrix A from rectangular full packed *> format (TF) to standard packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -85,10 +84,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 @@ -99,10 +97,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -185,7 +182,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stfttr.f b/SRC/stfttr.f index 25c0439..cb36753 100644 --- a/SRC/stfttr.f +++ b/SRC/stfttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * REAL A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STFTTR copies a triangular matrix A from rectangular full packed *> format (TF) to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -94,10 +93,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 @@ -108,10 +106,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -194,12 +191,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== SUBROUTINE STFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO ) * diff --git a/SRC/stgevc.f b/SRC/stgevc.f index d382322..3221127 100644 --- a/SRC/stgevc.f +++ b/SRC/stgevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL, * LDVL, VR, LDVR, MM, M, WORK, INFO ) @@ -32,11 +32,11 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGEVC computes some or all of the right and/or left eigenvectors of *> a pair of real matrices (S,P), where S is a quasi-triangular matrix @@ -63,10 +63,10 @@ *> factorization of a matrix pair (A,B), then Z*X and Q*Y *> are the matrices of right and left eigenvectors of (A,B). *> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -219,10 +219,9 @@ *> > 0: the 2-by-2 block (INFO:INFO+1) does not have a complex *> eigenvalue. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -233,10 +232,9 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Allocation of workspace: @@ -291,7 +289,6 @@ *> transpose of the one in storage, so the rowwise method then *> actually accesses columns of A and B at each step, and so is the *> preferred method. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stgex2.f b/SRC/stgex2.f index ff62cf0..f5d779d 100644 --- a/SRC/stgex2.f +++ b/SRC/stgex2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, J1, N1, N2, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGEX2 swaps adjacent diagonal blocks (A11, B11) and (A22, B22) *> of size 1-by-1 or 2-by-2 in an upper (quasi) triangular matrix pair @@ -50,11 +50,10 @@ *> Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T *> Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -173,10 +172,9 @@ *> <0: If INFO = -16: LWORK is too small. Appropriate value *> for LWORK is returned in WORK(1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -187,20 +185,24 @@ * *> \ingroup realGEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, -*> Umea University, S-901 87 Umea, Sweden. +*> \par Further Details: +* ===================== *> *> In the current code both weak and strong stability tests are *> performed. The user can omit the strong stability test by changing *> the internal logical parameter WANDS to .FALSE.. See ref. [2] for *> details. +* +*> \par Contributors: +* ================== +*> +*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, +*> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -213,7 +215,6 @@ *> Report UMINF - 94.04, Department of Computing Science, Umea *> University, S-901 87 Umea, Sweden, 1994. Also as LAPACK Working *> Note 87. To appear in Numerical Algorithms, 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stgexc.f b/SRC/stgexc.f index 154aa2c..08e00bb 100644 --- a/SRC/stgexc.f +++ b/SRC/stgexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, IFST, ILST, WORK, LWORK, INFO ) @@ -30,11 +30,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGEXC reorders the generalized real Schur decomposition of a real *> matrix pair (A,B) using an orthogonal equivalence transformation @@ -54,11 +54,10 @@ *> Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T *> Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -187,10 +186,9 @@ *> and ILST points to the first row of the current *> position of the block being moved. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -201,21 +199,21 @@ * *> \ingroup realGEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stgsen.f b/SRC/stgsen.f index 43e413b..5f712dd 100644 --- a/SRC/stgsen.f +++ b/SRC/stgsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB, * ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, M, PL, @@ -36,11 +36,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGSEN reorders the generalized real Schur decomposition of a real *> matrix pair (A, B) (in terms of an orthonormal equivalence trans- @@ -66,11 +66,10 @@ *> the selected cluster and the eigenvalues outside the cluster, resp., *> and norms of "projections" onto left and right eigenspaces w.r.t. *> the selected cluster in the (1,1)-block. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -296,10 +295,9 @@ *> (A, B) may have been partially reordered. *> If requested, 0 is returned in DIF(*), PL and PR. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -310,10 +308,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> STGSEN first collects the selected eigenvalues by computing @@ -415,13 +412,18 @@ *> based estimate DIF is not wanted (see SLATDF), then the parameter *> IDIFJB (see below) should be changed from 3 to 4 (routine SLATDF *> (IJOB = 2 will be used)). See STGSYL for more details. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -442,7 +444,6 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, *> 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stgsja.f b/SRC/stgsja.f index a53e4a8..2a154e9 100644 --- a/SRC/stgsja.f +++ b/SRC/stgsja.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B, * LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV, @@ -34,11 +34,11 @@ * $ V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGSJA computes the generalized singular value decomposition (GSVD) *> of two real upper triangular (or trapezoidal) matrices A and B. @@ -123,11 +123,10 @@ *> The computation of the orthogonal transformation matrices U, V or Q *> is optional. These matrices may either be formed explicitly, or they *> may be postmultiplied into input matrices U1, V1, or Q1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -342,10 +341,9 @@ *> may take. If after MAXIT cycles, the routine fails to *> converge, we return INFO = 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -356,10 +354,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> STGSJA essentially uses a variant of Kogbetliantz algorithm to reduce @@ -374,7 +371,6 @@ *> C1**2 + S1**2 = I, *> *> and R1 is an L-by-L nonsingular upper triangular matrix. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stgsna.f b/SRC/stgsna.f index 03f6a9b..ee04d1e 100644 --- a/SRC/stgsna.f +++ b/SRC/stgsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL, * LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK, @@ -33,11 +33,11 @@ * $ VL( LDVL, * ), VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or eigenvectors of a matrix pair (A, B) in @@ -49,11 +49,10 @@ *> i.e. A is block upper triangular with 1-by-1 and 2-by-2 diagonal *> blocks. B is upper triangular. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -222,10 +221,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 @@ -236,10 +234,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of a generalized eigenvalue @@ -345,13 +342,18 @@ *> EPS * norm(A, B) / DIF(i). *> *> See ref. [2-3] for more details and further references. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -372,7 +374,6 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, *> No 1, 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stgsy2.f b/SRC/stgsy2.f index f58205f..24bc706 100644 --- a/SRC/stgsy2.f +++ b/SRC/stgsy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, @@ -34,11 +34,11 @@ * $ D( LDD, * ), E( LDE, * ), F( LDF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGSY2 solves the generalized Sylvester equation: *> @@ -77,11 +77,10 @@ *> of an upper bound on the separation between to matrix pairs. Then *> the input (A, D), (B, E) are sub-pencils of the matrix pair in *> STGSYL. See STGSYL for details. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -251,10 +250,9 @@ *> >0: The matrix pairs (A, D) and (B, E) have common or very *> close eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -265,18 +263,12 @@ * *> \ingroup realSYauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE STGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, $ LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, diff --git a/SRC/stgsyl.f b/SRC/stgsyl.f index ac8edab..7b5b974 100644 --- a/SRC/stgsyl.f +++ b/SRC/stgsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK, @@ -35,11 +35,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STGSYL solves the generalized Sylvester equation: *> @@ -80,11 +80,10 @@ *> information. *> *> This is a level 3 BLAS algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -253,10 +252,9 @@ *> <0: If INFO = -i, the i-th argument had an illegal value. *> >0: (A, D) and (B, E) have common or close eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -267,15 +265,16 @@ * *> \ingroup realSYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ +*> +*> \verbatim *> *> [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the @@ -293,7 +292,6 @@ *> Condition Estimators for Solving the Generalized Sylvester *> Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7, *> July 1989, pp 745-751. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stpcon.f b/SRC/stpcon.f index a8299a7..4a770d8 100644 --- a/SRC/stpcon.f +++ b/SRC/stpcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, IWORK, * INFO ) @@ -31,11 +31,11 @@ * REAL AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPCON estimates the reciprocal of the condition number of a packed *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -114,10 +113,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/SRC/stpmqrt.f b/SRC/stpmqrt.f index f286323..ab1a762 100644 --- a/SRC/stpmqrt.f +++ b/SRC/stpmqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT, * A, LDA, B, LDB, WORK, INFO ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPMQRT applies a real orthogonal matrix Q obtained from a *> "triangular-pentagonal" real block reflector H to a general *> real matrix C, which consists of two blocks A and B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -167,10 +166,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 @@ -181,10 +179,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The columns of the pentagonal matrix V contain the elementary reflectors @@ -213,7 +210,6 @@ *> If TRANS='N' and SIDE='R', C is on exit replaced with C * Q. *> *> If TRANS='C' and SIDE='R', C is on exit replaced with C * Q^H. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stpqrt.f b/SRC/stpqrt.f index adea51a..06259d8 100644 --- a/SRC/stpqrt.f +++ b/SRC/stpqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK, * INFO ) @@ -28,21 +28,20 @@ * REAL A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPQRT computes a blocked QR factorization of a real *> "triangular-pentagonal" matrix C, which is composed of a *> triangular block A and pentagonal block B, using the compact *> WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,11 +136,11 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The input matrix C is a (N+M)-by-N matrix *> *> C = [ A ] @@ -185,7 +183,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = [T1 T2 ... TB]. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stpqrt2.f b/SRC/stpqrt2.f index 3b48db2..9768174 100644 --- a/SRC/stpqrt2.f +++ b/SRC/stpqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) * @@ -27,20 +27,19 @@ * REAL A( LDA, * ), B( LDB, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPQRT2 computes a QR factorization of a real "triangular-pentagonal" *> matrix C, which is composed of a triangular block A and pentagonal block B, *> using the compact WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -111,10 +110,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 @@ -125,10 +123,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The input matrix C is a (N+M)-by-N matrix @@ -171,7 +168,6 @@ *> *> where W^H is the conjugate transpose of W and T is the upper triangular *> factor of the block reflector. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stprfb.f b/SRC/stprfb.f index 61233fa..4d536d9 100644 --- a/SRC/stprfb.f +++ b/SRC/stprfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, * V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK ) @@ -30,20 +30,20 @@ * $ V( LDV, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPRFB applies a real "triangular-pentagonal" block reflector H or its *> conjugate transpose H^H to a real matrix C, which is composed of two *> blocks A and B, either from the left or right. *> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -185,10 +185,9 @@ *> If SIDE = 'L', LDWORK >= K; *> if SIDE = 'R', LDWORK >= M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -199,10 +198,9 @@ * *> \ingroup realOTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix C is a composite matrix formed from blocks A and B. @@ -247,7 +245,6 @@ *> If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L. *> *> If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stprfs.f b/SRC/stprfs.f index 14d66b0..4ad3fe2 100644 --- a/SRC/stprfs.f +++ b/SRC/stprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * FERR, BERR, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular packed @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by STPTRS or some other *> means before entering this routine. STPRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,10 +158,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/SRC/stptri.f b/SRC/stptri.f index 24cac6f..ccfdcc3 100644 --- a/SRC/stptri.f +++ b/SRC/stptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPTRI( UPLO, DIAG, N, AP, INFO ) * @@ -28,19 +28,18 @@ * REAL AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPTRI computes the inverse of a real upper or lower triangular *> matrix A stored in packed format. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -83,10 +82,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -97,10 +95,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A triangular matrix A can be transferred to packed storage using one @@ -115,7 +112,6 @@ *> 1 CONTINUE 1 CONTINUE *> JC = JC + J JC = JC + N - J + 1 *> 2 CONTINUE 2 CONTINUE -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stptrs.f b/SRC/stptrs.f index f2a7c84..43d1201 100644 --- a/SRC/stptrs.f +++ b/SRC/stptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * REAL AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> where A is a triangular matrix of order N stored in packed format, *> and B is an N-by-NRHS matrix. A check is made to verify that A is *> nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/stpttf.f b/SRC/stpttf.f index 38e4955..7105a8b 100644 --- a/SRC/stpttf.f +++ b/SRC/stpttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * REAL AP( 0: * ), ARF( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPTTF copies a triangular matrix A from standard packed format (TP) *> to rectangular full packed format (TF). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -84,10 +83,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 @@ -98,10 +96,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -184,7 +181,6 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stpttr.f b/SRC/stpttr.f index b9f74f9..4dd13ba 100644 --- a/SRC/stpttr.f +++ b/SRC/stpttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STPTTR( UPLO, N, AP, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STPTTR copies a triangular matrix A from standard packed format (TP) *> to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/strcon.f b/SRC/strcon.f index 2fa0906..531166c 100644 --- a/SRC/strcon.f +++ b/SRC/strcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK, * IWORK, INFO ) @@ -31,11 +31,11 @@ * REAL A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRCON estimates the reciprocal of the condition number of a *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -121,10 +120,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/SRC/strevc.f b/SRC/strevc.f index b90aa65..fb37bec 100644 --- a/SRC/strevc.f +++ b/SRC/strevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, MM, M, WORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STREVC computes some or all of the right and/or left eigenvectors of *> a real upper quasi-triangular matrix T. @@ -56,11 +56,10 @@ *> input matrix. If Q is the orthogonal factor that reduces a matrix *> A to Schur form T, then Q*X and Q*Y are the matrices of right and *> left eigenvectors of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -192,10 +191,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 @@ -206,10 +204,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The algorithm used in this program is basically backward (forward) @@ -219,7 +216,6 @@ *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x| + |y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/strexc.f b/SRC/strexc.f index 8609b9c..d02f3a8 100644 --- a/SRC/strexc.f +++ b/SRC/strexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, WORK, * INFO ) @@ -29,11 +29,11 @@ * REAL Q( LDQ, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STREXC reorders the real Schur factorization of a real matrix *> A = Q*T*Q**T, so that the diagonal block of T with row index IFST is @@ -47,11 +47,10 @@ *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each *> 2-by-2 diagonal block has its diagonal elements equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -130,10 +129,9 @@ *> reordered, and ILST points to the first row of the *> current position of the block being moved. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/strrfs.f b/SRC/strrfs.f index e23ae83..dc05cb3 100644 --- a/SRC/strrfs.f +++ b/SRC/strrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, FERR, BERR, WORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by STRTRS or some other *> means before entering this routine. STRRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,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/SRC/strsen.f b/SRC/strsen.f index 877de3c..5cf4e17 100644 --- a/SRC/strsen.f +++ b/SRC/strsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, WR, WI, * M, S, SEP, WORK, LWORK, IWORK, LIWORK, INFO ) @@ -33,11 +33,11 @@ * $ WR( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRSEN reorders the real Schur factorization of a real matrix *> A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in @@ -52,11 +52,10 @@ *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each *> 2-by-2 diagonal block has its diagonal elemnts equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -223,10 +222,9 @@ *> contain the eigenvalues in the same order as in T; S and *> SEP (if requested) are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -237,10 +235,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> STRSEN first collects the selected eigenvalues by computing an @@ -311,7 +308,6 @@ *> error in the computed right invariant subspace is *> *> EPS * norm(T) / SEP -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/strsna.f b/SRC/strsna.f index bac7719..47f18af 100644 --- a/SRC/strsna.f +++ b/SRC/strsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, S, SEP, MM, M, WORK, LDWORK, IWORK, @@ -33,11 +33,11 @@ * $ VR( LDVR, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or right eigenvectors of a real upper @@ -48,11 +48,10 @@ *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each *> 2-by-2 diagonal block has its diagonal elements equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -205,10 +204,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 @@ -219,10 +217,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of an eigenvalue lambda is @@ -261,7 +258,6 @@ *> is given by *> *> EPS * norm(T) / SEP(i) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/strsyl.f b/SRC/strsyl.f index 70f92e4..c8efc10 100644 --- a/SRC/strsyl.f +++ b/SRC/strsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, * LDC, SCALE, INFO ) @@ -30,11 +30,11 @@ * REAL A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRSYL solves the real Sylvester matrix equation: *> @@ -50,11 +50,10 @@ *> is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; *> each 2-by-2 diagonal block has its diagonal elements equal and its *> off-diagonal elements of opposite sign. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANA *> \verbatim @@ -148,10 +147,9 @@ *> values were used to solve the equation (but the matrices *> A and B are unchanged). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/strti2.f b/SRC/strti2.f index 911a6ed..17b9837 100644 --- a/SRC/strti2.f +++ b/SRC/strti2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRTI2( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRTI2 computes the inverse of a real upper or lower triangular *> matrix. *> *> This is the Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/strtri.f b/SRC/strtri.f index ea7e0a3..102f642 100644 --- a/SRC/strtri.f +++ b/SRC/strtri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRTRI( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * REAL A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRTRI computes the inverse of a real upper or lower triangular *> matrix A. *> *> This is the Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/strtrs.f b/SRC/strtrs.f index 480f868..95b5344 100644 --- a/SRC/strtrs.f +++ b/SRC/strtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, * INFO ) @@ -29,11 +29,11 @@ * REAL A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular matrix of order N, and B is an N-by-NRHS *> matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> indicating that the matrix is singular and the solutions *> X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/strttf.f b/SRC/strttf.f index aed8856..43aa4ac 100644 --- a/SRC/strttf.f +++ b/SRC/strttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO ) * @@ -28,19 +28,18 @@ * REAL A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRTTF copies a triangular matrix A from standard full format (TR) *> to rectangular full packed format (TF) . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -92,10 +91,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 @@ -106,10 +104,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Rectangular Full Packed (RFP) Format when N is @@ -192,12 +189,8 @@ *> 02 12 22 00 01 00 10 20 30 40 50 *> 03 13 23 33 11 33 11 21 31 41 51 *> 04 14 24 34 44 43 44 22 32 42 52 -*> -*> Reference -*> ========= -*> *> \endverbatim -*> +* * ===================================================================== SUBROUTINE STRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO ) * diff --git a/SRC/strttp.f b/SRC/strttp.f index ff5a4ce..9b3c141 100644 --- a/SRC/strttp.f +++ b/SRC/strttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STRTTP( UPLO, N, A, LDA, AP, INFO ) * @@ -28,19 +28,18 @@ * REAL A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STRTTP copies a triangular matrix A from full format (TR) to standard *> packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/stzrqf.f b/SRC/stzrqf.f index 6d439de..d4bc696 100644 --- a/SRC/stzrqf.f +++ b/SRC/stzrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STZRQF( M, N, A, LDA, TAU, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine STZRZF. *> @@ -44,11 +44,10 @@ *> *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -91,10 +90,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 @@ -105,10 +103,9 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The factorization is obtained by Householder's method. The kth @@ -136,7 +133,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/stzrzf.f b/SRC/stzrzf.f index 2b9999b..890fe68 100644 --- a/SRC/stzrzf.f +++ b/SRC/stzrzf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE STZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * REAL A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> STZRZF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A *> to upper triangular form by means of orthogonal transformations. @@ -42,11 +42,10 @@ *> *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -108,10 +107,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 @@ -122,14 +120,15 @@ * *> \ingroup realOTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -156,7 +155,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/xerbla.f b/SRC/xerbla.f index 10e0699..35e8230 100644 --- a/SRC/xerbla.f +++ b/SRC/xerbla.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE XERBLA( SRNAME, INFO ) * @@ -25,11 +25,11 @@ * INTEGER INFO * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> XERBLA is an error handler for the LAPACK routines. *> It is called by an LAPACK routine if an input parameter has an @@ -37,11 +37,10 @@ *> *> Installers may consider modifying the STOP statement in order to *> call system-specific exception-handling facilities. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SRNAME *> \verbatim @@ -55,10 +54,9 @@ *> The position of the invalid parameter in the parameter list *> of the calling routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/xerbla_array.f b/SRC/xerbla_array.f index 825988b..4746f25 100644 --- a/SRC/xerbla_array.f +++ b/SRC/xerbla_array.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE XERBLA_ARRAY( SRNAME_ARRAY, SRNAME_LEN, INFO) * @@ -27,11 +27,11 @@ * CHARACTER(1) SRNAME_ARRAY(SRNAME_LEN) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> XERBLA_ARRAY assists other languages in calling XERBLA, the LAPACK *> and BLAS error handler. Rather than taking a Fortran string argument @@ -51,11 +51,10 @@ *> *> Providing XERBLA_ARRAY is not necessary for intercepting LAPACK *> errors. XERBLA_ARRAY calls XERBLA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SRNAME_ARRAY *> \verbatim @@ -75,10 +74,9 @@ *> The position of the invalid parameter in the parameter list *> of the calling routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zbbcsd.f b/SRC/zbbcsd.f index 7911a4a..9e39b1f 100644 --- a/SRC/zbbcsd.f +++ b/SRC/zbbcsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q, * THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T, @@ -35,11 +35,11 @@ * $ V2T( LDV2T, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZBBCSD computes the CS decomposition of a unitary matrix in *> bidiagonal-block form, @@ -68,11 +68,10 @@ *> The unitary matrices U1, U2, V1T, and V2T are input/output. *> The input matrices are pre- or post-multiplied by the appropriate *> singular vector matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -297,25 +296,26 @@ *> > 0: if ZBBCSD did not converge, INFO specifies the number *> of nonzero entries in PHI, and B11D, B11E, etc., *> contain the partially reduced matrix. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Reference -*> ========= -*> -*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. -*> Algorithms, 50(1):33-65, 2009. -*> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL DOUBLE PRECISION, default = MAX(10,MIN(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they *> are within TOLMUL*EPS of either bound. *> \endverbatim +* +*> \par References: +* ================ *> +*> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. +*> Algorithms, 50(1):33-65, 2009. * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zbdsqr.f b/SRC/zbdsqr.f index 0e2bda0..5b1b301 100644 --- a/SRC/zbdsqr.f +++ b/SRC/zbdsqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, * LDU, C, LDC, RWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 C( LDC, * ), U( LDU, * ), VT( LDVT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZBDSQR computes the singular values and, optionally, the right and/or *> left singular vectors from the singular value decomposition (SVD) of @@ -65,11 +65,10 @@ *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics *> Department, University of California at Berkeley, July 1992 *> for a detailed description of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -180,10 +179,12 @@ *> elements of a bidiagonal matrix which is orthogonally *> similar to the input matrix B; if INFO = i, i *> elements of E have not converged to zero. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLMUL DOUBLE PRECISION, default = max(10,min(100,EPS**(-1/8))) *> TOLMUL controls the convergence criterion of the QR loop. *> If it is positive, TOLMUL*EPS is the desired relative @@ -205,10 +206,9 @@ *> (and so fails to converge) if the number of passes *> through the inner loop exceeds MAXITR*N**2. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zcgesv.f b/SRC/zcgesv.f index 9b2bb31..68985fa 100644 --- a/SRC/zcgesv.f +++ b/SRC/zcgesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK, * SWORK, RWORK, ITER, INFO ) @@ -32,11 +32,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCGESV computes the solution to a complex system of linear equations *> A * X = B, @@ -68,11 +68,10 @@ *> o EPS is the machine epsilon returned by DLAMCH('Epsilon') *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00 *> respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -185,10 +184,9 @@ *> factor U is exactly singular, so the solution *> could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zcposv.f b/SRC/zcposv.f index ee010e4..ca7a5d0 100644 --- a/SRC/zcposv.f +++ b/SRC/zcposv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZCPOSV( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, WORK, * SWORK, RWORK, ITER, INFO ) @@ -32,11 +32,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZCPOSV computes the solution to a complex system of linear equations *> A * X = B, @@ -69,11 +69,10 @@ *> o EPS is the machine epsilon returned by DLAMCH('Epsilon') *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00 *> respectively. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -193,10 +192,9 @@ *> factorization could not be completed, and the solution *> has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zdrscl.f b/SRC/zdrscl.f index 6d0b1f0..ad42577 100644 --- a/SRC/zdrscl.f +++ b/SRC/zdrscl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZDRSCL( N, SA, SX, INCX ) * @@ -28,20 +28,19 @@ * COMPLEX*16 SX( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZDRSCL multiplies an n-element complex vector x by the real scalar *> 1/a. This is done without overflow or underflow as long as *> the final result x/a does not overflow or underflow. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -69,10 +68,9 @@ *> The increment between successive values of the vector SX. *> > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbbrd.f b/SRC/zgbbrd.f index 82ee3b2..88e2e90 100644 --- a/SRC/zgbbrd.f +++ b/SRC/zgbbrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q, * LDQ, PT, LDPT, C, LDC, WORK, RWORK, INFO ) @@ -31,22 +31,21 @@ * $ Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBBRD reduces a complex general m-by-n band matrix A to real upper *> bidiagonal form B by a unitary transformation: Q**H * A * P = B. *> *> The routine computes B, and optionally forms Q or P**H, or computes *> Q**H*C for a given matrix C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -177,10 +176,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/SRC/zgbcon.f b/SRC/zgbcon.f index 1c78ace..d2041a5 100644 --- a/SRC/zgbcon.f +++ b/SRC/zgbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND, * WORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * COMPLEX*16 AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBCON estimates the reciprocal of the condition number of a complex *> general band matrix A, in either the 1-norm or the infinity-norm, @@ -45,11 +45,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -131,10 +130,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/SRC/zgbequ.f b/SRC/zgbequ.f index 59e1108..741d98b 100644 --- a/SRC/zgbequ.f +++ b/SRC/zgbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBEQU computes row and column scalings intended to equilibrate an *> M-by-N band matrix A and reduce its condition number. R returns the @@ -46,11 +46,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -138,10 +137,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbequb.f b/SRC/zgbequb.f index 02b5538..48ea812 100644 --- a/SRC/zgbequb.f +++ b/SRC/zgbequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -53,11 +53,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -145,10 +144,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbrfs.f b/SRC/zgbrfs.f index 25a04c9..9f55282 100644 --- a/SRC/zgbrfs.f +++ b/SRC/zgbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, @@ -33,20 +33,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is banded, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -181,16 +180,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbrfsx.f b/SRC/zgbrfsx.f index ef60853..243294d 100644 --- a/SRC/zgbrfsx.f +++ b/SRC/zgbrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBRFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -58,11 +56,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -423,10 +420,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbsv.f b/SRC/zgbsv.f index 436a5c8..1e91fa0 100644 --- a/SRC/zgbsv.f +++ b/SRC/zgbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBSV computes the solution to a complex system of linear equations *> A * X = B, where A is a band matrix of order N with KL subdiagonals @@ -43,11 +43,10 @@ *> and unit lower triangular matrices with KL subdiagonals, and U is *> upper triangular with KL+KU superdiagonals. The factored form of A *> is then used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -125,10 +124,9 @@ *> has been completed, but the factor U is exactly *> singular, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,10 +137,9 @@ * *> \ingroup complex16GBsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -160,7 +157,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgbsvx.f b/SRC/zgbsvx.f index cbe43b2..43ed5f0 100644 --- a/SRC/zgbsvx.f +++ b/SRC/zgbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -35,11 +35,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBSVX uses the LU factorization to compute the solution to a complex *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B, @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed by this subroutine: *> @@ -88,11 +91,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -350,10 +352,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbsvxx.f b/SRC/zgbsvxx.f index 955df20..33ebf13 100644 --- a/SRC/zgbsvxx.f +++ b/SRC/zgbsvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, * LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX, @@ -39,11 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBSVXX uses the LU factorization to compute the solution to a *> complex*16 system of linear equations A * X = B, where A is an @@ -63,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what ZGBSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -107,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -538,10 +540,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgbtf2.f b/SRC/zgbtf2.f index c5f1232..e6ce0d6 100644 --- a/SRC/zgbtf2.f +++ b/SRC/zgbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBTF2 computes an LU factorization of a complex m-by-n band matrix *> A using partial pivoting with row interchanges. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup complex16GBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -143,7 +140,6 @@ *> + need not be set on entry, but are required by the routine to store *> elements of U, because of fill-in resulting from the row *> interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgbtrf.f b/SRC/zgbtrf.f index ee89155..39358ff 100644 --- a/SRC/zgbtrf.f +++ b/SRC/zgbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBTRF computes an LU factorization of a complex m-by-n band matrix A *> using partial pivoting with row interchanges. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -107,10 +106,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -121,10 +119,9 @@ * *> \ingroup complex16GBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -142,7 +139,6 @@ *> Array elements marked * are not used by the routine; elements marked *> + need not be set on entry, but are required by the routine to store *> elements of U because of fill-in resulting from the row interchanges. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgbtrs.f b/SRC/zgbtrs.f index 2ca3591..ea1d986 100644 --- a/SRC/zgbtrs.f +++ b/SRC/zgbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * COMPLEX*16 AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGBTRS solves a system of linear equations *> A * X = B, A**T * X = B, or A**H * X = B *> with a general band matrix A using the LU factorization computed *> by ZGBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/zgebak.f b/SRC/zgebak.f index a1f3342..b6d1972 100644 --- a/SRC/zgebak.f +++ b/SRC/zgebak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV, * INFO ) @@ -30,20 +30,19 @@ * COMPLEX*16 V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEBAK forms the right or left eigenvectors of a complex general *> matrix by backward transformation on the computed eigenvectors of the *> balanced matrix output by ZGEBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \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/SRC/zgebal.f b/SRC/zgebal.f index 49c71f6..2106ee7 100644 --- a/SRC/zgebal.f +++ b/SRC/zgebal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEBAL balances a general complex matrix A. This involves, first, *> permuting A by a similarity transformation to isolate eigenvalues @@ -44,11 +44,10 @@ *> *> Balancing may reduce the 1-norm of the matrix, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -114,8 +113,8 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> \endverbatim * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -126,10 +125,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The permutations consist of row and column interchanges which put @@ -157,7 +155,6 @@ *> *> Modified by Tzu-Yi Chen, Computer Science Division, University of *> California at Berkeley, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgebd2.f b/SRC/zgebd2.f index 6fdf7d5..179cbe0 100644 --- a/SRC/zgebd2.f +++ b/SRC/zgebd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX*16 A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEBD2 reduces a complex general m by n matrix A to upper or lower *> real bidiagonal form B by a unitary transformation: Q**H * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,10 +136,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -187,7 +184,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgebrd.f b/SRC/zgebrd.f index 6a2881e..bb4a178 100644 --- a/SRC/zgebrd.f +++ b/SRC/zgebrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, * INFO ) @@ -29,21 +29,20 @@ * COMPLEX*16 A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEBRD reduces a general complex M-by-N matrix A to upper or lower *> bidiagonal form B by a unitary transformation: Q**H * A * P = B. *> *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -139,10 +138,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 @@ -153,10 +151,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -202,7 +199,6 @@ *> where d and e denote diagonal and off-diagonal elements of B, vi *> denotes an element of the vector defining H(i), and ui an element of *> the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgecon.f b/SRC/zgecon.f index 7c865cc..cf16d13 100644 --- a/SRC/zgecon.f +++ b/SRC/zgecon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, RWORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGECON estimates the reciprocal of the condition number of a general *> complex matrix A, in either the 1-norm or the infinity-norm, using @@ -44,11 +44,10 @@ *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -108,10 +107,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/SRC/zgeequ.f b/SRC/zgeequ.f index 688a0b4..9f23634 100644 --- a/SRC/zgeequ.f +++ b/SRC/zgeequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEEQU computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -46,11 +46,10 @@ *> number and BIGNUM = largest safe number. Use of these scaling *> factors is not guaranteed to reduce the condition number of A but *> works well in practice. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgeequb.f b/SRC/zgeequb.f index 8ee9aa8..e9fff4f 100644 --- a/SRC/zgeequb.f +++ b/SRC/zgeequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEEQUB computes row and column scalings intended to equilibrate an *> M-by-N matrix A and reduce its condition number. R returns the row @@ -53,11 +53,10 @@ *> these factors introduces no additional rounding errors. However, the *> scaled entries' magnitured are no longer approximately 1 but lie *> between sqrt(radix) and 1/sqrt(radix). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -131,10 +130,9 @@ *> <= M: the i-th row of A is exactly zero *> > M: the (i-M)-th column of A is exactly zero *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgees.f b/SRC/zgees.f index 2708300..9477416 100644 --- a/SRC/zgees.f +++ b/SRC/zgees.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, W, VS, * LDVS, WORK, LWORK, RWORK, BWORK, INFO ) @@ -35,11 +35,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEES computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur @@ -51,11 +51,10 @@ *> invariant subspace corresponding to the selected eigenvalues. *> *> A complex matrix is in Schur form if it is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -181,10 +180,9 @@ *> SELECT = .TRUE.. This could also be caused by *> underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgeesx.f b/SRC/zgeesx.f index 2181038..5d5f41c 100644 --- a/SRC/zgeesx.f +++ b/SRC/zgeesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, W, * VS, LDVS, RCONDE, RCONDV, WORK, LWORK, RWORK, @@ -37,11 +37,11 @@ * EXTERNAL SELECT * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEESX computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur @@ -60,11 +60,10 @@ *> these quantities are called s and sep respectively). *> *> A complex matrix is in Schur form if it is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVS *> \verbatim @@ -222,10 +221,9 @@ *> the Schur form no longer satisfy SELECT=.TRUE. This *> could also be caused by underflow due to scaling. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgeev.f b/SRC/zgeev.f index 73f1b27..a7fc2ac 100644 --- a/SRC/zgeev.f +++ b/SRC/zgeev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEEV( JOBVL, JOBVR, N, A, LDA, W, VL, LDVL, VR, LDVR, * WORK, LWORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEEV computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -49,11 +49,10 @@ *> *> The computed eigenvectors are normalized to have Euclidean norm *> equal to 1 and largest component real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -161,10 +160,9 @@ *> elements and i+1:N of W contain eigenvalues which have *> converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgeevx.f b/SRC/zgeevx.f index 3e14a9b..0e56048 100644 --- a/SRC/zgeevx.f +++ b/SRC/zgeevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL, * LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE, @@ -34,11 +34,11 @@ * $ W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEEVX computes for an N-by-N complex nonsymmetric matrix A, the *> eigenvalues and, optionally, the left and/or right eigenvectors. @@ -69,11 +69,10 @@ *> (in exact arithmetic) but diagonal scaling will. For further *> explanation of balancing, see section 4.10.2 of the LAPACK *> Users' Guide. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -268,10 +267,9 @@ *> have been computed; elements 1:ILO-1 and i+1:N of W *> contain eigenvalues which have converged. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgegs.f b/SRC/zgegs.f index 3859be5..3a8bb87 100644 --- a/SRC/zgegs.f +++ b/SRC/zgegs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHA, BETA, * VSL, LDVSL, VSR, LDVSR, WORK, LWORK, RWORK, @@ -33,11 +33,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine ZGGES. *> @@ -56,11 +56,10 @@ *> ZGEGV should be used instead. See ZGEGV for a description of the *> eigenvalues of the generalized nonsymmetric eigenvalue problem *> (GNEP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -208,10 +207,9 @@ *> =N+8: error return from ZGGBAK (computing VSR) *> =N+9: error return from ZLASCL (various places) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgegv.f b/SRC/zgegv.f index f12cbdc..bee5d04 100644 --- a/SRC/zgegv.f +++ b/SRC/zgegv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA, * VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine ZGGEV. *> @@ -64,11 +64,10 @@ *> are left eigenvectors of (A,B). *> *> Note: this routine performs "full balancing" on A and B -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -234,10 +233,9 @@ *> =N+9: error return from ZGGBAK (computing VR) *> =N+10: error return from ZLASCL (various calls) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -248,10 +246,9 @@ * *> \ingroup complex16GEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing @@ -279,7 +276,6 @@ *> are computed, then only the diagonal blocks will be correct. *> *> [*] In other words, upper triangular form. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgehd2.f b/SRC/zgehd2.f index 6a8ae73..e5eaedf 100644 --- a/SRC/zgehd2.f +++ b/SRC/zgehd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEHD2 reduces a complex general matrix A to upper Hessenberg form H *> by a unitary similarity transformation: Q**H * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \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 @@ -112,10 +110,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -147,7 +144,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgehrd.f b/SRC/zgehrd.f index c546808..9b7e9c1 100644 --- a/SRC/zgehrd.f +++ b/SRC/zgehrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEHRD reduces a complex general matrix A to upper Hessenberg form H by *> an unitary similarity transformation: Q**H * A * Q = H . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -113,10 +112,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 @@ -127,10 +125,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of (ihi-ilo) elementary @@ -166,7 +163,6 @@ *> This file is a slight modification of LAPACK-3.0's DGEHRD *> subroutine incorporating improvements proposed by Quintana-Orti and *> Van de Geijn (2006). (See DLAHR2.) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgelq2.f b/SRC/zgelq2.f index e03f4b8..3ac1610 100644 --- a/SRC/zgelq2.f +++ b/SRC/zgelq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGELQ2 computes an LQ factorization of a complex m by n matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in *> A(i,i+1:n), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgelqf.f b/SRC/zgelqf.f index 6e1164c..7c32626 100644 --- a/SRC/zgelqf.f +++ b/SRC/zgelqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGELQF computes an LQ factorization of a complex M-by-N matrix A: *> A = L * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -102,10 +101,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 @@ -116,10 +114,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -133,7 +130,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in *> A(i,i+1:n), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgels.f b/SRC/zgels.f index 05cdfe6..ddbd7fc 100644 --- a/SRC/zgels.f +++ b/SRC/zgels.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGELS solves overdetermined or underdetermined complex linear systems *> involving an M-by-N matrix A, or its conjugate-transpose, using a QR @@ -59,11 +59,10 @@ *> handled in a single call; they are stored as the columns of the *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution *> matrix X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -166,10 +165,9 @@ *> full rank; the least squares solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgelsd.f b/SRC/zgelsd.f index ef7064a..2b17124 100644 --- a/SRC/zgelsd.f +++ b/SRC/zgelsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, RWORK, IWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGELSD computes the minimum-norm solution to a real linear least *> squares problem: @@ -66,11 +66,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -202,10 +201,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -216,19 +214,13 @@ * *> \ingroup complex16GEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, $ WORK, LWORK, RWORK, IWORK, INFO ) diff --git a/SRC/zgelss.f b/SRC/zgelss.f index 6e62846..ca96cac 100644 --- a/SRC/zgelss.f +++ b/SRC/zgelss.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, * WORK, LWORK, RWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGELSS computes the minimum norm solution to a complex linear *> least squares problem: @@ -52,11 +52,10 @@ *> The effective rank of A is determined by treating as zero those *> singular values which are less than RCOND times the largest singular *> value. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -162,10 +161,9 @@ *> if INFO = i, i off-diagonal elements of an intermediate *> bidiagonal form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgelsx.f b/SRC/zgelsx.f index c4ab165..830b3d8 100644 --- a/SRC/zgelsx.f +++ b/SRC/zgelsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine ZGELSY. *> @@ -66,11 +66,10 @@ *> X = P * Z**H [ inv(T11)*Q1**H*B ] *> [ 0 ] *> where Q1 consists of the first RANK columns of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -168,10 +167,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/SRC/zgelsy.f b/SRC/zgelsy.f index c012677..bca35d4 100644 --- a/SRC/zgelsy.f +++ b/SRC/zgelsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, * WORK, LWORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGELSY computes the minimum-norm solution to a complex linear least *> squares problem: @@ -73,11 +73,10 @@ *> the call to the subroutine xGEQP3. This subroutine is a Blas-3 *> version of the QR factorization with column pivoting. *> o Matrix B (the right hand side) is updated with Blas-3. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -187,10 +186,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 @@ -201,18 +199,12 @@ * *> \ingroup complex16GEsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain -*> -*> \endverbatim +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n +*> E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n +*> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n *> * ===================================================================== SUBROUTINE ZGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, diff --git a/SRC/zgemqrt.f b/SRC/zgemqrt.f index ece7590..0be8eb0 100644 --- a/SRC/zgemqrt.f +++ b/SRC/zgemqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, * C, LDC, WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEMQRT overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> generated using the compact WY representation as returned by ZGEQRT. *> *> Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -152,10 +151,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/SRC/zgeql2.f b/SRC/zgeql2.f index 1137bc7..56087c6 100644 --- a/SRC/zgeql2.f +++ b/SRC/zgeql2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQL2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQL2 computes a QL factorization of a complex m by n matrix A: *> A = Q * L. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqlf.f b/SRC/zgeqlf.f index beaaf5e..dfd232a 100644 --- a/SRC/zgeqlf.f +++ b/SRC/zgeqlf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQLF computes a QL factorization of a complex M-by-N matrix A: *> A = Q * L. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in *> A(1:m-k+i-1,n-k+i), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqp3.f b/SRC/zgeqp3.f index e98296a..a160ae4 100644 --- a/SRC/zgeqp3.f +++ b/SRC/zgeqp3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK, * INFO ) @@ -30,19 +30,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQP3 computes a QR factorization with column pivoting of a *> matrix A: A*P = Q*R using Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -119,10 +118,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 @@ -133,10 +131,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -150,13 +147,14 @@ *> where tau is a real/complex scalar, and v is a real/complex vector *> with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in *> A(i+1:m,i), and tau in TAU(i). +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK, $ INFO ) diff --git a/SRC/zgeqpf.f b/SRC/zgeqpf.f index eb112a5..ad0cef4 100644 --- a/SRC/zgeqpf.f +++ b/SRC/zgeqpf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine ZGEQP3. *> *> ZGEQPF computes a QR factorization with column pivoting of a *> complex M-by-N matrix A: A*P = Q*R. -*> -*>\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 @@ -120,10 +118,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -146,7 +143,6 @@ *> University of Zagreb, Croatia. *> -- April 2011 -- *> For more details see LAPACK Working Note 176. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqr2.f b/SRC/zgeqr2.f index 38f7550..3eb01fd 100644 --- a/SRC/zgeqr2.f +++ b/SRC/zgeqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQR2 computes a QR factorization of a complex m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqr2p.f b/SRC/zgeqr2p.f index 8b379d3..0f1b18d 100644 --- a/SRC/zgeqr2p.f +++ b/SRC/zgeqr2p.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQR2P( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQR2P computes a QR factorization of a complex m by n matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -88,10 +87,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 @@ -102,10 +100,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -119,7 +116,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqrf.f b/SRC/zgeqrf.f index e11b19d..3314c82 100644 --- a/SRC/zgeqrf.f +++ b/SRC/zgeqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQRF computes a QR factorization of a complex M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqrfp.f b/SRC/zgeqrfp.f index bd08403..6db027c 100644 --- a/SRC/zgeqrfp.f +++ b/SRC/zgeqrfp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQRFP computes a QR factorization of a complex M-by-N matrix A: *> A = Q * R. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -103,10 +102,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 @@ -117,10 +115,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -134,7 +131,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), *> and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqrt.f b/SRC/zgeqrt.f index 4541ff1..3d09f67 100644 --- a/SRC/zgeqrt.f +++ b/SRC/zgeqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQRT computes a blocked QR factorization of a complex M-by-N matrix A *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -100,10 +99,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 @@ -114,11 +112,11 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The matrix V stores the elementary reflectors H(i) in the i-th column *> below the diagonal. For example, if M=5 and N=3, the matrix V is *> @@ -138,7 +136,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = (T1 T2 ... TB). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqrt2.f b/SRC/zgeqrt2.f index 337bef4..544fdf3 100644 --- a/SRC/zgeqrt2.f +++ b/SRC/zgeqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGEQRT2( M, N, A, LDA, T, LDT, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQRT2 computes a QR factorization of a complex M-by-N matrix A, *> using the compact WY representation of Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,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 @@ -103,10 +101,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -125,7 +122,6 @@ *> H = I - V * T * V**H *> *> where V**H is the conjugate transpose of V. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgeqrt3.f b/SRC/zgeqrt3.f index 0925a5d..fdd498f 100644 --- a/SRC/zgeqrt3.f +++ b/SRC/zgeqrt3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE ZGEQRT3( M, N, A, LDA, T, LDT, INFO ) * @@ -27,22 +27,21 @@ * COMPLEX*16 A( LDA, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGEQRT3 recursively computes a QR factorization of a complex M-by-N *> matrix A, using the compact WY representation of Q. *> *> Based on the algorithm of Elmroth and Gustavson, *> IBM J. Res. Develop. Vol 44 No. 4 July 2000. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,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 @@ -106,10 +104,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix V stores the elementary reflectors H(i) in the i-th column @@ -130,7 +127,6 @@ *> where V**H is the conjugate transpose of V. *> *> For details of the algorithm, see Elmroth and Gustavson (cited above). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgerfs.f b/SRC/zgerfs.f index a720ac9..78973ae 100644 --- a/SRC/zgerfs.f +++ b/SRC/zgerfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -32,20 +32,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGERFS improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates for *> the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -162,16 +161,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgerfsx.f b/SRC/zgerfsx.f index 4e5aaa1..4f34125 100644 --- a/SRC/zgerfsx.f +++ b/SRC/zgerfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGERFSX improves the computed solution to a system of linear *> equations and provides error bounds and backward error estimates @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED, R *> and C below. In this case, the solution and error bounds returned *> are for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -398,10 +395,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgerq2.f b/SRC/zgerq2.f index 86fcb36..7c419f2 100644 --- a/SRC/zgerq2.f +++ b/SRC/zgerq2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERQ2( M, N, A, LDA, TAU, WORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGERQ2 computes an RQ factorization of a complex m by n matrix A: *> A = R * Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -90,10 +89,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 @@ -104,10 +102,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -121,7 +118,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on *> exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgerqf.f b/SRC/zgerqf.f index bc04520..a16082e 100644 --- a/SRC/zgerqf.f +++ b/SRC/zgerqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,19 +27,18 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGERQF computes an RQ factorization of a complex M-by-N matrix A: *> A = R * Q. -*> -*>\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 @@ -119,10 +117,9 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -136,7 +133,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on *> exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgesc2.f b/SRC/zgesc2.f index d442f6b..86f76c2 100644 --- a/SRC/zgesc2.f +++ b/SRC/zgesc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), RHS( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGESC2 solves a system of linear equations *> @@ -42,11 +42,10 @@ *> with a general N-by-N matrix A using the LU factorization with *> complete pivoting computed by ZGETC2. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,9 @@ *> On exit, SCALE contains the scale factor. SCALE is chosen *> 0 <= SCALE <= 1 to prevent owerflow in the solution. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -108,18 +106,12 @@ * *> \ingroup complex16GEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) * diff --git a/SRC/zgesdd.f b/SRC/zgesdd.f index 42c53ca..be14d1e 100644 --- a/SRC/zgesdd.f +++ b/SRC/zgesdd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, * LWORK, RWORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGESDD computes the singular value decomposition (SVD) of a complex *> M-by-N matrix A, optionally computing the left and/or right singular @@ -59,11 +59,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -200,10 +199,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: The updating process of DBDSDC did not converge. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -214,18 +212,12 @@ * *> \ingroup complex16GEsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, $ LWORK, RWORK, IWORK, INFO ) diff --git a/SRC/zgesv.f b/SRC/zgesv.f index 1fcd0a1..d96c1b6 100644 --- a/SRC/zgesv.f +++ b/SRC/zgesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGESV computes the solution to a complex system of linear equations *> A * X = B, @@ -44,11 +44,10 @@ *> where P is a permutation matrix, L is unit lower triangular, and U is *> upper triangular. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -107,10 +106,9 @@ *> has been completed, but the factor U is exactly *> singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgesvd.f b/SRC/zgesvd.f index 3609a38..875345d 100644 --- a/SRC/zgesvd.f +++ b/SRC/zgesvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, * WORK, LWORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGESVD computes the singular value decomposition (SVD) of a complex *> M-by-N matrix A, optionally computing the left and/or right singular @@ -51,11 +51,10 @@ *> U and V are the left and right singular vectors of A. *> *> Note that the routine returns V**H, not V. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -198,10 +197,9 @@ *> did not converge to zero. See the description of RWORK *> above for details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgesvx.f b/SRC/zgesvx.f index 48b29df..0ccf53d 100644 --- a/SRC/zgesvx.f +++ b/SRC/zgesvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -35,11 +35,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGESVX uses the LU factorization to compute the solution to a complex *> system of linear equations @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -87,11 +90,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -330,10 +332,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgesvxx.f b/SRC/zgesvxx.f index e7ee129..72bfdc8 100644 --- a/SRC/zgesvxx.f +++ b/SRC/zgesvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW, @@ -39,13 +39,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGESVXX uses the LU factorization to compute the solution to a *> complex*16 system of linear equations A * X = B, where A is an @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what ZGESVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -109,11 +110,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so *> that it solves the original system before equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -520,10 +520,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgetc2.f b/SRC/zgetc2.f index 6845de4..1651a75 100644 --- a/SRC/zgetc2.f +++ b/SRC/zgetc2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGETC2 computes an LU factorization, using complete pivoting, of the *> n-by-n matrix A. The factorization has the form A = P * L * U * Q, @@ -40,11 +40,10 @@ *> unit diagonal elements and U is upper triangular. *> *> This is a level 1 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> one tries to solve for x in Ax = b. So U is perturbed *> to avoid the overflow. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,18 +102,12 @@ * *> \ingroup complex16GEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO ) * diff --git a/SRC/zgetf2.f b/SRC/zgetf2.f index 533e00e..a771ad5 100644 --- a/SRC/zgetf2.f +++ b/SRC/zgetf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETF2( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGETF2 computes an LU factorization of a general m-by-n matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgetrf.f b/SRC/zgetrf.f index a3af961..f32d3ea 100644 --- a/SRC/zgetrf.f +++ b/SRC/zgetrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETRF( M, N, A, LDA, IPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGETRF computes an LU factorization of a general M-by-N matrix A *> using partial pivoting with row interchanges. @@ -44,11 +44,10 @@ *> triangular (upper trapezoidal if m < n). *> *> This is the right-looking Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -93,10 +92,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgetri.f b/SRC/zgetri.f index 8e929bf..4798edb 100644 --- a/SRC/zgetri.f +++ b/SRC/zgetri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -28,22 +28,21 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGETRI computes the inverse of a matrix using the LU factorization *> computed by ZGETRF. *> *> This method inverts U and then computes inv(A) by solving the system *> inv(A)*L = inv(U) for inv(A). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, U(i,i) is exactly zero; the matrix is *> singular and its inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgetrs.f b/SRC/zgetrs.f index 1186b47..f73f9b7 100644 --- a/SRC/zgetrs.f +++ b/SRC/zgetrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGETRS solves a system of linear equations *> A * X = B, A**T * X = B, or A**H * X = B *> with a general N-by-N matrix A using the LU factorization computed *> by ZGETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \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/SRC/zggbak.f b/SRC/zggbak.f index 4b6635d..4b79151 100644 --- a/SRC/zggbak.f +++ b/SRC/zggbak.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V, * LDV, INFO ) @@ -30,21 +30,20 @@ * COMPLEX*16 V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGBAK forms the right or left eigenvectors of a complex generalized *> eigenvalue problem A*x = lambda*B*x, by backward transformation on *> the computed eigenvectors of the balanced pair of matrices output by *> ZGGBAL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -123,10 +122,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 @@ -137,15 +135,13 @@ * *> \ingroup complex16GBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. Ward, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zggbal.f b/SRC/zggbal.f index 2e7c009..452f7eb 100644 --- a/SRC/zggbal.f +++ b/SRC/zggbal.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE, * RSCALE, WORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGBAL balances a pair of general complex matrices (A,B). This *> involves, first, permuting A and B by similarity transformations to @@ -46,11 +46,10 @@ *> Balancing may reduce the 1-norm of the matrices, and improve the *> accuracy of the computed eigenvalues and/or eigenvectors in the *> generalized eigenvalue problem A*x = lambda*B*x. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -152,10 +151,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 @@ -166,15 +164,13 @@ * *> \ingroup complex16GBcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> See R.C. WARD, Balancing the generalized eigenvalue problem, *> SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgges.f b/SRC/zgges.f index 5c1456e..ca0efe7 100644 --- a/SRC/zgges.f +++ b/SRC/zgges.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB, * SDIM, ALPHA, BETA, VSL, LDVSL, VSR, LDVSR, WORK, @@ -38,11 +38,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGES computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B), the generalized eigenvalues, the generalized complex Schur @@ -70,11 +70,10 @@ *> A pair of matrices (S,T) is in generalized complex Schur form if S *> and T are upper triangular and, in addition, the diagonal elements *> of T are non-negative real numbers. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -253,10 +252,9 @@ *> be caused due to scaling. *> =N+3: reordering falied in ZTGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zggesx.f b/SRC/zggesx.f index e7f8329..4a36871 100644 --- a/SRC/zggesx.f +++ b/SRC/zggesx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA, * B, LDB, SDIM, ALPHA, BETA, VSL, LDVSL, VSR, @@ -41,11 +41,11 @@ * EXTERNAL SELCTG * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGESX computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B), the generalized eigenvalues, the complex Schur form (S,T), @@ -74,11 +74,10 @@ *> A pair of matrices (S,T) is in generalized complex Schur form if T is *> upper triangular with non-negative diagonal and S is upper *> triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVSL *> \verbatim @@ -312,10 +311,9 @@ *> be caused due to scaling. *> =N+3: reordering failed in ZTGSEN. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zggev.f b/SRC/zggev.f index 155b19c..f4e6906 100644 --- a/SRC/zggev.f +++ b/SRC/zggev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA, * VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGEV computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B), the generalized eigenvalues, and optionally, the left and/or @@ -59,11 +59,10 @@ *> u(j)**H * A = lambda(j) * u(j)**H * B *> *> where u(j)**H is the conjugate-transpose of u(j). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBVL *> \verbatim @@ -201,10 +200,9 @@ *> > N: =N+1: other then QZ iteration failed in DHGEQZ, *> =N+2: error return from DTGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zggevx.f b/SRC/zggevx.f index a02451a..4f8db7c 100644 --- a/SRC/zggevx.f +++ b/SRC/zggevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB, * ALPHA, BETA, VL, LDVL, VR, LDVR, ILO, IHI, @@ -38,11 +38,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGEVX computes for a pair of N-by-N complex nonsymmetric matrices *> (A,B) the generalized eigenvalues, and optionally, the left and/or @@ -68,11 +68,10 @@ *> u(j)**H * A = lambda(j) * u(j)**H * B. *> where u(j)**H is the conjugate-transpose of u(j). *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] BALANC *> \verbatim @@ -327,10 +326,9 @@ *> > N: =N+1: other than QZ iteration failed in ZHGEQZ. *> =N+2: error return from ZTGEVC. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -341,10 +339,9 @@ * *> \ingroup complex16GEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Balancing a matrix pair (A,B) includes, first, permuting rows and @@ -369,7 +366,6 @@ *> *> For further explanation of the reciprocal condition numbers RCONDE *> and RCONDV, see section 4.11 of LAPACK User's Guide. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zggglm.f b/SRC/zggglm.f index fd48a9d..ed7862f 100644 --- a/SRC/zggglm.f +++ b/SRC/zggglm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGGLM solves a general Gauss-Markov linear model (GLM) problem: *> @@ -61,11 +61,10 @@ *> x *> *> where inv(B) denotes the inverse of B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -169,10 +168,9 @@ *> rank( A B ) < N; the least squares solution could not *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgghrd.f b/SRC/zgghrd.f index a9ae228..f6d52de 100644 --- a/SRC/zgghrd.f +++ b/SRC/zgghrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q, * LDQ, Z, LDZ, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGHRD reduces a pair of complex matrices (A,B) to generalized upper *> Hessenberg form using unitary transformations, where A is a @@ -61,11 +61,10 @@ *> If Q1 is the unitary matrix from the QR factorization of B in the *> original equation A*x = lambda*B*x, then ZGGHRD reduces the original *> problem to generalized Hessenberg form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -178,10 +177,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 @@ -192,16 +190,14 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine reduces A to Hessenberg and B to triangular form by *> an unblocked reduction, as described in _Matrix_Computations_, *> by Golub and van Loan (Johns Hopkins Press). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgglse.f b/SRC/zgglse.f index 56629ca..7cd7db6 100644 --- a/SRC/zgglse.f +++ b/SRC/zgglse.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK, * INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGLSE solves the linear equality-constrained least squares (LSE) *> problem: @@ -52,11 +52,10 @@ *> matrices (B, A) given by *> *> B = (0 R)*Q, A = Z*T*Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,9 @@ *> ( (B) ) *> be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zggqrf.f b/SRC/zggqrf.f index 9aad8ba..24d6472 100644 --- a/SRC/zggqrf.f +++ b/SRC/zggqrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGQRF computes a generalized QR factorization of an N-by-M matrix A *> and an N-by-P matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**H denotes the *> conjugate transpose of matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -165,10 +164,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 @@ -179,10 +177,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -212,7 +209,6 @@ *> B(n-k+i,1:p-k+i-1), and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine ZUNGRQ. *> To use Z to update another matrix, use LAPACK subroutine ZUNMRQ. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zggrqf.f b/SRC/zggrqf.f index 63ed62f..9d49e2f 100644 --- a/SRC/zggrqf.f +++ b/SRC/zggrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK, * LWORK, INFO ) @@ -29,11 +29,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGRQF computes a generalized RQ factorization of an M-by-N matrix A *> and a P-by-N matrix B: @@ -62,11 +62,10 @@ *> *> where inv(B) denotes the inverse of the matrix B, and Z**H denotes the *> conjugate transpose of the matrix Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -164,10 +163,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 @@ -178,10 +176,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of elementary reflectors @@ -211,7 +208,6 @@ *> and taub in TAUB(i). *> To form Z explicitly, use LAPACK subroutine ZUNGQR. *> To use Z to update another matrix, use LAPACK subroutine ZUNMQR. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zggsvd.f b/SRC/zggsvd.f index 0928f17..3faa195 100644 --- a/SRC/zggsvd.f +++ b/SRC/zggsvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, * LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, @@ -33,11 +33,11 @@ * $ U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGSVD computes the generalized singular value decomposition (GSVD) *> of an M-by-N complex matrix A and P-by-N complex matrix B: @@ -116,11 +116,10 @@ *> *> X = Q*( I 0 ) *> ( 0 inv(R) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -297,10 +296,12 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, the Jacobi-type procedure failed to *> converge. For further details, see subroutine ZTGSJA. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> TOLA DOUBLE PRECISION *> TOLB DOUBLE PRECISION *> TOLA and TOLB are the thresholds to determine the effective @@ -310,10 +311,9 @@ *> The size of TOLA and TOLB may affect the size of backward *> errors of the decomposition. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -324,18 +324,12 @@ * *> \ingroup complex16OTHERsing * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> 2-96 Based on modifications by *> Ming Gu and Huan Ren, Computer Science Division, University of *> California at Berkeley, USA *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B, $ LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, diff --git a/SRC/zggsvp.f b/SRC/zggsvp.f index 005f361..566f2c3 100644 --- a/SRC/zggsvp.f +++ b/SRC/zggsvp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB, * TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ, @@ -34,11 +34,11 @@ * $ TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGGSVP computes unitary matrices U, V and Q such that *> @@ -63,11 +63,10 @@ *> This decomposition is the preprocessing step for computing the *> Generalized Singular Value Decomposition (GSVD), see subroutine *> ZGGSVD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -236,10 +235,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 @@ -250,16 +248,14 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The subroutine uses LAPACK subroutine ZGEQPF for the QR factorization *> with column pivoting to detect the effective numerical rank of the *> a matrix. It may be replaced by a better rank determination strategy. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zgtcon.f b/SRC/zgtcon.f index 7e95821..544abed 100644 --- a/SRC/zgtcon.f +++ b/SRC/zgtcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND, * WORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 D( * ), DL( * ), DU( * ), DU2( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTCON estimates the reciprocal of the condition number of a complex *> tridiagonal matrix A using the LU factorization as computed by @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \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/SRC/zgtrfs.f b/SRC/zgtrfs.f index e6902eb..78daea7 100644 --- a/SRC/zgtrfs.f +++ b/SRC/zgtrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2, * IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, @@ -34,20 +34,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is tridiagonal, and provides *> error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -185,16 +184,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgtsv.f b/SRC/zgtsv.f index f80df4f..cfef928 100644 --- a/SRC/zgtsv.f +++ b/SRC/zgtsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTSV( N, NRHS, DL, D, DU, B, LDB, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 B( LDB, * ), D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTSV solves the equation *> @@ -42,11 +42,10 @@ *> *> Note that the equation A**T *X = B may be solved by interchanging the *> order of the arguments DU and DL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> has not been computed. The factorization has not been *> completed unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgtsvx.f b/SRC/zgtsvx.f index 9bf4903..3b300c3 100644 --- a/SRC/zgtsvx.f +++ b/SRC/zgtsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, * DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -35,11 +35,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTSVX uses the LU factorization to compute the solution to a complex *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B, @@ -48,9 +48,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -72,11 +75,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -274,10 +276,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgttrf.f b/SRC/zgttrf.f index cd46a00..c800e2e 100644 --- a/SRC/zgttrf.f +++ b/SRC/zgttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTTRF( N, DL, D, DU, DU2, IPIV, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTTRF computes an LU factorization of a complex tridiagonal matrix A *> using elimination with partial pivoting and row interchanges. @@ -42,11 +42,10 @@ *> where L is a product of permutation and unit lower bidiagonal *> matrices and U is upper triangular with nonzeros in only the main *> diagonal and first two superdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -109,10 +108,9 @@ *> singular, and division by zero will occur if it is used *> to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zgttrs.f b/SRC/zgttrs.f index c90b88c..02fa8aa 100644 --- a/SRC/zgttrs.f +++ b/SRC/zgttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB, * INFO ) @@ -30,21 +30,20 @@ * COMPLEX*16 B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTTRS solves one of the systems of equations *> A * X = B, A**T * X = B, or A**H * X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by ZGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -122,10 +121,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/SRC/zgtts2.f b/SRC/zgtts2.f index df39cae..c608b83 100644 --- a/SRC/zgtts2.f +++ b/SRC/zgtts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB ) * @@ -28,21 +28,20 @@ * COMPLEX*16 B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZGTTS2 solves one of the systems of equations *> A * X = B, A**T * X = B, or A**H * X = B, *> with a tridiagonal matrix A using the LU factorization computed *> by ZGTTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITRANS *> \verbatim @@ -113,10 +112,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhbev.f b/SRC/zhbev.f index 4d7f6f2..a8ce833 100644 --- a/SRC/zhbev.f +++ b/SRC/zhbev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * RWORK, INFO ) @@ -30,19 +30,18 @@ * COMPLEX*16 AB( LDAB, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBEV computes all the eigenvalues and, optionally, eigenvectors of *> a complex Hermitian band matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -136,10 +135,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhbevd.f b/SRC/zhbevd.f index cf745ab..1a791da 100644 --- a/SRC/zhbevd.f +++ b/SRC/zhbevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AB( LDAB, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBEVD computes all the eigenvalues and, optionally, eigenvectors of *> a complex Hermitian band matrix A. If eigenvectors are desired, it @@ -47,11 +47,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -199,10 +198,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhbevx.f b/SRC/zhbevx.f index 16cb51e..9af5827 100644 --- a/SRC/zhbevx.f +++ b/SRC/zhbevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL, * VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK, @@ -34,21 +34,20 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBEVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian band matrix A. Eigenvalues and eigenvectors *> can be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -243,10 +242,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhbgst.f b/SRC/zhbgst.f index 82c1df9..41fa819 100644 --- a/SRC/zhbgst.f +++ b/SRC/zhbgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X, * LDX, WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBGST reduces a complex Hermitian-definite banded generalized *> eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, @@ -45,11 +45,10 @@ *> split Cholesky factorization. A is overwritten by C = X**H*A*X, where *> X = S**(-1)*Q and Q is a unitary matrix chosen to preserve the *> bandwidth of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -149,10 +148,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/SRC/zhbgv.f b/SRC/zhbgv.f index 108c540..d35c22f 100644 --- a/SRC/zhbgv.f +++ b/SRC/zhbgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z, * LDZ, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBGV computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite banded eigenproblem, of *> the form A*x=(lambda)*B*x. Here A and B are assumed to be Hermitian *> and banded, and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -167,10 +166,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhbgvd.f b/SRC/zhbgvd.f index 77f37dc..02284e7 100644 --- a/SRC/zhbgvd.f +++ b/SRC/zhbgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, * Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK, @@ -34,11 +34,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite banded eigenproblem, of @@ -52,11 +52,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -230,10 +229,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -244,17 +242,11 @@ * *> \ingroup complex16OTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, $ Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK, diff --git a/SRC/zhbgvx.f b/SRC/zhbgvx.f index c5bbfb8..6733eea 100644 --- a/SRC/zhbgvx.f +++ b/SRC/zhbgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, * LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, @@ -35,11 +35,11 @@ * $ WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBGVX computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite banded eigenproblem, of @@ -47,11 +47,10 @@ *> and banded, and B is also positive definite. Eigenvalues and *> eigenvectors can be selected by specifying either all eigenvalues, *> a range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -269,10 +268,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -283,17 +281,11 @@ * *> \ingroup complex16OTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB, $ LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z, diff --git a/SRC/zhbtrd.f b/SRC/zhbtrd.f index 0fa7f4e..4d940df 100644 --- a/SRC/zhbtrd.f +++ b/SRC/zhbtrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ, * WORK, INFO ) @@ -30,20 +30,19 @@ * COMPLEX*16 AB( LDAB, * ), Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHBTRD reduces a complex Hermitian band matrix A to real symmetric *> tridiagonal form T by a unitary similarity transformation: *> Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -139,10 +138,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 @@ -153,14 +151,12 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by Linda Kaufman, Bell Labs. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhecon.f b/SRC/zhecon.f index 8d2b8e0..a28825e 100644 --- a/SRC/zhecon.f +++ b/SRC/zhecon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHECON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHECON estimates the reciprocal of the condition number of a complex *> Hermitian matrix A using the factorization A = U*D*U**H or @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,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/SRC/zheequb.f b/SRC/zheequb.f index 6748290..a965211 100644 --- a/SRC/zheequb.f +++ b/SRC/zheequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * @@ -30,11 +30,11 @@ * DOUBLE PRECISION S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYEQUB computes row and column scalings intended to equilibrate a *> symmetric matrix A and reduce its condition number @@ -44,11 +44,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zheev.f b/SRC/zheev.f index 3a0c65c..9e54f88 100644 --- a/SRC/zheev.f +++ b/SRC/zheev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, * INFO ) @@ -30,19 +30,18 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEEV computes all eigenvalues and, optionally, eigenvectors of a *> complex Hermitian matrix A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -124,10 +123,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zheevd.f b/SRC/zheevd.f index 20d932a..916b617 100644 --- a/SRC/zheevd.f +++ b/SRC/zheevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, * LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEEVD computes all eigenvalues and, optionally, eigenvectors of a *> complex Hermitian matrix A. If eigenvectors are desired, it uses a @@ -47,11 +47,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -178,10 +177,9 @@ *> lying in rows and columns INFO/(N+1) through *> mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -192,18 +190,16 @@ * *> \ingroup complex16HEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA +*> \par Further Details: +* ===================== *> *> Modified description of INFO. Sven, 16 Feb 05. -*> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA *> * ===================================================================== SUBROUTINE ZHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK, diff --git a/SRC/zheevr.f b/SRC/zheevr.f index c59f26c..261b393 100644 --- a/SRC/zheevr.f +++ b/SRC/zheevr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, @@ -34,11 +34,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEEVR computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian matrix A. Eigenvalues and eigenvectors can @@ -97,11 +97,10 @@ *> hence may abort due to a floating point exception in environments *> which do not handle NaNs and infinities in the ieee standard default *> manner. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -321,10 +320,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: Internal error *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -335,21 +333,15 @@ * *> \ingroup complex16HEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n *> Ken Stanley, Computer Science Division, University of -*> California at Berkeley, USA +*> California at Berkeley, USA \n *> Jason Riedy, Computer Science Division, University of -*> California at Berkeley, USA -*> -*> \endverbatim +*> California at Berkeley, USA \n *> * ===================================================================== SUBROUTINE ZHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, diff --git a/SRC/zheevx.f b/SRC/zheevx.f index 02bac46..7ba66d0 100644 --- a/SRC/zheevx.f +++ b/SRC/zheevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, LWORK, RWORK, @@ -33,21 +33,20 @@ * COMPLEX*16 A( LDA, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEEVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian matrix A. Eigenvalues and eigenvectors can *> be selected by specifying either a range of values or a range of *> indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -235,10 +234,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhegs2.f b/SRC/zhegs2.f index eaa6534..9aae29c 100644 --- a/SRC/zhegs2.f +++ b/SRC/zhegs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEGS2 reduces a complex Hermitian-definite generalized *> eigenproblem to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H *A*L. *> *> B must have been previously factorized as U**H *U or L*L**H by ZPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/zhegst.f b/SRC/zhegst.f index dd95053..ca86723 100644 --- a/SRC/zhegst.f +++ b/SRC/zhegst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEGST reduces a complex Hermitian-definite generalized *> eigenproblem to standard form. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. *> *> B must have been previously factorized as U**H*U or L*L**H by ZPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -112,10 +111,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/SRC/zhegv.f b/SRC/zhegv.f index f51a7df..fbeacef 100644 --- a/SRC/zhegv.f +++ b/SRC/zhegv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, RWORK, INFO ) @@ -30,22 +30,21 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEGV computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be Hermitian and B is also *> positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -165,10 +164,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhegvd.f b/SRC/zhegvd.f index ca7c843..c2d68af 100644 --- a/SRC/zhegvd.f +++ b/SRC/zhegvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEGVD computes all the eigenvalues, and optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -49,11 +49,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -217,10 +216,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -231,20 +229,21 @@ * *> \ingroup complex16HEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> Based on contributions by -*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA +*> \verbatim *> *> Modified so that no backsubstitution is performed if ZHEEVD fails to *> converge (NEIG in old code could be greater than N causing out of *> bounds reference to A - reported by Ralf Meyer). Also corrected the *> description of INFO and the test on ITYPE. Sven, 16 Feb 05. *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA *> * ===================================================================== SUBROUTINE ZHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK, diff --git a/SRC/zhegvx.f b/SRC/zhegvx.f index 331f6bb..923bde8 100644 --- a/SRC/zhegvx.f +++ b/SRC/zhegvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, * VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, @@ -34,11 +34,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHEGVX computes selected eigenvalues, and optionally, eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -46,11 +46,10 @@ *> B are assumed to be Hermitian and B is also positive definite. *> Eigenvalues and eigenvectors can be selected by specifying either a *> range of values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -276,10 +275,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -290,17 +288,11 @@ * *> \ingroup complex16HEeigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB, $ VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, diff --git a/SRC/zherfs.f b/SRC/zherfs.f index eee0f29..c4ad164 100644 --- a/SRC/zherfs.f +++ b/SRC/zherfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHERFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -32,20 +32,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHERFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian indefinite, and *> provides error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -168,16 +167,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zherfsx.f b/SRC/zherfsx.f index 0a5e13c..ccc1715 100644 --- a/SRC/zherfsx.f +++ b/SRC/zherfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHERFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -37,13 +37,11 @@ * $ ERR_BNDS_NORM( NRHS, * ), * $ ERR_BNDS_COMP( NRHS, * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHERFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian indefinite, and @@ -56,11 +54,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -385,10 +382,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhesv.f b/SRC/zhesv.f index 837d60e..9fe0da2 100644 --- a/SRC/zhesv.f +++ b/SRC/zhesv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHESV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, * LWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHESV computes the solution to a complex system of linear equations *> A * X = B, @@ -48,11 +48,10 @@ *> triangular matrices, and D is Hermitian and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then *> used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhesvx.f b/SRC/zhesvx.f index 86f8866..68a9a42 100644 --- a/SRC/zhesvx.f +++ b/SRC/zhesvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHESVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHESVX uses the diagonal pivoting factorization to compute the *> solution to a complex system of linear equations A * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -74,11 +77,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -265,10 +267,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhesvxx.f b/SRC/zhesvxx.f index 01063ad..5437adb 100644 --- a/SRC/zhesvxx.f +++ b/SRC/zhesvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHESVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHESVXX uses the diagonal pivoting factorization to compute the *> solution to a complex*16 system of linear equations A * X = B, where @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what ZHESVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -108,11 +109,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(R) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -487,10 +487,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zheswapr.f b/SRC/zheswapr.f index 80b0135..b1888d9 100644 --- a/SRC/zheswapr.f +++ b/SRC/zheswapr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHESWAPR( UPLO, N, A, LDA, I1, I2) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * COMPLEX*16 A( LDA, N ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHESWAPR applies an elementary permutation on the rows and the columns of *> a hermitian matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,9 @@ *> I2 is INTEGER *> Index of the second row to swap *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhetd2.f b/SRC/zhetd2.f index 1cf3f8e..cc3bfd6 100644 --- a/SRC/zhetd2.f +++ b/SRC/zhetd2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETD2( UPLO, N, A, LDA, D, E, TAU, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETD2 reduces a complex Hermitian matrix A to real symmetric *> tridiagonal form T by a unitary similarity transformation: *> Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -114,10 +113,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 @@ -128,10 +126,9 @@ * *> \ingroup complex16HEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -173,7 +170,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhetf2.f b/SRC/zhetf2.f index d28ba0a..08f8b72 100644 --- a/SRC/zhetf2.f +++ b/SRC/zhetf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETF2( UPLO, N, A, LDA, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETF2 computes the factorization of a complex Hermitian matrix A *> using the Bunch-Kaufman diagonal pivoting method: @@ -45,11 +45,10 @@ *> Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -124,23 +122,10 @@ * *> \ingroup complex16HEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 09-29-06 - patch from -*> Bobby Cheng, MathWorks -*> -*> Replace l.210 and l.393 -*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN -*> by -*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN -*> -*> 01-01-96 - Based on modifications by -*> J. Lewis, Boeing Computer Services Company -*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**H, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -175,9 +160,25 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> \verbatim +*> 09-29-06 - patch from +*> Bobby Cheng, MathWorks +*> +*> Replace l.210 and l.393 +*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN +*> by +*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN *> +*> 01-01-96 - Based on modifications by +*> J. Lewis, Boeing Computer Services Company +*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +*> \endverbatim +* * ===================================================================== SUBROUTINE ZHETF2( UPLO, N, A, LDA, IPIV, INFO ) * diff --git a/SRC/zhetrd.f b/SRC/zhetrd.f index e2b1ae7..da010aa 100644 --- a/SRC/zhetrd.f +++ b/SRC/zhetrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRD reduces a complex Hermitian matrix A to real symmetric *> tridiagonal form T by a unitary similarity transformation: *> Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -131,10 +130,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 @@ -145,10 +143,9 @@ * *> \ingroup complex16HEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -190,7 +187,6 @@ *> *> where d and e denote diagonal and off-diagonal elements of T, and vi *> denotes an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhetrf.f b/SRC/zhetrf.f index 38c84d0..ae79ea7 100644 --- a/SRC/zhetrf.f +++ b/SRC/zhetrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRF computes the factorization of a complex Hermitian matrix A *> using the Bunch-Kaufman diagonal pivoting method. The form of the @@ -46,11 +46,10 @@ *> 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -122,10 +121,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup complex16HEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', then A = U*D*U**H, where @@ -175,7 +172,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhetri.f b/SRC/zhetri.f index d7e69fe..9d708e6 100644 --- a/SRC/zhetri.f +++ b/SRC/zhetri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRI( UPLO, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRI computes the inverse of a complex Hermitian indefinite matrix *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by *> ZHETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhetri2.f b/SRC/zhetri2.f index a79684e..bbc7371 100644 --- a/SRC/zhetri2.f +++ b/SRC/zhetri2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRI2 computes the inverse of a COMPLEX*16 hermitian indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> ZHETRF. ZHETRI2 set the LEADING DIMENSION of the workspace *> before calling ZHETRI2X that actually computes the inverse. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhetri2x.f b/SRC/zhetri2x.f index 789b88d..056df05 100644 --- a/SRC/zhetri2x.f +++ b/SRC/zhetri2x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), WORK( N+NB+1,* ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRI2X computes the inverse of a COMPLEX*16 Hermitian indefinite matrix *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by *> ZHETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhetrs.f b/SRC/zhetrs.f index cd110ef..2c45f86 100644 --- a/SRC/zhetrs.f +++ b/SRC/zhetrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRS solves a system of linear equations A*X = B with a complex *> Hermitian matrix A using the factorization A = U*D*U**H or *> A = L*D*L**H computed by ZHETRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/zhetrs2.f b/SRC/zhetrs2.f index 01ba7af..5bc4d27 100644 --- a/SRC/zhetrs2.f +++ b/SRC/zhetrs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHETRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, * WORK, INFO ) @@ -30,20 +30,19 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHETRS2 solves a system of linear equations A*X = B with a complex *> Hermitian matrix A using the factorization A = U*D*U**H or *> A = L*D*L**H computed by ZHETRF and converted by ZSYCONV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/SRC/zhfrk.f b/SRC/zhfrk.f index 2237521..9744530 100644 --- a/SRC/zhfrk.f +++ b/SRC/zhfrk.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, * C ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), C( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for C in RFP Format. *> @@ -49,11 +49,10 @@ *> where alpha and beta are real scalars, C is an n--by--n Hermitian *> matrix and A is an n--by--k matrix in the first case and a k--by--n *> matrix in the second case. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -152,10 +151,9 @@ *> parts of the diagonal elements need not be set, they are *> assumed to be zero, and on exit they are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhgeqz.f b/SRC/zhgeqz.f index 9630eda..bcec87c 100644 --- a/SRC/zhgeqz.f +++ b/SRC/zhgeqz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT, * ALPHA, BETA, Q, LDQ, Z, LDZ, WORK, LWORK, @@ -33,11 +33,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHGEQZ computes the eigenvalues of a complex matrix pair (H,T), *> where H is an upper Hessenberg matrix and T is upper triangular, @@ -81,11 +81,10 @@ *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix *> Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973), *> pp. 241--256. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -258,10 +257,9 @@ *> in Schur form, but ALPHA(i) and BETA(i), *> i=INFO-N+1,...,N should be correct. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -272,15 +270,13 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We assume that complex ABS works as long as its value is less than *> overflow. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhpcon.f b/SRC/zhpcon.f index 8c65b13..d4e6783 100644 --- a/SRC/zhpcon.f +++ b/SRC/zhpcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX*16 AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPCON estimates the reciprocal of the condition number of a complex *> Hermitian packed matrix A using the factorization A = U*D*U**H or @@ -42,11 +42,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/zhpev.f b/SRC/zhpev.f index 11cc330..38c9eec 100644 --- a/SRC/zhpev.f +++ b/SRC/zhpev.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, RWORK, * INFO ) @@ -30,19 +30,18 @@ * COMPLEX*16 AP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPEV computes all the eigenvalues and, optionally, eigenvectors of a *> complex Hermitian matrix in packed storage. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -122,10 +121,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhpevd.f b/SRC/zhpevd.f index 0b03554..319257b 100644 --- a/SRC/zhpevd.f +++ b/SRC/zhpevd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK, * RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPEVD computes all the eigenvalues and, optionally, eigenvectors of *> a complex Hermitian matrix A in packed storage. If eigenvectors are @@ -47,11 +47,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -185,10 +184,9 @@ *> off-diagonal elements of an intermediate tridiagonal *> form did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhpevx.f b/SRC/zhpevx.f index 0559079..7523271 100644 --- a/SRC/zhpevx.f +++ b/SRC/zhpevx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, WORK, RWORK, IWORK, @@ -33,21 +33,20 @@ * COMPLEX*16 AP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPEVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex Hermitian matrix A in packed storage. *> Eigenvalues/vectors can be selected by specifying either a range of *> values or a range of indices for the desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -216,10 +215,9 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge. *> Their indices are stored in array IFAIL. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhpgst.f b/SRC/zhpgst.f index 4164084..1b56378 100644 --- a/SRC/zhpgst.f +++ b/SRC/zhpgst.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPGST( ITYPE, UPLO, N, AP, BP, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AP( * ), BP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPGST reduces a complex Hermitian-definite generalized *> eigenproblem to standard form, using packed storage. @@ -44,11 +44,10 @@ *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. *> *> B must have been previously factorized as U**H*U or L*L**H by ZPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \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/SRC/zhpgv.f b/SRC/zhpgv.f index 67f8674..46e0e54 100644 --- a/SRC/zhpgv.f +++ b/SRC/zhpgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * RWORK, INFO ) @@ -30,22 +30,21 @@ * COMPLEX*16 AP( * ), BP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPGV computes all the eigenvalues and, optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form *> A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. *> Here A and B are assumed to be Hermitian, stored in packed format, *> and B is also positive definite. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -149,10 +148,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhpgvd.f b/SRC/zhpgvd.f index 76cf7d8..5abe0ed 100644 --- a/SRC/zhpgvd.f +++ b/SRC/zhpgvd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, * LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AP( * ), BP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPGVD computes all the eigenvalues and, optionally, the eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -50,11 +50,10 @@ *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or *> Cray-2. It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -210,10 +209,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -224,17 +222,11 @@ * *> \ingroup complex16OTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK, $ LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/zhpgvx.f b/SRC/zhpgvx.f index 42821bd..153d598 100644 --- a/SRC/zhpgvx.f +++ b/SRC/zhpgvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, * IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK, @@ -33,11 +33,11 @@ * COMPLEX*16 AP( * ), BP( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPGVX computes selected eigenvalues and, optionally, eigenvectors *> of a complex generalized Hermitian-definite eigenproblem, of the form @@ -46,11 +46,10 @@ *> positive definite. Eigenvalues and eigenvectors can be selected by *> specifying either a range of values or a range of indices for the *> desired eigenvalues. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ITYPE *> \verbatim @@ -246,10 +245,9 @@ *> The factorization of B could not be completed and *> no eigenvalues or eigenvectors were computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -260,17 +258,11 @@ * *> \ingroup complex16OTHEReigen * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU, $ IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK, diff --git a/SRC/zhprfs.f b/SRC/zhprfs.f index 214fc50..81edba3 100644 --- a/SRC/zhprfs.f +++ b/SRC/zhprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -32,21 +32,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian indefinite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,16 +155,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhpsv.f b/SRC/zhpsv.f index 2e6cc1b..569f3cd 100644 --- a/SRC/zhpsv.f +++ b/SRC/zhpsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPSV computes the solution to a complex system of linear equations *> A * X = B, @@ -47,11 +47,10 @@ *> triangular matrices, D is Hermitian and block diagonal with 1-by-1 *> and 2-by-2 diagonal blocks. The factored form of A is then used to *> solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, so the solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -160,7 +157,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhpsvx.f b/SRC/zhpsvx.f index 95b1ecb..a53b7f7 100644 --- a/SRC/zhpsvx.f +++ b/SRC/zhpsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, * LDX, RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPSVX uses the diagonal pivoting factorization A = U*D*U**H or *> A = L*D*L**H to compute the solution to a complex system of linear @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -72,11 +75,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -238,10 +240,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -252,10 +253,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -271,7 +271,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhptrd.f b/SRC/zhptrd.f index a7e5324..08011db 100644 --- a/SRC/zhptrd.f +++ b/SRC/zhptrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPTRD( UPLO, N, AP, D, E, TAU, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPTRD reduces a complex Hermitian matrix A stored in packed form to *> real symmetric tridiagonal form T by a unitary similarity *> transformation: Q**H * A * Q = T. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -104,10 +103,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 @@ -118,10 +116,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -149,7 +146,6 @@ *> where tau is a complex scalar, and v is a complex vector with *> v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP, *> overwriting A(i+2:n,i), and tau is stored in TAU(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhptrf.f b/SRC/zhptrf.f index 9700705..07c5a82 100644 --- a/SRC/zhptrf.f +++ b/SRC/zhptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPTRF( UPLO, N, AP, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPTRF computes the factorization of a complex Hermitian packed *> matrix A using the Bunch-Kaufman diagonal pivoting method: @@ -43,11 +43,10 @@ *> where U (or L) is a product of permutation and unit upper (lower) *> triangular matrices, and D is Hermitian and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -113,14 +111,10 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 5-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**H, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -155,9 +149,13 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== *> +*> J. Lewis, Boeing Computer Services Company +* * ===================================================================== SUBROUTINE ZHPTRF( UPLO, N, AP, IPIV, INFO ) * diff --git a/SRC/zhptri.f b/SRC/zhptri.f index 7cc6a13..7009e61 100644 --- a/SRC/zhptri.f +++ b/SRC/zhptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPTRI( UPLO, N, AP, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPTRI computes the inverse of a complex Hermitian indefinite matrix *> A in packed storage using the factorization A = U*D*U**H or *> A = L*D*L**H computed by ZHPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zhptrs.f b/SRC/zhptrs.f index d05c046..f7c2551 100644 --- a/SRC/zhptrs.f +++ b/SRC/zhptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHPTRS solves a system of linear equations A*X = B with a complex *> Hermitian matrix A stored in packed format using the factorization *> A = U*D*U**H or A = L*D*L**H computed by ZHPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,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/SRC/zhsein.f b/SRC/zhsein.f index cd74d72..d2f4f7b 100644 --- a/SRC/zhsein.f +++ b/SRC/zhsein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, W, VL, * LDVL, VR, LDVR, MM, M, WORK, RWORK, IFAILL, @@ -34,11 +34,11 @@ * $ W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHSEIN uses inverse iteration to find specified right and/or left *> eigenvectors of a complex upper Hessenberg matrix H. @@ -49,11 +49,10 @@ *> H * x = w * x, y**h * H = w * y**h *> *> where y**h denotes the conjugate transpose of the vector y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -217,10 +216,9 @@ *> failed to converge; see IFAILL and IFAILR for further *> details. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -231,16 +229,14 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x|+|y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zhseqr.f b/SRC/zhseqr.f index 00856d8..1cf8802 100644 --- a/SRC/zhseqr.f +++ b/SRC/zhseqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ, * WORK, LWORK, INFO ) @@ -28,13 +28,12 @@ * .. Array Arguments .. * COMPLEX*16 H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. -* Purpose -* ======= +* * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZHSEQR computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -45,11 +44,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -209,10 +207,9 @@ *> If INFO .GT. 0 and COMPZ = 'N', then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -223,6 +220,81 @@ * *> \ingroup complex16OTHERcomputational * +*> \par Contributors: +* ================== +*> +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim +*> +*> Default values supplied by +*> ILAENV(ISPEC,'ZHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). +*> It is suggested that these defaults be adjusted in order +*> to attain best performance in each particular +*> computational environment. +*> +*> ISPEC=12: The ZLAHQR vs ZLAQR0 crossover point. +*> Default: 75. (Must be at least 11.) +*> +*> ISPEC=13: Recommended deflation window size. +*> This depends on ILO, IHI and NS. NS is the +*> number of simultaneous shifts returned +*> by ILAENV(ISPEC=15). (See ISPEC=15 below.) +*> The default for (IHI-ILO+1).LE.500 is NS. +*> The default for (IHI-ILO+1).GT.500 is 3*NS/2. +*> +*> ISPEC=14: Nibble crossover point. (See IPARMQ for +*> details.) Default: 14% of deflation window +*> size. +*> +*> ISPEC=15: Number of simultaneous shifts in a multishift +*> QR iteration. +*> +*> If IHI-ILO+1 is ... +*> +*> greater than ...but less ... the +*> or equal to ... than default is +*> +*> 1 30 NS = 2(+) +*> 30 60 NS = 4(+) +*> 60 150 NS = 10(+) +*> 150 590 NS = ** +*> 590 3000 NS = 64 +*> 3000 6000 NS = 128 +*> 6000 infinity NS = 256 +*> +*> (+) By default some or all matrices of this order +*> are passed to the implicit double shift routine +*> ZLAHQR and this parameter is ignored. See +*> ISPEC=12 above and comments in IPARMQ for +*> details. +*> +*> (**) The asterisks (**) indicate an ad-hoc +*> function of N increasing from 10 to 64. +*> +*> ISPEC=16: Select structured matrix multiply. +*> If the number of simultaneous shifts (specified +*> by ISPEC=15) is less than 14, then the default +*> for ISPEC=16 is 0. Otherwise the default for +*> ISPEC=16 is 2. +*> \endverbatim +* +*> \par References: +* ================ +*> +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. +*> \n +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part II: Aggressive Early Deflation, SIAM Journal +*> of Matrix Analysis, volume 23, pages 948--973, 2002. +* * ===================================================================== SUBROUTINE ZHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ, $ WORK, LWORK, INFO ) @@ -239,75 +311,9 @@ * .. Array Arguments .. COMPLEX*16 H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. -* ================================================================ -* Default values supplied by -* ILAENV(ISPEC,'ZHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK). -* It is suggested that these defaults be adjusted in order -* to attain best performance in each particular -* computational environment. -* -* ISPEC=12: The ZLAHQR vs ZLAQR0 crossover point. -* Default: 75. (Must be at least 11.) -* -* ISPEC=13: Recommended deflation window size. -* This depends on ILO, IHI and NS. NS is the -* number of simultaneous shifts returned -* by ILAENV(ISPEC=15). (See ISPEC=15 below.) -* The default for (IHI-ILO+1).LE.500 is NS. -* The default for (IHI-ILO+1).GT.500 is 3*NS/2. -* -* ISPEC=14: Nibble crossover point. (See IPARMQ for -* details.) Default: 14% of deflation window -* size. -* -* ISPEC=15: Number of simultaneous shifts in a multishift -* QR iteration. -* -* If IHI-ILO+1 is ... -* -* greater than ...but less ... the -* or equal to ... than default is -* -* 1 30 NS = 2(+) -* 30 60 NS = 4(+) -* 60 150 NS = 10(+) -* 150 590 NS = ** -* 590 3000 NS = 64 -* 3000 6000 NS = 128 -* 6000 infinity NS = 256 -* -* (+) By default some or all matrices of this order -* are passed to the implicit double shift routine -* ZLAHQR and this parameter is ignored. See -* ISPEC=12 above and comments in IPARMQ for -* details. -* -* (**) The asterisks (**) indicate an ad-hoc -* function of N increasing from 10 to 64. -* -* ISPEC=16: Select structured matrix multiply. -* If the number of simultaneous shifts (specified -* by ISPEC=15) is less than 14, then the default -* for ISPEC=16 is 0. Otherwise the default for -* ISPEC=16 is 2. -* -* ================================================================ -* Based on contributions by -* Karen Braman and Ralph Byers, Department of Mathematics, -* University of Kansas, USA -* -* ================================================================ -* References: -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 -* Performance, SIAM Journal of Matrix Analysis, volume 23, pages -* 929--947, 2002. -* -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part II: Aggressive Early Deflation, SIAM Journal -* of Matrix Analysis, volume 23, pages 948--973, 2002. -* -* ================================================================ +* +* ===================================================================== +* * .. Parameters .. * * ==== Matrices of order NTINY or smaller must be processed by diff --git a/SRC/zla_gbamv.f b/SRC/zla_gbamv.f index 1b9fa77..974bd9f 100644 --- a/SRC/zla_gbamv.f +++ b/SRC/zla_gbamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X, * INCX, BETA, Y, INCY ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GBAMV performs one of the matrix-vector operations *> @@ -52,11 +52,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -170,10 +169,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gbrcond_c.f b/SRC/zla_gbrcond_c.f index ca28ce6..2857453 100644 --- a/SRC/zla_gbrcond_c.f +++ b/SRC/zla_gbrcond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_GBRCOND_C( TRANS, N, KL, KU, AB, * LDAB, AFB, LDAFB, IPIV, @@ -34,19 +34,18 @@ * DOUBLE PRECISION C( * ), RWORK( * ) * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GBRCOND_C Computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -145,10 +144,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gbrcond_x.f b/SRC/zla_gbrcond_x.f index f40fd19..3e013f5 100644 --- a/SRC/zla_gbrcond_x.f +++ b/SRC/zla_gbrcond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_GBRCOND_X( TRANS, N, KL, KU, AB, * LDAB, AFB, LDAFB, IPIV, @@ -33,19 +33,18 @@ * DOUBLE PRECISION RWORK( * ) * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GBRCOND_X Computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX*16 vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -138,10 +137,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gbrfsx_extended.f b/SRC/zla_gbrfsx_extended.f index 3df873a..c82f513 100644 --- a/SRC/zla_gbrfsx_extended.f +++ b/SRC/zla_gbrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, * NRHS, AB, LDAB, AFB, LDAFB, IPIV, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GBRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -391,10 +390,9 @@ *> < 0: if INFO = -i, the ith argument to ZGBTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gbrpvgrw.f b/SRC/zla_gbrpvgrw.f index 6fb77ca..ce17d2a 100644 --- a/SRC/zla_gbrpvgrw.f +++ b/SRC/zla_gbrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_GBRPVGRW( N, KL, KU, NCOLS, AB, * LDAB, AFB, LDAFB ) @@ -28,11 +28,11 @@ * COMPLEX*16 AB( LDAB, * ), AFB( LDAFB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GBRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +40,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -101,10 +100,9 @@ *> LDAFB is INTEGER *> The leading dimension of the array AFB. LDAFB >= 2*KL+KU+1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_geamv.f b/SRC/zla_geamv.f index cbf1516..b7ee5a1 100644 --- a/SRC/zla_geamv.f +++ b/SRC/zla_geamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA, * Y, INCY ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GEAMV performs one of the matrix-vector operations *> @@ -53,11 +53,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -159,10 +158,9 @@ *> *> Level 2 Blas routine. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gercond_c.f b/SRC/zla_gercond_c.f index 6850b54..c707ad2 100644 --- a/SRC/zla_gercond_c.f +++ b/SRC/zla_gercond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_GERCOND_C( TRANS, N, A, LDA, AF, * LDAF, IPIV, C, CAPPLY, @@ -33,19 +33,18 @@ * DOUBLE PRECISION C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GERCOND_C computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -126,10 +125,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gercond_x.f b/SRC/zla_gercond_x.f index f25c805..07a2bb9 100644 --- a/SRC/zla_gercond_x.f +++ b/SRC/zla_gercond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_GERCOND_X( TRANS, N, A, LDA, AF, * LDAF, IPIV, X, INFO, @@ -32,19 +32,18 @@ * DOUBLE PRECISION RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GERCOND_X computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX*16 vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -119,10 +118,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gerfsx_extended.f b/SRC/zla_gerfsx_extended.f index 1ca6dd3..01f1bd7 100644 --- a/SRC/zla_gerfsx_extended.f +++ b/SRC/zla_gerfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, * LDA, AF, LDAF, IPIV, COLEQU, C, B, @@ -40,11 +40,11 @@ * $ ERRS_N( NRHS, * ), ERRS_C( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_GERFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -55,11 +55,10 @@ *> and ERRS_C for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERRS_N and ERRS_C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -378,10 +377,9 @@ *> < 0: if INFO = -i, the ith argument to ZGETRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_gerpvgrw.f b/SRC/zla_gerpvgrw.f index 65d38c9..5ee1a6f 100644 --- a/SRC/zla_gerpvgrw.f +++ b/SRC/zla_gerpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_GERPVGRW( N, NCOLS, A, LDA, AF, * LDAF ) @@ -28,11 +28,12 @@ * COMPLEX*16 A( LDA, * ), AF( LDAF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> ZLA_GERPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -40,11 +41,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -83,10 +83,9 @@ *> LDAF is INTEGER *> The leading dimension of the array AF. LDAF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_heamv.f b/SRC/zla_heamv.f index 616c386..5805a67 100644 --- a/SRC/zla_heamv.f +++ b/SRC/zla_heamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_HEAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -30,11 +30,11 @@ * DOUBLE PRECISION Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_SYAMV performs the matrix-vector operation *> @@ -51,11 +51,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -146,10 +145,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -160,10 +158,9 @@ * *> \ingroup complex16HEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -175,7 +172,6 @@ *> Richard Hanson, Sandia National Labs. *> -- Modified for the absolute-value product, April 2006 *> Jason Riedy, UC Berkeley -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zla_hercond_c.f b/SRC/zla_hercond_c.f index e572790..ae7dbad 100644 --- a/SRC/zla_hercond_c.f +++ b/SRC/zla_hercond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_HERCOND_C( UPLO, N, A, LDA, AF, * LDAF, IPIV, C, CAPPLY, @@ -33,19 +33,18 @@ * DOUBLE PRECISION C ( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_HERCOND_C computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -123,10 +122,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_hercond_x.f b/SRC/zla_hercond_x.f index b317c2e..0cc6ce5 100644 --- a/SRC/zla_hercond_x.f +++ b/SRC/zla_hercond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_HERCOND_X( UPLO, N, A, LDA, AF, * LDAF, IPIV, X, INFO, @@ -32,19 +32,18 @@ * DOUBLE PRECISION RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_HERCOND_X computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX*16 vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -116,10 +115,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_herfsx_extended.f b/SRC/zla_herfsx_extended.f index bd075d9..d2f88ad 100644 --- a/SRC/zla_herfsx_extended.f +++ b/SRC/zla_herfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_HERFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, IPIV, COLEQU, C, B, LDB, @@ -42,11 +42,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_HERFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -57,11 +57,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -377,10 +376,9 @@ *> < 0: if INFO = -i, the ith argument to ZHETRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_herpvgrw.f b/SRC/zla_herpvgrw.f index 65a6739..915e34d 100644 --- a/SRC/zla_herpvgrw.f +++ b/SRC/zla_herpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_HERPVGRW( UPLO, N, INFO, A, LDA, AF, * LDAF, IPIV, WORK ) @@ -31,11 +31,12 @@ * DOUBLE PRECISION WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> ZLA_HERPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -43,11 +44,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +106,9 @@ *> \verbatim *> WORK is COMPLEX*16 array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_lin_berr.f b/SRC/zla_lin_berr.f index dbeddca..e4414aa 100644 --- a/SRC/zla_lin_berr.f +++ b/SRC/zla_lin_berr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR ) * @@ -28,22 +28,21 @@ * COMPLEX*16 RES( N, NRHS ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_LIN_BERR computes componentwise relative backward error from *> the formula *> max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) ) *> where abs(Z) is the componentwise absolute value of the matrix *> or vector Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> BERR is COMPLEX*16 array, dimension (NRHS) *> The componentwise relative backward error from the formula above. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_porcond_c.f b/SRC/zla_porcond_c.f index 2338a9e..43fa1fb 100644 --- a/SRC/zla_porcond_c.f +++ b/SRC/zla_porcond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_PORCOND_C( UPLO, N, A, LDA, AF, * LDAF, C, CAPPLY, INFO, @@ -32,19 +32,18 @@ * DOUBLE PRECISION C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_PORCOND_C Computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_porcond_x.f b/SRC/zla_porcond_x.f index 7cc0973..fac935a 100644 --- a/SRC/zla_porcond_x.f +++ b/SRC/zla_porcond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_PORCOND_X( UPLO, N, A, LDA, AF, * LDAF, X, INFO, WORK, @@ -31,19 +31,18 @@ * DOUBLE PRECISION RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_PORCOND_X Computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX*16 vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_porfsx_extended.f b/SRC/zla_porfsx_extended.f index 53eaefc..e13e64f 100644 --- a/SRC/zla_porfsx_extended.f +++ b/SRC/zla_porfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, COLEQU, C, B, LDB, Y, @@ -41,11 +41,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_PORFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -56,11 +56,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -369,10 +368,9 @@ *> < 0: if INFO = -i, the ith argument to ZPOTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_porpvgrw.f b/SRC/zla_porpvgrw.f index e72f1d4..56a8cd2 100644 --- a/SRC/zla_porpvgrw.f +++ b/SRC/zla_porpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, * LDAF, WORK ) @@ -30,11 +30,12 @@ * DOUBLE PRECISION WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> ZLA_PORPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -42,11 +43,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -90,10 +90,9 @@ *> \verbatim *> WORK is COMPLEX*16 array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_syamv.f b/SRC/zla_syamv.f index 3d1e691..66ae39f 100644 --- a/SRC/zla_syamv.f +++ b/SRC/zla_syamv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, * INCY ) @@ -31,11 +31,11 @@ * DOUBLE PRECISION Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_SYAMV performs the matrix-vector operation *> @@ -52,11 +52,10 @@ *> "symbolically" zero components are not perturbed. A zero *> entry is considered "symbolic" if all multiplications involved *> in computing that entry have at least one zero multiplicand. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -147,10 +146,9 @@ *> Y. INCY must not be zero. *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -161,10 +159,9 @@ * *> \ingroup complex16SYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Level 2 Blas routine. @@ -176,7 +173,6 @@ *> Richard Hanson, Sandia National Labs. *> -- Modified for the absolute-value product, April 2006 *> Jason Riedy, UC Berkeley -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zla_syrcond_c.f b/SRC/zla_syrcond_c.f index 3970450..1d553ea 100644 --- a/SRC/zla_syrcond_c.f +++ b/SRC/zla_syrcond_c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_SYRCOND_C( UPLO, N, A, LDA, AF, * LDAF, IPIV, C, CAPPLY, @@ -33,19 +33,18 @@ * DOUBLE PRECISION C( * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_SYRCOND_C Computes the infinity norm condition number of *> op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -123,10 +122,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_syrcond_x.f b/SRC/zla_syrcond_x.f index 3ada961..8d86dd2 100644 --- a/SRC/zla_syrcond_x.f +++ b/SRC/zla_syrcond_x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_SYRCOND_X( UPLO, N, A, LDA, AF, * LDAF, IPIV, X, INFO, @@ -32,19 +32,18 @@ * DOUBLE PRECISION RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_SYRCOND_X Computes the infinity norm condition number of *> op(A) * diag(X) where X is a COMPLEX*16 vector. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -116,10 +115,9 @@ *> RWORK is DOUBLE PRECISION array, dimension (N). *> Workspace. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_syrfsx_extended.f b/SRC/zla_syrfsx_extended.f index ae0c7ae..4e6079a 100644 --- a/SRC/zla_syrfsx_extended.f +++ b/SRC/zla_syrfsx_extended.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, * AF, LDAF, IPIV, COLEQU, C, B, LDB, @@ -42,11 +42,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_SYRFSX_EXTENDED improves the computed solution to a system of *> linear equations by performing extra-precise iterative refinement @@ -57,11 +57,10 @@ *> and ERR_BNDS_COMP for details of the error bounds. Note that this *> subroutine is only resonsible for setting the second fields of *> ERR_BNDS_NORM and ERR_BNDS_COMP. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] PREC_TYPE *> \verbatim @@ -377,10 +376,9 @@ *> < 0: if INFO = -i, the ith argument to ZSYTRS had an illegal *> value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_syrpvgrw.f b/SRC/zla_syrpvgrw.f index f918c91..fa39301 100644 --- a/SRC/zla_syrpvgrw.f +++ b/SRC/zla_syrpvgrw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF, * LDAF, IPIV, WORK ) @@ -31,11 +31,12 @@ * INTEGER IPIV( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim +*> *> *> ZLA_SYRPVGRW computes the reciprocal pivot growth factor *> norm(A)/norm(U). The "max absolute element" norm is used. If this is @@ -43,11 +44,10 @@ *> (equilibrated) matrix A could be poor. This also means that the *> solution X, estimated condition numbers, and error bounds could be *> unreliable. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +106,9 @@ *> \verbatim *> WORK is COMPLEX*16 array, dimension (2*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zla_wwaddw.f b/SRC/zla_wwaddw.f index f1483cc..4b04b73 100644 --- a/SRC/zla_wwaddw.f +++ b/SRC/zla_wwaddw.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLA_WWADDW( N, X, Y, W ) * @@ -27,23 +27,20 @@ * COMPLEX*16 X( * ), Y( * ), W( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLA_WWADDW adds a vector W into a doubled-single vector (X, Y). *> *> This works for all extant IBM's hex and binary floating point *> arithmetics, but not for decimal. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -68,10 +65,9 @@ *> W is COMPLEX*16 array, dimension (N) *> The vector to be added. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlabrd.f b/SRC/zlabrd.f index 7d25830..a5af6ff 100644 --- a/SRC/zlabrd.f +++ b/SRC/zlabrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, * LDY ) @@ -30,11 +30,11 @@ * $ Y( LDY, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLABRD reduces the first NB rows and columns of a complex general *> m by n matrix A to upper or lower real bidiagonal form by a unitary @@ -45,11 +45,10 @@ *> bidiagonal form. *> *> This is an auxiliary routine called by ZGEBRD -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -149,10 +148,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -163,10 +161,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrices Q and P are represented as products of elementary @@ -209,7 +206,6 @@ *> where a denotes an element of the original matrix which is unchanged, *> vi denotes an element of the vector defining H(i), and ui an element *> of the vector defining G(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlacgv.f b/SRC/zlacgv.f index 72530fe..c334ff4 100644 --- a/SRC/zlacgv.f +++ b/SRC/zlacgv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACGV( N, X, INCX ) * @@ -27,18 +27,17 @@ * COMPLEX*16 X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= *> -*> ZLACGV conjugates a complex vector of length N. +*> \verbatim *> -*>\endverbatim +*> ZLACGV conjugates a complex vector of length N. +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -59,10 +58,9 @@ *> INCX is INTEGER *> The spacing between successive elements of X. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlacn2.f b/SRC/zlacn2.f index f0de9ad..dbcd777 100644 --- a/SRC/zlacn2.f +++ b/SRC/zlacn2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE ) * @@ -29,19 +29,18 @@ * COMPLEX*16 V( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLACN2 estimates the 1-norm of a square, complex matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -88,10 +87,9 @@ *> ISAVE is INTEGER array, dimension (3) *> ISAVE is used to save variables between calls to ZLACN2 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -102,19 +100,13 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> -*> Contributed by Nick Higham, University of Manchester. *> Originally named CONEST, dated March 16, 1988. *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of -*> a real or complex matrix, with applications to condition estimation", -*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. -*> *> Last modified: April, 1999 *> *> This is a thread safe version of ZLACON, which uses the array ISAVE @@ -124,8 +116,19 @@ *> JUMP ISAVE(1) *> J ISAVE(2) *> ITER ISAVE(3) -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> Nick Higham, University of Manchester +* +*> \par References: +* ================ +*> +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> a real or complex matrix, with applications to condition estimation", +*> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> * ===================================================================== SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE ) diff --git a/SRC/zlacon.f b/SRC/zlacon.f index de54877..da6f13c 100644 --- a/SRC/zlacon.f +++ b/SRC/zlacon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACON( N, V, X, EST, KASE ) * @@ -28,19 +28,18 @@ * COMPLEX*16 V( N ), X( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLACON estimates the 1-norm of a square, complex matrix A. *> Reverse communication is used for evaluating matrix-vector products. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -81,10 +80,9 @@ *> whether X should be overwritten by A * X or A**H * X. *> On the final return from ZLACON, KASE will again be 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -95,23 +93,24 @@ * *> \ingroup complex16OTHERauxiliary * +*> \par Further Details: +* ===================== +*> +*> Originally named CONEST, dated March 16, 1988. \n +*> Last modified: April, 1999 * -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Contributed by Nick Higham, University of Manchester. -*> Originally named CONEST, dated March 16, 1988. +*> Nick Higham, University of Manchester +* +*> \par References: +* ================ *> -*> Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of +*> N.J. Higham, "FORTRAN codes for estimating the one-norm of *> a real or complex matrix, with applications to condition estimation", *> ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. *> -*> Last modified: April, 1999 -*> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZLACON( N, V, X, EST, KASE ) * diff --git a/SRC/zlacp2.f b/SRC/zlacp2.f index 00778eb..8433e5d 100644 --- a/SRC/zlacp2.f +++ b/SRC/zlacp2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACP2( UPLO, M, N, A, LDA, B, LDB ) * @@ -29,19 +29,18 @@ * COMPLEX*16 B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLACP2 copies all or part of a real two-dimensional matrix A to a *> complex matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlacpy.f b/SRC/zlacpy.f index 9ce0920..9218ee3 100644 --- a/SRC/zlacpy.f +++ b/SRC/zlacpy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACPY( UPLO, M, N, A, LDA, B, LDB ) * @@ -28,19 +28,18 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLACPY copies all or part of a two-dimensional matrix A to another *> matrix B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -88,10 +87,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlacrm.f b/SRC/zlacrm.f index c06abf1..577db9b 100644 --- a/SRC/zlacrm.f +++ b/SRC/zlacrm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACRM( M, N, A, LDA, B, LDB, C, LDC, RWORK ) * @@ -28,21 +28,20 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLACRM performs a very simple matrix-matrix multiplication: *> C := A * B, *> where A is M by N and complex; B is N by N and real; *> C is M by N and complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> \verbatim *> RWORK is DOUBLE PRECISION array, dimension (2*M*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlacrt.f b/SRC/zlacrt.f index 8bc43b4..0e66d8e 100644 --- a/SRC/zlacrt.f +++ b/SRC/zlacrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLACRT( N, CX, INCX, CY, INCY, C, S ) * @@ -28,11 +28,11 @@ * COMPLEX*16 CX( * ), CY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLACRT performs the operation *> @@ -40,11 +40,10 @@ *> ( -s c )( y ) ( y ) *> *> where c and s are complex and the vectors x and y are complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> [ C S ]. *> [ -S C ] *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zladiv.f b/SRC/zladiv.f index 9a6ea94..56f57b1 100644 --- a/SRC/zladiv.f +++ b/SRC/zladiv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * COMPLEX*16 FUNCTION ZLADIV( X, Y ) * @@ -24,20 +24,19 @@ * COMPLEX*16 X, Y * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLADIV := X / Y, where X and Y are complex. The computation of X / Y *> will not overflow on an intermediary step unless the results *> overflows. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] X *> \verbatim @@ -49,10 +48,9 @@ *> Y is COMPLEX*16 *> The complex scalars X and Y. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaed0.f b/SRC/zlaed0.f index 68a86b3..09b73d2 100644 --- a/SRC/zlaed0.f +++ b/SRC/zlaed0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAED0( QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, RWORK, * IWORK, INFO ) @@ -30,21 +30,20 @@ * COMPLEX*16 Q( LDQ, * ), QSTORE( LDQS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Using the divide and conquer method, ZLAED0 computes all eigenvalues *> of a symmetric tridiagonal matrix which is one diagonal block of *> those from reducing a dense or band Hermitian matrix and *> corresponding eigenvectors of the dense or band matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] QSIZ *> \verbatim @@ -129,10 +128,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaed7.f b/SRC/zlaed7.f index f889194..fd160c9 100644 --- a/SRC/zlaed7.f +++ b/SRC/zlaed7.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, * LDQ, RHO, INDXQ, QSTORE, QPTR, PRMPTR, PERM, @@ -35,11 +35,11 @@ * COMPLEX*16 Q( LDQ, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAED7 computes the updated eigensystem of a diagonal *> matrix after modification by a rank-one symmetric matrix. This @@ -71,11 +71,10 @@ *> directly using the updated eigenvalues. The eigenvectors for *> the current problem are multiplied with the eigenvectors from *> the overall problem. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -231,10 +230,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = 1, an eigenvalue did not converge *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaed8.f b/SRC/zlaed8.f index 6afb698..1b4056e 100644 --- a/SRC/zlaed8.f +++ b/SRC/zlaed8.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAED8( K, N, QSIZ, Q, LDQ, D, RHO, CUTPNT, Z, DLAMDA, * Q2, LDQ2, W, INDXP, INDX, INDXQ, PERM, GIVPTR, @@ -34,11 +34,11 @@ * COMPLEX*16 Q( LDQ, * ), Q2( LDQ2, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAED8 merges the two sets of eigenvalues together into a single *> sorted set. Then it tries to deflate the size of the problem. @@ -46,11 +46,10 @@ *> eigenvalues are close together or if there is a tiny element in the *> Z vector. For each such occurrence the order of the related secular *> equation problem is reduced by one. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[out] K *> \verbatim @@ -211,10 +210,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/SRC/zlaein.f b/SRC/zlaein.f index a300b27..1fd9118 100644 --- a/SRC/zlaein.f +++ b/SRC/zlaein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAEIN( RIGHTV, NOINIT, N, H, LDH, W, V, B, LDB, RWORK, * EPS3, SMLNUM, INFO ) @@ -32,20 +32,19 @@ * COMPLEX*16 B( LDB, * ), H( LDH, * ), V( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAEIN uses inverse iteration to find a right or left eigenvector *> corresponding to the eigenvalue W of a complex upper Hessenberg *> matrix H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] RIGHTV *> \verbatim @@ -133,10 +132,9 @@ *> = 1: inverse iteration did not converge; V is set to the *> last iterate. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaesy.f b/SRC/zlaesy.f index b29491e..0d7bdf0 100644 --- a/SRC/zlaesy.f +++ b/SRC/zlaesy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAESY( A, B, C, RT1, RT2, EVSCAL, CS1, SN1 ) * @@ -24,11 +24,11 @@ * COMPLEX*16 A, B, C, CS1, EVSCAL, RT1, RT2, SN1 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAESY computes the eigendecomposition of a 2-by-2 symmetric matrix *> ( ( A, B );( B, C ) ) @@ -41,11 +41,10 @@ *> *> [ CS1 SN1 ] . [ A B ] . [ CS1 -SN1 ] = [ RT1 0 ] *> [ -SN1 CS1 ] [ B C ] [ SN1 CS1 ] [ 0 RT2 ] -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -100,10 +99,9 @@ *> If EVSCAL .NE. 0, ( CS1, SN1 ) is the unit right eigenvector *> for RT1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaev2.f b/SRC/zlaev2.f index e8f0b14..dc2e70c 100644 --- a/SRC/zlaev2.f +++ b/SRC/zlaev2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAEV2( A, B, C, RT1, RT2, CS1, SN1 ) * @@ -25,11 +25,11 @@ * COMPLEX*16 A, B, C, SN1 * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAEV2 computes the eigendecomposition of a 2-by-2 Hermitian matrix *> [ A B ] @@ -40,11 +40,10 @@ *> *> [ CS1 CONJG(SN1) ] [ A B ] [ CS1 -CONJG(SN1) ] = [ RT1 0 ] *> [-SN1 CS1 ] [ CONJG(B) C ] [ SN1 CS1 ] [ 0 RT2 ]. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] A *> \verbatim @@ -87,10 +86,9 @@ *> SN1 is COMPLEX*16 *> The vector (CS1, SN1) is a unit right eigenvector for RT1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -101,10 +99,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> RT1 is accurate to a few ulps barring over/underflow. @@ -119,7 +116,6 @@ *> Overflow is possible only if RT1 is within a factor of 5 of overflow. *> Underflow is harmless if the input data is 0 or exceeds *> underflow_threshold / macheps. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlag2c.f b/SRC/zlag2c.f index c40e4de..f0e50fe 100644 --- a/SRC/zlag2c.f +++ b/SRC/zlag2c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAG2C( M, N, A, LDA, SA, LDSA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAG2C converts a COMPLEX*16 matrix, SA, to a COMPLEX matrix, A. *> @@ -41,11 +41,10 @@ *> RMAX. If not the convertion is aborted and a flag is raised. *> *> This is an auxiliary routine so there is no argument checking. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -92,10 +91,9 @@ *> PRECISION overflow threshold, in this case, the content *> of SA in exit is unspecified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlags2.f b/SRC/zlags2.f index 4c49c56..2c477e0 100644 --- a/SRC/zlags2.f +++ b/SRC/zlags2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV, * SNV, CSQ, SNQ ) @@ -27,11 +27,11 @@ * COMPLEX*16 A2, B2, SNQ, SNU, SNV * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAGS2 computes 2-by-2 unitary matrices U, V and Q, such *> that if ( UPPER ) then @@ -63,11 +63,10 @@ *> then the transformed (2,2) element of B is not zero, except when the *> first rows of input A and B are parallel and the second rows are *> zero. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPPER *> \verbatim @@ -142,10 +141,9 @@ *> SNQ is COMPLEX*16 *> The desired unitary matrix Q. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlagtm.f b/SRC/zlagtm.f index 6b8e85e..e4833b3 100644 --- a/SRC/zlagtm.f +++ b/SRC/zlagtm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA, * B, LDB ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAGTM performs a matrix-vector product of the form *> @@ -44,11 +44,10 @@ *> where A is a tridiagonal matrix of order N, B and X are N by NRHS *> matrices, and alpha and beta are real scalars, each of which may be *> 0., 1., or -1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -129,10 +128,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/SRC/zlahef.f b/SRC/zlahef.f index 04650bd..1fad493 100644 --- a/SRC/zlahef.f +++ b/SRC/zlahef.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAHEF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAHEF computes a partial factorization of a complex Hermitian *> matrix A using the Bunch-Kaufman diagonal pivoting method. The @@ -52,11 +52,10 @@ *> ZLAHEF is an auxiliary routine called by ZHETRF. It uses blocked code *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or *> A22 (if UPLO = 'L'). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -142,10 +141,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlahqr.f b/SRC/zlahqr.f index 4c955ce..79fc06e 100644 --- a/SRC/zlahqr.f +++ b/SRC/zlahqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, * IHIZ, Z, LDZ, INFO ) @@ -29,21 +29,20 @@ * COMPLEX*16 H( LDH, * ), W( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAHQR is an auxiliary routine called by CHSEQR to update the *> eigenvalues and Schur decomposition already computed by CHSEQR, by *> dealing with the Hessenberg submatrix in rows and columns ILO to *> IHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -163,10 +162,9 @@ *> where U is the orthogonal matrix in (*) *> (regardless of the value of WANTT.) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -177,10 +175,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Contributors: +* ================== +*> *> \verbatim *> *> 02-96 Based on modifications by @@ -192,7 +189,6 @@ *> It is (1) more robust against overflow and underflow and *> (2) adopts the more conservative Ahues & Tisseur stopping *> criterion (LAWN 122, 1997). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlahr2.f b/SRC/zlahr2.f index 12f7c62..da371b5 100644 --- a/SRC/zlahr2.f +++ b/SRC/zlahr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAHR2 reduces the first NB columns of A complex general n-BY-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -41,11 +41,10 @@ *> Q as a block reflector I - V*T*V**H, and also the matrix Y = A * V * T. *> *> This is an auxiliary routine called by ZGEHRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -115,10 +114,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -129,10 +127,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -172,16 +169,15 @@ *> Gejin. Note that the entries of A(1:K,2:NB) differ from those *> returned by the original LAPACK-3.0's DLAHRD routine. (This *> subroutine is not backward compatible with LAPACK-3.0's DLAHRD.) -*> -*> References -*> ========== +*> \endverbatim +* +*> \par References: +* ================ *> *> Gregorio Quintana-Orti and Robert van de Geijn, "Improving the *> performance of reduction to Hessenberg form," ACM Transactions on *> Mathematical Software, 32(2):180-194, June 2006. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * diff --git a/SRC/zlahrd.f b/SRC/zlahrd.f index d3781b9..9b375b3 100644 --- a/SRC/zlahrd.f +++ b/SRC/zlahrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * @@ -28,11 +28,11 @@ * $ Y( LDY, NB ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAHRD reduces the first NB columns of a complex general n-by-(n-k+1) *> matrix A so that elements below the k-th subdiagonal are zero. The @@ -43,11 +43,10 @@ *> This is an OBSOLETE auxiliary routine. *> This routine will be 'deprecated' in a future release. *> Please use the new routine ZLAHR2 instead. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -116,10 +115,9 @@ *> LDY is INTEGER *> The leading dimension of the array Y. LDY >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -130,10 +128,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix Q is represented as a product of nb elementary reflectors @@ -167,7 +164,6 @@ *> where a denotes an element of the original matrix A, h denotes a *> modified element of the upper Hessenberg matrix H, and vi denotes an *> element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlaic1.f b/SRC/zlaic1.f index 0e7480c..204e1bf 100644 --- a/SRC/zlaic1.f +++ b/SRC/zlaic1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C ) * @@ -29,11 +29,11 @@ * COMPLEX*16 W( J ), X( J ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAIC1 applies one step of incremental condition estimation in *> its simplest version: @@ -60,11 +60,10 @@ *> [ conjg(gamma) ] *> *> where alpha = x**H * w. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -120,10 +119,9 @@ *> C is COMPLEX*16 *> Cosine needed in forming xhat. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlals0.f b/SRC/zlals0.f index c7a6881..c99d1cf 100644 --- a/SRC/zlals0.f +++ b/SRC/zlals0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, * PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, @@ -35,11 +35,11 @@ * COMPLEX*16 B( LDB, * ), BX( LDBX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLALS0 applies back the multiplying factors of either the left or the *> right singular vector matrix of a diagonal matrix appended by a row @@ -70,11 +70,10 @@ *> (3R) The inverse transformation of (2L). *> *> (4R) The inverse transformation of (1L). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -246,10 +245,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 @@ -260,19 +258,13 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE ZLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX, $ PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM, diff --git a/SRC/zlalsa.f b/SRC/zlalsa.f index 2477c1e..93d4a6a 100644 --- a/SRC/zlalsa.f +++ b/SRC/zlalsa.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, * LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, @@ -36,11 +36,11 @@ * COMPLEX*16 B( LDB, * ), BX( LDBX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLALSA is an itermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The @@ -52,11 +52,10 @@ *> ICOMPQ = 1, ZLALSA applies the right singular vector matrix to the *> right hand side. The singular vector matrices were generated in *> compact form by ZLALSA. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] ICOMPQ *> \verbatim @@ -243,10 +242,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 @@ -257,19 +255,13 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE ZLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U, $ LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR, diff --git a/SRC/zlalsd.f b/SRC/zlalsd.f index de47186..a4d4e4f 100644 --- a/SRC/zlalsd.f +++ b/SRC/zlalsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, * RANK, WORK, RWORK, IWORK, INFO ) @@ -32,11 +32,11 @@ * COMPLEX*16 B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLALSD uses the singular value decomposition of A to solve the least *> squares problem of finding X to minimize the Euclidean norm of each @@ -54,11 +54,10 @@ *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,10 +164,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through MOD(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -179,19 +177,13 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Ming Gu and Ren-Cang Li, Computer Science Division, University of -*> California at Berkeley, USA -*> Osni Marques, LBNL/NERSC, USA -*> -*> \endverbatim -*> +*> California at Berkeley, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE ZLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND, $ RANK, WORK, RWORK, IWORK, INFO ) diff --git a/SRC/zlangb.f b/SRC/zlangb.f index 9961ac3..0d0ecd8 100644 --- a/SRC/zlangb.f +++ b/SRC/zlangb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANGB( NORM, N, KL, KU, AB, LDAB, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANGB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n band matrix A, with kl sub-diagonals and ku super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANGB returns the value +*> \return ZLANGB +*> \verbatim *> *> ZLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -110,10 +108,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlange.f b/SRC/zlange.f index bd58749..ab78224 100644 --- a/SRC/zlange.f +++ b/SRC/zlange.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANGE( NORM, M, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANGE returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANGE returns the value +*> \return ZLANGE +*> \verbatim *> *> ZLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -101,10 +99,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlangt.f b/SRC/zlangt.f index cb97201..82767d7 100644 --- a/SRC/zlangt.f +++ b/SRC/zlangt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANGT( NORM, N, DL, D, DU ) * @@ -28,20 +28,19 @@ * COMPLEX*16 D( * ), DL( * ), DU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANGT returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANGT returns the value +*> \return ZLANGT +*> \verbatim *> *> ZLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -55,11 +54,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -92,10 +90,9 @@ *> DU is COMPLEX*16 array, dimension (N-1) *> The (n-1) super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlanhb.f b/SRC/zlanhb.f index f051298..5bce9f8 100644 --- a/SRC/zlanhb.f +++ b/SRC/zlanhb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANHB( NORM, UPLO, N, K, AB, LDAB, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANHB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n hermitian band matrix A, with k super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANHB returns the value +*> \return ZLANHB +*> \verbatim *> *> ZLANHB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -117,10 +115,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlanhe.f b/SRC/zlanhe.f index f5769de..8133355 100644 --- a/SRC/zlanhe.f +++ b/SRC/zlanhe.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANHE( NORM, UPLO, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANHE returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex hermitian matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANHE returns the value +*> \return ZLANHE +*> \verbatim *> *> ZLANHE = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -110,10 +108,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlanhf.f b/SRC/zlanhf.f index 7e9e136..0544781 100644 --- a/SRC/zlanhf.f +++ b/SRC/zlanhf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANHF( NORM, TRANSR, UPLO, N, A, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANHF returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex Hermitian matrix A in RFP format. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANHF returns the value +*> \return ZLANHF +*> \verbatim *> *> ZLANHF = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -124,10 +122,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +135,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -245,7 +241,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlanhp.f b/SRC/zlanhp.f index 50ff9cc..37d366b 100644 --- a/SRC/zlanhp.f +++ b/SRC/zlanhp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANHP( NORM, UPLO, N, AP, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANHP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex hermitian matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANHP returns the value +*> \return ZLANHP +*> \verbatim *> *> ZLANHP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -103,10 +101,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlanhs.f b/SRC/zlanhs.f index 3023546..7892783 100644 --- a/SRC/zlanhs.f +++ b/SRC/zlanhs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANHS( NORM, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANHS returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> Hessenberg matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANHS returns the value +*> \return ZLANHS +*> \verbatim *> *> ZLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -95,10 +93,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlanht.f b/SRC/zlanht.f index 3d3820a..dbaf479 100644 --- a/SRC/zlanht.f +++ b/SRC/zlanht.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANHT( NORM, N, D, E ) * @@ -29,20 +29,19 @@ * COMPLEX*16 E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANHT returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex Hermitian tridiagonal matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANHT returns the value +*> \return ZLANHT +*> \verbatim *> *> ZLANHT = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -87,10 +85,9 @@ *> E is COMPLEX*16 array, dimension (N-1) *> The (n-1) sub-diagonal or super-diagonal elements of A. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlansb.f b/SRC/zlansb.f index c50d3a3..dcc5ccb 100644 --- a/SRC/zlansb.f +++ b/SRC/zlansb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANSB( NORM, UPLO, N, K, AB, LDAB, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANSB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n symmetric band matrix A, with k super-diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANSB returns the value +*> \return ZLANSB +*> \verbatim *> *> ZLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -115,10 +113,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlansp.f b/SRC/zlansp.f index 5d596f2..d70288d 100644 --- a/SRC/zlansp.f +++ b/SRC/zlansp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANSP( NORM, UPLO, N, AP, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANSP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex symmetric matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANSP returns the value +*> \return ZLANSP +*> \verbatim *> *> ZLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -101,10 +99,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlansy.f b/SRC/zlansy.f index 2ded1ef..b03f020 100644 --- a/SRC/zlansy.f +++ b/SRC/zlansy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANSY( NORM, UPLO, N, A, LDA, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANSY returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> complex symmetric matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANSY returns the value +*> \return ZLANSY +*> \verbatim *> *> ZLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -109,10 +107,9 @@ *> where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise, *> WORK is not referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlantb.f b/SRC/zlantb.f index c8203ad..899b00a 100644 --- a/SRC/zlantb.f +++ b/SRC/zlantb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANTB( NORM, UPLO, DIAG, N, K, AB, * LDAB, WORK ) @@ -30,20 +30,19 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANTB returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of an *> n by n triangular band matrix A, with ( k + 1 ) diagonals. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANTB returns the value +*> \return ZLANTB +*> \verbatim *> *> ZLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -126,10 +124,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlantp.f b/SRC/zlantp.f index c2b25bc..e2167f9 100644 --- a/SRC/zlantp.f +++ b/SRC/zlantp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANTP( NORM, UPLO, DIAG, N, AP, WORK ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANTP returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> triangular matrix A, supplied in packed form. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANTP returns the value +*> \return ZLANTP +*> \verbatim *> *> ZLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -56,11 +55,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -111,10 +109,9 @@ *> where LWORK >= N when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlantr.f b/SRC/zlantr.f index c5840c6..ca65ee3 100644 --- a/SRC/zlantr.f +++ b/SRC/zlantr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * DOUBLE PRECISION FUNCTION ZLANTR( NORM, UPLO, DIAG, M, N, A, LDA, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLANTR returns the value of the one norm, or the Frobenius norm, or *> the infinity norm, or the element of largest absolute value of a *> trapezoidal or triangular matrix A. +*> \endverbatim *> -*> Description -*> =========== -*> -*> ZLANTR returns the value +*> \return ZLANTR +*> \verbatim *> *> ZLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm' *> ( @@ -57,11 +56,10 @@ *> normI denotes the infinity norm of a matrix (maximum row sum) and *> normF denotes the Frobenius norm of a matrix (square root of sum of *> squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -127,10 +125,9 @@ *> where LWORK >= M when NORM = 'I'; otherwise, WORK is not *> referenced. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlapll.f b/SRC/zlapll.f index 4a04fc0..47a489d 100644 --- a/SRC/zlapll.f +++ b/SRC/zlapll.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAPLL( N, X, INCX, Y, INCY, SSMIN ) * @@ -28,11 +28,11 @@ * COMPLEX*16 X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given two column vectors X and Y, let *> @@ -42,11 +42,10 @@ *> and then computes the SVD of the 2-by-2 upper triangular matrix R. *> The smaller singular value of R is returned in SSMIN, which is used *> as the measurement of the linear dependency of the vectors X and Y. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -85,10 +84,9 @@ *> SSMIN is DOUBLE PRECISION *> The smallest singular value of the N-by-2 matrix A = ( X Y ). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlapmr.f b/SRC/zlapmr.f index 9078b06..7ce3e89 100644 --- a/SRC/zlapmr.f +++ b/SRC/zlapmr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAPMR( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * COMPLEX*16 X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAPMR rearranges the rows of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(I,*) is moved to X(K(I),*) for I = 1,2,...,M. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlapmt.f b/SRC/zlapmt.f index e1bf40d..5b9c8a2 100644 --- a/SRC/zlapmt.f +++ b/SRC/zlapmt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAPMT( FORWRD, M, N, X, LDX, K ) * @@ -29,11 +29,11 @@ * COMPLEX*16 X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAPMT rearranges the columns of the M by N matrix X as specified *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N. @@ -44,11 +44,10 @@ *> If FORWRD = .FALSE., backward permutation: *> *> X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FORWRD *> \verbatim @@ -89,10 +88,9 @@ *> internal workspace, but reset to its original value on *> output. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqgb.f b/SRC/zlaqgb.f index 927ec89..635f7b0 100644 --- a/SRC/zlaqgb.f +++ b/SRC/zlaqgb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND, * AMAX, EQUED ) @@ -31,20 +31,19 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQGB equilibrates a general M by N band matrix A with KL *> subdiagonals and KU superdiagonals using the row and scaling factors *> in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -129,10 +128,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -142,10 +143,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqge.f b/SRC/zlaqge.f index 857b088..6f4452b 100644 --- a/SRC/zlaqge.f +++ b/SRC/zlaqge.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, * EQUED ) @@ -31,19 +31,18 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQGE equilibrates a general M by N matrix A using the row and *> column scaling factors in the vectors R and C. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,12 @@ *> by diag(C). *> = 'B': Both row and column equilibration, i.e., A has been *> replaced by diag(R) * A * diag(C). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if row or column scaling *> should be done based on the ratio of the row or column scaling *> factors. If ROWCND < THRESH, row scaling is done, and if @@ -125,10 +126,9 @@ *> should be done based on the absolute size of the largest matrix *> element. If AMAX > LARGE or AMAX < SMALL, row scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqhb.f b/SRC/zlaqhb.f index c96a108..9500be4 100644 --- a/SRC/zlaqhb.f +++ b/SRC/zlaqhb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQHB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQHB equilibrates a Hermitian band matrix A *> using the scaling factors in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -124,10 +125,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqhe.f b/SRC/zlaqhe.f index 1028cdc..059631f 100644 --- a/SRC/zlaqhe.f +++ b/SRC/zlaqhe.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQHE( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQHE equilibrates a Hermitian matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -117,10 +118,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqhp.f b/SRC/zlaqhp.f index f2ae706..d14d643 100644 --- a/SRC/zlaqhp.f +++ b/SRC/zlaqhp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQHP( UPLO, N, AP, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQHP equilibrates a Hermitian matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -109,10 +110,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqp2.f b/SRC/zlaqp2.f index 4fb1165..5c6cab7 100644 --- a/SRC/zlaqp2.f +++ b/SRC/zlaqp2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, * WORK ) @@ -30,20 +30,19 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQP2 computes a QR factorization with column pivoting of *> the block A(OFFSET+1:M,1:N). *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -114,10 +113,9 @@ *> \verbatim *> WORK is COMPLEX*16 array, dimension (N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -128,23 +126,25 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA -*> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE ZLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2, $ WORK ) diff --git a/SRC/zlaqps.f b/SRC/zlaqps.f index 8671276..9a847e3 100644 --- a/SRC/zlaqps.f +++ b/SRC/zlaqps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, * VN2, AUXV, F, LDF ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), AUXV( * ), F( LDF, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQPS computes a step of QR factorization with column pivoting *> of a complex M-by-N matrix A by using Blas-3. It tries to factorize @@ -46,11 +46,10 @@ *> columns is returned in KB. *> *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -142,10 +141,9 @@ *> LDF is INTEGER *> The leading dimension of the array F. LDF >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -156,23 +154,25 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain *> X. Sun, Computer Science Dept., Duke University, USA -*> -*> Partial column norm updating strategy modified by +*> \n +*> Partial column norm updating strategy modified on April 2011 *> Z. Drmac and Z. Bujanovic, Dept. of Mathematics, *> University of Zagreb, Croatia. -*> -- April 2011 -- -*> For more details see LAPACK Working Note 176. -*> \endverbatim +* +*> \par References: +* ================ *> +*> LAPACK Working Note 176 +* +*> \htmlonly +*> [PDF] +*> \endhtmlonly +* * ===================================================================== SUBROUTINE ZLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1, $ VN2, AUXV, F, LDF ) diff --git a/SRC/zlaqr0.f b/SRC/zlaqr0.f index 71f4598..4ee699e 100644 --- a/SRC/zlaqr0.f +++ b/SRC/zlaqr0.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, * IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQR0 computes the eigenvalues of a Hessenberg matrix H *> and, optionally, the matrices T and Z from the Schur decomposition @@ -44,11 +44,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -207,10 +206,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -221,28 +219,24 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, $ IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/zlaqr1.f b/SRC/zlaqr1.f index 461d604..213cba8 100644 --- a/SRC/zlaqr1.f +++ b/SRC/zlaqr1.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQR1( N, H, LDH, S1, S2, V ) * @@ -28,11 +28,11 @@ * COMPLEX*16 H( LDH, * ), V( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Given a 2-by-2 or 3-by-3 matrix H, ZLAQR1 sets v to a *> scalar multiple of the first column of the product @@ -43,11 +43,10 @@ *> *> This is useful for starting double implicit shift bulges *> in the QR algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -86,10 +85,9 @@ *> A scalar multiple of the first column of the *> matrix K in (*). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -100,17 +98,11 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE ZLAQR1( N, H, LDH, S1, S2, V ) diff --git a/SRC/zlaqr2.f b/SRC/zlaqr2.f index 7e3b5d0..8e39ce4 100644 --- a/SRC/zlaqr2.f +++ b/SRC/zlaqr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT, @@ -32,11 +32,11 @@ * $ WORK( * ), WV( LDWV, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQR2 is identical to ZLAQR3 except that it avoids *> recursion by calling ZLAHQR instead of ZLAQR4. @@ -52,11 +52,10 @@ *> hoped that the final version of H has many zero subdiagonal *> entries. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -247,10 +246,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -261,17 +259,11 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE ZLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/zlaqr3.f b/SRC/zlaqr3.f index 864221e..10311ad 100644 --- a/SRC/zlaqr3.f +++ b/SRC/zlaqr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, * IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT, @@ -32,11 +32,11 @@ * $ WORK( * ), WV( LDWV, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Aggressive early deflation: *> @@ -49,11 +49,10 @@ *> hoped that the final version of H has many zero subdiagonal *> entries. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -244,10 +243,9 @@ *> in WORK(1). No error message related to LWORK is issued *> by XERBLA. Neither H nor Z are accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -258,17 +256,11 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA -*> -*> \endverbatim +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA *> * ===================================================================== SUBROUTINE ZLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ, diff --git a/SRC/zlaqr4.f b/SRC/zlaqr4.f index 94042bd..b3f53fc 100644 --- a/SRC/zlaqr4.f +++ b/SRC/zlaqr4.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, * IHIZ, Z, LDZ, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQR4 implements one level of recursion for ZLAQR0. *> It is a complete implementation of the small bulge multi-shift @@ -51,11 +51,10 @@ *> matrix Q so that this routine can give the Schur factorization *> of a matrix A which has been reduced to the Hessenberg form H *> by the unitary matrix Q: A = Q*H*Q**H = (QZ)*H*(QZ)**H. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -213,10 +212,9 @@ *> If INFO .GT. 0 and WANTZ is .FALSE., then Z is not *> accessed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -227,28 +225,24 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by -*> Karen Braman and Ralph Byers, Department of Mathematics, -*> University of Kansas, USA +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ *> -*> References: *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 *> Performance, SIAM Journal of Matrix Analysis, volume 23, pages *> 929--947, 2002. -*> +*> \n *> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR *> Algorithm Part II: Aggressive Early Deflation, SIAM Journal *> of Matrix Analysis, volume 23, pages 948--973, 2002. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, $ IHIZ, Z, LDZ, WORK, LWORK, INFO ) diff --git a/SRC/zlaqr5.f b/SRC/zlaqr5.f index 053c57e..a1e3c91 100644 --- a/SRC/zlaqr5.f +++ b/SRC/zlaqr5.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S, * H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV, @@ -32,19 +32,18 @@ * $ WH( LDWH, * ), WV( LDWV, * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQR5, called by ZLAQR0, performs a *> single small-bulge multi-shift QR sweep. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTT *> \verbatim @@ -220,10 +219,9 @@ *> LDWV is the leading dimension of WV as declared in the *> in the calling subroutine. LDWV.GE.NV. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -234,6 +232,20 @@ * *> \ingroup complex16OTHERauxiliary * +*> \par Contributors: +* ================== +*> +*> Karen Braman and Ralph Byers, Department of Mathematics, +*> University of Kansas, USA +* +*> \par References: +* ================ +*> +*> K. Braman, R. Byers and R. Mathias, The Multi-Shift QR +*> Algorithm Part I: Maintaining Well Focused Shifts, and Level 3 +*> Performance, SIAM Journal of Matrix Analysis, volume 23, pages +*> 929--947, 2002. +*> * ===================================================================== SUBROUTINE ZLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S, $ H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV, @@ -255,19 +267,6 @@ * .. * * ================================================================ -* Based on contributions by -* Karen Braman and Ralph Byers, Department of Mathematics, -* University of Kansas, USA -* -* ================================================================ -* Reference: -* -* K. Braman, R. Byers and R. Mathias, The Multi-Shift QR -* Algorithm Part I: Maintaining Well Focused Shifts, and -* Level 3 Performance, SIAM Journal of Matrix Analysis, -* volume 23, pages 929--947, 2002. -* -* ================================================================ * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = ( 0.0d0, 0.0d0 ), diff --git a/SRC/zlaqsb.f b/SRC/zlaqsb.f index 81029b8..ae7976c 100644 --- a/SRC/zlaqsb.f +++ b/SRC/zlaqsb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQSB equilibrates a symmetric band matrix A using the scaling *> factors in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -124,10 +125,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqsp.f b/SRC/zlaqsp.f index edea546..3a7d2a6 100644 --- a/SRC/zlaqsp.f +++ b/SRC/zlaqsp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQSP equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -109,10 +110,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaqsy.f b/SRC/zlaqsy.f index dc4e8e9..0c675c7 100644 --- a/SRC/zlaqsy.f +++ b/SRC/zlaqsy.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED ) * @@ -30,19 +30,18 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAQSY equilibrates a symmetric matrix A using the scaling factors *> in the vector S. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,12 @@ *> = 'N': No equilibration. *> = 'Y': Equilibration was done, i.e., A has been replaced by *> diag(S) * A * diag(S). +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> THRESH is a threshold value used to decide if scaling should be done *> based on the ratio of the scaling factors. If SCOND < THRESH, *> scaling is done. @@ -117,10 +118,9 @@ *> be done based on the absolute size of the largest matrix element. *> If AMAX > LARGE or AMAX < SMALL, scaling is done. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlar1v.f b/SRC/zlar1v.f index fea96b1..5d131e0 100644 --- a/SRC/zlar1v.f +++ b/SRC/zlar1v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, * PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, @@ -35,11 +35,11 @@ * COMPLEX*16 Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAR1V computes the (scaled) r-th column of the inverse of *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix @@ -56,11 +56,10 @@ *> (d) Computation of the (scaled) r-th column of the inverse using the *> twisted factorization obtained by combining the top part of the *> the stationary and the bottom part of the progressive transform. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -204,10 +203,9 @@ *> \verbatim *> WORK is DOUBLE PRECISION array, dimension (4*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -218,21 +216,15 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE ZLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD, $ PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA, diff --git a/SRC/zlar2v.f b/SRC/zlar2v.f index 3d763b7..efc50ac 100644 --- a/SRC/zlar2v.f +++ b/SRC/zlar2v.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAR2V( N, X, Y, Z, INCX, C, S, INCC ) * @@ -28,11 +28,11 @@ * COMPLEX*16 S( * ), X( * ), Y( * ), Z( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAR2V applies a vector of complex plane rotations with real cosines *> from both sides to a sequence of 2-by-2 complex Hermitian matrices, @@ -43,11 +43,10 @@ *> *> ( c(i) conjg(s(i)) ) ( x(i) z(i) ) ( c(i) -conjg(s(i)) ) *> ( -s(i) c(i) ) ( conjg(z(i)) y(i) ) ( s(i) c(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -96,10 +95,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlarcm.f b/SRC/zlarcm.f index 6129ca1..4a7421d 100644 --- a/SRC/zlarcm.f +++ b/SRC/zlarcm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARCM( M, N, A, LDA, B, LDB, C, LDC, RWORK ) * @@ -28,21 +28,20 @@ * COMPLEX*16 B( LDB, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARCM performs a very simple matrix-matrix multiplication: *> C := A * B, *> where A is M by M and real; B is M by N and complex; *> C is M by N and complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> \verbatim *> RWORK is DOUBLE PRECISION array, dimension (2*M*N) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlarf.f b/SRC/zlarf.f index 34730d9..2fb0f54 100644 --- a/SRC/zlarf.f +++ b/SRC/zlarf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX*16 C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARF applies a complex elementary reflector H to a complex M-by-N *> matrix C, from either the left or the right. H is represented in the @@ -47,11 +47,10 @@ *> *> To apply H**H, supply conjg(tau) instead *> tau. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -113,10 +112,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlarfb.f b/SRC/zlarfb.f index 2638ac9..e4767ef 100644 --- a/SRC/zlarfb.f +++ b/SRC/zlarfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, * T, LDT, C, LDC, WORK, LDWORK ) @@ -30,19 +30,18 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARFB applies a complex block reflector H or its transpose H**H to a *> complex M-by-N matrix C, from either the left or the right. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -165,10 +163,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -192,7 +189,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlarfg.f b/SRC/zlarfg.f index 9802d0e..cf3bd3f 100644 --- a/SRC/zlarfg.f +++ b/SRC/zlarfg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARFG( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * COMPLEX*16 X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARFG generates a complex elementary reflector H of order n, such *> that @@ -53,11 +53,10 @@ *> and H is taken to be the unit matrix. *> *> Otherwise 1 <= real(tau) <= 2 and abs(tau-1) <= 1 . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -91,10 +90,9 @@ *> TAU is COMPLEX*16 *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlarfgp.f b/SRC/zlarfgp.f index 87e6d66..21a7dc3 100644 --- a/SRC/zlarfgp.f +++ b/SRC/zlarfgp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARFGP( N, ALPHA, X, INCX, TAU ) * @@ -28,11 +28,11 @@ * COMPLEX*16 X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARFGP generates a complex elementary reflector H of order n, such *> that @@ -51,11 +51,10 @@ *> *> If the elements of x are all zero and alpha is real, then tau = 0 *> and H is taken to be the unit matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -89,10 +88,9 @@ *> TAU is COMPLEX*16 *> The value tau. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlarft.f b/SRC/zlarft.f index fdef55a..c562893 100644 --- a/SRC/zlarft.f +++ b/SRC/zlarft.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * COMPLEX*16 T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARFT forms the triangular factor T of a complex block reflector H *> of order n, which is defined as a product of k elementary reflectors. @@ -50,11 +50,10 @@ *> H(i) is stored in the i-th row of the array V, and *> *> H = I - V**H * T * V -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -122,10 +121,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -136,10 +134,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define @@ -163,7 +160,6 @@ *> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) *> ( 1 v3 ) *> ( 1 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlarfx.f b/SRC/zlarfx.f index 61f612d..7ec6e76 100644 --- a/SRC/zlarfx.f +++ b/SRC/zlarfx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX*16 C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARFX applies a complex elementary reflector H to a complex m by n *> matrix C, from either the left or the right. H is represented in the @@ -46,11 +46,10 @@ *> If tau = 0, then H is taken to be the unit matrix *> *> This version uses inline code if H has order < 11. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -104,10 +103,9 @@ *> or (M) if SIDE = 'R' *> WORK is not referenced if H has order < 11. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlargv.f b/SRC/zlargv.f index 0f2fdef..364ae2c 100644 --- a/SRC/zlargv.f +++ b/SRC/zlargv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARGV( N, X, INCX, Y, INCY, C, INCC ) * @@ -28,11 +28,11 @@ * COMPLEX*16 X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARGV generates a vector of complex plane rotations with real *> cosines, determined by elements of the complex vectors x and y. @@ -47,11 +47,10 @@ *> but differ from the BLAS1 routine ZROTG): *> If y(i)=0, then c(i)=1 and s(i)=0. *> If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -96,10 +95,9 @@ *> INCC is INTEGER *> The increment between elements of C. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -110,17 +108,15 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel *> *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlarnv.f b/SRC/zlarnv.f index f58634a..3079f54 100644 --- a/SRC/zlarnv.f +++ b/SRC/zlarnv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARNV( IDIST, ISEED, N, X ) * @@ -28,19 +28,18 @@ * COMPLEX*16 X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARNV returns a vector of n random complex numbers from a uniform or *> normal distribution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IDIST *> \verbatim @@ -73,10 +72,9 @@ *> X is COMPLEX*16 array, dimension (N) *> The generated random numbers. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -87,17 +85,15 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> This routine calls the auxiliary routine DLARUV to generate random *> real numbers from a uniform (0,1) distribution, in batches of up to *> 128 using vectorisable code. The Box-Muller method is used to *> transform numbers from a uniform to a normal distribution. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlarrv.f b/SRC/zlarrv.f index e8c75ed..8968b4b 100644 --- a/SRC/zlarrv.f +++ b/SRC/zlarrv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN, * ISPLIT, M, DOL, DOU, MINRGP, @@ -36,20 +36,19 @@ * COMPLEX*16 Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARRV computes the eigenvectors of the tridiagonal matrix *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T. *> The input eigenvalues should have been computed by DLARRE. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -255,10 +254,9 @@ *> = 5: The Rayleigh Quotient Iteration failed to converge to *> full accuracy in MAXITR steps. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -269,21 +267,15 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA +* * ===================================================================== SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN, $ ISPLIT, M, DOL, DOU, MINRGP, diff --git a/SRC/zlarscl2.f b/SRC/zlarscl2.f index 52e8cba..4df988d 100644 --- a/SRC/zlarscl2.f +++ b/SRC/zlarscl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARSCL2 ( M, N, D, X, LDX ) * @@ -28,11 +28,11 @@ * DOUBLE PRECISION D( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARSCL2 performs a reciprocal diagonal scaling on an vector: *> x <-- inv(D) * x @@ -40,11 +40,10 @@ *> *> Eventually to be replaced by BLAS_zge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -76,10 +75,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlartg.f b/SRC/zlartg.f index 2c8309e..823e768 100644 --- a/SRC/zlartg.f +++ b/SRC/zlartg.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARTG( F, G, CS, SN, R ) * @@ -25,11 +25,11 @@ * COMPLEX*16 F, G, R, SN * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARTG generates a plane rotation so that *> @@ -42,11 +42,10 @@ *> F and G are unchanged on return. *> If G=0, then CS=1 and SN=0. *> If F=0, then CS=0 and SN is chosen so that R is real. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] F *> \verbatim @@ -77,10 +76,9 @@ *> R is COMPLEX*16 *> The nonzero component of the rotated vector. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -91,17 +89,15 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel *> *> This version has a few statements commented out for thread safety *> (machine parameters are computed on each entry). 10 feb 03, SJH. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlartv.f b/SRC/zlartv.f index fcc525e..4af0a1c 100644 --- a/SRC/zlartv.f +++ b/SRC/zlartv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARTV( N, X, INCX, Y, INCY, C, S, INCC ) * @@ -28,22 +28,21 @@ * COMPLEX*16 S( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARTV applies a vector of complex plane rotations with real cosines *> to elements of the complex vectors x and y. For i = 1,2,...,n *> *> ( x(i) ) := ( c(i) s(i) ) ( x(i) ) *> ( y(i) ) ( -conjg(s(i)) c(i) ) ( y(i) ) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -92,10 +91,9 @@ *> INCC is INTEGER *> The increment between elements of C and S. INCC > 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlarz.f b/SRC/zlarz.f index 48385d1..b4f192f 100644 --- a/SRC/zlarz.f +++ b/SRC/zlarz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX*16 C( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARZ applies a complex elementary reflector H to a complex *> M-by-N matrix C, from either the left or the right. H is represented @@ -49,11 +49,10 @@ *> tau. *> *> H is a product of k elementary reflectors as returned by ZTZRZF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -121,10 +120,9 @@ *> (N) if SIDE = 'L' *> or (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -135,15 +133,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlarzb.f b/SRC/zlarzb.f index 5498679..40984ea 100644 --- a/SRC/zlarzb.f +++ b/SRC/zlarzb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, * LDV, T, LDT, C, LDC, WORK, LDWORK ) @@ -30,21 +30,20 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARZB applies a complex block reflector H or its transpose H**H *> to a complex distributed M-by-N C from the left or the right. *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -156,10 +155,9 @@ *> If SIDE = 'L', LDWORK >= max(1,N); *> if SIDE = 'R', LDWORK >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -170,15 +168,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlarzt.f b/SRC/zlarzt.f index 17c63db..ea8cf26 100644 --- a/SRC/zlarzt.f +++ b/SRC/zlarzt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * @@ -28,11 +28,11 @@ * COMPLEX*16 T( LDT, * ), TAU( * ), V( LDV, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLARZT forms the triangular factor T of a complex block reflector *> H of order > n, which is defined as a product of k elementary @@ -53,11 +53,10 @@ *> H = I - V**H * T * V *> *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] DIRECT *> \verbatim @@ -125,10 +124,9 @@ *> LDT is INTEGER *> The leading dimension of the array T. LDT >= K. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -139,14 +137,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The shape of the matrix V and the storage of the vectors which define *> the H(i) is best illustrated by the following example with n = 5 and @@ -181,7 +180,6 @@ *> V = ( v1 v2 v3 ) *> ( v1 v2 v3 ) *> ( v1 v2 v3 ) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlascl.f b/SRC/zlascl.f index 55ab2de..9e4eff7 100644 --- a/SRC/zlascl.f +++ b/SRC/zlascl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) * @@ -29,22 +29,21 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASCL multiplies the M by N complex matrix A by the real scalar *> CTO/CFROM. This is done without over/underflow as long as the final *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that *> A may be full, upper triangular, lower triangular, upper Hessenberg, *> or banded. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TYPE *> \verbatim @@ -124,10 +123,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/SRC/zlascl2.f b/SRC/zlascl2.f index bc4898e..4fb0d18 100644 --- a/SRC/zlascl2.f +++ b/SRC/zlascl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASCL2 ( M, N, D, X, LDX ) * @@ -28,11 +28,11 @@ * COMPLEX*16 X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASCL2 performs a diagonal scaling on a vector: *> x <-- D * x @@ -40,11 +40,10 @@ *> *> Eventually to be replaced by BLAS_zge_diag_scale in the new BLAS *> standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -76,10 +75,9 @@ *> LDX is INTEGER *> The leading dimension of the vector X. LDX >= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaset.f b/SRC/zlaset.f index 80e2866..da26903 100644 --- a/SRC/zlaset.f +++ b/SRC/zlaset.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASET( UPLO, M, N, ALPHA, BETA, A, LDA ) * @@ -29,19 +29,18 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASET initializes a 2-D array A to BETA on the diagonal and *> ALPHA on the offdiagonals. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -91,10 +90,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlasr.f b/SRC/zlasr.f index 29a0b27..b6f3c35 100644 --- a/SRC/zlasr.f +++ b/SRC/zlasr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASR applies a sequence of real plane rotations to a complex matrix *> A, from either the left or the right. @@ -106,11 +106,10 @@ *> *> where R(k) appears in rows and columns k and z. The rotations are *> performed without ever forming P(k) explicitly. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -185,10 +184,9 @@ *> LDA is INTEGER *> The leading dimension of the array A. LDA >= max(1,M). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlassq.f b/SRC/zlassq.f index 67c76ac..8aa13c6 100644 --- a/SRC/zlassq.f +++ b/SRC/zlassq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASSQ( N, X, INCX, SCALE, SUMSQ ) * @@ -28,11 +28,11 @@ * COMPLEX*16 X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASSQ returns the values scl and ssq such that *> @@ -52,11 +52,10 @@ *> SCALE and SUMSQ are overwritten by scl and ssq respectively. *> *> The routine makes only one pass through the vector X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -91,10 +90,9 @@ *> On entry, the value sumsq in the equation above. *> On exit, SUMSQ is overwritten with the value ssq . *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlaswp.f b/SRC/zlaswp.f index 0ca515a..992b421 100644 --- a/SRC/zlaswp.f +++ b/SRC/zlaswp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASWP( N, A, LDA, K1, K2, IPIV, INCX ) * @@ -28,19 +28,18 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASWP performs a series of row interchanges on the matrix A. *> One row interchange is initiated for each of rows K1 through K2 of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -90,10 +89,9 @@ *> The increment between successive values of IPIV. If IPIV *> is negative, the pivots are applied in reverse order. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -104,15 +102,13 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> Modified by *> R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlasyf.f b/SRC/zlasyf.f index 8a1b39a..0ffcd56 100644 --- a/SRC/zlasyf.f +++ b/SRC/zlasyf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLASYF computes a partial factorization of a complex symmetric matrix *> A using the Bunch-Kaufman diagonal pivoting method. The partial @@ -52,11 +52,10 @@ *> ZLASYF is an auxiliary routine called by ZSYTRF. It uses blocked code *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or *> A22 (if UPLO = 'L'). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -142,10 +141,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlat2c.f b/SRC/zlat2c.f index d635b37..c748230 100644 --- a/SRC/zlat2c.f +++ b/SRC/zlat2c.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAT2C( UPLO, N, A, LDA, SA, LDSA, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAT2C converts a COMPLEX*16 triangular matrix, SA, to a COMPLEX *> triangular matrix, A. @@ -43,11 +43,10 @@ *> RMAX. If not the convertion is aborted and a flag is raised. *> *> This is an auxiliary routine so there is no argument checking. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -96,10 +95,9 @@ *> PRECISION overflow threshold, in this case, the content *> of the UPLO part of SA in exit is unspecified. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlatbs.f b/SRC/zlatbs.f index 464d47f..1919566 100644 --- a/SRC/zlatbs.f +++ b/SRC/zlatbs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X, * SCALE, CNORM, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AB( LDAB, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATBS solves one of the triangular systems *> @@ -49,11 +49,10 @@ *> overflow, the Level 2 BLAS routine ZTBSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,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 @@ -169,10 +167,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, ZTBSV @@ -240,7 +237,6 @@ *> *> and we can safely call ZTBSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlatdf.f b/SRC/zlatdf.f index 1a4f175..659068c 100644 --- a/SRC/zlatdf.f +++ b/SRC/zlatdf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, * JPIV ) @@ -30,11 +30,11 @@ * COMPLEX*16 RHS( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATDF computes the contribution to the reciprocal Dif-estimate *> by solving for x in Z * x = b, where b is chosen such that the norm @@ -45,11 +45,10 @@ *> The factorization of Z returned by ZGETC2 has the form *> Z = P * L * U * Q, where P and Q are permutation matrices. L is lower *> triangular with unit diagonal elements and U is upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -126,10 +125,9 @@ *> The pivot indices; for 1 <= j <= N, column j of the *> matrix has been interchanged with column JPIV(j). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -140,33 +138,33 @@ * *> \ingroup complex16OTHERauxiliary * +*> \par Further Details: +* ===================== +*> +*> This routine is a further developed implementation of algorithm +*> BSOLVE in [1] using complete pivoting in the LU factorization. * -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> This routine is a further developed implementation of algorithm -*> BSOLVE in [1] using complete pivoting in the LU factorization. +* +*> \par References: +* ================ *> *> [1] Bo Kagstrom and Lars Westin, *> Generalized Schur Methods with Condition Estimators for *> Solving the Generalized Sylvester Equation, IEEE Transactions *> on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751. -*> +*>\n *> [2] Peter Poromaa, *> On Efficient and Robust Estimators for the Separation *> between two Regular Matrix Pairs with Applications in *> Condition Estimation. Report UMINF-95.05, Department of *> Computing Science, Umea University, S-901 87 Umea, Sweden, *> 1995. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, $ JPIV ) diff --git a/SRC/zlatps.f b/SRC/zlatps.f index 9260713..d6c1ece 100644 --- a/SRC/zlatps.f +++ b/SRC/zlatps.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE, * CNORM, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AP( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATPS solves one of the triangular systems *> @@ -50,11 +50,10 @@ *> overflow, the Level 2 BLAS routine ZTPSV is called. If the matrix A *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a *> non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -143,10 +142,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 @@ -157,10 +155,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, ZTPSV @@ -228,7 +225,6 @@ *> *> and we can safely call ZTPSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlatrd.f b/SRC/zlatrd.f index c85ed58..61764e8 100644 --- a/SRC/zlatrd.f +++ b/SRC/zlatrd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), W( LDW, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATRD reduces NB rows and columns of a complex Hermitian matrix A to *> Hermitian tridiagonal form by a unitary similarity @@ -46,11 +46,10 @@ *> matrix, of which the lower triangle is supplied. *> *> This is an auxiliary routine called by ZHETRD. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -132,10 +131,9 @@ *> LDW is INTEGER *> The leading dimension of the array W. LDW >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -146,10 +144,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', the matrix Q is represented as a product of elementary @@ -197,7 +194,6 @@ *> where d denotes a diagonal element of the reduced matrix, a denotes *> an element of the original matrix that is unchanged, and vi denotes *> an element of the vector defining H(i). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlatrs.f b/SRC/zlatrs.f index ad603df..2c093b1 100644 --- a/SRC/zlatrs.f +++ b/SRC/zlatrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, * CNORM, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATRS solves one of the triangular systems *> @@ -49,11 +49,10 @@ *> unscaled problem will not cause overflow, the Level 2 BLAS routine *> ZTRSV is called. If the matrix A is singular (A(j,j) = 0 for some j), *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -151,10 +150,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 @@ -165,10 +163,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A rough bound on x is computed; if that is less than overflow, ZTRSV @@ -236,7 +233,6 @@ *> *> and we can safely call ZTRSV if 1/M(n) and 1/G(n) are both greater *> than max(underflow, 1/overflow). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlatrz.f b/SRC/zlatrz.f index deb4c8c..f164e29 100644 --- a/SRC/zlatrz.f +++ b/SRC/zlatrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATRZ( M, N, L, A, LDA, TAU, WORK ) * @@ -27,21 +27,20 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLATRZ factors the M-by-(M+L) complex upper trapezoidal matrix *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R 0 ) * Z by means *> of unitary transformations, where Z is an (M+L)-by-(M+L) unitary *> matrix and, R and A1 are M-by-M upper triangular matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -89,10 +88,9 @@ *> \verbatim *> WORK is COMPLEX*16 array, dimension (M) *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,14 +101,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -136,7 +135,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zlatzm.f b/SRC/zlatzm.f index 231b5e5..749f92a 100644 --- a/SRC/zlatzm.f +++ b/SRC/zlatzm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK ) * @@ -29,11 +29,11 @@ * COMPLEX*16 C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine ZUNMRZ. *> @@ -54,11 +54,10 @@ *> C = [ C1, C2 ] m *> 1 n-1 *> Then C is overwritten by C*P. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -137,10 +136,9 @@ *> (N) if SIDE = 'L' *> (M) if SIDE = 'R' *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zlauu2.f b/SRC/zlauu2.f index a6c078a..7caf48e 100644 --- a/SRC/zlauu2.f +++ b/SRC/zlauu2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAUU2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAUU2 computes the product U * U**H or L**H * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the unblocked form of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/zlauum.f b/SRC/zlauum.f index 45dbabc..6a57ca0 100644 --- a/SRC/zlauum.f +++ b/SRC/zlauum.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZLAUUM( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZLAUUM computes the product U * U**H or L**H * L, where the triangular *> factor U or L is stored in the upper or lower triangular part of @@ -44,11 +44,10 @@ *> overwriting the factor L in A. *> *> This is the blocked form of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,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/SRC/zpbcon.f b/SRC/zpbcon.f index 27c73dc..683ea0f 100644 --- a/SRC/zpbcon.f +++ b/SRC/zpbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK, * RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite band matrix using @@ -44,11 +44,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,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/SRC/zpbequ.f b/SRC/zpbequ.f index fa2f3a9..236040f 100644 --- a/SRC/zpbequ.f +++ b/SRC/zpbequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBEQU computes row and column scalings intended to equilibrate a *> Hermitian positive definite band matrix A and reduce its condition @@ -44,11 +44,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpbrfs.f b/SRC/zpbrfs.f index 5d975af..2f473bc 100644 --- a/SRC/zpbrfs.f +++ b/SRC/zpbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B, * LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite *> and banded, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -165,16 +164,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpbstf.f b/SRC/zpbstf.f index 0e48bfb..4f61328 100644 --- a/SRC/zpbstf.f +++ b/SRC/zpbstf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBSTF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBSTF computes a split Cholesky factorization of a complex *> Hermitian positive definite band matrix A. @@ -47,11 +47,10 @@ *> *> where U is upper triangular of order m = (n+kd)/2, and L is lower *> triangular of order n-m. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> because the updated element a(i,i) was negative; the *> matrix A is not positive definite. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -151,7 +148,6 @@ *> *> Array elements marked * are not used by the routine; s12**H denotes *> conjg(s12); the diagonal elements of S are real. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpbsv.f b/SRC/zpbsv.f index 38a3822..28a420f 100644 --- a/SRC/zpbsv.f +++ b/SRC/zpbsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBSV computes the solution to a complex system of linear equations *> A * X = B, @@ -46,11 +46,10 @@ *> triangular band matrix, with the same number of superdiagonals or *> subdiagonals as A. The factored form of A is then used to solve the *> system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -138,10 +136,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -162,7 +159,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpbsvx.f b/SRC/zpbsvx.f index a7739ee..be4e98b 100644 --- a/SRC/zpbsvx.f +++ b/SRC/zpbsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, * EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR, @@ -33,11 +33,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to *> compute the solution to a complex system of linear equations @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -85,11 +88,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -290,10 +292,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -304,10 +305,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -335,7 +335,6 @@ *> a31 a42 a53 a64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpbtf2.f b/SRC/zpbtf2.f index 3b29117..96fbdf3 100644 --- a/SRC/zpbtf2.f +++ b/SRC/zpbtf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBTF2( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBTF2 computes the Cholesky factorization of a complex Hermitian *> positive definite band matrix A. @@ -44,11 +44,10 @@ *> of U, and L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -116,10 +114,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -140,7 +137,6 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpbtrf.f b/SRC/zpbtrf.f index 202dd4c..65ec22b 100644 --- a/SRC/zpbtrf.f +++ b/SRC/zpbtrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AB( LDAB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBTRF computes the Cholesky factorization of a complex Hermitian *> positive definite band matrix A. @@ -41,11 +41,10 @@ *> A = U**H * U, if UPLO = 'U', or *> A = L * L**H, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -111,10 +109,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The band storage scheme is illustrated by the following example, when @@ -135,12 +132,13 @@ *> a31 a42 a53 a64 * * l31 l42 l53 l64 * * *> *> Array elements marked * are not used by the routine. -*> -*> Contributed by -*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 -*> *> \endverbatim +* +*> \par Contributors: +* ================== *> +*> Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989 +* * ===================================================================== SUBROUTINE ZPBTRF( UPLO, N, KD, AB, LDAB, INFO ) * diff --git a/SRC/zpbtrs.f b/SRC/zpbtrs.f index 9195092..ac1c9f9 100644 --- a/SRC/zpbtrs.f +++ b/SRC/zpbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPBTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite band matrix A using the Cholesky factorization *> A = U**H *U or A = L*L**H computed by ZPBTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/zpftrf.f b/SRC/zpftrf.f index e4e116e..8547c8d 100644 --- a/SRC/zpftrf.f +++ b/SRC/zpftrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPFTRF( TRANSR, UPLO, N, A, INFO ) * @@ -27,11 +27,11 @@ * .. Array Arguments .. * COMPLEX*16 A( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPFTRF computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A. @@ -42,11 +42,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -196,10 +195,9 @@ *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpftri.f b/SRC/zpftri.f index 35a6fe6..5bd23af 100644 --- a/SRC/zpftri.f +++ b/SRC/zpftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPFTRI( TRANSR, UPLO, N, A, INFO ) * @@ -27,20 +27,19 @@ * COMPLEX*16 A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPFTRI computes the inverse of a complex Hermitian positive definite *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H *> computed by ZPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -89,10 +88,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -103,10 +101,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -210,7 +207,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpftrs.f b/SRC/zpftrs.f index e6a259e..c0a5333 100644 --- a/SRC/zpftrs.f +++ b/SRC/zpftrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 A( 0: * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPFTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite matrix A using the Cholesky factorization *> A = U**H*U or A = L*L**H computed by ZPFTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -97,10 +96,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 @@ -111,10 +109,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -218,7 +215,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpocon.f b/SRC/zpocon.f index 97367cc..c5e048f 100644 --- a/SRC/zpocon.f +++ b/SRC/zpocon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, RWORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite matrix using the @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/zpoequ.f b/SRC/zpoequ.f index 03fe5e6..45fd430 100644 --- a/SRC/zpoequ.f +++ b/SRC/zpoequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOEQU( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOEQU computes row and column scalings intended to equilibrate a *> Hermitian positive definite matrix A and reduce its condition number @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -98,10 +97,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpoequb.f b/SRC/zpoequb.f index 84d0fc0..b7d6a51 100644 --- a/SRC/zpoequb.f +++ b/SRC/zpoequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO ) * @@ -29,11 +29,11 @@ * DOUBLE PRECISION S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOEQUB computes row and column scalings intended to equilibrate a *> symmetric positive definite matrix A and reduce its condition number @@ -43,11 +43,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -98,10 +97,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zporfs.f b/SRC/zporfs.f index 8d56c39..eb2bd3b 100644 --- a/SRC/zporfs.f +++ b/SRC/zporfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X, * LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPORFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite, *> and provides error bounds and backward error estimates for the *> solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,16 +158,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zporfsx.f b/SRC/zporfsx.f index a1fb9b0..61e360f 100644 --- a/SRC/zporfsx.f +++ b/SRC/zporfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B, * LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -37,13 +37,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPORFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric positive @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -377,10 +374,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zposv.f b/SRC/zposv.f index 683f287..43dcfa7 100644 --- a/SRC/zposv.f +++ b/SRC/zposv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOSV computes the solution to a complex system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zposvx.f b/SRC/zposvx.f index cf60118..f86f63e 100644 --- a/SRC/zposvx.f +++ b/SRC/zposvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, @@ -33,11 +33,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to *> compute the solution to a complex system of linear equations @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -85,11 +88,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -286,10 +288,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zposvxx.f b/SRC/zposvxx.f index 20a334a..1b281f5 100644 --- a/SRC/zposvxx.f +++ b/SRC/zposvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED, * S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -37,13 +37,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T *> to compute the solution to a complex*16 system of linear equations @@ -64,9 +62,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what ZPOSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -104,11 +105,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -474,10 +474,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpotf2.f b/SRC/zpotf2.f index 2abd1b3..0621b43 100644 --- a/SRC/zpotf2.f +++ b/SRC/zpotf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOTF2( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOTF2 computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpotrf.f b/SRC/zpotrf.f index 2310617..81a3c70 100644 --- a/SRC/zpotrf.f +++ b/SRC/zpotrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOTRF( UPLO, N, A, LDA, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOTRF computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A. @@ -43,11 +43,10 @@ *> where U is an upper triangular matrix and L is lower triangular. *> *> This is the block version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -92,10 +91,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpotri.f b/SRC/zpotri.f index b9e3953..124fa13 100644 --- a/SRC/zpotri.f +++ b/SRC/zpotri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOTRI( UPLO, N, A, LDA, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOTRI computes the inverse of a complex Hermitian positive definite *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H *> computed by ZPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -80,10 +79,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpotrs.f b/SRC/zpotrs.f index 0bc7147..75015c4 100644 --- a/SRC/zpotrs.f +++ b/SRC/zpotrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPOTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite matrix A using the Cholesky factorization *> A = U**H * U or A = L * L**H computed by ZPOTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/zppcon.f b/SRC/zppcon.f index 864e8e0..779b593 100644 --- a/SRC/zppcon.f +++ b/SRC/zppcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPCON( UPLO, N, AP, ANORM, RCOND, WORK, RWORK, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX*16 AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite packed matrix using @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/zppequ.f b/SRC/zppequ.f index 5ddf0a7..ab8426f 100644 --- a/SRC/zppequ.f +++ b/SRC/zppequ.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPEQU computes row and column scalings intended to equilibrate a *> Hermitian positive definite matrix A in packed storage and reduce @@ -44,11 +44,10 @@ *> This choice of S puts the condition number of B within a factor N of *> the smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -102,10 +101,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpprfs.f b/SRC/zpprfs.f index 01977a9..c62868f 100644 --- a/SRC/zpprfs.f +++ b/SRC/zpprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR, * BERR, WORK, RWORK, INFO ) @@ -31,21 +31,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -147,16 +146,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zppsv.f b/SRC/zppsv.f index 030bd5e..9141992 100644 --- a/SRC/zppsv.f +++ b/SRC/zppsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPSV( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPSV computes the solution to a complex system of linear equations *> A * X = B, @@ -45,11 +45,10 @@ *> where U is an upper triangular matrix and L is a lower triangular *> matrix. The factored form of A is then used to solve the system of *> equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,9 @@ *> positive definite, so the factorization could not be *> completed, and the solution has not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -123,10 +121,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -142,7 +139,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zppsvx.f b/SRC/zppsvx.f index f7fec16..8ca73b3 100644 --- a/SRC/zppsvx.f +++ b/SRC/zppsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB, * X, LDX, RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPSVX uses the Cholesky factorization A = U**H * U or A = L * L**H to *> compute the solution to a complex system of linear equations @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -84,11 +87,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(S) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -272,10 +274,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -286,10 +287,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -305,7 +305,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpptrf.f b/SRC/zpptrf.f index eab3d04..93b2732 100644 --- a/SRC/zpptrf.f +++ b/SRC/zpptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPTRF( UPLO, N, AP, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPTRF computes the Cholesky factorization of a complex Hermitian *> positive definite matrix A stored in packed format. @@ -41,11 +41,10 @@ *> A = U**H * U, if UPLO = 'U', or *> A = L * L**H, if UPLO = 'L', *> where U is an upper triangular matrix and L is lower triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -84,10 +83,9 @@ *> positive definite, and the factorization could not be *> completed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -98,10 +96,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -117,7 +114,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpptri.f b/SRC/zpptri.f index 5335047..0b33a02 100644 --- a/SRC/zpptri.f +++ b/SRC/zpptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPTRI( UPLO, N, AP, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPTRI computes the inverse of a complex Hermitian positive definite *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H *> computed by ZPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -78,10 +77,9 @@ *> > 0: if INFO = i, the (i,i) element of the factor U or L is *> zero, and the inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpptrs.f b/SRC/zpptrs.f index 257f76f..9041668 100644 --- a/SRC/zpptrs.f +++ b/SRC/zpptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPPTRS solves a system of linear equations A*X = B with a Hermitian *> positive definite matrix A in packed storage using the Cholesky *> factorization A = U**H * U or A = L * L**H computed by ZPPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -93,10 +92,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/SRC/zpstf2.f b/SRC/zpstf2.f index 472c706..d5aac67 100644 --- a/SRC/zpstf2.f +++ b/SRC/zpstf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -31,11 +31,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPSTF2 computes the Cholesky factorization with complete *> pivoting of a complex Hermitian positive semidefinite matrix A. @@ -48,11 +48,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -126,10 +125,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpstrf.f b/SRC/zpstrf.f index 4be6d12..19b1da9 100644 --- a/SRC/zpstrf.f +++ b/SRC/zpstrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO ) * @@ -31,11 +31,11 @@ * INTEGER PIV( N ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPSTRF computes the Cholesky factorization with complete *> pivoting of a complex Hermitian positive semidefinite matrix A. @@ -48,11 +48,10 @@ *> *> This algorithm does not attempt to check that A is positive *> semidefinite. This version of the algorithm calls level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -126,10 +125,9 @@ *> as returned in RANK, or is indefinite. See Section 7 of *> LAPACK Working Note #161 for further information. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zptcon.f b/SRC/zptcon.f index 7dc3dd3..a6bbd45 100644 --- a/SRC/zptcon.f +++ b/SRC/zptcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTCON( N, D, E, ANORM, RCOND, RWORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTCON computes the reciprocal of the condition number (in the *> 1-norm) of a complex Hermitian positive definite tridiagonal matrix @@ -43,11 +43,10 @@ *> Norm(inv(A)) is computed by a direct method, and the reciprocal of *> the condition number is computed as *> RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -94,10 +93,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 @@ -108,16 +106,14 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The method used is described in Nicholas J. Higham, "Efficient *> Algorithms for Computing the Condition Number of a Tridiagonal *> Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zpteqr.f b/SRC/zpteqr.f index 227cdca..7788a2d 100644 --- a/SRC/zpteqr.f +++ b/SRC/zpteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric positive definite tridiagonal matrix by first factoring the @@ -52,11 +52,10 @@ *> tridiagonal form, however, may preclude the possibility of obtaining *> high relative accuracy in the small eigenvalues of the original *> matrix, if these eigenvalues range over many orders of magnitude.) -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -130,10 +129,9 @@ *> if INFO = N+i, i off-diagonal elements of the *> bidiagonal factor did not converge to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zptrfs.f b/SRC/zptrfs.f index 16e71ca..5c08efc 100644 --- a/SRC/zptrfs.f +++ b/SRC/zptrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTRFS( UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -32,21 +32,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is Hermitian positive definite *> and tridiagonal, and provides error bounds and backward error *> estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -159,16 +158,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zptsv.f b/SRC/zptsv.f index 2498e4b..daf34be 100644 --- a/SRC/zptsv.f +++ b/SRC/zptsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTSV( N, NRHS, D, E, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 B( LDB, * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTSV computes the solution to a complex system of linear equations *> A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal @@ -40,11 +40,10 @@ *> *> A is factored as A = L*D*L**H, and the factored form of A is then *> used to solve the system of equations. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -100,10 +99,9 @@ *> computed. The factorization has not been completed *> unless i = N. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zptsvx.f b/SRC/zptsvx.f index 7137e1c..64b1364 100644 --- a/SRC/zptsvx.f +++ b/SRC/zptsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, * RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTSVX uses the factorization A = L*D*L**H to compute the solution *> to a complex system of linear equations A*X = B, where A is an @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -71,11 +74,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -215,10 +217,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpttrf.f b/SRC/zpttrf.f index 7da80c7..b96aad9 100644 --- a/SRC/zpttrf.f +++ b/SRC/zpttrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTTRF( N, D, E, INFO ) * @@ -28,20 +28,19 @@ * COMPLEX*16 E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTTRF computes the L*D*L**H factorization of a complex Hermitian *> positive definite tridiagonal matrix A. The factorization may also *> be regarded as having the form A = U**H *D*U. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -77,10 +76,9 @@ *> be completed, while if k = N, the factorization was *> completed, but D(N) <= 0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zpttrs.f b/SRC/zpttrs.f index e0bf1f9..4f2f846 100644 --- a/SRC/zpttrs.f +++ b/SRC/zpttrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTTRS( UPLO, N, NRHS, D, E, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 B( LDB, * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTTRS solves a tridiagonal system of the form *> A * X = B @@ -41,11 +41,10 @@ *> D is a diagonal matrix specified in the vector D, U (or L) is a unit *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in *> the vector E, and X and B are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -106,10 +105,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/SRC/zptts2.f b/SRC/zptts2.f index 0f9608f..3e25225 100644 --- a/SRC/zptts2.f +++ b/SRC/zptts2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZPTTS2( IUPLO, N, NRHS, D, E, B, LDB ) * @@ -28,11 +28,11 @@ * COMPLEX*16 B( LDB, * ), E( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZPTTS2 solves a tridiagonal system of the form *> A * X = B @@ -40,11 +40,10 @@ *> D is a diagonal matrix specified in the vector D, U (or L) is a unit *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in *> the vector E, and X and B are N by NRHS matrices. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IUPLO *> \verbatim @@ -98,10 +97,9 @@ *> LDB is INTEGER *> The leading dimension of the array B. LDB >= max(1,N). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zrot.f b/SRC/zrot.f index f1acc53..316b938 100644 --- a/SRC/zrot.f +++ b/SRC/zrot.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZROT( N, CX, INCX, CY, INCY, C, S ) * @@ -29,19 +29,18 @@ * COMPLEX*16 CX( * ), CY( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZROT applies a plane rotation, where the cos (C) is real and the *> sin (S) is complex, and the vectors CX and CY are complex. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -88,10 +87,9 @@ *> [ -conjg(S) C ] *> where C*C + S*CONJG(S) = 1.0. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zspcon.f b/SRC/zspcon.f index f66fa35..0f0a36d 100644 --- a/SRC/zspcon.f +++ b/SRC/zspcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO ) * @@ -30,11 +30,11 @@ * COMPLEX*16 AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex symmetric packed matrix A using the @@ -42,11 +42,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -103,10 +102,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/SRC/zspmv.f b/SRC/zspmv.f index 4daf302..e0c6bea 100644 --- a/SRC/zspmv.f +++ b/SRC/zspmv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPMV( UPLO, N, ALPHA, AP, X, INCX, BETA, Y, INCY ) * @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPMV performs the matrix-vector operation *> @@ -41,11 +41,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -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/SRC/zspr.f b/SRC/zspr.f index 977d326..fc763af 100644 --- a/SRC/zspr.f +++ b/SRC/zspr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPR( UPLO, N, ALPHA, X, INCX, AP ) * @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPR performs the symmetric rank 1 operation *> @@ -41,11 +41,10 @@ *> *> where alpha is a complex scalar, x is an n element vector and A is an *> n by n symmetric matrix, supplied in packed form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -117,10 +116,9 @@ *> not be set, they are assumed to be zero, and on exit they *> are set to zero. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsprfs.f b/SRC/zsprfs.f index 8985b8c..03258cc 100644 --- a/SRC/zsprfs.f +++ b/SRC/zsprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -32,21 +32,20 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite *> and packed, and provides error bounds and backward error estimates *> for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -156,16 +155,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zspsv.f b/SRC/zspsv.f index fa16bfd..b4d3f84 100644 --- a/SRC/zspsv.f +++ b/SRC/zspsv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPSV computes the solution to a complex system of linear equations *> A * X = B, @@ -47,11 +47,10 @@ *> triangular matrices, D is symmetric and block diagonal with 1-by-1 *> and 2-by-2 diagonal blocks. The factored form of A is then used to *> solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, so the solution could not be *> computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -160,7 +157,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zspsvx.f b/SRC/zspsvx.f index b28194d..78a96da 100644 --- a/SRC/zspsvx.f +++ b/SRC/zspsvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, * LDX, RCOND, FERR, BERR, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPSVX uses the diagonal pivoting factorization A = U*D*U**T or *> A = L*D*L**T to compute the solution to a complex system of linear @@ -46,9 +46,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -72,11 +75,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -238,10 +240,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -252,10 +253,9 @@ * *> \ingroup complex16OTHERsolve * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The packed storage scheme is illustrated by the following example @@ -271,7 +271,6 @@ *> Packed storage of the upper triangle of A: *> *> AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ] -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zsptrf.f b/SRC/zsptrf.f index 2cbb295..74d5f49 100644 --- a/SRC/zsptrf.f +++ b/SRC/zsptrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPTRF( UPLO, N, AP, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPTRF computes the factorization of a complex symmetric matrix A *> stored in packed format using the Bunch-Kaufman diagonal pivoting @@ -44,11 +44,10 @@ *> where U (or L) is a product of permutation and unit upper (lower) *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -114,10 +112,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> 5-96 - Based on modifications by J. Lewis, Boeing Computer Services @@ -156,7 +153,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zsptri.f b/SRC/zsptri.f index 4400a3f..64a3973 100644 --- a/SRC/zsptri.f +++ b/SRC/zsptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPTRI( UPLO, N, AP, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPTRI computes the inverse of a complex symmetric indefinite matrix *> A in packed storage using the factorization A = U*D*U**T or *> A = L*D*L**T computed by ZSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsptrs.f b/SRC/zsptrs.f index b36222d..d81ac74 100644 --- a/SRC/zsptrs.f +++ b/SRC/zsptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSPTRS solves a system of linear equations A*X = B with a complex *> symmetric matrix A stored in packed format using the factorization *> A = U*D*U**T or A = L*D*L**T computed by ZSPTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -100,10 +99,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/SRC/zstedc.f b/SRC/zstedc.f index 88c6d32..25a4897 100644 --- a/SRC/zstedc.f +++ b/SRC/zstedc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK, * LRWORK, IWORK, LIWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTEDC computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the divide and conquer method. @@ -49,11 +49,10 @@ *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. *> It could conceivably fail on hexadecimal or decimal machines *> without guard digits, but we know of none. See DLAED3 for details. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -191,10 +190,9 @@ *> working on the submatrix lying in rows and columns *> INFO/(N+1) through mod(INFO,N+1). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -205,18 +203,12 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Jeff Rutter, Computer Science Division, University of California -*> at Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Jeff Rutter, Computer Science Division, University of California +*> at Berkeley, USA +* * ===================================================================== SUBROUTINE ZSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK, $ LRWORK, IWORK, LIWORK, INFO ) diff --git a/SRC/zstegr.f b/SRC/zstegr.f index c8e61ae..2231389 100644 --- a/SRC/zstegr.f +++ b/SRC/zstegr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, @@ -33,11 +33,11 @@ * COMPLEX*16 Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTEGR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -59,11 +59,10 @@ *> NaNs. Normal execution may create these exceptiona values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -232,10 +231,9 @@ *> the nonzero error code returned by DLARRE or *> ZLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -246,19 +244,13 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Inderjit Dhillon, IBM Almaden, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, LBNL/NERSC, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Inderjit Dhillon, IBM Almaden, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, LBNL/NERSC, USA \n +* * ===================================================================== SUBROUTINE ZSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK, diff --git a/SRC/zstein.f b/SRC/zstein.f index 894b56c..a4b20e4 100644 --- a/SRC/zstein.f +++ b/SRC/zstein.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK, * IWORK, IFAIL, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTEIN computes the eigenvectors of a real symmetric tridiagonal *> matrix T corresponding to specified eigenvalues, using inverse @@ -49,11 +49,10 @@ *> transformation to the eigenvectors of a complex Hermitian matrix *> which was reduced to tridiagonal form. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -153,10 +152,12 @@ *> > 0: if INFO = i, then i eigenvectors failed to converge *> in MAXITS iterations. Their indices are stored in *> array IFAIL. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> MAXITS INTEGER, default = 5 *> The maximum number of iterations performed. *> @@ -164,10 +165,9 @@ *> The number of iterations performed after norm growth *> criterion is satisfied, should be at least 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zstemr.f b/SRC/zstemr.f index 233aa44..a576d5e 100644 --- a/SRC/zstemr.f +++ b/SRC/zstemr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, * M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, @@ -34,11 +34,11 @@ * COMPLEX*16 Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTEMR computes selected eigenvalues and, optionally, eigenvectors *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has @@ -107,11 +107,10 @@ *> Since LAPACK drivers overwrite the matrix data with the eigenvectors, *> ZSTEMR accepts complex workspace to facilitate interoperability *> with ZUNMTR or ZUPMTR. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBZ *> \verbatim @@ -303,10 +302,9 @@ *> the nonzero error code returned by DLARRE or *> ZLARRV, respectively. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -317,21 +315,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Beresford Parlett, University of California, Berkeley, USA -*> Jim Demmel, University of California, Berkeley, USA -*> Inderjit Dhillon, University of Texas, Austin, USA -*> Osni Marques, LBNL/NERSC, USA -*> Christof Voemel, University of California, Berkeley, USA -*> -*> \endverbatim +*> \par Contributors: +* ================== *> +*> Beresford Parlett, University of California, Berkeley, USA \n +*> Jim Demmel, University of California, Berkeley, USA \n +*> Inderjit Dhillon, University of Texas, Austin, USA \n +*> Osni Marques, LBNL/NERSC, USA \n +*> Christof Voemel, University of California, Berkeley, USA \n +* * ===================================================================== SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, $ M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, diff --git a/SRC/zsteqr.f b/SRC/zsteqr.f index 30557d7..30c7c36 100644 --- a/SRC/zsteqr.f +++ b/SRC/zsteqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) * @@ -29,22 +29,21 @@ * COMPLEX*16 Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSTEQR computes all eigenvalues and, optionally, eigenvectors of a *> symmetric tridiagonal matrix using the implicit QL or QR method. *> The eigenvectors of a full or band complex Hermitian matrix can also *> be found if ZHETRD or ZHPTRD or ZHBTRD has been used to reduce this *> matrix to tridiagonal form. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPZ *> \verbatim @@ -117,10 +116,9 @@ *> matrix which is unitarily similar to the original *> matrix. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsycon.f b/SRC/zsycon.f index 6146b0b..ca325c7 100644 --- a/SRC/zsycon.f +++ b/SRC/zsycon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYCON estimates the reciprocal of the condition number (in the *> 1-norm) of a complex symmetric matrix A using the factorization @@ -43,11 +43,10 @@ *> *> An estimate is obtained for norm(inv(A)), and the reciprocal of the *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -109,10 +108,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/SRC/zsyconv.f b/SRC/zsyconv.f index 5711212..d116ccb 100644 --- a/SRC/zsyconv.f +++ b/SRC/zsyconv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYCONV converts A given by ZHETRF into L and D or vice-versa. *> Get nondiagonal elements of D (returned in workspace) and *> apply or reverse permutation done in TRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -97,10 +96,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/SRC/zsyequb.f b/SRC/zsyequb.f index 2d4a45d..a0b4c56 100644 --- a/SRC/zsyequb.f +++ b/SRC/zsyequb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * @@ -30,11 +30,11 @@ * DOUBLE PRECISION S( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYEQUB computes row and column scalings intended to equilibrate a *> symmetric matrix A and reduce its condition number @@ -44,11 +44,10 @@ *> choice of S puts the condition number of B within a factor N of the *> smallest possible condition number over all possible diagonal *> scalings. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -113,10 +112,9 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value *> > 0: if INFO = i, the i-th diagonal element is nonpositive. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -127,19 +125,14 @@ * *> \ingroup complex16SYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par References: +* ================ *> -*> Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization", -*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. -*> DOI 10.1023/B:NUMA.0000016606.32820.69 +*> Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n +*> Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n +*> DOI 10.1023/B:NUMA.0000016606.32820.69 \n *> Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO ) * diff --git a/SRC/zsymv.f b/SRC/zsymv.f index 03d9567..858e7a0 100644 --- a/SRC/zsymv.f +++ b/SRC/zsymv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), X( * ), Y( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYMV performs the matrix-vector operation *> @@ -41,11 +41,10 @@ *> *> where alpha and beta are scalars, x and y are n element vectors and *> A is an n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -142,10 +141,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/SRC/zsyr.f b/SRC/zsyr.f index adb4be3..2f02d1c 100644 --- a/SRC/zsyr.f +++ b/SRC/zsyr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYR( UPLO, N, ALPHA, X, INCX, A, LDA ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), X( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYR performs the symmetric rank 1 operation *> @@ -41,11 +41,10 @@ *> *> where alpha is a complex scalar, x is an n element vector and A is an *> n by n symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -120,10 +119,9 @@ *> max( 1, N ). *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsyrfs.f b/SRC/zsyrfs.f index 2ed039d..1d12340 100644 --- a/SRC/zsyrfs.f +++ b/SRC/zsyrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB, * X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -32,20 +32,19 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYRFS improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and *> provides error bounds and backward error estimates for the solution. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -168,16 +167,17 @@ *> INFO is INTEGER *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> ITMAX is the maximum number of steps of iterative refinement. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsyrfsx.f b/SRC/zsyrfsx.f index ae66d58..0f72a2e 100644 --- a/SRC/zsyrfsx.f +++ b/SRC/zsyrfsx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV, * S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYRFSX improves the computed solution to a system of linear *> equations when the coefficient matrix is symmetric indefinite, and @@ -57,11 +55,10 @@ *> before calling this routine, as described by arguments EQUED and S *> below. In this case, the solution and error bounds returned are *> for the original unequilibrated system. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -386,10 +383,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsysv.f b/SRC/zsysv.f index 5e9270f..27ea908 100644 --- a/SRC/zsysv.f +++ b/SRC/zsysv.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, * LWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYSV computes the solution to a complex system of linear equations *> A * X = B, @@ -48,11 +48,10 @@ *> triangular matrices, and D is symmetric and block diagonal with *> 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then *> used to solve the system of equations A * X = B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -155,10 +154,9 @@ *> has been completed, but the block diagonal matrix D is *> exactly singular, so the solution could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsysvx.f b/SRC/zsysvx.f index addd8fe..38f0bc7 100644 --- a/SRC/zsysvx.f +++ b/SRC/zsysvx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, * LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK, @@ -34,11 +34,11 @@ * $ WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYSVX uses the diagonal pivoting factorization to compute the *> solution to a complex system of linear equations A * X = B, @@ -47,9 +47,12 @@ *> *> Error bounds on the solution and a condition estimate are also *> provided. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -74,11 +77,10 @@ *> 4. Iterative refinement is applied to improve the computed solution *> matrix and calculate error bounds and backward error estimates *> for it. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] FACT *> \verbatim @@ -265,10 +267,9 @@ *> computed solution can be more accurate than the *> value of RCOND would suggest. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsysvxx.f b/SRC/zsysvxx.f index 0394fee..dd56bb0 100644 --- a/SRC/zsysvxx.f +++ b/SRC/zsysvxx.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, * EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR, @@ -38,13 +38,11 @@ * $ ERR_BNDS_COMP( NRHS, * ), RWORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim -*> Purpose -*> ======= +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYSVXX uses the diagonal pivoting factorization to compute the *> solution to a complex*16 system of linear equations A * X = B, where @@ -65,9 +63,12 @@ *> errors or warnings, but we cannot make that claim for general *> user-provided factorizations and equilibration factors if they *> differ from what ZSYSVXX would itself produce. +*> \endverbatim +* +*> \par Description: +* ================= *> -*> Description -*> =========== +*> \verbatim *> *> The following steps are performed: *> @@ -108,11 +109,10 @@ *> 6. If equilibration was used, the matrix X is premultiplied by *> diag(R) so that it solves the original system before *> equilibration. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \verbatim *> Some optional parameters are bundled in the PARAMS array. These @@ -487,10 +487,9 @@ *> about all of the right-hand sides check ERR_BNDS_NORM or *> ERR_BNDS_COMP. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsyswapr.f b/SRC/zsyswapr.f index dc24302..0f912e1 100644 --- a/SRC/zsyswapr.f +++ b/SRC/zsyswapr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYSWAPR( UPLO, N, A, LDA, I1, I2) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * COMPLEX*16 A( LDA, N ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYSWAPR applies an elementary permutation on the rows and the columns of *> a symmetric matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -87,10 +86,9 @@ *> I2 is INTEGER *> Index of the second row to swap *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsytf2.f b/SRC/zsytf2.f index 225b676..73865b4 100644 --- a/SRC/zsytf2.f +++ b/SRC/zsytf2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTF2 computes the factorization of a complex symmetric matrix A *> using the Bunch-Kaufman diagonal pivoting method: @@ -45,11 +45,10 @@ *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the unblocked version of the algorithm, calling Level 2 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -110,10 +109,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -124,22 +122,10 @@ * *> \ingroup complex16SYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Further Details: +* ===================== *> -*> 09-29-06 - patch from -*> Bobby Cheng, MathWorks -*> -*> Replace l.209 and l.377 -*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN -*> by -*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN -*> -*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services -*> Company +*> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where *> U = P(n)*U(n)* ... *P(k)U(k)* ..., @@ -174,9 +160,25 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim +* +*> \par Contributors: +* ================== +*> +*> \verbatim +*> +*> 09-29-06 - patch from +*> Bobby Cheng, MathWorks *> +*> Replace l.209 and l.377 +*> IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN +*> by +*> IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN +*> +*> 1-96 - Based on modifications by J. Lewis, Boeing Computer Services +*> Company +*> \endverbatim +* * ===================================================================== SUBROUTINE ZSYTF2( UPLO, N, A, LDA, IPIV, INFO ) * diff --git a/SRC/zsytrf.f b/SRC/zsytrf.f index dd20645..c6ff3d3 100644 --- a/SRC/zsytrf.f +++ b/SRC/zsytrf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTRF computes the factorization of a complex symmetric matrix A *> using the Bunch-Kaufman diagonal pivoting method. The form of the @@ -46,11 +46,10 @@ *> with 1-by-1 and 2-by-2 diagonal blocks. *> *> This is the blocked version of the algorithm, calling Level 3 BLAS. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -127,10 +126,9 @@ *> exactly singular, and division by zero will occur if it *> is used to solve a system of equations. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -141,10 +139,9 @@ * *> \ingroup complex16SYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> If UPLO = 'U', then A = U*D*U**T, where @@ -180,7 +177,6 @@ *> If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). *> If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), *> and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zsytri.f b/SRC/zsytri.f index 09cbb2c..31c46cc 100644 --- a/SRC/zsytri.f +++ b/SRC/zsytri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTRI computes the inverse of a complex symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> ZSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -99,10 +98,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsytri2.f b/SRC/zsytri2.f index dc8decb..150bac7 100644 --- a/SRC/zsytri2.f +++ b/SRC/zsytri2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO ) * @@ -29,21 +29,20 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTRI2 computes the inverse of a COMPLEX*16 hermitian indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> ZSYTRF. ZSYTRI2 sets the LEADING DIMENSION of the workspace *> before calling ZSYTRI2X that actually computes the inverse. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -112,10 +111,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsytri2x.f b/SRC/zsytri2x.f index 8345683..b03bcfd 100644 --- a/SRC/zsytri2x.f +++ b/SRC/zsytri2x.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), WORK( N+NB+1,* ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTRI2X computes the inverse of a complex symmetric indefinite matrix *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by *> ZSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -105,10 +104,9 @@ *> > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its *> inverse could not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zsytrs.f b/SRC/zsytrs.f index 646b426..a7ec1e5 100644 --- a/SRC/zsytrs.f +++ b/SRC/zsytrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * @@ -29,20 +29,19 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTRS solves a system of linear equations A*X = B with a complex *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by ZSYTRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/zsytrs2.f b/SRC/zsytrs2.f index 81dd04f..38fbf0c 100644 --- a/SRC/zsytrs2.f +++ b/SRC/zsytrs2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, * WORK, INFO ) @@ -30,20 +30,19 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZSYTRS2 solves a system of linear equations A*X = B with a real *> symmetric matrix A using the factorization A = U*D*U**T or *> A = L*D*L**T computed by ZSYTRF and converted by ZSYCONV. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -111,10 +110,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/SRC/ztbcon.f b/SRC/ztbcon.f index 60df906..8fd8240 100644 --- a/SRC/ztbcon.f +++ b/SRC/ztbcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK, * RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AB( LDAB, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBCON estimates the reciprocal of the condition number of a *> triangular band matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -127,10 +126,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/SRC/ztbrfs.f b/SRC/ztbrfs.f index 83a201f..2e4dfea 100644 --- a/SRC/ztbrfs.f +++ b/SRC/ztbrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular band @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by ZTBTRS or some other *> means before entering this routine. ZTBRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -172,10 +171,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/SRC/ztbtrs.f b/SRC/ztbtrs.f index be0745a..3bc721a 100644 --- a/SRC/ztbtrs.f +++ b/SRC/ztbtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, * LDB, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 AB( LDAB, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTBTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular band matrix of order N, and B is an *> N-by-NRHS matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -130,10 +129,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ztfsm.f b/SRC/ztfsm.f index 1e1f00e..79c5607 100644 --- a/SRC/ztfsm.f +++ b/SRC/ztfsm.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A, * B, LDB ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( 0: * ), B( 0: LDB-1, 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> Level 3 BLAS like routine for A in RFP Format. *> @@ -50,11 +50,10 @@ *> A is in Rectangular Full Packed (RFP) Format. *> *> The matrix X is overwritten on B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -174,10 +173,9 @@ *> max( 1, m ). *> Unchanged on exit. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -188,10 +186,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -295,7 +292,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztftri.f b/SRC/ztftri.f index f94c530..d6cf097 100644 --- a/SRC/ztftri.f +++ b/SRC/ztftri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX*16 A( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTFTRI computes the inverse of a triangular matrix A stored in RFP *> format. *> *> This is a Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -98,10 +97,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -112,10 +110,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -219,7 +216,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztfttp.f b/SRC/ztfttp.f index d19432f..2762320 100644 --- a/SRC/ztfttp.f +++ b/SRC/ztfttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTFTTP( TRANSR, UPLO, N, ARF, AP, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX*16 AP( 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTFTTP copies a triangular matrix A from rectangular full packed *> format (TF) to standard packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -85,10 +84,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 @@ -99,10 +97,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -206,7 +203,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztfttr.f b/SRC/ztfttr.f index 43a9c0b..45e1fc1 100644 --- a/SRC/ztfttr.f +++ b/SRC/ztfttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX*16 A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTFTTR copies a triangular matrix A from rectangular full packed *> format (TF) to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -93,10 +92,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 @@ -107,10 +105,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -214,7 +211,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztgevc.f b/SRC/ztgevc.f index 3787015..426f7cd 100644 --- a/SRC/ztgevc.f +++ b/SRC/ztgevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL, * LDVL, VR, LDVR, MM, M, WORK, RWORK, INFO ) @@ -33,11 +33,11 @@ * .. * * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGEVC computes some or all of the right and/or left eigenvectors of *> a pair of complex matrices (S,P), where S and P are upper triangular. @@ -63,11 +63,10 @@ *> If Q and Z are the unitary factors from the generalized Schur *> factorization of a matrix pair (A,B), then Z*X and Q*Y *> are the matrices of right and left eigenvectors of (A,B). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -203,10 +202,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/SRC/ztgex2.f b/SRC/ztgex2.f index 3eea8c6..0716914 100644 --- a/SRC/ztgex2.f +++ b/SRC/ztgex2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, J1, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22) *> in an upper triangular matrix pair (A, B) by an unitary equivalence @@ -49,11 +49,10 @@ *> Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H *> Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -145,10 +144,9 @@ *> from generalized Schur form; the problem is ill- *> conditioned. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -159,26 +157,28 @@ * *> \ingroup complex16GEauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim -*> -*> Based on contributions by -*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, -*> Umea University, S-901 87 Umea, Sweden. +*> \par Further Details: +* ===================== *> *> In the current code both weak and strong stability tests are *> performed. The user can omit the strong stability test by changing *> the internal logical parameter WANDS to .FALSE.. See ref. [2] for *> details. +* +*> \par Contributors: +* ================== +*> +*> Bo Kagstrom and Peter Poromaa, Department of Computing Science, +*> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> +*> \n *> [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified *> Eigenvalues of a Regular Matrix Pair (A, B) and Condition *> Estimation: Theory, Algorithms and Software, Report UMINF-94.04, @@ -186,8 +186,6 @@ *> Sweden, 1994. Also as LAPACK Working Note 87. To appear in *> Numerical Algorithms, 1996. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, $ LDZ, J1, INFO ) diff --git a/SRC/ztgexc.f b/SRC/ztgexc.f index 65905b6..acc814a 100644 --- a/SRC/ztgexc.f +++ b/SRC/ztgexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, * LDZ, IFST, ILST, INFO ) @@ -30,11 +30,11 @@ * $ Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGEXC reorders the generalized Schur decomposition of a complex *> matrix pair (A,B), using an unitary equivalence transformation @@ -49,11 +49,10 @@ *> *> Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H *> Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] WANTQ *> \verbatim @@ -155,10 +154,9 @@ *> and ILST points to the first row of the current *> position of the block being moved. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -169,28 +167,27 @@ * *> \ingroup complex16GEcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> +*> \n *> [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified *> Eigenvalues of a Regular Matrix Pair (A, B) and Condition *> Estimation: Theory, Algorithms and Software, Report *> UMINF - 94.04, Department of Computing Science, Umea University, *> S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87. *> To appear in Numerical Algorithms, 1996. -*> +*> \n *> [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the *> Separation between Regular Matrix Pairs, Report UMINF - 93.23, @@ -199,8 +196,6 @@ *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, *> 1996. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, $ LDZ, IFST, ILST, INFO ) diff --git a/SRC/ztgsen.f b/SRC/ztgsen.f index 6645544..2836175 100644 --- a/SRC/ztgsen.f +++ b/SRC/ztgsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB, * ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF, @@ -36,11 +36,11 @@ * $ BETA( * ), Q( LDQ, * ), WORK( * ), Z( LDZ, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGSEN reorders the generalized Schur decomposition of a complex *> matrix pair (A, B) (in terms of an unitary equivalence trans- @@ -65,11 +65,10 @@ *> and norms of "projections" onto left and right eigenspaces w.r.t. *> the selected cluster in the (1,1)-block. *> -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] IJOB *> \verbatim @@ -282,10 +281,9 @@ *> (A, B) may have been partially reordered. *> If requested, 0 is returned in DIF(*), PL and PR. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -296,10 +294,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> ZTGSEN first collects the selected eigenvalues by computing unitary @@ -400,26 +397,29 @@ *> based estimate DIF is not wanted (see ZLATDF), then the parameter *> IDIFJB (see below) should be changed from 3 to 4 (routine ZLATDF *> (IJOB = 2 will be used)). See ZTGSYL for more details. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> References -*> ========== +* +*> \par References: +* ================ *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in *> M.S. Moonen et al (eds), Linear Algebra for Large Scale and *> Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. -*> +*> \n *> [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified *> Eigenvalues of a Regular Matrix Pair (A, B) and Condition *> Estimation: Theory, Algorithms and Software, Report *> UMINF - 94.04, Department of Computing Science, Umea University, *> S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87. *> To appear in Numerical Algorithms, 1996. -*> +*> \n *> [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the *> Separation between Regular Matrix Pairs, Report UMINF - 93.23, @@ -428,8 +428,6 @@ *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, *> 1996. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB, $ ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF, diff --git a/SRC/ztgsja.f b/SRC/ztgsja.f index 7567e9d..7fa0bc6 100644 --- a/SRC/ztgsja.f +++ b/SRC/ztgsja.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B, * LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV, @@ -34,11 +34,11 @@ * $ U( LDU, * ), V( LDV, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGSJA computes the generalized singular value decomposition (GSVD) *> of two complex upper triangular (or trapezoidal) matrices A and B. @@ -124,11 +124,10 @@ *> The computation of the unitary transformation matrices U, V or Q *> is optional. These matrices may either be formed explicitly, or they *> may be postmultiplied into input matrices U1, V1, or Q1. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU *> \verbatim @@ -332,19 +331,20 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument had an illegal value. *> = 1: the procedure does not converge after MAXIT cycles. +*> \endverbatim +* +*> \par Internal Parameters: +* ========================= *> -*> Internal Parameters -*> =================== -*> +*> \verbatim *> MAXIT INTEGER *> MAXIT specifies the total loops that the iterative procedure *> may take. If after MAXIT cycles, the routine fails to *> converge, we return INFO = 1. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -355,10 +355,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> ZTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce @@ -373,7 +372,6 @@ *> C1**2 + S1**2 = I, *> *> and R1 is an L-by-L nonsingular upper triangular matrix. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztgsna.f b/SRC/ztgsna.f index fa9cb87..21394be 100644 --- a/SRC/ztgsna.f +++ b/SRC/ztgsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL, * LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK, @@ -34,22 +34,21 @@ * $ VR( LDVR, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or eigenvectors of a matrix pair (A, B). *> *> (A, B) must be in generalized Schur canonical form, that is, A and *> B are both upper triangular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -205,10 +204,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 @@ -219,10 +217,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of the i-th generalized @@ -275,13 +272,18 @@ *> EPS * norm(A, B) / DIF(i). *> *> See ref. [2-3] for more details and further references. +*> \endverbatim +* +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> -*> References -*> ========== +*> \verbatim *> *> [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the *> Generalized Real Schur Form of a Regular Matrix Pair (A, B), in @@ -302,7 +304,6 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. *> To appear in ACM Trans. on Math. Software, Vol 22, No 1, 1996. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztgsy2.f b/SRC/ztgsy2.f index 2a85b8a..1717e7f 100644 --- a/SRC/ztgsy2.f +++ b/SRC/ztgsy2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, @@ -32,11 +32,11 @@ * $ D( LDD, * ), E( LDE, * ), F( LDF, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGSY2 solves the generalized Sylvester equation *> @@ -73,11 +73,10 @@ *> of an upper bound on the separation between to matrix pairs. Then *> the input (A, D), (B, E) are sub-pencils of two matrix pairs in *> ZTGSYL. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -236,10 +235,9 @@ *> >0: The matrix pairs (A, D) and (B, E) have common or very *> close eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -250,18 +248,12 @@ * *> \ingroup complex16SYauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. -*> -*> \endverbatim -*> +* * ===================================================================== SUBROUTINE ZTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, $ LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL, diff --git a/SRC/ztgsyl.f b/SRC/ztgsyl.f index da509d6..416387b 100644 --- a/SRC/ztgsyl.f +++ b/SRC/ztgsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, * LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK, @@ -35,11 +35,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTGSYL solves the generalized Sylvester equation: *> @@ -79,11 +79,10 @@ *> reciprocal of the smallest singular value of Z. *> *> This is a level-3 BLAS algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -252,10 +251,9 @@ *> >0: (A, D) and (B, E) have common or very close *> eigenvalues. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -266,15 +264,14 @@ * *> \ingroup complex16SYcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> Bo Kagstrom and Peter Poromaa, Department of Computing Science, *> Umea University, S-901 87 Umea, Sweden. +* +*> \par References: +* ================ *> *> [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software *> for Solving the Generalized Sylvester Equation and Estimating the @@ -283,18 +280,16 @@ *> Sweden, December 1993, Revised April 1994, Also as LAPACK Working *> Note 75. To appear in ACM Trans. on Math. Software, Vol 22, *> No 1, 1996. -*> +*> \n *> [2] B. Kagstrom, A Perturbation Analysis of the Generalized Sylvester *> Equation (AR - LB, DR - LE ) = (C, F), SIAM J. Matrix Anal. *> Appl., 15(4):1045-1060, 1994. -*> +*> \n *> [3] B. Kagstrom and L. Westin, Generalized Schur Methods with *> Condition Estimators for Solving the Generalized Sylvester *> Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7, *> July 1989, pp 745-751. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D, $ LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK, diff --git a/SRC/ztpcon.f b/SRC/ztpcon.f index df13fa4..cabb219 100644 --- a/SRC/ztpcon.f +++ b/SRC/ztpcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, RWORK, * INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 AP( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPCON estimates the reciprocal of the condition number of a packed *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -114,10 +113,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/SRC/ztpmqrt.f b/SRC/ztpmqrt.f index 116d8eb..809fb8e 100644 --- a/SRC/ztpmqrt.f +++ b/SRC/ztpmqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT, * A, LDA, B, LDB, WORK, INFO ) @@ -30,20 +30,19 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPMQRT applies a complex orthogonal matrix Q obtained from a *> "triangular-pentagonal" complex block reflector H to a general *> complex matrix C, which consists of two blocks A and B. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -167,10 +166,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 @@ -181,10 +179,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The columns of the pentagonal matrix V contain the elementary reflectors @@ -213,7 +210,6 @@ *> If TRANS='N' and SIDE='R', C is on exit replaced with C * Q. *> *> If TRANS='C' and SIDE='R', C is on exit replaced with C * Q**H. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztpqrt.f b/SRC/ztpqrt.f index ae9d23c..f2b1eba 100644 --- a/SRC/ztpqrt.f +++ b/SRC/ztpqrt.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK, * INFO ) @@ -28,21 +28,20 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPQRT computes a blocked QR factorization of a complex *> "triangular-pentagonal" matrix C, which is composed of a *> triangular block A and pentagonal block B, using the compact *> WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -124,10 +123,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 @@ -138,11 +136,11 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim +*> *> The input matrix C is a (N+M)-by-N matrix *> *> C = [ A ] @@ -185,7 +183,6 @@ *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = [T1 T2 ... TB]. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztpqrt2.f b/SRC/ztpqrt2.f index 44aaf9d..ec9ac11 100644 --- a/SRC/ztpqrt2.f +++ b/SRC/ztpqrt2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) * @@ -27,20 +27,19 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPQRT2 computes a QR factorization of a complex "triangular-pentagonal" *> matrix C, which is composed of a triangular block A and pentagonal block B, *> using the compact WY representation for Q. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -111,10 +110,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 @@ -125,10 +123,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The input matrix C is a (N+M)-by-N matrix @@ -171,7 +168,6 @@ *> *> where W**H is the conjugate transpose of W and T is the upper triangular *> factor of the block reflector. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztprfb.f b/SRC/ztprfb.f index bce429b..7f46d9c 100644 --- a/SRC/ztprfb.f +++ b/SRC/ztprfb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, * V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK ) @@ -30,20 +30,20 @@ * $ V( LDV, * ), WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPRFB applies a complex "triangular-pentagonal" block reflector H or its *> conjugate transpose H**H to a complex matrix C, which is composed of two *> blocks A and B, either from the left or right. *> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -185,10 +185,9 @@ *> If SIDE = 'L', LDWORK >= K; *> if SIDE = 'R', LDWORK >= M. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -199,10 +198,9 @@ * *> \ingroup complex16OTHERauxiliary * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The matrix C is a composite matrix formed from blocks A and B. @@ -247,7 +245,6 @@ *> If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L. *> *> If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztprfs.f b/SRC/ztprfs.f index 961caf4..1e143d0 100644 --- a/SRC/ztprfs.f +++ b/SRC/ztprfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, * FERR, BERR, WORK, RWORK, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ), WORK( * ), X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular packed @@ -43,11 +43,10 @@ *> The solution matrix X must be computed by ZTPTRS or some other *> means before entering this routine. ZTPRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -158,10 +157,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/SRC/ztptri.f b/SRC/ztptri.f index 3f03982..f8d5e31 100644 --- a/SRC/ztptri.f +++ b/SRC/ztptri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPTRI( UPLO, DIAG, N, AP, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX*16 AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPTRI computes the inverse of a complex upper or lower triangular *> matrix A stored in packed format. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -83,10 +82,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley @@ -97,10 +95,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> A triangular matrix A can be transferred to packed storage using one @@ -115,7 +112,6 @@ *> 1 CONTINUE 1 CONTINUE *> JC = JC + J JC = JC + N - J + 1 *> 2 CONTINUE 2 CONTINUE -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztptrs.f b/SRC/ztptrs.f index ab2581e..24312dd 100644 --- a/SRC/ztptrs.f +++ b/SRC/ztptrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AP( * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> where A is a triangular matrix of order N stored in packed format, *> and B is an N-by-NRHS matrix. A check is made to verify that A is *> nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -115,10 +114,9 @@ *> indicating that the matrix is singular and the *> solutions X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ztpttf.f b/SRC/ztpttf.f index d25082d..9e22370 100644 --- a/SRC/ztpttf.f +++ b/SRC/ztpttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) * @@ -27,19 +27,18 @@ * .. Array Arguments .. * COMPLEX*16 AP( 0: * ), ARF( 0: * ) * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPTTF copies a triangular matrix A from standard packed format (TP) *> to rectangular full packed format (TF). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -84,10 +83,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 @@ -98,10 +96,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -205,7 +202,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztpttr.f b/SRC/ztpttr.f index 1b77741..70e99ab 100644 --- a/SRC/ztpttr.f +++ b/SRC/ztpttr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTPTTR( UPLO, N, AP, A, LDA, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX*16 A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTPTTR copies a triangular matrix A from standard packed format (TP) *> to standard full format (TR). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/ztrcon.f b/SRC/ztrcon.f index 8684223..469914a 100644 --- a/SRC/ztrcon.f +++ b/SRC/ztrcon.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK, * RWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 A( LDA, * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRCON estimates the reciprocal of the condition number of a *> triangular matrix A, in either the 1-norm or the infinity-norm. @@ -44,11 +44,10 @@ *> norm(inv(A)), then the reciprocal of the condition number is *> computed as *> RCOND = 1 / ( norm(A) * norm(inv(A)) ). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] NORM *> \verbatim @@ -121,10 +120,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/SRC/ztrevc.f b/SRC/ztrevc.f index 40a41c9..f41ddef 100644 --- a/SRC/ztrevc.f +++ b/SRC/ztrevc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, MM, M, WORK, RWORK, INFO ) @@ -32,11 +32,11 @@ * $ WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTREVC computes some or all of the right and/or left eigenvectors of *> a complex upper triangular matrix T. @@ -57,11 +57,10 @@ *> input matrix. If Q is the unitary factor that reduces a matrix A to *> Schur form T, then Q*X and Q*Y are the matrices of right and left *> eigenvectors of A. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \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 @@ -202,10 +200,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The algorithm used in this program is basically backward (forward) @@ -215,7 +212,6 @@ *> Each eigenvector is normalized so that the element of largest *> magnitude has magnitude 1; here the magnitude of a complex number *> (x,y) is taken to be |x| + |y|. -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztrexc.f b/SRC/ztrexc.f index aa5e8e7..a8f1df9 100644 --- a/SRC/ztrexc.f +++ b/SRC/ztrexc.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 Q( LDQ, * ), T( LDT, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTREXC reorders the Schur factorization of a complex matrix *> A = Q*T*Q**H, so that the diagonal element of T with row index IFST @@ -41,11 +41,10 @@ *> The Schur form T is reordered by a unitary similarity transformation *> Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by *> postmultplying it with Z. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] COMPQ *> \verbatim @@ -109,10 +108,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/SRC/ztrrfs.f b/SRC/ztrrfs.f index c6b5f5e..7167b3d 100644 --- a/SRC/ztrrfs.f +++ b/SRC/ztrrfs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, * LDX, FERR, BERR, WORK, RWORK, INFO ) @@ -31,11 +31,11 @@ * $ X( LDX, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRRFS provides error bounds and backward error estimates for the *> solution to a system of linear equations with a triangular @@ -44,11 +44,10 @@ *> The solution matrix X must be computed by ZTRTRS or some other *> means before entering this routine. ZTRRFS does not do iterative *> refinement because doing so cannot improve the backward error. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -166,10 +165,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/SRC/ztrsen.f b/SRC/ztrsen.f index be3e73d..3e9ad12 100644 --- a/SRC/ztrsen.f +++ b/SRC/ztrsen.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, W, M, S, * SEP, WORK, LWORK, INFO ) @@ -31,11 +31,11 @@ * COMPLEX*16 Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRSEN reorders the Schur factorization of a complex matrix *> A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in @@ -45,11 +45,10 @@ *> *> Optionally the routine computes the reciprocal condition numbers of *> the cluster of eigenvalues and/or the invariant subspace. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -174,10 +173,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 @@ -188,10 +186,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> ZTRSEN first collects the selected eigenvalues by computing a unitary @@ -261,7 +258,6 @@ *> error in the computed right invariant subspace is *> *> EPS * norm(T) / SEP -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztrsna.f b/SRC/ztrsna.f index ee3222f..c315452 100644 --- a/SRC/ztrsna.f +++ b/SRC/ztrsna.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, * LDVR, S, SEP, MM, M, WORK, LDWORK, RWORK, @@ -33,20 +33,19 @@ * $ WORK( LDWORK, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRSNA estimates reciprocal condition numbers for specified *> eigenvalues and/or right eigenvectors of a complex upper triangular *> matrix T (or of any matrix Q*T*Q**H with Q unitary). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOB *> \verbatim @@ -189,10 +188,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 @@ -203,10 +201,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The reciprocal of the condition number of an eigenvalue lambda is @@ -245,7 +242,6 @@ *> is given by *> *> EPS * norm(T) / SEP(i) -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztrsyl.f b/SRC/ztrsyl.f index d450a88..32d0394 100644 --- a/SRC/ztrsyl.f +++ b/SRC/ztrsyl.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, * LDC, SCALE, INFO ) @@ -30,11 +30,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRSYL solves the complex Sylvester matrix equation: *> @@ -45,11 +45,10 @@ *> M-by-M and B is N-by-N; the right hand side C and the solution X are *> M-by-N; and scale is an output scale factor, set <= 1 to avoid *> overflow in X. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANA *> \verbatim @@ -141,10 +140,9 @@ *> values were used to solve the equation (but the matrices *> A and B are unchanged). *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ztrti2.f b/SRC/ztrti2.f index 79710a6..a4ee646 100644 --- a/SRC/ztrti2.f +++ b/SRC/ztrti2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRTI2( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRTI2 computes the inverse of a complex upper or lower triangular *> matrix. *> *> This is the Level 2 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -95,10 +94,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/SRC/ztrtri.f b/SRC/ztrtri.f index 198be21..37f4037 100644 --- a/SRC/ztrtri.f +++ b/SRC/ztrtri.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRTRI( UPLO, DIAG, N, A, LDA, INFO ) * @@ -28,21 +28,20 @@ * COMPLEX*16 A( LDA, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRTRI computes the inverse of a complex upper or lower triangular *> matrix A. *> *> This is the Level 3 BLAS version of the algorithm. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -94,10 +93,9 @@ *> > 0: if INFO = i, A(i,i) is exactly zero. The triangular *> matrix is singular and its inverse can not be computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ztrtrs.f b/SRC/ztrtrs.f index 696a579..860e24d 100644 --- a/SRC/ztrtrs.f +++ b/SRC/ztrtrs.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, * INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRTRS solves a triangular system of the form *> @@ -41,11 +41,10 @@ *> *> where A is a triangular matrix of order N, and B is an N-by-NRHS *> matrix. A check is made to verify that A is nonsingular. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -124,10 +123,9 @@ *> indicating that the matrix is singular and the solutions *> X have not been computed. *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/ztrttf.f b/SRC/ztrttf.f index 7e8cf0b..d523365 100644 --- a/SRC/ztrttf.f +++ b/SRC/ztrttf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX*16 A( 0: LDA-1, 0: * ), ARF( 0: * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRTTF copies a triangular matrix A from standard full format (TR) *> to rectangular full packed format (TF) . -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANSR *> \verbatim @@ -93,10 +92,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 @@ -107,10 +105,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> We first consider Standard Packed Format when N is even. @@ -214,7 +211,6 @@ *> 03 13 23 33 11 33 11 21 31 41 51 *> -- -- -- -- -- -- -- -- -- *> 04 14 24 34 44 43 44 22 32 42 52 -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztrttp.f b/SRC/ztrttp.f index f12a1ac..44daa31 100644 --- a/SRC/ztrttp.f +++ b/SRC/ztrttp.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTRTTP( UPLO, N, A, LDA, AP, INFO ) * @@ -28,19 +28,18 @@ * COMPLEX*16 A( LDA, * ), AP( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTRTTP copies a triangular matrix A from full format (TR) to standard *> packed format (TP). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -89,10 +88,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/SRC/ztzrqf.f b/SRC/ztzrqf.f index c172ecf..4c2db02 100644 --- a/SRC/ztzrqf.f +++ b/SRC/ztzrqf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTZRQF( M, N, A, LDA, TAU, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> This routine is deprecated and has been replaced by routine ZTZRZF. *> @@ -44,11 +44,10 @@ *> *> where Z is an N-by-N unitary matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -91,10 +90,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 @@ -105,10 +103,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The factorization is obtained by Householder's method. The kth @@ -136,7 +133,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/ztzrzf.f b/SRC/ztzrzf.f index f6ec031..a3ef9e0 100644 --- a/SRC/ztzrzf.f +++ b/SRC/ztzrzf.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZTZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZTZRZF reduces the M-by-N ( M<=N ) complex upper trapezoidal matrix A *> to upper triangular form by means of unitary transformations. @@ -42,11 +42,10 @@ *> *> where Z is an N-by-N unitary matrix and R is an M-by-M upper *> triangular matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -108,10 +107,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 @@ -122,14 +120,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== +*> +*> \verbatim *> *> The factorization is obtained by Householder's method. The kth *> transformation matrix, Z( k ), which is used to introduce zeros into @@ -156,7 +155,6 @@ *> Z is given by *> *> Z = Z( 1 ) * Z( 2 ) * ... * Z( m ). -*> *> \endverbatim *> * ===================================================================== diff --git a/SRC/zunbdb.f b/SRC/zunbdb.f index 0db8e98..afd7edf 100644 --- a/SRC/zunbdb.f +++ b/SRC/zunbdb.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, * X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, @@ -34,11 +34,11 @@ * $ X21( LDX21, * ), X22( LDX22, * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNBDB simultaneously bidiagonalizes the blocks of an M-by-M *> partitioned unitary matrix X: @@ -60,11 +60,10 @@ *> *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented *> implicitly by angles THETA, PHI. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] TRANS *> \verbatim @@ -247,10 +246,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 @@ -261,10 +259,9 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details +*> \par Further Details: +* ===================== +*> *> \verbatim *> *> The bidiagonal blocks B11, B12, B21, and B22 are represented @@ -277,15 +274,14 @@ *> P1, P2, Q1, and Q2 are represented as products of elementary *> reflectors. See ZUNCSD for details on generating P1, P2, Q1, and Q2 *> using ZUNGQR and ZUNGLQ. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. *> -*> \endverbatim -*> * ===================================================================== SUBROUTINE ZUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, $ X21, LDX21, X22, LDX22, THETA, PHI, TAUP1, diff --git a/SRC/zuncsd.f b/SRC/zuncsd.f index e5c1371..6e96ff4 100644 --- a/SRC/zuncsd.f +++ b/SRC/zuncsd.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * RECURSIVE SUBROUTINE ZUNCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, * SIGNS, M, P, Q, X11, LDX11, X12, @@ -40,11 +40,11 @@ * $ * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNCSD computes the CS decomposition of an M-by-M partitioned *> unitary matrix X: @@ -61,11 +61,10 @@ *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in *> which R = MIN(P,M-P,Q,M-Q). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] JOBU1 *> \verbatim @@ -293,17 +292,16 @@ *> < 0: if INFO = -i, the i-th argument had an illegal value. *> > 0: ZBBCSD did not converge. See the description of RWORK *> above for details. -*> -*> Reference -*> ========= +*> \endverbatim +* +*> \par References: +* ================ *> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. -*> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zung2l.f b/SRC/zung2l.f index aed3bb0..8e1a764 100644 --- a/SRC/zung2l.f +++ b/SRC/zung2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNG2L( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNG2L generates an m by n complex matrix Q with orthonormal columns, *> which is defined as the last n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by ZGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zung2r.f b/SRC/zung2r.f index dbfabc5..de4550e 100644 --- a/SRC/zung2r.f +++ b/SRC/zung2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNG2R( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNG2R generates an m by n complex matrix Q with orthonormal columns, *> which is defined as the first n columns of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by ZGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zungbr.f b/SRC/zungbr.f index 7cfa7c6..dd2d9a7 100644 --- a/SRC/zungbr.f +++ b/SRC/zungbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGBR generates one of the complex unitary matrices Q or P**H *> determined by ZGEBRD when reducing a complex matrix A to bidiagonal @@ -52,11 +52,10 @@ *> rows of P**H, where n >= m >= k; *> if k >= n, P**H = G(n-1) . . . G(2) G(1) and ZUNGBR returns P**H as *> an N-by-N matrix. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -142,10 +141,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/SRC/zunghr.f b/SRC/zunghr.f index 7a55850..a8bb488 100644 --- a/SRC/zunghr.f +++ b/SRC/zunghr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,22 +27,21 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGHR generates a complex unitary matrix Q which is defined as the *> product of IHI-ILO elementary reflectors of order N, as returned by *> ZGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] N *> \verbatim @@ -111,10 +110,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/SRC/zungl2.f b/SRC/zungl2.f index 29b6775..86bb64d 100644 --- a/SRC/zungl2.f +++ b/SRC/zungl2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGL2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGL2 generates an m-by-n complex matrix Q with orthonormal rows, *> which is defined as the first m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(k)**H . . . H(2)**H H(1)**H *> *> as returned by ZGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -98,10 +97,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zunglq.f b/SRC/zunglq.f index 8b74497..74cb39d 100644 --- a/SRC/zunglq.f +++ b/SRC/zunglq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGLQ generates an M-by-N complex matrix Q with orthonormal rows, *> which is defined as the first M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k)**H . . . H(2)**H H(1)**H *> *> as returned by ZGELQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -112,10 +111,9 @@ *> = 0: successful exit; *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zungql.f b/SRC/zungql.f index 6e854bb..bf77df0 100644 --- a/SRC/zungql.f +++ b/SRC/zungql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGQL generates an M-by-N complex matrix Q with orthonormal columns, *> which is defined as the last N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(k) . . . H(2) H(1) *> *> as returned by ZGEQLF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zungqr.f b/SRC/zungqr.f index a268fed..578a9a5 100644 --- a/SRC/zungqr.f +++ b/SRC/zungqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGQR generates an M-by-N complex matrix Q with orthonormal columns, *> which is defined as the first N columns of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1) H(2) . . . H(k) *> *> as returned by ZGEQRF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zungr2.f b/SRC/zungr2.f index 3c52d36..dcf3179 100644 --- a/SRC/zungr2.f +++ b/SRC/zungr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGR2( M, N, K, A, LDA, TAU, WORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGR2 generates an m by n complex matrix Q with orthonormal rows, *> which is defined as the last m rows of a product of k elementary @@ -40,11 +40,10 @@ *> Q = H(1)**H H(2)**H . . . H(k)**H *> *> as returned by ZGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -99,10 +98,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zungrq.f b/SRC/zungrq.f index 5e163bd..ec1a717 100644 --- a/SRC/zungrq.f +++ b/SRC/zungrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -27,11 +27,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGRQ generates an M-by-N complex matrix Q with orthonormal rows, *> which is defined as the last M rows of a product of K elementary @@ -40,11 +40,10 @@ *> Q = H(1)**H H(2)**H . . . H(k)**H *> *> as returned by ZGERQF. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] M *> \verbatim @@ -113,10 +112,9 @@ *> = 0: successful exit *> < 0: if INFO = -i, the i-th argument has an illegal value *> \endverbatim -*> * -* Authors -* ======= +* Authors: +* ======== * *> \author Univ. of Tennessee *> \author Univ. of California Berkeley diff --git a/SRC/zungtr.f b/SRC/zungtr.f index 049ec0b..2d8d2ff 100644 --- a/SRC/zungtr.f +++ b/SRC/zungtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNGTR generates a complex unitary matrix Q which is defined as the *> product of n-1 elementary reflectors of order N, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \verbatim @@ -108,10 +107,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/SRC/zunm2l.f b/SRC/zunm2l.f index 25f8a99..44f85e6 100644 --- a/SRC/zunm2l.f +++ b/SRC/zunm2l.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNM2L overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by ZGEQLF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/zunm2r.f b/SRC/zunm2r.f index 4efffe0..ab94d2c 100644 --- a/SRC/zunm2r.f +++ b/SRC/zunm2r.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNM2R overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by ZGEQRF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/zunmbr.f b/SRC/zunmbr.f index 35e6224..b3e2344 100644 --- a/SRC/zunmbr.f +++ b/SRC/zunmbr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> If VECT = 'Q', ZUNMBR overwrites the general complex M-by-N matrix C *> with @@ -62,11 +62,10 @@ *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix: *> if k < nq, P = G(1) G(2) . . . G(k); *> if k >= nq, P = G(1) G(2) . . . G(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] VECT *> \verbatim @@ -180,10 +179,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/SRC/zunmhr.f b/SRC/zunmhr.f index 77f77cf..46bc2b1 100644 --- a/SRC/zunmhr.f +++ b/SRC/zunmhr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C, * LDC, WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMHR overwrites the general complex M-by-N matrix C with *> @@ -46,11 +46,10 @@ *> IHI-ILO elementary reflectors, as returned by ZGEHRD: *> *> Q = H(ilo) H(ilo+1) . . . H(ihi-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,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/SRC/zunml2.f b/SRC/zunml2.f index 26124be..a1c03e3 100644 --- a/SRC/zunml2.f +++ b/SRC/zunml2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNML2 overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by ZGELQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/zunmlq.f b/SRC/zunmlq.f index c87e6bd..8fc799e 100644 --- a/SRC/zunmlq.f +++ b/SRC/zunmlq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMLQ overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by ZGELQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/zunmql.f b/SRC/zunmql.f index 67365d7..1ed5117 100644 --- a/SRC/zunmql.f +++ b/SRC/zunmql.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMQL overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by ZGEQLF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/zunmqr.f b/SRC/zunmqr.f index 0dd18ab..4d1878f 100644 --- a/SRC/zunmqr.f +++ b/SRC/zunmqr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMQR overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by ZGEQRF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/zunmr2.f b/SRC/zunmr2.f index 5dcc164..40f9058 100644 --- a/SRC/zunmr2.f +++ b/SRC/zunmr2.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMR2 overwrites the general complex m-by-n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by ZGERQF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -143,10 +142,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/SRC/zunmr3.f b/SRC/zunmr3.f index 347c917..89a8827 100644 --- a/SRC/zunmr3.f +++ b/SRC/zunmr3.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMR3 overwrites the general complex m by n matrix C with *> @@ -52,11 +52,10 @@ *> *> as returned by ZTZRZF. Q is of order m if SIDE = 'L' and of order n *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -151,10 +150,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 @@ -165,15 +163,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/zunmrq.f b/SRC/zunmrq.f index e0ac87b..7fca322 100644 --- a/SRC/zunmrq.f +++ b/SRC/zunmrq.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMRQ overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by ZGERQF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -154,10 +153,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/SRC/zunmrz.f b/SRC/zunmrz.f index c1366aa..006e3db 100644 --- a/SRC/zunmrz.f +++ b/SRC/zunmrz.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMRZ overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> *> as returned by ZTZRZF. Q is of order M if SIDE = 'L' and of order N *> if SIDE = 'R'. -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -162,10 +161,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 @@ -176,15 +174,15 @@ * *> \ingroup complex16OTHERcomputational * -* -* Further Details -* =============== -*>\details \b Further \b Details -*> \verbatim +*> \par Contributors: +* ================== *> -*> Based on contributions by *> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA +* +*> \par Further Details: +* ===================== *> +*> \verbatim *> \endverbatim *> * ===================================================================== diff --git a/SRC/zunmtr.f b/SRC/zunmtr.f index a8566fe..1f119ee 100644 --- a/SRC/zunmtr.f +++ b/SRC/zunmtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUNMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC, * WORK, LWORK, INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUNMTR overwrites the general complex M-by-N matrix C with *> @@ -48,11 +48,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -155,10 +154,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/SRC/zupgtr.f b/SRC/zupgtr.f index ea63376..4d80380 100644 --- a/SRC/zupgtr.f +++ b/SRC/zupgtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO ) * @@ -28,11 +28,11 @@ * COMPLEX*16 AP( * ), Q( LDQ, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUPGTR generates a complex unitary matrix Q which is defined as the *> product of n-1 elementary reflectors H(i) of order n, as returned by @@ -41,11 +41,10 @@ *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] UPLO *> \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/SRC/zupmtr.f b/SRC/zupmtr.f index 4c691e0..f6c2bea 100644 --- a/SRC/zupmtr.f +++ b/SRC/zupmtr.f @@ -15,8 +15,8 @@ *> [TXT] *> \endhtmlonly * -* Definition -* ========== +* Definition: +* =========== * * SUBROUTINE ZUPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK, * INFO ) @@ -29,11 +29,11 @@ * COMPLEX*16 AP( * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * -* Purpose -* ======= * -*>\details \b Purpose: -*>\verbatim +*> \par Purpose: +* ============= +*> +*> \verbatim *> *> ZUPMTR overwrites the general complex M-by-N matrix C with *> @@ -49,11 +49,10 @@ *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1); *> *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1). -*> -*>\endverbatim +*> \endverbatim * -* Arguments -* ========= +* Arguments: +* ========== * *> \param[in] SIDE *> \verbatim @@ -134,10 +133,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/alahdg.f b/TESTING/EIG/alahdg.f index 2befca1..8f20a5a 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 fc29edc..1c4afbf 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 7aa1fc1..ec2e53b 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 e7face9..e31644c 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 47c60f1..c0b759d 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 b30db3d..5658b63 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 b5c2118..4929d68 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 d0909eb..9c01142 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 ad26cf7..09875c3 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 0f7cfbe..158b470 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 604a43a..777b416 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 fdc7d83..fa9da0c 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 ba05f91..d0f9b6c 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 6ee6700..91ea17f 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 459397c..2b65e1c 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 6e04957..75539fd 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 5d30e1d..3d07d25 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 f3b4717..f8bfcdb 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 80e8b0a..cc54fae 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 f931e7f..cca9ab8 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 90caf9d..e5fca93 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 04f25ef..2585300 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 7c248a8..ca12b26 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 83b8e27..ad14eed 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 63306ca..15d0767 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 389113d..d07c522 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 59a18d2..7600257 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 0f0a265..0ac5cc3 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 15e872b..c52238e 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 c285195..1420424 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 77bb5aa..e59af94 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 5620476..81528c1 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 11bf31d..018ca40 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 7ac5cad..5918896 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 ebe3f9a..141054a 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 daac388..0b69657 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 94949b3..8f2fad9 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 659c26f..3d4a8ca 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 7aa0ce0..37e6edc 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 8563c61..f1d71f8 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 85eba2e..6b1a134 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 48c6ab9..add9233 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 3515702..8644d5d 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 cc3bf60..b2ebbc0 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 58552bc..114686c 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 98beaad..d000f9f 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 59c9dc3..34890d3 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 267045e..347e5f8 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 ea8da36..a3ac53c 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 ee604fc..326efbd 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 c1cde65..b043ef3 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 969ac57..9db39c2 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 94e1a47..ce223c6 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 54697ff..e866bd6 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 99201d5..7c2c8d0 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 f267031..67364e4 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 724126b..6c4da40 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 f359528..d87bc86 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 7457347..c5d0f5a 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 69004f0..ad4233e 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 b981bad..6799f6d 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 34fc099..5d1aae2 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 c5b0f05..1dc68f3 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 b6e5b49..993cab1 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 15bc8b3..3cfa4d8 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 9ad6d7c..6a24de6 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 a007da9..9d016f6 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 29a0e8f..509157f 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 d7fb11b..f62c7fd 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 c4a3994..0d6a1d1 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 baa72da..40f8ae2 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 01ed84f..815b655 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 dc7f74f..7e17aac 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 5cfff04..9a70bb6 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 c1a52a9..6cabeae 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 649bc1d..f040cf9 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 de7160c..6d1f67f 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 5dbbe63..e495692 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 f7f1564..aa1a5d5 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 678fdc2..fc4660f 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 7850a1a..d425b38 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 b2ebec2..25e7929 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 834a961..34f0724 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 ca9b537..47cdc57 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 32c8dbd..4777778 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 d21c76a..dce2115 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 92cf4f1..415ca17 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 387881e..427af87 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 4c8b646..ab38e74 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 15a375a..d294b1d 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 911ab07..b15d303 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 d462140..04b55a8 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 0657f68..c407db0 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 cda3fae..0cc4215 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 76b5752..87fc2f0 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 1bb4d9a..52c7489 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 2a2c8d7..5b8f0a3 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 c94e8d1..c75321f 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 6c34949..232ab38 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 da3161e..6770257 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 8c2d006..6f1f9c5 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 dd96e7c..0ba5719 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 bf138b7..dfa2e47 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 6f2f36a..a3aa055 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 e148626..f089374 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 3db3b7d..8584840 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 6cf863b..41b9ce9 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 6605420..908a155 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 9ab41fb..295a9c0 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 cfe511e..e6a12d9 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 e1319ca..3f31ca9 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 11688d6..9dd1f03 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 4b75431..b1b126e 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 4735cff..8f04d29 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 da66764..fe4079d 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 9f2d465..a718952 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 7b7baed..a9b7bb8 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 6f678b9..92b21a7 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 ddb9454..70ee867 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 dee1ae7..79ce7ad 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 0fe5e2a..23b1f95 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 39aa95d..7a884ab 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 c055d62..ab93538 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 5020f56..5faa12a 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 1f4723e..eb79eab 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 1b0a533..8f6fc67 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 81f3614..d2a8fce 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 c2c083e..e93716e 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 d951142..1d4be1f 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 b132fa3..1fa1c54 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 167d321..b50eda5 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 f098c0c..e1e3352 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 938638f..ed0dea3 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 42aea9f..d49e115 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 91314e4..85b9594 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 55482a1..c59967f 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 cb34512..9fb5302 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 42fcee9..02fac10 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 99ac48b..d3b1d86 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 336c709..3fd27f9 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 7f989f2..99c674e 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 9af8fd9..388db95 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 29cf46f..e4cd0f9 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 9d2cac9..f6b248c 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 5a75339..fd0934c 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 b071ccd..c38574a 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 d44fc99..c62a001 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 8a9cf15..905254c 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 dcb3d9c..d8bb662 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 7c29268..715f408 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 b106491..8afcf96 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 75c364f..c4dffd6 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 1c23a8a..d45ec5a 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 c6172be..5cd4f70 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 c9f9eae..5db0cb0 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 5b678d0..432b61f 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 fedb29d..7b4f78f 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 862b26e..dd4888e 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 c702f6b..9539710 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 e73ecf4..9074366 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 a166a5a..d2a0b7e 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 376510f..b7089b4 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 9eb4577..a517d71 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 fa22a10..c33ec91 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 6181516..0ad55cb 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 c6ee194..d05a6f9 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 dc0e5ba..c697871 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 09b45a9..10ad76d 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 66d47ad..1a85fab 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 55629e7..10885e0 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 4578ea1..ac84272 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 5929270..749f60d 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 831c667..2b5df0d 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 ebffb63..13afc10 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 a8e2e53..44c216f 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 c60fede..2fd78af 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 73dd3bb..860eca4 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 e458510..50a8ede 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 b52eace..919adff 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 b82ccb4..e943a06 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 47b6a07..0b43a7a 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 2dafac4..bc1c003 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 1f51628..359e7aa 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 e4281d1..9497503 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 2ce0b7a..07c2815 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 ca543be..50dcb0a 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 20e6ca9..f777a7b 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 e8a830b..534bb46 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 1a9ba8f..a1aa2e9 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 7fd779e..79cca6b 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 2adcd11..473ee08 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 b0e96a8..ff170ac 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 f1aad54..fdc6d47 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 c03e343..9ea2fc3 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 f4cdd51..f55e3db 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 f75d43b..1a1244d 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 87cfaca..549cd70 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 57703cd..0e77162 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 cd554af..8db4e1e 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 a1b98e1..81cdd05 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 9b32d06..598dd0b 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 3ce1537..a26e4a0 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 539b417..726c7aa 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 ab2845e..7dc2192 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 fc55688..58c05ec 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 677104a..5a802a8 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 145a2c7..b959f67 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 2dc6ab2..0b02e81 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 5925e48..c10582f 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 7db0f4a..b0d9af0 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 f614b5f..b4b0d4c 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 48c35b9..83a3ae7 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 f2a166f..608b264 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 394323a..dda9095 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 5777b65..bc724eb 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 74d646c..0646428 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 b48b533..d5a7c75 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 e6cb609..76bb591 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 63a1a3f..2fe262b 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 d89ca06..a34bf68 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 8c23cba..f67a097 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 549d59b..bf815c7 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 a044fa4..ba1520f 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 c3fdd99..391a6b3 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 0001fd8..2747540 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 4165571..4a9b9d2 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 0fa14d4..fca6a1f 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 aae24a0..f1960b1 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 7a74ca9..a803849 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 a36ac4d..fc987a6 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 7e49023..d257749 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 2a09afc..86601f9 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 56b7b86..e48e5b3 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 f6b1473..c021b86 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 b2e22e1..3a1e821 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 7e6f281..0206e04 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 757231a..6409db7 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 44ecb89..44679e9 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 286bf18..22f43fd 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 c58f224..1068ef7 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 ee27957..baa3ad2 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 a7511bb..a62e009 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 3c67a17..4775f34 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 c24d448..91be638 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 2114d6e..8dd0297 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 dcbc419..494b56e 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 bcaa392..6de9465 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 f90232b..e05aab4 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 3fc0b57..ce49def 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 90f83cf..22c9b05 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 6de9e39..7ce4d40 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 8923269..b09cae3 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 853d30b..37372af 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 5fbde6a..b8d80fa 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 7abdea8..3ffd3e7 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 fcce9e6..a404d01 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 6389fab..49088be 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 10eb601..572ac56 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 0a0bea2..4607186 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 3827761..392bc47 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 5163611..3563f5f 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 376d53f..3d5bc1f 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 7960e13..ea4b12d 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 a6aa070..a216568 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 3cad283..c8c2574 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 49f59a5..dbd04ee 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 3ea100f..47bd018 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 c4f1922..21e8206 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 71bbe0c..b58e1cc 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 6e879f1..9f8a0c3 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 b6afc0a..3a689c4 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 a0f2a8b..922542f 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 8506da6..71df397 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 9ceca67..455d7d7 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 1d7a07c..1bf2cd0 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 3d42a7e..c8fa16a 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 c815197..44dbd7a 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 d336b50..a26ca95 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 dd9c57a..0573e38 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 166b848..887f5cc 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 60fd676..35831d9 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 4e4d2f4..8571fd1 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 d88ceb0..43c0a3b 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 034f504..0d6b213 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 af692d5..28aac46 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 8857774..de65701 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 d7734bf..1d2c0ef 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 923322b..f607491 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 39e51dd..8a25fd0 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 9b3763d..e042a0c 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 2ad1b3b..1fddce4 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 a2dee08..84dafc9 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 48faa5a..e52e1eb 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 2ba2a84..85f6195 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 815c16f..b47fbc1 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 1f7c2fe..19404a9 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 118c4a0..e7f2736 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 f4582d5..2cdcb84 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 9f2f1cb..8ab1458 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 4a5682e..2afd601 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 b68b008..f5fae0f 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 d89cf54..65fda91 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 d4628fa..f5fc5fc 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 eeffa46..aaac85e 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 d7573d7..9156b12 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 abc858a..cf5bcdb 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 be83c5f..850204f 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 4b84c52..c87bbc4 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 fce7481..77b4e59 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 3cac167..1987962 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 18bd781..5d571ca 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 bd099c6..03b7ade 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 3be21b5..56fbb77 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 b86d05d..22c2aeb 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 36affd0..0742a6c 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 08bf259..9daa849 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 ed35666..0ca05b1 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 abcef80..10f8c63 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 330a9af..89cc7c8 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 3fb07fc..33a27e6 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 239abe4..9755a0c 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 ea5c268..ac06748 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 c86895f..e924dc5 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 3f4adcf..f26f3cd 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 c863d77..9d03261 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 386c1c3..b7971f6 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 02f4dd7..046283a 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 b123c8b..f5dbaec 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 eb2b7fd..dcf16d7 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 a03a2a2..215fd27 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 4669c9a..5ab46f3 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 0b31034..ac9b115 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 c8c5b91..dcb46fe 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 07dd4a9..055457a 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 6acaed1..6f91162 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 e0159d1..e800e8a 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 17adf18..589b095 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 9220fb3..c334876 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 3c03f70..904c5de 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 c5185a5..a57081f 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 679e133..36a877a 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 83d67d3..aaae154 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 5968237..25dfe39 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 b7a6970..74cce0f 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 0c520ff..b1a069c 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 2bc160f..99cb481 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 cdd9187..9484171 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 078f6a7..31455db 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 935635a..4768d34 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 3b50922..c53e7ab 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 446c651..750efce 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 cfdc804..cf2401c 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 5414edc..6819c0f 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 703c7bf..8695182 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 814a18a..c35ebab 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 5ae501b..d3b4707 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 a377e68..dbdc9a0 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 112f0a4..5a402fc 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 4538516..0b21801 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 5549311..808fe5a 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 ae0af63..b830bd8 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 60f7837..a4fc8fc 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 a5e671a..5b5329c 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 6d130a9..d726301 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 b932d2b..ab5d348 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 7823aa3..1cb11cd 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 7b671f4..1300d36 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 a02091b..a2521c0 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 613306d..f2034ef 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 44fb654..d08dae4 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 045f434..5953997 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 6760fb1..f7311ad 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 877d0be..960a623 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 52da500..3868e43 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 b352665..504e6b2 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 677c189..1393c92 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 c01020b..a748715 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 92942e7..a74d340 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 2ebaa61..65e8d24 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 2aa2bc9..a09b874 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 1831004..6c5ef9f 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 7764c0a..52fea00 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 b3aa399..5bd319e 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 e70c0c3..4700d65 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 4c2096f..283ffe3 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 863f7f0..f1c421a 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 c0a6291..2a2d974 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 69ea9f3..8d31e16 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 63f24c4..949ad3e 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 b6db76a..2ca798d 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 b64dfa2..8b6065b 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 b28c993..ea56539 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 5b7c884..7aa4ea8 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 099d08e..6408260 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 e7581d3..0cb047d 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 8ab2459..7adbd52 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 38d97e3..0b68203 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 a02a62b..3c5dca0 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 a0a182a..9559e8d 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 e9139db..98a030f 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 20fa4be..5ab8390 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 9dbca81..47c8f92 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 264c56b..39d33b4 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 47ec90c..6704d10 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 42753c9..75ee91e 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 1ca1f6c..d15eca3 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 5abb6f4..d5c0ac3 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 bb35c1b..92477df 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 fbcf837..3adc5ba 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 41d6a05..cf4d184 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 c56ca7b..6e4679b 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 efa05b4..6df8e27 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 887c708..b09d04a 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 92eea1e..2c82357 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 d22946d..139bce1 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 4b2679c..a489b66 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 7421618..d5ece9c 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 52e9afa..be41678 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 d45c248..12392fe 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 43a9354..23a281a 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 e57d97e..8ffcc03 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 7c27801..9265598 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 8725f6f..77d02dc 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 0231f75..85f0cb1 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 d3ae6e0..189e972 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 d140b3b..8116949 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 4e8f461..a4979d0 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 a076121..a5d70c5 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 7fc6d38..744f79a 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 e6acabd..cf9dbae 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 015169b..b0de2bf 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 f0c2507..7289b47 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 efd251d..218b776 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 baf28cf..6bdd9f9 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 4768e5b..8b1293a 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 290542c..c182bfa 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 53c32c8..a75306a 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 fdd28d6..e940bc4 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 f241512..14b9040 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 ef7011e..92b2916 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 abeeb2e..cbf1fe3 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 c2ccbdf..11e85f2 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 6c8ec35..965133f 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 3fcf08f..671e317 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 de13ff0..7f76f2c 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 10a91a7..70b1d96 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 d2f7835..8cee964 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 91ed1b0..ee3c34e 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 4793394..28d576b 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 b54a2e6..20335e2 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 0b7e191..8e16e0a 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 3c1e0ad..c3e2886 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 257d03d..92a4ea0 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 cf2e605..8cacf66 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 7bef530..e3e355c 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 70375bb..afc2283 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 4fb6b74..28d5df3 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 0004ab3..a632b0f 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 78873f6..c565ff2 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 68b8e8a..fef5043 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 162601b..17d7f5c 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 30b4474..78c40be 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 79e0f45..7341a40 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 2ace0e9..f2c5b3a 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 54db03d..3a937c2 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 a66a0fd..b7b9dc0 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 ccf1ce3..760b24e 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 b2398a5..5383a78 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 92a5a3c..32a6dd2 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 3e3bb20..ad5c985 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 54efa72..0e37d64 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 09bca3c..6215ee3 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 a925aa5..5e78f14 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 871b00f..46d7212 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 cd1abf6..ee098f7 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 7669e58..93657e5 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 2f520e3..988400d 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 3484d8a..ad5d928 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 f55e8ff..814dfad 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 9d4cd5c..6d3da4f 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 4e143cc..17ab3d6 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 41ae25a..ce971d0 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 674164e..3b010f9 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 bd3d727..de7ac37 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 f5d314a..840642c 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 ca11560..cbba9e6 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 a733d57..44b4ee6 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 056af1e..6b6f9d6 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 f6f5ff9..72f4ed0 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 7a3efcb..6616356 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 db34b67..0dde07b 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 e32d3cb..8349846 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 4e1d491..6e27139 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 33fb444..59e16b4 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 79d1eaa..12fa986 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 217946c..9755d44 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 75950e3..7b0d50f 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 1e774b7..0fe694e 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 a80081d..2607137 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 16d0415..1a12ed5 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 1bf0162..cf20978 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 8ecfcad..59f12ea 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 371a584..b99ba13 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 dd781f1..567425f 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 8b5c765..2ef8cb2 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 9963c91..6f3bab7 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 bf90ad5..b978d38 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 27ae0af..120a758 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 91dfbc6..81ad71c 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 5a09592..bed63b9 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 509d792..7864950 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 746dc64..890b3d2 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 e498575..4c89147 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 9b95622..1a192f0 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 cf58d01..c2af2de 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 1895f52..9998acd 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 d4d2027..4b3739a 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 e452042..646ae62 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 1b709b5..88d07f0 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 2aa394b..78accfa 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 4f8729a..67b4a89 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 c56153f..8b4e4a5 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 62cc07c..6699c5e 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 0d1f5f8..d107323 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 ded8b6a..eefd6b6 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 9b648e7..95bebcc 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 ffef258..6d43855 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 5c42508..4be4b43 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 952b84f..1b5a956 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 e6d49c4..3cb97b3 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 f069953..3ee5107 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 b4b648c..15048c0 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 4eb3c1d..abd15e4 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 4820cb6..f47d3de 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 99cb26d..607c452 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 01676fb..b775828 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 314571e..3ee7a4d 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 5a0d4f2..316e27e 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 94cba42..ee553f9 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 cbc3851..b0e4457 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 a393a55..238317c 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 ecdf27b..6e86b60 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 e9cf171..97a2cd0 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 0a409c6..b416672 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 665209e..7f83d92 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 7df5446..7a942d8 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 a1a78fe..5791dac 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 7dca814..8a65693 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 69bf58c..6e954b8 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 9584d62..3edf402 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 745c892..17b4ea6 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 1059939..3dff4cc 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 0cf9bac..4bbb8d0 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 4931f6c..6edde15 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 2bba18f..f3d138d 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 7239578..21306a6 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 a8eddaf..30ff5ef 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 f711268..a679f88 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 7ab3177..598bd90 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 d53520f..27d0972 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 853171e..ef1e781 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 21ab5e1..8057c1c 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 91ca81f..6d9d349 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 3033f3b..19ceb48 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 62ae4c2..cb854a3 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 4775088..4e2f07f 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 9da8bd8..bb6b4fa 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 e426ed9..c7d34e1 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 163c0cd..dfa5525 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 75680d1..90f3f1e 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 0fc7a15..aaf0b80 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 819ea0e..2f4ac73 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 a8f134e..eec17a6 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 34a60b5..17b8263 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 be29099..445d279 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 be07f98..16c8eee 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 e313753..cafd575 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 ecc6e73..e58dabf 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 cde04a3..d908bf3 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 21fb672..52c7b68 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 fc8fbaf..ea864b2 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 c65d145..0f5ca18 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 e4d9833..b638f2a 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 ccbad30..382c39c 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 7cd8303..bdfec6c 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 6fc036c..928c090 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 7a62fe6..99633b0 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 453999c..46fd8a6 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 a4922e8..b965b83 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 a05057f..729d37d 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 dc40b5f..92fbe8c 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 e8800f4..8876499 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 c7ba8eb..5fa2369 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 eafdb41..29b47a4 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 61c77bc..a567d27 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 15cfab1..e842ba0 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 9de42fc..fc8c5b2 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 236da3d..126da50 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 bda8a61..f574acd 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 16c8178..62f68e0 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 827fa6a..2e08c3d 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 dc3d651..9f9a2ef 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 34a846f..e0109d1 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 8bac818..f14ad80 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 ba53b14..b90decd 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 a44f2a2..4175106 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 638e4ec..065bb4f 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 1024066..77ff85d 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 7b8e4f9..01d4375 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 1741912..d1ff7a2 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 0841395..ec3e9b2 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 52cbee5..735181f 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 fb76ef6..3f06bfa 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 191dc15..c3d212d 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 252fe64..1e2f310 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 33302be..391bddd 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 dd54778..bd5b82e 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 8d5e991..54e0fac 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 a65c63b..16848e2 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 51338f5..a07ebc8 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 b823a05..8298385 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 22838a6..0676cda 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 80e55f4..3499d14 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 7f4f1ac..53a409f 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 a5dd488..8b8cd8e 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 2ffbbe2..61b7964 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 bb5cdb2..ab9cd68 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 8b8777b..5931fdd 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 6eb3c59..96369bf 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 d180a48..33ee7ab 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 4023c4d..5ae66c0 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 a61543c..b191f6f 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 76030a8..ee47073 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 26c451a..73544a8 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 b4f93d3..64fdbe3 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 25aca39..0af8874 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 c990c5a..2fc88f8 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 f3afbdd..ed91b7b 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 cb98f79..9390d49 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 af785e1..9c1dc44 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 6941630..f892958 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 585101c..bf7f9bd 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 5229dbe..93b00ad 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 69e5d0b..1feba88 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 e7dda82..c34ccbc 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 b98e4cd..e14da18 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 1d22172..6d46c49 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 9048e94..24c7d01 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 bc7e9bf..5e4563a 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 00a1f24..9c53bfa 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 163d9fa..089a632 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 f96c12f..fc48076 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 7a9b079..c337249 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 8259c28..7c90026 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 bf38ab0..268fbb8 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 2102bfa..124355a 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 2880854..b927a2c 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 9b4a62d..b4c8060 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 c08a57d..a125103 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 6f9b309..a9291d6 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 b9e22ce..57ecd78 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 ea70c63..1ba67bc 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 b0b0384..38a336b 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 4dbdc98..d124f3a 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 3e0853c..28d98a0 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 7ee4d9a..961f647 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 27ef719..3d65dd5 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 8390d22..381f6ec 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 f607fe0..62d3158 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 ff510b7..7cc487f 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 c902670..cf2f178 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 1e6dd9c..50b5315 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 4fd50db..9711e55 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 8c307d0..1521d11 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 6ebbb10..75b4843 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 4cefd28..9da8546 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 c863eee..67df3d9 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 fa1222e..f46ee24 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 6c6abca..669b0c7 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 d68dae6..52ee8e3 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 1027477..ee52aff 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 e050fe7..6713a3b 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 5a51a82..7c55010 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 74fc713..a1f6590 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 1062b33..ad2756a 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 25dcf54..58441fc 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 31b165b..46d4739 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 f46a42a..70b16a2 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 78e852f..347f5fd 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 9a6e2c8..3b4fa72 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 f07360d..d099867 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 813c751..ed62f27 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 5249799..af2a0ca 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 5c10751..9ff28d4 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 46d5d1d..845caf3 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 024bb49..4e6a3aa 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 38dd4a2..2ef93e5 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 cfac8ba..74dc425 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 136b453..2190e77 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 9607685..35945fa 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 ea33425..294d8aa 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 9092c10..d841ef7 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 b29e17c..9fa72df 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 aaa0519..54122ad 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 5534100..84fcc9b 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 78e332a..4e78847 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 28bd4cc..2fadff1 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 bea2f99..fa0e9c0 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 3e36cfd..cc9543d 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 225c1ad..4ad9d58 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 44c33eb..0fefa3a 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 6be4b60..f4d85f6 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 51268e0..7bb88b4 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 4e0811c..ee70def 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 1695b6a..f14c9ce 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 fbcbe56..ad567c1 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 905aad4..7fa45fa 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 440b2a7..c45cfee 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 4e72dc0..be2fa7c 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 ab031f2..fcf3083 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 135b95b..f80d057 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 2e67c67..00a1033 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 c026988..abc675c 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 f49181f..4f18a3b 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 b8184d8..0f3382d 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 0e0184a..6926c37 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 877b10c..c7798e4 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 1b214ad..3e4c9eb 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 110bbf1..a3f6dea 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 a774a43..499b0de 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 63a41fb..226f882 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 44976ff..ea103a1 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 27d0efe..818352d 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 a27d948..bdd76fb 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 e3b33ef..10f4c6a 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 1ba4234..aabcb44 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 c2f8e71..86af460 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 193d037..dd95605 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 8e4fd8b..3495106 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 7ced82f..a66af5d 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 1828ec1..ba3e09f 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 b5f77cb..4a6c266 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 dabce94..68b7cad 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 837410f..45a2a15 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 1ac8b01..b7964fb 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 18f2feb..f81460a 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 a60a548..bde1883 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 682871d..4e8766d 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 791d44f..e3c2c3c 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 e0d3782..bf041a4 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 9d8c91f..cfcff0c 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 427675f..317af70 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 d0da6fd..391aee9 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 96a8c44..1d50823 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 144994b..4f4a4ae 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 8a0124c..034c7a9 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 5a0e522..07c682a 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 e7694f5..e8d8718 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 b0cd0f8..1e29094 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 04f7aa8..b255a81 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 ada465c..c29f263 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 323b056..29641b0 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 d2fe15d..4806f6a 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 d7f9cb8..ce54be2 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 01e4b69..d963fc8 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 928e23b..f78b097 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 5381c76..ed8f1d6 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 26ecf66..8a533f6 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 9056fc8..365bdf8 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 139346a..6d59e3b 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 2881f1b..6cfb1ad 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 11d57da..a2198e8 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 5808ceb..89a7ea2 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 81c0899..ff215a9 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 52e8e23..6449d68 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 a7ff139..8ee6783 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 402de36..8dec71d 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 6997b36..d633133 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 db37b43..b089e03 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 bdc4807..76a3078 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 dbf805b..7fa1ec8 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 25685b7..62330a1 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 41c3a34..bdb1625 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 0d15b87..be4b2bd 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 77c2e09..30a937d 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 eccc744..8822002 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 80e725d..3300848 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 9165763..d21f8d4 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 725988a..7dfa8bd 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 a2c89c1..79c2205 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 ddb38a9..d58eeb7 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 bce84e6..c0fc4a6 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 20b76b7..96d4c18 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 996712a..1681a70 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 dfd6b73..6d2ac1e 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 721a721..c102c19 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 47ec1bf..158d092 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 eda3c53..e4c48ba 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 5e726cd..17a8c84 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 58ca7d7..cea9605 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 6a4b510..4e65508 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 f15c101..d3f409b 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 67a602e..4b304a2 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 df8de5b..ad1aaed 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 d6b55e0..c28a615 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 b510724..1e463da 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 81044f3..428726e 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 65a9f8a..8ab22ab 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 fcce9e6..a404d01 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 210e798..b6e955b 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 9cca756..0f822ff 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 960b772..e6b8624 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 38c04a0..7900f0a 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 0fd52d5..aef1157 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 8d5d970..e349e4a 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 c261cfc..ae7ec6c 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 2d18772..b5e3af1 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 b3618a3..397cb02 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 d537296..a8a7aad 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 e2b23b2..7221e7d 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 cf32b06..1750053 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 cc27555..4c647a8 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 110c51e..f721ecf 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 b7a45fa..b819aa8 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 35fc8ce..6251f39 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 76420c1..512398e 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 7c5b4ae..052a3e9 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 d5f5d03..9ebed68 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 3b4c382..d963c4d 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 9fa1d42..b1622e9 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 9ea060a..8a8640f 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 d985b7e..d216145 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 88f7333..c44f55e 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 04aa67a..f3d352c 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 16fb8ed..06432b7 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 a8810f9..58e7b32 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 4bbe1ae..9be9ff5 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 d528cd1..8d14b18 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 9adea83..c2b93c5 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 085ff4a..4ed2ad3 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 5e10134..f8d2eaa 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 0b01657..042a222 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 debecad..0bca988 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 0bbc121..aecd807 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 00d07d0..a947538 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 db26177..5f662c5 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 a745553..08f73a7 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 0ea61fb..9e89ba0 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 fb62dc7..5398a40 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 3207a06..8e21e9b 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 2299e4f..38b7129 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 d9ffa4a..1f91d24 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 18533d7..529c0a2 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 c6c0f20..5b50ebb 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 7cff331..b85456c 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 8e9d5ac..2600b0b 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 3ced47f..50cebc7 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 497a6e7..7fcca09 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 6432e50..976ac6b 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 9a1be83..98759e5 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 3410f06..9b95563 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 04dab87..60f132b 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 bec4d41..9666a4c 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 645bf9f..9d6a269 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 4c84b2b..75fc82b 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 253087e..1e5c9db 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 442bb29..f354512 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 98f6cbf..4380f86 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 128c71d..67a6622 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 f11f6d6..3824eb0 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 ef18ad9..77dce6b 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 346021b..506883a 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 8ded02b..d7a6aa0 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 3cfba85..228b5a9 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 1cbf4bf..44e592c 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 4a20da5..1cc1975 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 3efda27..b8bba40 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 d5a1c1b..1681585 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 4a3520e..f5515db 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 0766e84..8c71a4c 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 c0e71fe..b05eaa3 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 d2b30ce..1cda22f 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 0f1c5f4..463e03e 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 4221665..9eb86a9 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 41a61e5..5ad7b74 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 0851946..a30befc 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 abf8fe9..d1c1cd8 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 049df34..d0c92f7 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 5b5d681..5aaa6e8 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 11f71db..e20dac1 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 712fa3c..60d2a3b 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 c849bd2..55fd7da 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 a828b90..ff35367 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 4e1b244..217e779 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 73ba946..ef5c16c 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 aeb008c..ee577d3 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 f314269..b023b21 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 69558d3..0f18728 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 403c8c7..1e76e44 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 2f1e0c2..9fbd968 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 1b3013a..f07f2ee 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 4f2a11f..1e56ca6 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 5224a42..45a593c 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 8479b3b..8b49372 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 61aafdd..f76e5d6 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 03c6243..12a479f 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 36953ea..8fb16eb 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 c8aade0..37b3a03 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 868de8f..d94799b 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 78c85af..2638b0e 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 229887a..5caead5 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 63ecbbc..1fa4a03 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 c59385c..14e0a06 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 a22005b..83a8f99 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 43c5927..cfc0a75 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 8fba568..9aebbd0 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 ffa9eec..010874e 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 99613b4..435f23c 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 2bda010..3ec2579 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 2908fee..9784f9a 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 4ebe385..a39a134 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 b96dde5..51e4e79 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 ae70258..6f5df20 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 2cdb26f..945072d 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 e7e6e55..1390390 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 0ed9347..4cd2545 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 260a433..76b5531 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 50db4db..a2a6dd2 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 b475167..523481b 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 05f9a97..ed8e8c7 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 db61b80..e34d739 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 d5b65fe..f7a4e15 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 830c312..dc88029 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 bbedf4a..b04b9c4 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 c132e5b..0677c68 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 c436735..9241556 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 18ff57c..18821d4 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 baa2521..f96b7cf 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 aa8804e..48a0a13 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 a5285f2..f0ad35b 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 d953f8e..ff074c8 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 8e3856c..7ed1318 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 7fb1cc2..cfbbeb6 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 c3f7efc..ca9abe3 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 253555e..c71e359 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 cbc51e5..50d8b94 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 cb1f893..eccf128 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 9fb0c80..2888ea5 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 6ea350a..1d81970 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 bb580af..fbee59e 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 ff80bf2..2dfe736 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 193563e..c187ea6 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 c1438c3..2714ce7 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 1206dd7..e88dddd 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 ec11271..8761b25 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 264f3cf..329e875 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 2329bbe..8f2c978 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 2aaa329..9b87987 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 3a23c7c..57a7a0a 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 0cb22d9..afe694f 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 37e0b09..318c67e 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 929104a..259931b 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 2c3caf7..4e85c9e 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 a676e43..319951d 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 a3835c7..4aaf90c 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 af2058e..6bb9ab3 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 6866235..8b9c1ba 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 7a99191..aa25674 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 65e9579..ac1e53b 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 bc95da4..5bdcb5b 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 46b668f..c6dd881 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 356baf9..0c8f28e 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 aeaf39a..944ca4b 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 005b85e..9c31c45 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 766d456..c008ab0 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 6e76b0a..355520d 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 c670efc..bb2792d 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 8c878c2..6959a44 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 094e7dc..755ce17 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 15164ad..df79901 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 0067ae1..61ec109 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 9f83533..6d05090 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 3622257..0e6ba11 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 6cee2d6..339140c 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 afa1d80..f2cd78f 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 68661e5..4f22613 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 96819d0..79a15ab 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 93b9ee8..a59f813 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 46fa07a..c91a3fb 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 e2ad80e..335eb4f 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 0804549..c8b8cae 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 86ea937..4575f9e 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 76e053b..64f0e78 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 f2d9782..e174689 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 b49e5c9..f9b1dd1 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 71b8307..93e675a 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 b2499c7..8c6f64f 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 ae7dc93..61611d3 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 0076852..001024c 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 bdfbf98..664293e 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 1a3b2a5..d75294e 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 4385303..fc4cc16 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 b35f40e..545cc27 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 2cbed70..af1cbe1 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 cfd008e..07cfb32 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 e7e77e2..bd863cf 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 3716cdd..29df136 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 5bfa845..5e14f6c 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 108a399..1f89aed 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 f8cbb9c..d8f1296 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 1f3eaf3..968629b 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 10d1b2b..9107fe9 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 d3bb66e..97deab2 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 09f92aa..ee929e8 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 252530f..64efb74 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 9eccb77..804f0fd 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 32eff55..d182688 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 b63bf92..dfa94d2 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 a3e9409..e4b5572 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 e551eee..657df78 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 18fdee0..c91d386 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 ceb9ef2..e25ee1f 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 aa752fa..bdc3da2 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 079aa34..abb9130 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 8293c28..7805335 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 3868af3..e43c97e 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 6330057..6b50dc7 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 3d9616c..5633b2c 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 5541542..f303e3e 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 81fa969..45a71b2 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 3c63992..3104610 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 ef49ad8..dd882f5 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 1e89a6f..7cc630e 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 d5508ba..0a7db8e 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 3deff32..0e53e89 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 e58b267..64b48c2 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 74abc33..ff137df 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 3a3c598..25d1e94 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 5963699..a39492d 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 8e9c6e3..0b742da 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 317d248..4f6fd3a 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 3d68ab6..9e55fa5 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 07c748f..eddd987 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 895afc4..e7b39ec 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 15919f2..757b387 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 6eab03c..a088028 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 e0b85c6..30f3da8 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 8e6829b..524c5d2 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 76b0152..813815c 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 b3aac8e..e4becc7 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 6e3ce53..abc31cc 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 04a52d8..082fe36 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 51dbb2d..afb6f41 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 9f2c264..ec36ccf 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 2a25fc2..e57af33 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 99707c2..39ca0d6 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