Computing the Singular Value Decomposition with High Relative Accuracy

[1]  Z. Drmač.  Accurate Computation of the Product-Induced Singular Value Decomposition with Applications , 1998 .

[2]  Christian H. Bischof,et al.  Computing rank-revealing QR factorizations of dense matrices , 1998, TOMS.

[3]  Ren-Cang Li,et al.  Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations , 1996, SIAM J. Matrix Anal. Appl..

[4]  T. Hwang,et al.  Improved bound for rank revealing LU factorizations , 1997 .

[5]  Ming Gu,et al.  Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..

[6]  Francesco Brenti,et al.  The Applications of Total Positivity to Combinatorics, and Conversely , 1996 .

[7]  Ilse C. F. Ipsen,et al.  Relative perturbation techniques for singular value problems , 1995 .

[8]  Richard A. Brualdi,et al.  Matrices of Sign-Solvable Linear Systems , 1995 .

[9]  Francesco Brenti,et al.  Combinatorics and Total Positivity , 1995, J. Comb. Theory, Ser. A.

[10]  Roy Mathias.  Accurate Eigensystem Computations by Jacobi Methods , 1995, SIAM J. Matrix Anal. Appl..

[11]  Stephen A. Vavasis,et al.  Complete Orthogonal Decomposition for Weighted Least Squares , 1995 .

[12]  Ivan Slapničar,et al.  Perturbations of the eigenprojections of a factorized Hermitian matrix , 1995 .

[13]  Stanley C. Eisenstat,et al.  A Divide-and-Conquer Algorithm for the Bidiagonal SVD , 1995, SIAM J. Matrix Anal. Appl..

[14]  S. Vavasis.  Stable Numerical Algorithms for Equilibrium Systems , 1994, SIAM J. Matrix Anal. Appl..

[15]  Ren Li.  Relative perturbation theory: (I) eigenvalue variations , 1994 .

[16]  B. Parlett,et al.  Accurate singular values and differential qd algorithms , 1994 .

[17]  K. Veselié.  A Jacobi eigenreduction algorithm for definite matrix pairs , 1993 .

[18]  Ivan Slapničar,et al.  Floating-point perturbations of Hermitian matrices , 1993 .

[19]  S. Godunov.  Guaranteed Accuracy in Numerical Linear Algebra , 1993 .

[20]  G. Stewart.  Updating a Rank-Revealing ULV Decomposition , 1993, SIAM J. Matrix Anal. Appl..

[21]  Ivan Slapničar,et al.  Accurate Symmetric Eigenreduction by a Jacobi Method , 1993 .

[22]  P. Tang,et al.  Bounds on Singular Values Revealed by QR Factorizations , 1999 .

[23]  Ji-guang Sun.  Componentwise perturbation bounds for some matrix decompositions , 1992 .

[24]  W. Gragg,et al.  On computing accurate singular values and eigenvalues of acyclic matrices , 1992 .

[25]  James Demmel,et al.  Jacobi's Method is More Accurate than QR , 1989, SIAM J. Matrix Anal. Appl..

[26]  Mei Han An,et al.  accuracy and stability of numerical algorithms , 1991 .

[27]  James Demmel,et al.  Accurate Singular Values of Bidiagonal Matrices , 1990, SIAM J. Sci. Comput..

[28]  D. O’Leary.  On bounds for scaled projections and pseudoinverses , 1990 .

[29]  Jack J. Dongarra,et al.  A set of level 3 basic linear algebra subprograms , 1990, TOMS.

[30]  J. Demmel,et al.  The bidiagonal singular value decomposition and Hamiltonian mechanics: LAPACK working note No. 11 , 1989 .

[31]  G. Stewart.  On scaled projections and pseudoinverses , 1989 .

[32]  J. Barlow,et al.  Computing accurate eigensystems of scaled diagonally dominant matrices: LAPACK working note No. 7 , 1988 .

[33]  T. Andô.  Totally positive matrices , 1987 .

[34]  T. Chan.  Rank revealing QR factorizations , 1987 .

[35]  G. Golub.  Matrix computations , 1983 .

[36]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[37]  I. G. MacDonald,et al.  Symmetric functions and Hall polynomials , 1979 .

[38]  C. Cryer.  Some properties of totally positive matrices , 1976 .

[39]  J. H. Wilkinson,et al.  Handbook for Automatic Computation. Vol II, Linear Algebra , 1973 .

[40]  P. Wedin.  Perturbation theory for pseudo-inverses , 1973 .

[41]  A. Sluis.  Condition numbers and equilibration of matrices , 1969 .

[42]  Gene H. Golub,et al.  Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5] , 1969, CACM.