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

Diff for /rpl/lapack/lapack/dpftrs.f between versions 1.2 and 1.6

version 1.2, 2010/08/07 13:22:23 version 1.6, 2011/07/22 07:38:09
Line 1 Line 1
       SUBROUTINE DPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )        SUBROUTINE DPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )
 *  *
 *  -- LAPACK routine (version 3.2.2)                                    --  *  -- LAPACK routine (version 3.3.1)                                    --
 *  *
 *  -- Contributed by Fred Gustavson of the IBM Watson Research Center --  *  -- Contributed by Fred Gustavson of the IBM Watson Research Center --
 *  -- June 2010                                                       --  *  -- April 2011                                                      --
 *  *
 *  -- 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 26 Line 26
 *  Arguments  *  Arguments
 *  =========  *  =========
 *  *
 *  TRANSR  (input) CHARACTER  *  TRANSR  (input) CHARACTER*1
 *          = 'N':  The Normal TRANSR of RFP A is stored;  *          = 'N':  The Normal TRANSR of RFP A is stored;
 *          = 'T':  The Transpose TRANSR of RFP A is stored.  *          = 'T':  The Transpose TRANSR of RFP A is stored.
 *  *
 *  UPLO    (input) CHARACTER  *  UPLO    (input) CHARACTER*1
 *          = 'U':  Upper triangle of RFP A is stored;  *          = 'U':  Upper triangle of RFP A is stored;
 *          = 'L':  Lower triangle of RFP A is stored.  *          = 'L':  Lower triangle of RFP A is stored.
 *  *
Line 186 Line 186
 *     Quick return if possible  *     Quick return if possible
 *  *
       IF( N.EQ.0 .OR. NRHS.EQ.0 )        IF( N.EQ.0 .OR. NRHS.EQ.0 )
      +   RETURN       $   RETURN
 *  *
 *     start execution: there are two triangular solves  *     start execution: there are two triangular solves
 *  *
       IF( LOWER ) THEN        IF( LOWER ) THEN
          CALL DTFSM( TRANSR, 'L', UPLO, 'N', 'N', N, NRHS, ONE, A, B,           CALL DTFSM( TRANSR, 'L', UPLO, 'N', 'N', N, NRHS, ONE, A, B,
      +               LDB )       $               LDB )
          CALL DTFSM( TRANSR, 'L', UPLO, 'T', 'N', N, NRHS, ONE, A, B,           CALL DTFSM( TRANSR, 'L', UPLO, 'T', 'N', N, NRHS, ONE, A, B,
      +               LDB )       $               LDB )
       ELSE        ELSE
          CALL DTFSM( TRANSR, 'L', UPLO, 'T', 'N', N, NRHS, ONE, A, B,           CALL DTFSM( TRANSR, 'L', UPLO, 'T', 'N', N, NRHS, ONE, A, B,
      +               LDB )       $               LDB )
          CALL DTFSM( TRANSR, 'L', UPLO, 'N', 'N', N, NRHS, ONE, A, B,           CALL DTFSM( TRANSR, 'L', UPLO, 'N', 'N', N, NRHS, ONE, A, B,
      +               LDB )       $               LDB )
       END IF        END IF
 *  *
       RETURN        RETURN
Removed from v.1.2  
changed lines
  Added in v.1.6

CVSweb interface <joel.bertrand@systella.fr>