version 1.16, 2016/08/27 15:27:14
|
version 1.22, 2020/05/21 21:46:10
|
Line 2
|
Line 2
|
* |
* |
* =========== 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 ZSTEMR + dependencies |
*> Download ZSTEMR + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zstemr.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zstemr.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zstemr.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zstemr.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zstemr.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zstemr.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
Line 21
|
Line 21
|
* SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, |
* SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, |
* M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, |
* M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, |
* IWORK, LIWORK, INFO ) |
* IWORK, LIWORK, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* CHARACTER JOBZ, RANGE |
* CHARACTER JOBZ, RANGE |
* LOGICAL TRYRAC |
* LOGICAL TRYRAC |
Line 33
|
Line 33
|
* DOUBLE PRECISION D( * ), E( * ), W( * ), WORK( * ) |
* DOUBLE PRECISION D( * ), E( * ), W( * ), WORK( * ) |
* COMPLEX*16 Z( LDZ, * ) |
* COMPLEX*16 Z( LDZ, * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 239
|
Line 239
|
*> |
*> |
*> \param[out] ISUPPZ |
*> \param[out] ISUPPZ |
*> \verbatim |
*> \verbatim |
*> ISUPPZ is INTEGER ARRAY, dimension ( 2*max(1,M) ) |
*> ISUPPZ is INTEGER array, dimension ( 2*max(1,M) ) |
*> The support of the eigenvectors in Z, i.e., the indices |
*> The support of the eigenvectors in Z, i.e., the indices |
*> indicating the nonzero elements in Z. The i-th computed eigenvector |
*> indicating the nonzero elements in Z. The i-th computed eigenvector |
*> is nonzero only in elements ISUPPZ( 2*i-1 ) through |
*> is nonzero only in elements ISUPPZ( 2*i-1 ) through |
Line 250
|
Line 250
|
*> \param[in,out] TRYRAC |
*> \param[in,out] TRYRAC |
*> \verbatim |
*> \verbatim |
*> TRYRAC is LOGICAL |
*> TRYRAC is LOGICAL |
*> If TRYRAC.EQ..TRUE., indicates that the code should check whether |
*> If TRYRAC = .TRUE., indicates that the code should check whether |
*> the tridiagonal matrix defines its eigenvalues to high relative |
*> the tridiagonal matrix defines its eigenvalues to high relative |
*> accuracy. If so, the code uses relative-accuracy preserving |
*> accuracy. If so, the code uses relative-accuracy preserving |
*> algorithms that might be (a bit) slower depending on the matrix. |
*> algorithms that might be (a bit) slower depending on the matrix. |
*> If the matrix does not define its eigenvalues to high relative |
*> If the matrix does not define its eigenvalues to high relative |
*> accuracy, the code can uses possibly faster algorithms. |
*> accuracy, the code can uses possibly faster algorithms. |
*> If TRYRAC.EQ..FALSE., the code is not required to guarantee |
*> If TRYRAC = .FALSE., the code is not required to guarantee |
*> relatively accurate eigenvalues and can use the fastest possible |
*> relatively accurate eigenvalues and can use the fastest possible |
*> techniques. |
*> techniques. |
*> On exit, a .TRUE. TRYRAC will be set to .FALSE. if the matrix |
*> On exit, a .TRUE. TRYRAC will be set to .FALSE. if the matrix |
Line 315
|
Line 315
|
* 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 June 2016 |
*> \date June 2016 |
* |
* |
Line 338
|
Line 338
|
$ M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, |
$ M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK, |
$ IWORK, LIWORK, INFO ) |
$ IWORK, LIWORK, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.6.1) -- |
* -- LAPACK computational routine (version 3.7.1) -- |
* -- 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..-- |
* June 2016 |
* June 2016 |
Line 418
|
Line 418
|
IIL = 0 |
IIL = 0 |
IIU = 0 |
IIU = 0 |
NSPLIT = 0 |
NSPLIT = 0 |
|
|
IF( VALEIG ) THEN |
IF( VALEIG ) THEN |
* We do not reference VL, VU in the cases RANGE = 'I','A' |
* We do not reference VL, VU in the cases RANGE = 'I','A' |
* The interval (WL, WU] contains all the wanted eigenvalues. |
* The interval (WL, WU] contains all the wanted eigenvalues. |