Jacobi's Method is More Accurate than QR
暂无分享,去创建一个
[1] J. Barlow,et al. Computing accurate eigensystems of scaled diagonally dominant matrices: LAPACK working note No. 7 , 1988 .
[2] James Demmel,et al. Accurate Singular Values of Bidiagonal Matrices , 1990, SIAM J. Sci. Comput..
[3] J. Bunch,et al. Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .
[4] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .
[5] G. Stewart. A method for computing the generalized singular value decomposition , 1983 .
[6] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .
[7] N. Higham. Analysis of the Cholesky Decomposition of a Semi-definite Matrix , 1990 .
[8] P. P. Rijk. A one-sided Jacobi algorithm for computing the singular value decomposition on avector computer , 1989 .
[9] V. Hari,et al. On Jacobi methods for singular value decompositions , 1987 .
[10] Guido D. Salvucci,et al. Ieee standard for binary floating-point arithmetic , 1985 .
[11] B N Parlett,et al. On the Forward Instability of the QR Transformation , 1988 .
[13] V. Hari,et al. A note on a one-sided Jacobi algorithm , 1989 .
[14] A. Sluis. Condition numbers and equilibration of matrices , 1969 .
[15] Tosio Kato. Perturbation theory for linear operators , 1966 .