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

version 1.7, 2010/12/21 13:53:46 version 1.8, 2011/11/21 20:43:11
Line 1 Line 1
   *> \brief <b> ZHEEV computes the eigenvalues and, optionally, the left and/or right eigenvectors for HE matrices</b>
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at 
   *            http://www.netlib.org/lapack/explore-html/ 
   *
   *> \htmlonly
   *> Download ZHEEV + dependencies 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zheev.f"> 
   *> [TGZ]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zheev.f"> 
   *> [ZIP]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zheev.f"> 
   *> [TXT]</a>
   *> \endhtmlonly 
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE ZHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
   *                         INFO )
   * 
   *       .. Scalar Arguments ..
   *       CHARACTER          JOBZ, UPLO
   *       INTEGER            INFO, LDA, LWORK, N
   *       ..
   *       .. Array Arguments ..
   *       DOUBLE PRECISION   RWORK( * ), W( * )
   *       COMPLEX*16         A( LDA, * ), WORK( * )
   *       ..
   *  
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> ZHEEV computes all eigenvalues and, optionally, eigenvectors of a
   *> complex Hermitian matrix A.
   *> \endverbatim
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] JOBZ
   *> \verbatim
   *>          JOBZ is CHARACTER*1
   *>          = 'N':  Compute eigenvalues only;
   *>          = 'V':  Compute eigenvalues and eigenvectors.
   *> \endverbatim
   *>
   *> \param[in] UPLO
   *> \verbatim
   *>          UPLO is CHARACTER*1
   *>          = 'U':  Upper triangle of A is stored;
   *>          = 'L':  Lower triangle of A is stored.
   *> \endverbatim
   *>
   *> \param[in] N
   *> \verbatim
   *>          N is INTEGER
   *>          The order of the matrix A.  N >= 0.
   *> \endverbatim
   *>
   *> \param[in,out] A
   *> \verbatim
   *>          A is COMPLEX*16 array, dimension (LDA, N)
   *>          On entry, the Hermitian matrix A.  If UPLO = 'U', the
   *>          leading N-by-N upper triangular part of A contains the
   *>          upper triangular part of the matrix A.  If UPLO = 'L',
   *>          the leading N-by-N lower triangular part of A contains
   *>          the lower triangular part of the matrix A.
   *>          On exit, if JOBZ = 'V', then if INFO = 0, A contains the
   *>          orthonormal eigenvectors of the matrix A.
   *>          If JOBZ = 'N', then on exit the lower triangle (if UPLO='L')
   *>          or the upper triangle (if UPLO='U') of A, including the
   *>          diagonal, is destroyed.
   *> \endverbatim
   *>
   *> \param[in] LDA
   *> \verbatim
   *>          LDA is INTEGER
   *>          The leading dimension of the array A.  LDA >= max(1,N).
   *> \endverbatim
   *>
   *> \param[out] W
   *> \verbatim
   *>          W is DOUBLE PRECISION array, dimension (N)
   *>          If INFO = 0, the eigenvalues in ascending order.
   *> \endverbatim
   *>
   *> \param[out] WORK
   *> \verbatim
   *>          WORK is COMPLEX*16 array, dimension (MAX(1,LWORK))
   *>          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
   *> \endverbatim
   *>
   *> \param[in] LWORK
   *> \verbatim
   *>          LWORK is INTEGER
   *>          The length of the array WORK.  LWORK >= max(1,2*N-1).
   *>          For optimal efficiency, LWORK >= (NB+1)*N,
   *>          where NB is the blocksize for ZHETRD returned by ILAENV.
   *>
   *>          If LWORK = -1, then a workspace query is assumed; the routine
   *>          only calculates the optimal size of the WORK array, returns
   *>          this value as the first entry of the WORK array, and no error
   *>          message related to LWORK is issued by XERBLA.
   *> \endverbatim
   *>
   *> \param[out] RWORK
   *> \verbatim
   *>          RWORK is DOUBLE PRECISION array, dimension (max(1, 3*N-2))
   *> \endverbatim
   *>
   *> \param[out] INFO
   *> \verbatim
   *>          INFO is INTEGER
   *>          = 0:  successful exit
   *>          < 0:  if INFO = -i, the i-th argument had an illegal value
   *>          > 0:  if INFO = i, the algorithm failed to converge; i
   *>                off-diagonal elements of an intermediate tridiagonal
   *>                form did not converge to zero.
   *> \endverbatim
   *
   *  Authors:
   *  ========
   *
   *> \author Univ. of Tennessee 
   *> \author Univ. of California Berkeley 
   *> \author Univ. of Colorado Denver 
   *> \author NAG Ltd. 
   *
   *> \date November 2011
   *
   *> \ingroup complex16HEeigen
   *
   *  =====================================================================
       SUBROUTINE ZHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,        SUBROUTINE ZHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
      $                  INFO )       $                  INFO )
 *  *
 *  -- LAPACK driver routine (version 3.2) --  *  -- LAPACK driver 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
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          JOBZ, UPLO        CHARACTER          JOBZ, UPLO
Line 15 Line 154
       COMPLEX*16         A( LDA, * ), WORK( * )        COMPLEX*16         A( LDA, * ), WORK( * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  ZHEEV computes all eigenvalues and, optionally, eigenvectors of a  
 *  complex Hermitian matrix A.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  JOBZ    (input) CHARACTER*1  
 *          = 'N':  Compute eigenvalues only;  
 *          = 'V':  Compute eigenvalues and eigenvectors.  
 *  
 *  UPLO    (input) CHARACTER*1  
 *          = 'U':  Upper triangle of A is stored;  
 *          = 'L':  Lower triangle of A is stored.  
 *  
 *  N       (input) INTEGER  
 *          The order of the matrix A.  N >= 0.  
 *  
 *  A       (input/output) COMPLEX*16 array, dimension (LDA, N)  
 *          On entry, the Hermitian matrix A.  If UPLO = 'U', the  
 *          leading N-by-N upper triangular part of A contains the  
 *          upper triangular part of the matrix A.  If UPLO = 'L',  
 *          the leading N-by-N lower triangular part of A contains  
 *          the lower triangular part of the matrix A.  
 *          On exit, if JOBZ = 'V', then if INFO = 0, A contains the  
 *          orthonormal eigenvectors of the matrix A.  
 *          If JOBZ = 'N', then on exit the lower triangle (if UPLO='L')  
 *          or the upper triangle (if UPLO='U') of A, including the  
 *          diagonal, is destroyed.  
 *  
 *  LDA     (input) INTEGER  
 *          The leading dimension of the array A.  LDA >= max(1,N).  
 *  
 *  W       (output) DOUBLE PRECISION array, dimension (N)  
 *          If INFO = 0, the eigenvalues in ascending order.  
 *  
 *  WORK    (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))  
 *          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.  
 *  
 *  LWORK   (input) INTEGER  
 *          The length of the array WORK.  LWORK >= max(1,2*N-1).  
 *          For optimal efficiency, LWORK >= (NB+1)*N,  
 *          where NB is the blocksize for ZHETRD returned by ILAENV.  
 *  
 *          If LWORK = -1, then a workspace query is assumed; the routine  
 *          only calculates the optimal size of the WORK array, returns  
 *          this value as the first entry of the WORK array, and no error  
 *          message related to LWORK is issued by XERBLA.  
 *  
 *  RWORK   (workspace) DOUBLE PRECISION array, dimension (max(1, 3*N-2))  
 *  
 *  INFO    (output) INTEGER  
 *          = 0:  successful exit  
 *          < 0:  if INFO = -i, the i-th argument had an illegal value  
 *          > 0:  if INFO = i, the algorithm failed to converge; i  
 *                off-diagonal elements of an intermediate tridiagonal  
 *                form did not converge to zero.  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..

Removed from v.1.7  
changed lines
  Added in v.1.8


CVSweb interface <joel.bertrand@systella.fr>