rpl/lapack/lapack/dpptrs.f - diff

Return to dpptrs.f CVS log

Up to [local] / rpl / lapack / lapack

Diff for /rpl/lapack/lapack/dpptrs.f between versions 1.8 and 1.9

-version 1.8, 2011/07/22 07:38:10
+version 1.9, 2011/11/21 20:43:02
  Line 1
+ *> \brief \b DPPTRS
+ *
+ *  =========== DOCUMENTATION ===========
+ *
+ * Online html documentation available at
+ *            http://www.netlib.org/lapack/explore-html/
+ *
+ *> \htmlonly
+ *> Download DPPTRS + dependencies
+ *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dpptrs.f">
+ *> [TGZ]</a>
+ *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dpptrs.f">
+ *> [ZIP]</a>
+ *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dpptrs.f">
+ *> [TXT]</a>
+ *> \endhtmlonly
+ *
+ *  Definition:
+ *  ===========
+ *
+ *       SUBROUTINE DPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO )
+ *
+ *       .. Scalar Arguments ..
+ *       CHARACTER          UPLO
+ *       INTEGER            INFO, LDB, N, NRHS
+ *       ..
+ *       .. Array Arguments ..
+ *       DOUBLE PRECISION   AP( * ), B( LDB, * )
+ *       ..
+ *
+ *
+ *> \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
+ *
+ *  Arguments:
+ *  ==========
+ *
+ *> \param[in] UPLO
+ *> \verbatim
+ *>          UPLO is CHARACTER*1
+ *>          = 'U':  Upper triangle of A is stored;
+ *>          = 'L':  Lower triangle of A is stored.
+ *> \endverbatim
+ *>
+ *> \param[in] N
+ *> \verbatim
+ *>          N is INTEGER
+ *>          The order of the matrix A.  N >= 0.
+ *> \endverbatim
+ *>
+ *> \param[in] NRHS
+ *> \verbatim
+ *>          NRHS is INTEGER
+ *>          The number of right hand sides, i.e., the number of columns
+ *>          of the matrix B.  NRHS >= 0.
+ *> \endverbatim
+ *>
+ *> \param[in] AP
+ *> \verbatim
+ *>          AP is DOUBLE PRECISION array, dimension (N*(N+1)/2)
+ *>          The triangular factor U or L from the Cholesky factorization
+ *>          A = U**T*U or A = L*L**T, packed columnwise in 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.
+ *> \endverbatim
+ *>
+ *> \param[in,out] B
+ *> \verbatim
+ *>          B is DOUBLE PRECISION array, dimension (LDB,NRHS)
+ *>          On entry, the right hand side matrix B.
+ *>          On exit, the solution matrix X.
+ *> \endverbatim
+ *>
+ *> \param[in] LDB
+ *> \verbatim
+ *>          LDB is INTEGER
+ *>          The leading dimension of the array B.  LDB >= max(1,N).
+ *> \endverbatim
+ *>
+ *> \param[out] INFO
+ *> \verbatim
+ *>          INFO is INTEGER
+ *>          = 0:  successful exit
+ *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+ *> \endverbatim
+ *
+ *  Authors:
+ *  ========
+ *
+ *> \author Univ. of Tennessee
+ *> \author Univ. of California Berkeley
+ *> \author Univ. of Colorado Denver
+ *> \author NAG Ltd.
+ *
+ *> \date November 2011
+ *
+ *> \ingroup doubleOTHERcomputational
+ *
+ *  =====================================================================
        SUBROUTINE DPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO )
  *
- *  -- LAPACK routine (version 3.3.1) --
+ *  -- LAPACK computational routine (version 3.4.0) --
  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
- *  -- April 2011                                                      --
+ *     November 2011
  *
  *     .. Scalar Arguments ..
        CHARACTER          UPLO
- Line 13
+ Line 121
        DOUBLE PRECISION   AP( * ), B( LDB, * )
  *     ..
  *
- *  Purpose
- *  =======
- *
- *  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.
- *
- *  Arguments
- *  =========
- *
- *  UPLO    (input) CHARACTER*1
- *          = 'U':  Upper triangle of A is stored;
- *          = 'L':  Lower triangle of A is stored.
- *
- *  N       (input) INTEGER
- *          The order of the matrix A.  N >= 0.
- *
- *  NRHS    (input) INTEGER
- *          The number of right hand sides, i.e., the number of columns
- *          of the matrix B.  NRHS >= 0.
- *
- *  AP      (input) DOUBLE PRECISION array, dimension (N*(N+1)/2)
- *          The triangular factor U or L from the Cholesky factorization
- *          A = U**T*U or A = L*L**T, packed columnwise in 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.
- *
- *  B       (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS)
- *          On entry, the right hand side matrix B.
- *          On exit, the solution matrix X.
- *
- *  LDB     (input) INTEGER
- *          The leading dimension of the array B.  LDB >= max(1,N).
- *
- *  INFO    (output) INTEGER
- *          = 0:  successful exit
- *          < 0:  if INFO = -i, the i-th argument had an illegal value
- *
  *  =====================================================================
  *
  *     .. Local Scalars ..

CVSweb interface <joel.bertrand@systella.fr>

Removed from v.1.8
changed lines
	Added in v.1.9