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

Diff for /rpl/lapack/lapack/zsptrs.f between versions 1.3 and 1.17

version 1.3, 2010/08/06 15:29:01 version 1.17, 2018/05/29 07:18:35
Line 1 Line 1
   *> \brief \b ZSPTRS
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at
   *            http://www.netlib.org/lapack/explore-html/
   *
   *> \htmlonly
   *> Download ZSPTRS + dependencies
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zsptrs.f">
   *> [TGZ]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zsptrs.f">
   *> [ZIP]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zsptrs.f">
   *> [TXT]</a>
   *> \endhtmlonly
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE ZSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
   *
   *       .. Scalar Arguments ..
   *       CHARACTER          UPLO
   *       INTEGER            INFO, LDB, N, NRHS
   *       ..
   *       .. Array Arguments ..
   *       INTEGER            IPIV( * )
   *       COMPLEX*16         AP( * ), B( LDB, * )
   *       ..
   *
   *
   *> \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
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] UPLO
   *> \verbatim
   *>          UPLO is CHARACTER*1
   *>          Specifies whether the details of the factorization are stored
   *>          as an upper or lower triangular matrix.
   *>          = 'U':  Upper triangular, form is A = U*D*U**T;
   *>          = 'L':  Lower triangular, form is A = L*D*L**T.
   *> \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 COMPLEX*16 array, dimension (N*(N+1)/2)
   *>          The block diagonal matrix D and the multipliers used to
   *>          obtain the factor U or L as computed by ZSPTRF, stored as a
   *>          packed triangular matrix.
   *> \endverbatim
   *>
   *> \param[in] IPIV
   *> \verbatim
   *>          IPIV is INTEGER array, dimension (N)
   *>          Details of the interchanges and the block structure of D
   *>          as determined by ZSPTRF.
   *> \endverbatim
   *>
   *> \param[in,out] B
   *> \verbatim
   *>          B is COMPLEX*16 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 December 2016
   *
   *> \ingroup complex16OTHERcomputational
   *
   *  =====================================================================
       SUBROUTINE ZSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )        SUBROUTINE ZSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 *  *
 *  -- LAPACK routine (version 3.2) --  *  -- LAPACK computational routine (version 3.7.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  *     December 2016
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          UPLO        CHARACTER          UPLO
Line 14 Line 129
       COMPLEX*16         AP( * ), B( LDB, * )        COMPLEX*16         AP( * ), B( LDB, * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  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.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  UPLO    (input) CHARACTER*1  
 *          Specifies whether the details of the factorization are stored  
 *          as an upper or lower triangular matrix.  
 *          = 'U':  Upper triangular, form is A = U*D*U**T;  
 *          = 'L':  Lower triangular, form is A = L*D*L**T.  
 *  
 *  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) COMPLEX*16 array, dimension (N*(N+1)/2)  
 *          The block diagonal matrix D and the multipliers used to  
 *          obtain the factor U or L as computed by ZSPTRF, stored as a  
 *          packed triangular matrix.  
 *  
 *  IPIV    (input) INTEGER array, dimension (N)  
 *          Details of the interchanges and the block structure of D  
 *          as determined by ZSPTRF.  
 *  
 *  B       (input/output) COMPLEX*16 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  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
Line 103 Line 175
 *  *
       IF( UPPER ) THEN        IF( UPPER ) THEN
 *  *
 *        Solve A*X = B, where A = U*D*U'.  *        Solve A*X = B, where A = U*D*U**T.
 *  *
 *        First solve U*D*X = B, overwriting B with X.  *        First solve U*D*X = B, overwriting B with X.
 *  *
Line 177 Line 249
          GO TO 10           GO TO 10
    30    CONTINUE     30    CONTINUE
 *  *
 *        Next solve U'*X = B, overwriting B with X.  *        Next solve U**T*X = B, overwriting B with X.
 *  *
 *        K is the main loop index, increasing from 1 to N in steps of  *        K is the main loop index, increasing from 1 to N in steps of
 *        1 or 2, depending on the size of the diagonal blocks.  *        1 or 2, depending on the size of the diagonal blocks.
Line 195 Line 267
 *  *
 *           1 x 1 diagonal block  *           1 x 1 diagonal block
 *  *
 *           Multiply by inv(U'(K)), where U(K) is the transformation  *           Multiply by inv(U**T(K)), where U(K) is the transformation
 *           stored in column K of A.  *           stored in column K of A.
 *  *
             CALL ZGEMV( 'Transpose', K-1, NRHS, -ONE, B, LDB, AP( KC ),              CALL ZGEMV( 'Transpose', K-1, NRHS, -ONE, B, LDB, AP( KC ),
Line 212 Line 284
 *  *
 *           2 x 2 diagonal block  *           2 x 2 diagonal block
 *  *
 *           Multiply by inv(U'(K+1)), where U(K+1) is the transformation  *           Multiply by inv(U**T(K+1)), where U(K+1) is the transformation
 *           stored in columns K and K+1 of A.  *           stored in columns K and K+1 of A.
 *  *
             CALL ZGEMV( 'Transpose', K-1, NRHS, -ONE, B, LDB, AP( KC ),              CALL ZGEMV( 'Transpose', K-1, NRHS, -ONE, B, LDB, AP( KC ),
Line 234 Line 306
 *  *
       ELSE        ELSE
 *  *
 *        Solve A*X = B, where A = L*D*L'.  *        Solve A*X = B, where A = L*D*L**T.
 *  *
 *        First solve L*D*X = B, overwriting B with X.  *        First solve L*D*X = B, overwriting B with X.
 *  *
Line 311 Line 383
          GO TO 60           GO TO 60
    80    CONTINUE     80    CONTINUE
 *  *
 *        Next solve L'*X = B, overwriting B with X.  *        Next solve L**T*X = B, overwriting B with X.
 *  *
 *        K is the main loop index, decreasing from N to 1 in steps of  *        K is the main loop index, decreasing from N to 1 in steps of
 *        1 or 2, depending on the size of the diagonal blocks.  *        1 or 2, depending on the size of the diagonal blocks.
Line 330 Line 402
 *  *
 *           1 x 1 diagonal block  *           1 x 1 diagonal block
 *  *
 *           Multiply by inv(L'(K)), where L(K) is the transformation  *           Multiply by inv(L**T(K)), where L(K) is the transformation
 *           stored in column K of A.  *           stored in column K of A.
 *  *
             IF( K.LT.N )              IF( K.LT.N )
Line 347 Line 419
 *  *
 *           2 x 2 diagonal block  *           2 x 2 diagonal block
 *  *
 *           Multiply by inv(L'(K-1)), where L(K-1) is the transformation  *           Multiply by inv(L**T(K-1)), where L(K-1) is the transformation
 *           stored in columns K-1 and K of A.  *           stored in columns K-1 and K of A.
 *  *
             IF( K.LT.N ) THEN              IF( K.LT.N ) THEN
Removed from v.1.3  
changed lines
  Added in v.1.17

CVSweb interface <joel.bertrand@systella.fr>