Go to the first, previous, next, last section, table of contents.
Further information on the algorithms described in this section can be
found in the following book,

G. H. Golub, C. F. Van Loan, Matrix Computations (3rd Ed, 1996),
Johns Hopkins University Press, ISBN 0801854148.
The LAPACK library is described in,

LAPACK Users' Guide (Third Edition, 1999), Published by SIAM,
ISBN 0898714478.
@url{http://www.netlib.org/lapack}
The LAPACK source code can be found at the website above, along
with an online copy of the users guide.
The Modified GolubReinsch algorithm is described in the following paper,

T.F. Chan, "An Improved Algorithm for Computing the Singular Value
Decomposition", ACM Transactions on Mathematical Software, 8
(1982), pp 7283.
The Jacobi algorithm for singular value decomposition is described in
the following papers,

J.C.Nash, "A onesided transformation method for the singular value
decomposition and algebraic eigenproblem", Computer Journal,
Volume 18, Number 1 (1973), p 7476

James Demmel, Kresimir Veselic, "Jacobi's Method is more accurate than
QR", Lapack Working Note 15 (LAWN15), October 1989. Available
from netlib, @url{http://www.netlib.org/lapack/} in the
lawns
or
lawnspdf
directories.
Go to the first, previous, next, last section, table of contents.