version 1.13, 2017/06/17 10:54:08
|
version 1.17, 2023/08/07 08:39:15
|
Line 75
|
Line 75
|
*> Specifies the form of the system of equations: |
*> Specifies the form of the system of equations: |
*> = 'N': A * X = B (No transpose) |
*> = 'N': A * X = B (No transpose) |
*> = 'T': A**T * X = B (Transpose) |
*> = 'T': A**T * X = B (Transpose) |
*> = 'C': A**H * X = B (Conjugate transpose = Transpose) |
*> = 'C': A**H * X = B (Conjugate transpose) |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in] EQUED |
*> \param[in] EQUED |
Line 138
|
Line 138
|
*> \verbatim |
*> \verbatim |
*> AFB is COMPLEX*16 array, dimension (LDAFB,N) |
*> AFB is COMPLEX*16 array, dimension (LDAFB,N) |
*> Details of the LU factorization of the band matrix A, as |
*> Details of the LU factorization of the band matrix A, as |
*> computed by DGBTRF. U is stored as an upper triangular band |
*> computed by ZGBTRF. U is stored as an upper triangular band |
*> matrix with KL+KU superdiagonals in rows 1 to KL+KU+1, and |
*> matrix with KL+KU superdiagonals in rows 1 to KL+KU+1, and |
*> the multipliers used during the factorization are stored in |
*> the multipliers used during the factorization are stored in |
*> rows KL+KU+2 to 2*KL+KU+1. |
*> rows KL+KU+2 to 2*KL+KU+1. |
Line 153
|
Line 153
|
*> \param[in] IPIV |
*> \param[in] IPIV |
*> \verbatim |
*> \verbatim |
*> IPIV is INTEGER array, dimension (N) |
*> IPIV is INTEGER array, dimension (N) |
*> The pivot indices from DGETRF; for 1<=i<=N, row i of the |
*> The pivot indices from ZGETRF; for 1<=i<=N, row i of the |
*> matrix was interchanged with row IPIV(i). |
*> matrix was interchanged with row IPIV(i). |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
Line 208
|
Line 208
|
*> \param[in,out] X |
*> \param[in,out] X |
*> \verbatim |
*> \verbatim |
*> X is COMPLEX*16 array, dimension (LDX,NRHS) |
*> X is COMPLEX*16 array, dimension (LDX,NRHS) |
*> On entry, the solution matrix X, as computed by DGETRS. |
*> On entry, the solution matrix X, as computed by ZGETRS. |
*> On exit, the improved solution matrix X. |
*> On exit, the improved solution matrix X. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
Line 308
|
Line 308
|
*> information as described below. There currently are up to three |
*> information as described below. There currently are up to three |
*> pieces of information returned for each right-hand side. If |
*> pieces of information returned for each right-hand side. If |
*> componentwise accuracy is not requested (PARAMS(3) = 0.0), then |
*> componentwise accuracy is not requested (PARAMS(3) = 0.0), then |
*> ERR_BNDS_COMP is not accessed. If N_ERR_BNDS .LT. 3, then at most |
*> ERR_BNDS_COMP is not accessed. If N_ERR_BNDS < 3, then at most |
*> the first (:,N_ERR_BNDS) entries are returned. |
*> the first (:,N_ERR_BNDS) entries are returned. |
*> |
*> |
*> The first index in ERR_BNDS_COMP(i,:) corresponds to the ith |
*> The first index in ERR_BNDS_COMP(i,:) corresponds to the ith |
Line 344
|
Line 344
|
*> \param[in] NPARAMS |
*> \param[in] NPARAMS |
*> \verbatim |
*> \verbatim |
*> NPARAMS is INTEGER |
*> NPARAMS is INTEGER |
*> Specifies the number of parameters set in PARAMS. If .LE. 0, the |
*> Specifies the number of parameters set in PARAMS. If <= 0, the |
*> PARAMS array is never referenced and default values are used. |
*> PARAMS array is never referenced and default values are used. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in,out] PARAMS |
*> \param[in,out] PARAMS |
*> \verbatim |
*> \verbatim |
*> PARAMS is DOUBLE PRECISION array, dimension NPARAMS |
*> PARAMS is DOUBLE PRECISION array, dimension NPARAMS |
*> Specifies algorithm parameters. If an entry is .LT. 0.0, then |
*> Specifies algorithm parameters. If an entry is < 0.0, then |
*> that entry will be filled with default value used for that |
*> that entry will be filled with default value used for that |
*> parameter. Only positions up to NPARAMS are accessed; defaults |
*> parameter. Only positions up to NPARAMS are accessed; defaults |
*> are used for higher-numbered parameters. |
*> are used for higher-numbered parameters. |
Line 359
|
Line 359
|
*> PARAMS(LA_LINRX_ITREF_I = 1) : Whether to perform iterative |
*> PARAMS(LA_LINRX_ITREF_I = 1) : Whether to perform iterative |
*> refinement or not. |
*> refinement or not. |
*> Default: 1.0D+0 |
*> Default: 1.0D+0 |
*> = 0.0 : No refinement is performed, and no error bounds are |
*> = 0.0: No refinement is performed, and no error bounds are |
*> computed. |
*> computed. |
*> = 1.0 : Use the double-precision refinement algorithm, |
*> = 1.0: Use the double-precision refinement algorithm, |
*> possibly with doubled-single computations if the |
*> possibly with doubled-single computations if the |
*> compilation environment does not support DOUBLE |
*> compilation environment does not support DOUBLE |
*> PRECISION. |
*> PRECISION. |
Line 429
|
Line 429
|
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
* |
*> \date April 2012 |
|
* |
|
*> \ingroup complex16GBcomputational |
*> \ingroup complex16GBcomputational |
* |
* |
* ===================================================================== |
* ===================================================================== |
Line 440
|
Line 438
|
$ ERR_BNDS_COMP, NPARAMS, PARAMS, WORK, RWORK, |
$ ERR_BNDS_COMP, NPARAMS, PARAMS, WORK, RWORK, |
$ INFO ) |
$ INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.7.0) -- |
* -- 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..-- |
* April 2012 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER TRANS, EQUED |
CHARACTER TRANS, EQUED |