Accurate and efficient expression evaluation and linear algebra

Acta Numerica

Volumn 17, Issue , 2008, Pages 87-145

  Demmel, James ^a,b   Dumitriu, Ioana ^c   Holtz, Olga ^a,d   Koev, Plamen ^e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^e NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58149398431     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492906350015     Document Type: Article

References (79)

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman (1975), The Design and Analysis of Computer Algorithms, second printing, Addison-Wesley Series in Computer Science and Information Processing.
2. A. S. Alfa, J. Xue and Q. Ye (2002), 'Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix', Math. Comp. 71, 217-236 (electronic).
3. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Grecn-baum, S. Hammarling, A. McKenney, S. Blackford and D. Sorensen (1999), LAPACK Users' Guide, third edn, SIAM, Philadelphia.
4. Å. Björck and V. Pcrcyra (1970), 'Solution of Vandermonde systems of equations', Math. Comp. 24, 893-903.
5. E. Boman, B. Hendrickson and S. Vavasis (2004), 'Solving elliptic finite clement systems in near-linear time with support pro-conditioners', arXiv.org:cs/0407022.
6. T. Boros, T. Kailath and V. Olshevsky (1999), 'A fast Björck-Percyra-typc algorithm for parallel solution of Cauchy linear equations', Linear Algebra Appl. 302/303, 265-293.
7. T. Chan (1987), 'Rank revealing QR factorizations', Linear Algebra Appl. 88/89, 67-82.
8. S. Chandrasekaran and I. Ipsen (1994), 'On rank-revealing QR factorizations', SIAM J. Matrix Anal. Appl.
9. K. Clarkson (1992), Safe and effective determinant evaluation, in 33rd Annual Symposium on Foundations of Computer Science, pp. 387-395.
10. J. Demmel (1987), 'On condition numbers and the distance to the nearest ill-posed problem', Numer. Math. 51, 251-289.
11. J. Demmel (1999), 'Accurate singular value decompositions of structured matrices', SIAM J. Matrix Anal. Appl. 21, 562-580 (electronic).
12. J. Demmel and W. Gragg (1993), 'On computing accurate singular values and eigenvalues of acyclic matrices', Linear Algebra Appl. 185, 203-218.
13. J. Demmel and Y. Hida (2003), 'Accurate and efficient floating point summation', SIAM J. Sci. Comput. 25, 1214-1248.
14. J. Demmel and W. Kalian (1990), 'Accurate singular values of bidiagonal matrices', SIAM J. Sci. Statist. Comput. 11, 873-912.
15. J. Demmel and P. Koev (2001), Necessary and sufficient conditions for accurate and efficient rational function evaluation and factorizations of rational matrices. In Structured Matrices in Mathematics, Computer Science, and Engineering II (Boulder, CO, 1999), Vol. 281 of Contemporary Mathematics, AMS, Providence, RI, pp. 117-143.
16. J. Demmel and P. Koev (2004a), Accurate and efficient algorithms for floating point computation. In Applied Mathematics Entering the 21st Century, SIAM, Philadelphia, PA, pp. 73-88.
17. J. Demmel and P. Koev (2004b), 'Accurate SVDs of weakly diagonally dominant M-matrices', Numer. Math. 98, 99-104.
18. J. Demmel and P. Koev (2005), 'The accurate and efficient solution of a totally positive generalized Vandermonde linear system', SIAM J. Matrix Anal. Appl. 27, 142-152 (electronic).
19. J. Demmel and P. Koev (2006), 'Accurate SVDs of polynomial Vanclcrmonclc matrices involving orthonormal polynomials', Linear Algebra Appl. 417, 382-396.
20. J. Demmel and K. Veselić (1992), 'Jacobi's method is more accurate than QR', SIAM J. Matrix Anal. Appl. 13, 1204-1246.
21. J. Demmel, B. Diament and G. Malajovich (2001), 'On the complexity of computing error bounds', in Found. Comput. Math. 1, 101-125.
22. J. Demmel, I. Dumitriu and O. Holtz (2006), Toward accurate polynomial evaluation in rounded arithmetic. In Foundations of Computational Mathematics (Santander 2005), Vol. 331 of London Mathematical Society Lecture Notes, Cambridge University Press, Cambridge, pp. 36-105.
23. J. Demmel, M. Gu, S. Eisenstat, I. Slapničar, K. Veselić and Z. Drmač (1999), 'Computing the singular value decomposition with high relative accuracy', Linear Algebra Appl. 299, 21-80.
24. F. M. Dopico, J. M. Molera and J. Moro (2003), 'An orthogonal high relative accuracy algorithm for the symmetric eigenproblem', SIAM J. Matrix Anal. Appl. 25, 301-351 (electronic).
25. Z. Drmač (1998), 'Accurate computation of the product induced singular value decomposition with applications', SIAM J. Numer. Anal. 35, 1969-1994.
26. S. Eisenstat and I. Ipsen (1995), 'Relative perturbation techniques for singular value problems', SIAM J. Numer. Anal.
27. S. M. Fallat (2001), 'Bidiagonal factorizations of totally nonnegative matrices', Amer. Math. Monthly 108, 697-712.
28. H. K. Farahat (1958), 'On Schur functions', Proc. London Math. Soc. (3) 8, 621-630.
29. F. P. Gantmacher and M. G. Krein (2002), Oscillation Matrices and Kernels and Small Vibrations of Mechanical Systems, revised edn, AMS Chelsea Publishing, Providence, RI. Translation based on the 1941 Russian original.
30. M. Gasca and J. M. Peña (1992), 'Total positivity and Neville elimination', Linear Algebra Appl. 165, 25-44.
31. M. Gasca and J. M. Peña (1996), On factorizations of totally positive matrices, in Total Positivity and its Applications, Kluwer, Dordrecht, pp. 109-130.
32. M. Gu and S. Eisenstat (1996), 'An efficient algorithm for computing a strong rank-revealing QR factorization', SIAM J. Sci. Comput. 17, 848-869.
33. N. J. Higham (1987), 'Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems', Numer. Math. 50, 613-632.
34. N. J. Higham (1988), 'Fast solution of Vandermonde-like systems involving orthogonal polynomials', IMA J. Numer. Anal. 8, 473-486.
35. N. J. Higham (1990), 'Stability analysis of algorithms for solving confluent Vandermonde-like systems', SIAM J. Matrix Anal. Appl. 11, 23-41.
36. O. Holtz (2005), 'The inverse eigenvalue problem for symmetric anti-bidiagonal matrices', Linear Algebra Appl. 408, 268-274.
37. P. Hong and C. T. Pan (1992), 'Rank-revealing QR factorizations and the singular value decomposition', Math. Comp. 58, 213-232.
38. T.-M. Hwang, W.-W. Lin and E. K. Yang (1992), 'Rank revealing LU factorization', Linear Algebra Appl. 175, 115-141.
39. Y. Ikebe (1979), 'On inverses of Hessenberg matrices', Linear Algebra Appl. 24, 93-97.
40. W. Kahan and I. Farkas (1963a), 'Algorithm 167: Calculation of confluent divided differences', Commun. ACM 6, 164-165.
41. W. Kahan and I. Farkas (1963b), 'Algorithm 168: Newton interpolation with backward divided differences', Commun. ACM 6, 165.
42. W. Kahan and I. Farkas (1963c), 'Algorithm 169: Newton interpolation with forward divided differences', Commun. ACM 6, 165.
43. T. Kailath and V. Olshevsky (1995), 'Displacement structure approach to Cheby-sliev-Vandermonde and related matrices', Integral Equations Operator Theory 22, 65-92.
44. T. Kailath and V. Olshevsky (1997), 'Displacement-structure approach to polynomial Vandermondc and related matrices', Linear Algebra Appl. 261, 49-90.
45. S. Karlin (1968), Total Positivity, Vol. I, Stanford University Press, Stanford, CA.
46. P. Koev (2005), 'Accurate eigenvalues and SVDs of totally nonnegative matrices', SIAM J. Matrix Anal. Appl. 27, 1-23 (electronic).
47. P. Koev (2007), 'Accurate computations with totally nonnegative matrices', SIAM J. Matrix Anal. Appl. 29, 731-751.
48. P. Koev and F. Dopico (2007), 'Accurate eigenvalues of certain sign regular matrices', Linear Algebra Appl. 424, 435-447.
49. R.-C. Li (1999), 'Relative perturbation theory II: Eigenspace and singular subspace variations', SIAM J. Matrix Anal. Appl. 20, 471-492 (electronic).
50. I. G. Macdonald (1998), Symmetric Functions and Orthogonal Polynomials, Vol. 12 of University Lecture Series, AMS, Providence, RI.
51. A. Marco and J.-J. Martínez (2007), 'A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems', Linear Algebra Appl. 422, 616-628.
52. J. J. Martínez and J. M. Peña (1998), 'Fast algorithms of Björck-Pcrcyra type for solving Cauchy-Vandcrmondc linear systems', Appl. Numer. Math. 26, 343-352.
53. J. J. Martínez and J. M. Peña (1998), 'Factorizations of Cauchy-Vandermonde matrices', Linear Algebra Appl. 284, 229-237.
54. J. J. Martínez and J. M. Peña (2003), Factorizations of Cauchy-Vandermonde matrices with one multiple pole. In Recent Research on Pure and Applied Algebra, Nova Scientific, Hauppauge, NY, pp. 85-95.
55. The MathWorks (1992), MATLAB Reference Guide, The MathWorks, Natick, MA.
56. R. Mathias (1996), 'Accurate eigensystem computations by Jacobi methods', SIAM J. Matrix Anal. Appl. 16, 977-1003.
57. E. Miller and B. Sturmfels (2005), Combinatorial Commutative Algebra, Vol. 227 of Graduate Texts in Mathematics, Springer, New York.
58. L. Miranian and M. Gu (2003), 'Strong rank revealing LU factorizations', Linear Algebra Appl. 367, 1-16.
59. R. Nabben (1999), 'Decay rates of the inverse of nonsymmetric tridiagonal and band matrices', SIAM J. Matrix Anal. Appl. 20, 820-837.
60. C. O'Cinneide (1996), 'Relative-error for the LU decomposition via the GTH algorithm', Numer. Math. 73, 507-519.
61. B. Parlett (1995), The new qd algorithms, in Acta Numerica, Vol. 4, Cambridge University Press, pp. 459-491.
62. M. J. Peláez and J. Moro (2006), 'Accurate factorization and eigenvalue algorithms for symmetric DSTU and TSC matrices', SIAM J. Matrix Anal. Appl. 28, 1173-1198 (electronic).
63. J. M. Peña (2004), 'LDU decompositions with L and U well conditioned', Electron. Trans. Numer. Anal. 18, 198-208 (electronic).
64. J. Renegar (1992), 'On the computational complexity and geometry of the first-order theory of the reals I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals', J. Symbolic Comput. 13, 255-299.
65. B. Reznick (2000), Some Concrete Aspects of Hilbert's 17th Problem, Vol. 253 of Contemporary Mathematics, AMS.
66. S. Rump (1998), 'Structured perturbations and symmetric matrices', Linear Algebra Appl. 278, 121-132.
67. S. Rump (1999a), 'Ill-conditioned matrices are componentwise near to singularity', SIAM Review 41, 102-112.
68. S. Rump (1999b), Ill-conditionedness need not be componentwise near to ill-posedncss for least squares problems', BIT 39, 143-151.
69. S. Rump (2003a), 'Structured perturbations I: Normwise distances', SIAM J. Matrix Anal. Appl. 25, 1-30.
70. S. Rump (2003b), 'Structured perturbations II: Componentwise distances', SIAM J. Matrix Anal. Appl. 25, 31-56.
71. J. R. Shewchuk (1997), 'Adaptive precision floating-point arithmetic and fast robust geometric predicates', Discrete Comput. Geom. 18, 305-363.
72. R. P. Stanley (1999), Enumerative Combinatorics 2, Vol. 62 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.
73. G. W. Stewart (1993), 'Updating a rank-revealing ULV decomposition', SIAM J. Matrix Anal. Appl. 14, 494-499.
74. A. Tarski (1951), A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley.
75. J. Taylor (2004), Several Complex Variables with Connections to Algebraic Geometry and Lie Groups, AMS Series on Graduate Studies in Mathematics, AMS.
76. L. G. Valiant (1979), 'The complexity of computing the permanent', Theoret. Comput. Sci. 8, 189-201.
77. Q. Ye (2008a), 'Computing singular values of diagonally dominant matrices to high relative accuracy', Math. Comp., to appear.
78. Q. Ye (2008b), 'Relative perturbation bounds for eigenvalues of symmetric positive definite diagonally dominant matrices', SIAM J. Matrix Anal. Appl., to appear.
79. G. M. Ziegler (1995), Lectures on Polytopes, Vol. 152 of Graduate Texts in Mathematics, Springer, New York.