|
version 1.8, 2011/11/21 20:43:18
|
version 1.20, 2023/08/07 08:39:32
|
|
Line 1
|
Line 1
|
| *> \brief \b ZLATDF |
*> \brief \b ZLATDF uses the LU factorization of the n-by-n matrix computed by sgetc2 and computes a contribution to the reciprocal Dif-estimate. |
| * |
* |
| * =========== DOCUMENTATION =========== |
* =========== DOCUMENTATION =========== |
| * |
* |
| * Online html documentation available at |
* Online html documentation available at |
| * http://www.netlib.org/lapack/explore-html/ |
* http://www.netlib.org/lapack/explore-html/ |
| * |
* |
| *> \htmlonly |
*> \htmlonly |
| *> Download ZLATDF + dependencies |
*> Download ZLATDF + dependencies |
| *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlatdf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlatdf.f"> |
| *> [TGZ]</a> |
*> [TGZ]</a> |
| *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlatdf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlatdf.f"> |
| *> [ZIP]</a> |
*> [ZIP]</a> |
| *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlatdf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlatdf.f"> |
| *> [TXT]</a> |
*> [TXT]</a> |
| *> \endhtmlonly |
*> \endhtmlonly |
| * |
* |
| * Definition: |
* Definition: |
| * =========== |
* =========== |
| * |
* |
| * SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, |
* SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, |
| * JPIV ) |
* JPIV ) |
| * |
* |
| * .. Scalar Arguments .. |
* .. Scalar Arguments .. |
| * INTEGER IJOB, LDZ, N |
* INTEGER IJOB, LDZ, N |
| * DOUBLE PRECISION RDSCAL, RDSUM |
* DOUBLE PRECISION RDSCAL, RDSUM |
|
Line 29
|
Line 29
|
| * INTEGER IPIV( * ), JPIV( * ) |
* INTEGER IPIV( * ), JPIV( * ) |
| * COMPLEX*16 RHS( * ), Z( LDZ, * ) |
* COMPLEX*16 RHS( * ), Z( LDZ, * ) |
| * .. |
* .. |
| * |
* |
| * |
* |
| *> \par Purpose: |
*> \par Purpose: |
| * ============= |
* ============= |
|
Line 58
|
Line 58
|
| *> Zx = +-e - f with the sign giving the greater value of |
*> Zx = +-e - f with the sign giving the greater value of |
| *> 2-norm(x). About 5 times as expensive as Default. |
*> 2-norm(x). About 5 times as expensive as Default. |
| *> IJOB .ne. 2: Local look ahead strategy where |
*> IJOB .ne. 2: Local look ahead strategy where |
| *> all entries of the r.h.s. b is choosen as either +1 or |
*> all entries of the r.h.s. b is chosen as either +1 or |
| *> -1. Default. |
*> -1. Default. |
| *> \endverbatim |
*> \endverbatim |
| *> |
*> |
|
Line 70
|
Line 70
|
| *> |
*> |
| *> \param[in] Z |
*> \param[in] Z |
| *> \verbatim |
*> \verbatim |
| *> Z is DOUBLE PRECISION array, dimension (LDZ, N) |
*> Z is COMPLEX*16 array, dimension (LDZ, N) |
| *> On entry, the LU part of the factorization of the n-by-n |
*> On entry, the LU part of the factorization of the n-by-n |
| *> matrix Z computed by ZGETC2: Z = P * L * U * Q |
*> matrix Z computed by ZGETC2: Z = P * L * U * Q |
| *> \endverbatim |
*> \endverbatim |
|
Line 83
|
Line 83
|
| *> |
*> |
| *> \param[in,out] RHS |
*> \param[in,out] RHS |
| *> \verbatim |
*> \verbatim |
| *> RHS is DOUBLE PRECISION array, dimension (N). |
*> RHS is COMPLEX*16 array, dimension (N). |
| *> On entry, RHS contains contributions from other subsystems. |
*> On entry, RHS contains contributions from other subsystems. |
| *> On exit, RHS contains the solution of the subsystem with |
*> On exit, RHS contains the solution of the subsystem with |
| *> entries according to the value of IJOB (see above). |
*> entries according to the value of IJOB (see above). |
|
Line 129
|
Line 129
|
| * Authors: |
* Authors: |
| * ======== |
* ======== |
| * |
* |
| *> \author Univ. of Tennessee |
*> \author Univ. of Tennessee |
| *> \author Univ. of California Berkeley |
*> \author Univ. of California Berkeley |
| *> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
| *> \author NAG Ltd. |
*> \author NAG Ltd. |
| * |
|
| *> \date November 2011 |
|
| * |
* |
| *> \ingroup complex16OTHERauxiliary |
*> \ingroup complex16OTHERauxiliary |
| * |
* |
|
Line 169
|
Line 167
|
| SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, |
SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, |
| $ JPIV ) |
$ JPIV ) |
| * |
* |
| * -- LAPACK auxiliary routine (version 3.4.0) -- |
* -- LAPACK auxiliary 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..-- |
| * November 2011 |
|
| * |
* |
| * .. Scalar Arguments .. |
* .. Scalar Arguments .. |
| INTEGER IJOB, LDZ, N |
INTEGER IJOB, LDZ, N |
|
Line 261
|
Line 258
|
| * |
* |
| * Solve for U- part, lockahead for RHS(N) = +-1. This is not done |
* Solve for U- part, lockahead for RHS(N) = +-1. This is not done |
| * In BSOLVE and will hopefully give us a better estimate because |
* In BSOLVE and will hopefully give us a better estimate because |
| * any ill-conditioning of the original matrix is transfered to U |
* any ill-conditioning of the original matrix is transferred to U |
| * and not to L. U(N, N) is an approximation to sigma_min(LU). |
* and not to L. U(N, N) is an approximation to sigma_min(LU). |
| * |
* |
| CALL ZCOPY( N-1, RHS, 1, WORK, 1 ) |
CALL ZCOPY( N-1, RHS, 1, WORK, 1 ) |
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to zlatdf.f CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [local] / rpl / lapack / lapack