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

Diff for /rpl/lapack/lapack/dgerfs.f between versions 1.7 and 1.8

version 1.7, 2010/12/21 13:53:26 version 1.8, 2011/11/21 20:42:51
Line 1 Line 1
   *> \brief \b DGERFS
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at 
   *            http://www.netlib.org/lapack/explore-html/ 
   *
   *> \htmlonly
   *> Download DGERFS + dependencies 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dgerfs.f"> 
   *> [TGZ]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dgerfs.f"> 
   *> [ZIP]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dgerfs.f"> 
   *> [TXT]</a>
   *> \endhtmlonly 
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE DGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
   *                          X, LDX, FERR, BERR, WORK, IWORK, INFO )
   * 
   *       .. Scalar Arguments ..
   *       CHARACTER          TRANS
   *       INTEGER            INFO, LDA, LDAF, LDB, LDX, N, NRHS
   *       ..
   *       .. Array Arguments ..
   *       INTEGER            IPIV( * ), IWORK( * )
   *       DOUBLE PRECISION   A( LDA, * ), AF( LDAF, * ), B( LDB, * ),
   *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
   *       ..
   *  
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> DGERFS improves the computed solution to a system of linear
   *> equations and provides error bounds and backward error estimates for
   *> the solution.
   *> \endverbatim
   *
   *  Arguments:
   *  ==========
   *
   *> \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] 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 matrices B and X.  NRHS >= 0.
   *> \endverbatim
   *>
   *> \param[in] A
   *> \verbatim
   *>          A is DOUBLE PRECISION array, dimension (LDA,N)
   *>          The original N-by-N matrix A.
   *> \endverbatim
   *>
   *> \param[in] LDA
   *> \verbatim
   *>          LDA is INTEGER
   *>          The leading dimension of the array A.  LDA >= max(1,N).
   *> \endverbatim
   *>
   *> \param[in] AF
   *> \verbatim
   *>          AF is DOUBLE PRECISION array, dimension (LDAF,N)
   *>          The factors L and U from the factorization A = P*L*U
   *>          as computed by DGETRF.
   *> \endverbatim
   *>
   *> \param[in] LDAF
   *> \verbatim
   *>          LDAF is INTEGER
   *>          The leading dimension of the array AF.  LDAF >= max(1,N).
   *> \endverbatim
   *>
   *> \param[in] IPIV
   *> \verbatim
   *>          IPIV is INTEGER array, dimension (N)
   *>          The pivot indices from DGETRF; for 1<=i<=N, row i of the
   *>          matrix was interchanged with row IPIV(i).
   *> \endverbatim
   *>
   *> \param[in] B
   *> \verbatim
   *>          B is DOUBLE PRECISION array, dimension (LDB,NRHS)
   *>          The right hand side matrix B.
   *> \endverbatim
   *>
   *> \param[in] LDB
   *> \verbatim
   *>          LDB is INTEGER
   *>          The leading dimension of the array B.  LDB >= max(1,N).
   *> \endverbatim
   *>
   *> \param[in,out] X
   *> \verbatim
   *>          X is DOUBLE PRECISION array, dimension (LDX,NRHS)
   *>          On entry, the solution matrix X, as computed by DGETRS.
   *>          On exit, the improved solution matrix X.
   *> \endverbatim
   *>
   *> \param[in] LDX
   *> \verbatim
   *>          LDX is INTEGER
   *>          The leading dimension of the array X.  LDX >= max(1,N).
   *> \endverbatim
   *>
   *> \param[out] FERR
   *> \verbatim
   *>          FERR is DOUBLE PRECISION array, dimension (NRHS)
   *>          The estimated forward error bound for each solution vector
   *>          X(j) (the j-th column of the solution matrix X).
   *>          If XTRUE is the true solution corresponding to X(j), FERR(j)
   *>          is an estimated upper bound for the magnitude of the largest
   *>          element in (X(j) - XTRUE) divided by the magnitude of the
   *>          largest element in X(j).  The estimate is as reliable as
   *>          the estimate for RCOND, and is almost always a slight
   *>          overestimate of the true error.
   *> \endverbatim
   *>
   *> \param[out] BERR
   *> \verbatim
   *>          BERR is DOUBLE PRECISION array, dimension (NRHS)
   *>          The componentwise relative backward error of each solution
   *>          vector X(j) (i.e., the smallest relative change in
   *>          any element of A or B that makes X(j) an exact solution).
   *> \endverbatim
   *>
   *> \param[out] WORK
   *> \verbatim
   *>          WORK is DOUBLE PRECISION array, dimension (3*N)
   *> \endverbatim
   *>
   *> \param[out] IWORK
   *> \verbatim
   *>          IWORK is INTEGER 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
   *
   *> \par Internal Parameters:
   *  =========================
   *>
   *> \verbatim
   *>  ITMAX is the maximum number of steps of iterative refinement.
   *> \endverbatim
   *
   *  Authors:
   *  ========
   *
   *> \author Univ. of Tennessee 
   *> \author Univ. of California Berkeley 
   *> \author Univ. of Colorado Denver 
   *> \author NAG Ltd. 
   *
   *> \date November 2011
   *
   *> \ingroup doubleGEcomputational
   *
   *  =====================================================================
       SUBROUTINE DGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,        SUBROUTINE DGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
      $                   X, LDX, FERR, BERR, WORK, IWORK, INFO )       $                   X, LDX, FERR, BERR, WORK, IWORK, 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
 *  
 *     Modified to call DLACN2 in place of DLACON, 5 Feb 03, SJH.  
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          TRANS        CHARACTER          TRANS
Line 18 Line 200
      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )       $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  DGERFS improves the computed solution to a system of linear  
 *  equations and provides error bounds and backward error estimates for  
 *  the solution.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  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)  
 *  
 *  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 matrices B and X.  NRHS >= 0.  
 *  
 *  A       (input) DOUBLE PRECISION array, dimension (LDA,N)  
 *          The original N-by-N matrix A.  
 *  
 *  LDA     (input) INTEGER  
 *          The leading dimension of the array A.  LDA >= max(1,N).  
 *  
 *  AF      (input) DOUBLE PRECISION array, dimension (LDAF,N)  
 *          The factors L and U from the factorization A = P*L*U  
 *          as computed by DGETRF.  
 *  
 *  LDAF    (input) INTEGER  
 *          The leading dimension of the array AF.  LDAF >= max(1,N).  
 *  
 *  IPIV    (input) INTEGER array, dimension (N)  
 *          The pivot indices from DGETRF; for 1<=i<=N, row i of the  
 *          matrix was interchanged with row IPIV(i).  
 *  
 *  B       (input) DOUBLE PRECISION array, dimension (LDB,NRHS)  
 *          The right hand side matrix B.  
 *  
 *  LDB     (input) INTEGER  
 *          The leading dimension of the array B.  LDB >= max(1,N).  
 *  
 *  X       (input/output) DOUBLE PRECISION array, dimension (LDX,NRHS)  
 *          On entry, the solution matrix X, as computed by DGETRS.  
 *          On exit, the improved solution matrix X.  
 *  
 *  LDX     (input) INTEGER  
 *          The leading dimension of the array X.  LDX >= max(1,N).  
 *  
 *  FERR    (output) DOUBLE PRECISION array, dimension (NRHS)  
 *          The estimated forward error bound for each solution vector  
 *          X(j) (the j-th column of the solution matrix X).  
 *          If XTRUE is the true solution corresponding to X(j), FERR(j)  
 *          is an estimated upper bound for the magnitude of the largest  
 *          element in (X(j) - XTRUE) divided by the magnitude of the  
 *          largest element in X(j).  The estimate is as reliable as  
 *          the estimate for RCOND, and is almost always a slight  
 *          overestimate of the true error.  
 *  
 *  BERR    (output) DOUBLE PRECISION array, dimension (NRHS)  
 *          The componentwise relative backward error of each solution  
 *          vector X(j) (i.e., the smallest relative change in  
 *          any element of A or B that makes X(j) an exact solution).  
 *  
 *  WORK    (workspace) DOUBLE PRECISION array, dimension (3*N)  
 *  
 *  IWORK   (workspace) INTEGER array, dimension (N)  
 *  
 *  INFO    (output) INTEGER  
 *          = 0:  successful exit  
 *          < 0:  if INFO = -i, the i-th argument had an illegal value  
 *  
 *  Internal Parameters  
 *  ===================  
 *  
 *  ITMAX is the maximum number of steps of iterative refinement.  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
Removed from v.1.7  
changed lines
  Added in v.1.8

CVSweb interface <joel.bertrand@systella.fr>