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

Diff for /rpl/lapack/lapack/zgesvj.f between versions 1.5 and 1.6

version 1.5, 2017/06/17 11:06:44 version 1.6, 2018/05/29 06:55:22
Line 52 Line 52
 *  *
 *> \param[in] JOBA  *> \param[in] JOBA
 *> \verbatim  *> \verbatim
 *>          JOBA is CHARACTER* 1  *>          JOBA is CHARACTER*1
 *>          Specifies the structure of A.  *>          Specifies the structure of A.
 *>          = 'L': The input matrix A is lower triangular;  *>          = 'L': The input matrix A is lower triangular;
 *>          = 'U': The input matrix A is upper triangular;  *>          = 'U': The input matrix A is upper triangular;
Line 206 Line 206
 *>  *>
 *> \param[in,out] CWORK  *> \param[in,out] CWORK
 *> \verbatim  *> \verbatim
 *>          CWORK is COMPLEX*16 array, dimension max(1,LWORK).  *>          CWORK is COMPLEX*16 array, dimension (max(1,LWORK))
 *>          Used as workspace.  *>          Used as workspace.
 *>          If on entry LWORK .EQ. -1, then a workspace query is assumed and  *>          If on entry LWORK .EQ. -1, then a workspace query is assumed and
 *>          no computation is done; CWORK(1) is set to the minial (and optimal)  *>          no computation is done; CWORK(1) is set to the minial (and optimal)
Line 221 Line 221
 *>  *>
 *> \param[in,out] RWORK  *> \param[in,out] RWORK
 *> \verbatim  *> \verbatim
 *>          RWORK is DOUBLE PRECISION array, dimension max(6,LRWORK).  *>          RWORK is DOUBLE PRECISION array, dimension (max(6,LRWORK))
 *>          On entry,  *>          On entry,
 *>          If JOBU .EQ. 'C' :  *>          If JOBU .EQ. 'C' :
 *>          RWORK(1) = CTOL, where CTOL defines the threshold for convergence.  *>          RWORK(1) = CTOL, where CTOL defines the threshold for convergence.
Line 318 Line 318
 *> \par References:  *> \par References:
 *  ================  *  ================
 *>  *>
   *> \verbatim
   *>
 *> [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the  *> [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the
 *>    singular value decomposition on a vector computer.  *>    singular value decomposition on a vector computer.
 *>    SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371.  *>    SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371.
Line 349 Line 351
       SUBROUTINE ZGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V,        SUBROUTINE ZGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V,
      $                   LDV, CWORK, LWORK, RWORK, LRWORK, INFO )       $                   LDV, CWORK, LWORK, RWORK, LRWORK, INFO )
 *  *
 *  -- LAPACK computational routine (version 3.7.0) --  *  -- LAPACK computational routine (version 3.8.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..--
 *     June 2016  *     June 2016
Line 407 Line 409
 *     .. External Subroutines ..  *     .. External Subroutines ..
 *     ..  *     ..
 *     from BLAS  *     from BLAS
       EXTERNAL           ZCOPY, ZROT, ZDSCAL, ZSWAP        EXTERNAL           ZCOPY, ZROT, ZDSCAL, ZSWAP, ZAXPY
 *     from LAPACK  *     from LAPACK
       EXTERNAL           DLASCL, ZLASCL, ZLASET, ZLASSQ, XERBLA        EXTERNAL           DLASCL, ZLASCL, ZLASET, ZLASSQ, XERBLA
       EXTERNAL           ZGSVJ0, ZGSVJ1        EXTERNAL           ZGSVJ0, ZGSVJ1
Removed from v.1.5  
changed lines
  Added in v.1.6

CVSweb interface <joel.bertrand@systella.fr>