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

Diff for /rpl/lapack/lapack/zsytrs2.f between versions 1.3 and 1.16

version 1.3, 2011/07/22 07:38:20 version 1.16, 2023/08/07 08:39:39
Line 1 Line 1
       SUBROUTINE ZSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB,   *> \brief \b ZSYTRS2
      $                    WORK, INFO )  *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at
   *            http://www.netlib.org/lapack/explore-html/
 *  *
 *  -- LAPACK PROTOTYPE routine (version 3.3.1) --  *> \htmlonly
   *> Download ZSYTRS2 + dependencies
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zsytrs2.f">
   *> [TGZ]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zsytrs2.f">
   *> [ZIP]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zsytrs2.f">
   *> [TXT]</a>
   *> \endhtmlonly
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE ZSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB,
   *                           WORK, INFO )
   *
   *       .. Scalar Arguments ..
   *       CHARACTER          UPLO
   *       INTEGER            INFO, LDA, LDB, N, NRHS
   *       ..
   *       .. Array Arguments ..
   *       INTEGER            IPIV( * )
   *       COMPLEX*16       A( LDA, * ), B( LDB, * ), WORK( * )
   *       ..
   *
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> ZSYTRS2 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 and converted by ZSYCONV.
   *> \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,out] A
   *> \verbatim
   *>          A is COMPLEX*16 array, dimension (LDA,N)
   *>          The block diagonal matrix D and the multipliers used to
   *>          obtain the factor U or L as computed by ZSYTRF.
   *>          Note that A is input / output. This might be counter-intuitive,
   *>          and one may think that A is input only. A is input / output. This
   *>          is because, at the start of the subroutine, we permute A in a
   *>          "better" form and then we permute A back to its original form at
   *>          the end.
   *> \endverbatim
   *>
   *> \param[in] LDA
   *> \verbatim
   *>          LDA is INTEGER
   *>          The leading dimension of the array A.  LDA >= max(1,N).
   *> \endverbatim
   *>
   *> \param[in] IPIV
   *> \verbatim
   *>          IPIV is INTEGER array, dimension (N)
   *>          Details of the interchanges and the block structure of D
   *>          as determined by ZSYTRF.
   *> \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] WORK
   *> \verbatim
   *>          WORK is COMPLEX*16 array, dimension (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.
 *  *
 *  -- Written by Julie Langou of the Univ. of TN    --  *> \ingroup complex16SYcomputational
 *  -- April 2011                                                      --  *
   *  =====================================================================
         SUBROUTINE ZSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB,
        $                    WORK, INFO )
 *  *
   *  -- LAPACK computational routine --
 *  -- 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..--
 *  *
Line 15 Line 140
 *     ..  *     ..
 *     .. Array Arguments ..  *     .. Array Arguments ..
       INTEGER            IPIV( * )        INTEGER            IPIV( * )
       DOUBLE COMPLEX   A( LDA, * ), B( LDB, * ), WORK( * )        COMPLEX*16       A( LDA, * ), B( LDB, * ), WORK( * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  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.  
 *  
 *  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.  
 *  
 *  A       (input) DOUBLE COMPLEX array, dimension (LDA,N)  
 *          The block diagonal matrix D and the multipliers used to  
 *          obtain the factor U or L as computed by ZSYTRF.  
 *  
 *  LDA     (input) INTEGER  
 *          The leading dimension of the array A.  LDA >= max(1,N).  
 *  
 *  IPIV    (input) INTEGER array, dimension (N)  
 *          Details of the interchanges and the block structure of D  
 *          as determined by ZSYTRF.  
 *  
 *  B       (input/output) DOUBLE COMPLEX 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).  
 *  
 *  WORK    (workspace) REAL array, dimension (N)  
 *  
 *  INFO    (output) INTEGER  
 *          = 0:  successful exit  
 *          < 0:  if INFO = -i, the i-th argument had an illegal value  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
       DOUBLE COMPLEX     ONE        COMPLEX*16         ONE
       PARAMETER          ( ONE = (1.0D+0,0.0D+0) )        PARAMETER          ( ONE = (1.0D+0,0.0D+0) )
 *     ..  *     ..
 *     .. Local Scalars ..  *     .. Local Scalars ..
       LOGICAL            UPPER        LOGICAL            UPPER
       INTEGER            I, IINFO, J, K, KP        INTEGER            I, IINFO, J, K, KP
       DOUBLE COMPLEX     AK, AKM1, AKM1K, BK, BKM1, DENOM        COMPLEX*16         AK, AKM1, AKM1K, BK, BKM1, DENOM
 *     ..  *     ..
 *     .. External Functions ..  *     .. External Functions ..
       LOGICAL            LSAME        LOGICAL            LSAME
Line 119 Line 197
 *  *
 *        Solve A*X = B, where A = U*D*U**T.  *        Solve A*X = B, where A = U*D*U**T.
 *  *
 *       P**T * B    *       P**T * B
         K=N          K=N
         DO WHILE ( K .GE. 1 )          DO WHILE ( K .GE. 1 )
          IF( IPIV( K ).GT.0 ) THEN           IF( IPIV( K ).GT.0 ) THEN
Line 144 Line 222
         CALL ZTRSM('L','U','N','U',N,NRHS,ONE,A,LDA,B,LDB)          CALL ZTRSM('L','U','N','U',N,NRHS,ONE,A,LDA,B,LDB)
 *  *
 *  Compute D \ B -> B   [ D \ (U \P**T * B) ]  *  Compute D \ B -> B   [ D \ (U \P**T * B) ]
 *         *
          I=N           I=N
          DO WHILE ( I .GE. 1 )           DO WHILE ( I .GE. 1 )
             IF( IPIV(I) .GT. 0 ) THEN              IF( IPIV(I) .GT. 0 ) THEN
Line 196 Line 274
 *  *
 *        Solve A*X = B, where A = L*D*L**T.  *        Solve A*X = B, where A = L*D*L**T.
 *  *
 *       P**T * B    *       P**T * B
         K=1          K=1
         DO WHILE ( K .LE. N )          DO WHILE ( K .LE. N )
          IF( IPIV( K ).GT.0 ) THEN           IF( IPIV( K ).GT.0 ) THEN
Line 221 Line 299
         CALL ZTRSM('L','L','N','U',N,NRHS,ONE,A,LDA,B,LDB)          CALL ZTRSM('L','L','N','U',N,NRHS,ONE,A,LDA,B,LDB)
 *  *
 *  Compute D \ B -> B   [ D \ (L \P**T * B) ]  *  Compute D \ B -> B   [ D \ (L \P**T * B) ]
 *         *
          I=1           I=1
          DO WHILE ( I .LE. N )           DO WHILE ( I .LE. N )
             IF( IPIV(I) .GT. 0 ) THEN              IF( IPIV(I) .GT. 0 ) THEN
Line 243 Line 321
          END DO           END DO
 *  *
 *  Compute (L**T \ B) -> B   [ L**T \ (D \ (L \P**T * B) ) ]  *  Compute (L**T \ B) -> B   [ L**T \ (D \ (L \P**T * B) ) ]
 *   *
         CALL ZTRSM('L','L','T','U',N,NRHS,ONE,A,LDA,B,LDB)          CALL ZTRSM('L','L','T','U',N,NRHS,ONE,A,LDA,B,LDB)
 *  *
 *       P * B  [ P * (L**T \ (D \ (L \P**T * B) )) ]  *       P * B  [ P * (L**T \ (D \ (L \P**T * B) )) ]
Removed from v.1.3  
changed lines
  Added in v.1.16

CVSweb interface <joel.bertrand@systella.fr>