--- rpl/lapack/lapack/dpptri.f 2010/01/26 15:22:45 1.1
+++ rpl/lapack/lapack/dpptri.f 2023/08/07 08:39:04 1.18
@@ -1,9 +1,99 @@
+*> \brief \b DPPTRI
+*
+* =========== DOCUMENTATION ===========
+*
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
+*
+*> \htmlonly
+*> Download DPPTRI + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
+*> [TXT]
+*> \endhtmlonly
+*
+* Definition:
+* ===========
+*
+* SUBROUTINE DPPTRI( UPLO, N, AP, INFO )
+*
+* .. Scalar Arguments ..
+* CHARACTER UPLO
+* INTEGER INFO, N
+* ..
+* .. Array Arguments ..
+* DOUBLE PRECISION AP( * )
+* ..
+*
+*
+*> \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
+*
+* Arguments:
+* ==========
+*
+*> \param[in] UPLO
+*> \verbatim
+*> UPLO is CHARACTER*1
+*> = 'U': Upper triangular factor is stored in AP;
+*> = 'L': Lower triangular factor is stored in AP.
+*> \endverbatim
+*>
+*> \param[in] N
+*> \verbatim
+*> N is INTEGER
+*> The order of the matrix A. N >= 0.
+*> \endverbatim
+*>
+*> \param[in,out] AP
+*> \verbatim
+*> AP is DOUBLE PRECISION array, dimension (N*(N+1)/2)
+*> On entry, the triangular factor U or L from the Cholesky
+*> factorization A = U**T*U or A = L*L**T, packed columnwise as
+*> a linear array. The j-th column of U or L is stored in the
+*> array AP as follows:
+*> if UPLO = 'U', AP(i + (j-1)*j/2) = U(i,j) for 1<=i<=j;
+*> if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = L(i,j) for j<=i<=n.
+*>
+*> On exit, the upper or lower triangle of the (symmetric)
+*> inverse of A, overwriting the input factor U or L.
+*> \endverbatim
+*>
+*> \param[out] INFO
+*> \verbatim
+*> INFO is INTEGER
+*> = 0: successful exit
+*> < 0: if INFO = -i, the i-th argument had an illegal value
+*> > 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:
+* ========
+*
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
+*
+*> \ingroup doubleOTHERcomputational
+*
+* =====================================================================
SUBROUTINE DPPTRI( UPLO, N, AP, INFO )
*
-* -- LAPACK routine (version 3.2) --
+* -- LAPACK computational routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-* November 2006
*
* .. Scalar Arguments ..
CHARACTER UPLO
@@ -13,40 +103,6 @@
DOUBLE PRECISION AP( * )
* ..
*
-* Purpose
-* =======
-*
-* 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.
-*
-* Arguments
-* =========
-*
-* UPLO (input) CHARACTER*1
-* = 'U': Upper triangular factor is stored in AP;
-* = 'L': Lower triangular factor is stored in AP.
-*
-* N (input) INTEGER
-* The order of the matrix A. N >= 0.
-*
-* AP (input/output) DOUBLE PRECISION array, dimension (N*(N+1)/2)
-* On entry, the triangular factor U or L from the Cholesky
-* factorization A = U**T*U or A = L*L**T, packed columnwise as
-* a linear array. The j-th column of U or L is stored in the
-* array AP as follows:
-* if UPLO = 'U', AP(i + (j-1)*j/2) = U(i,j) for 1<=i<=j;
-* if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = L(i,j) for j<=i<=n.
-*
-* On exit, the upper or lower triangle of the (symmetric)
-* inverse of A, overwriting the input factor U or L.
-*
-* INFO (output) INTEGER
-* = 0: successful exit
-* < 0: if INFO = -i, the i-th argument had an illegal value
-* > 0: if INFO = i, the (i,i) element of the factor U or L is
-* zero, and the inverse could not be computed.
-*
* =====================================================================
*
* .. Parameters ..
@@ -95,7 +151,7 @@
*
IF( UPPER ) THEN
*
-* Compute the product inv(U) * inv(U)'.
+* Compute the product inv(U) * inv(U)**T.
*
JJ = 0
DO 10 J = 1, N
@@ -109,7 +165,7 @@
*
ELSE
*
-* Compute the product inv(L)' * inv(L).
+* Compute the product inv(L)**T * inv(L).
*
JJ = 1
DO 20 J = 1, N