[BACK]Return to dtptrs.f CVS log [TXT] [DIR] Up to [local] / rpl / lapack / lapack

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

version 1.8, 2011/07/22 07:38:13 version 1.9, 2011/11/21 20:43:06
Line 1 Line 1
   *> \brief \b DTPTRS
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at 
   *            http://www.netlib.org/lapack/explore-html/ 
   *
   *> \htmlonly
   *> Download DTPTRS + dependencies 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dtptrs.f"> 
   *> [TGZ]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dtptrs.f"> 
   *> [ZIP]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dtptrs.f"> 
   *> [TXT]</a>
   *> \endhtmlonly 
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE DTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )
   * 
   *       .. Scalar Arguments ..
   *       CHARACTER          DIAG, TRANS, UPLO
   *       INTEGER            INFO, LDB, N, NRHS
   *       ..
   *       .. Array Arguments ..
   *       DOUBLE PRECISION   AP( * ), B( LDB, * )
   *       ..
   *  
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> DTPTRS solves a triangular system of the form
   *>
   *>    A * X = B  or  A**T * X = B,
   *>
   *> 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
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] UPLO
   *> \verbatim
   *>          UPLO is CHARACTER*1
   *>          = 'U':  A is upper triangular;
   *>          = 'L':  A is lower triangular.
   *> \endverbatim
   *>
   *> \param[in] TRANS
   *> \verbatim
   *>          TRANS is CHARACTER*1
   *>          Specifies the form of the system of equations:
   *>          = 'N':  A * X = B  (No transpose)
   *>          = 'T':  A**T * X = B  (Transpose)
   *>          = 'C':  A**H * X = B  (Conjugate transpose = Transpose)
   *> \endverbatim
   *>
   *> \param[in] DIAG
   *> \verbatim
   *>          DIAG is CHARACTER*1
   *>          = 'N':  A is non-unit triangular;
   *>          = 'U':  A is unit triangular.
   *> \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 upper or lower triangular matrix A, packed columnwise in
   *>          a linear array.  The j-th column of A is stored in the array
   *>          AP as follows:
   *>          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
   *>          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(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, if INFO = 0, 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
   *>          > 0:  if INFO = i, the i-th diagonal element of A is zero,
   *>                indicating that the matrix is singular and the
   *>                solutions X have not been computed.
   *> \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 DTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )        SUBROUTINE DTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )
 *  *
 *  -- LAPACK routine (version 3.2) --  *  -- LAPACK computational routine (version 3.4.0) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     November 2006  *     November 2011
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          DIAG, TRANS, UPLO        CHARACTER          DIAG, TRANS, UPLO
Line 13 Line 143
       DOUBLE PRECISION   AP( * ), B( LDB, * )        DOUBLE PRECISION   AP( * ), B( LDB, * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  DTPTRS solves a triangular system of the form  
 *  
 *     A * X = B  or  A**T * X = B,  
 *  
 *  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.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  UPLO    (input) CHARACTER*1  
 *          = 'U':  A is upper triangular;  
 *          = 'L':  A is lower triangular.  
 *  
 *  TRANS   (input) CHARACTER*1  
 *          Specifies the form of the system of equations:  
 *          = 'N':  A * X = B  (No transpose)  
 *          = 'T':  A**T * X = B  (Transpose)  
 *          = 'C':  A**H * X = B  (Conjugate transpose = Transpose)  
 *  
 *  DIAG    (input) CHARACTER*1  
 *          = 'N':  A is non-unit triangular;  
 *          = 'U':  A is unit triangular.  
 *  
 *  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 upper or lower triangular matrix A, packed columnwise in  
 *          a linear array.  The j-th column of A is stored in the array  
 *          AP as follows:  
 *          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;  
 *          if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(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, if INFO = 0, 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  
 *          > 0:  if INFO = i, the i-th diagonal element of A is zero,  
 *                indicating that the matrix is singular and the  
 *                solutions X have not been computed.  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
Removed from v.1.8  
changed lines
  Added in v.1.9

CVSweb interface <joel.bertrand@systella.fr>