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

Diff for /rpl/lapack/lapack/dbdsqr.f between versions 1.13 and 1.14

version 1.13, 2016/08/27 15:34:19 version 1.14, 2017/06/17 10:53:46
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 DBDSQR + dependencies   *> Download DBDSQR + dependencies
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dbdsqr.f">   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dbdsqr.f">
 *> [TGZ]</a>   *> [TGZ]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dbdsqr.f">   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dbdsqr.f">
 *> [ZIP]</a>   *> [ZIP]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dbdsqr.f">   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dbdsqr.f">
 *> [TXT]</a>  *> [TXT]</a>
 *> \endhtmlonly   *> \endhtmlonly
 *  *
 *  Definition:  *  Definition:
 *  ===========  *  ===========
 *  *
 *       SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,  *       SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,
 *                          LDU, C, LDC, WORK, INFO )  *                          LDU, C, LDC, WORK, INFO )
 *   *
 *       .. Scalar Arguments ..  *       .. Scalar Arguments ..
 *       CHARACTER          UPLO  *       CHARACTER          UPLO
 *       INTEGER            INFO, LDC, LDU, LDVT, N, NCC, NCVT, NRU  *       INTEGER            INFO, LDC, LDU, LDVT, N, NCC, NCVT, NRU
Line 29 Line 29
 *       DOUBLE PRECISION   C( LDC, * ), D( * ), E( * ), U( LDU, * ),  *       DOUBLE PRECISION   C( LDC, * ), D( * ), E( * ), U( LDU, * ),
 *      $                   VT( LDVT, * ), WORK( * )  *      $                   VT( LDVT, * ), WORK( * )
 *       ..  *       ..
 *    *
 *  *
 *> \par Purpose:  *> \par Purpose:
 *  =============  *  =============
Line 40 Line 40
 *> left singular vectors from the singular value decomposition (SVD) of  *> left singular vectors from the singular value decomposition (SVD) of
 *> a real N-by-N (upper or lower) bidiagonal matrix B using the implicit  *> a real N-by-N (upper or lower) bidiagonal matrix B using the implicit
 *> zero-shift QR algorithm.  The SVD of B has the form  *> zero-shift QR algorithm.  The SVD of B has the form
 *>   *>
 *>    B = Q * S * P**T  *>    B = Q * S * P**T
 *>   *>
 *> where S is the diagonal matrix of singular values, Q is an orthogonal  *> where S is the diagonal matrix of singular values, Q is an orthogonal
 *> matrix of left singular vectors, and P is an orthogonal matrix of  *> matrix of left singular vectors, and P is an orthogonal matrix of
 *> right singular vectors.  If left singular vectors are requested, this  *> right singular vectors.  If left singular vectors are requested, this
Line 113 Line 113
 *> \verbatim  *> \verbatim
 *>          E is DOUBLE PRECISION array, dimension (N-1)  *>          E is DOUBLE PRECISION array, dimension (N-1)
 *>          On entry, the N-1 offdiagonal elements of the bidiagonal  *>          On entry, the N-1 offdiagonal elements of the bidiagonal
 *>          matrix B.   *>          matrix B.
 *>          On exit, if INFO = 0, E is destroyed; if INFO > 0, D and E  *>          On exit, if INFO = 0, E is destroyed; if INFO > 0, D and E
 *>          will contain the diagonal and superdiagonal elements of a  *>          will contain the diagonal and superdiagonal elements of a
 *>          bidiagonal matrix orthogonally equivalent to the one given  *>          bidiagonal matrix orthogonally equivalent to the one given
Line 179 Line 179
 *>                = 1, a split was marked by a positive value in E  *>                = 1, a split was marked by a positive value in E
 *>                = 2, current block of Z not diagonalized after 30*N  *>                = 2, current block of Z not diagonalized after 30*N
 *>                     iterations (in inner while loop)  *>                     iterations (in inner while loop)
 *>                = 3, termination criterion of outer while loop not met   *>                = 3, termination criterion of outer while loop not met
 *>                     (program created more than N unreduced blocks)  *>                     (program created more than N unreduced blocks)
 *>             else NCVT = NRU = NCC = 0,  *>             else NCVT = NRU = NCC = 0,
 *>                   the algorithm did not converge; D and E contain the  *>                   the algorithm did not converge; D and E contain the
Line 217 Line 217
 *  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  *> \date December 2016
 *  *
 *> \ingroup auxOTHERcomputational  *> \ingroup auxOTHERcomputational
 *  *
Line 230 Line 230
       SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,        SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,
      $                   LDU, C, LDC, WORK, INFO )       $                   LDU, C, LDC, WORK, INFO )
 *  *
 *  -- LAPACK computational routine (version 3.4.0) --  *  -- LAPACK computational routine (version 3.7.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 2011  *     December 2016
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          UPLO        CHARACTER          UPLO
Line 329 Line 329
          CALL DLASQ1( N, D, E, WORK, INFO )           CALL DLASQ1( N, D, E, WORK, INFO )
 *  *
 *     If INFO equals 2, dqds didn't finish, try to finish  *     If INFO equals 2, dqds didn't finish, try to finish
 *           *
          IF( INFO .NE. 2 ) RETURN           IF( INFO .NE. 2 ) RETURN
          INFO = 0           INFO = 0
       END IF        END IF
Removed from v.1.13  
changed lines
  Added in v.1.14

CVSweb interface <joel.bertrand@systella.fr>