On the Complexity of Computing Error Bounds

Foundations of Computational Mathematics

Volumn 1, Issue 1, 2001, Pages 101-125

  Demmel, J ^a   Diament, B ^b   Malajovich, G ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC NUMBERS; CONDITION NUMBERS; LINEAR ALGEBRA PROBLEMS; LOWER COMPLEXITY; MATRIX INVERSIONS; MATRIX MULTIPLICATION; SYSTEM OF LINEAR EQUATIONS; TRIANGULAR SYSTEM;

ERROR ANALYSIS; ESTIMATION; INVERSE PROBLEMS; NUMBER THEORY;

MATRIX ALGEBRA;

EID: 0000847923     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208001004     Document Type: Article

References (20)

1. I. Adler and P. A. Beling, Polynomial algorithms for linear programming over the algebraic numbers, Algorithmica 12 (1994), 436-457.
2. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. W. Baur and V. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci. 22 (1982), 317-330.
4. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer-Verlag, New York, 1998.
5. P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, Springer-Verlag, Berlin, 1997.
6. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (3) (1990), 251-280.
7. J. Demmel, Open problems in numerical linear algebra, IMA Preprint Series 961, Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, 1992. www.netlib.org/ lapack/lawns/lawn47.ps.
8. J. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
9. N. J. Higham, A survey of condition number estimation for triangular matrices, SIAM Rev. 29 (1987), 575-596.
10. N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
11. S. Lang, Survey of Diophantine Geometry, Springer-Verlag, Berlin, 1997. Corrected second printing.
12. T. Lickteig and K. Meer, Semi-algebraic complexity-additive complexity of matrix-computational tasks, J. Complexity 13 (1) (1997), 83-107.
13. G. Malajovich, On a transfer theorem for the P ≠ Nscript N signP conjecture (1998), MSRI preprint 1998-069.
14. G. Malajovich, Condition number bounds for problems with integer coefficients (1999), MSRI preprint 1999-009.
15. V. Pan. How to Multiply Matrices Faster, Springer-Verlag, Berlin, 1984.
16. A. Schönhage and V. Strassen, Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen) 7 (1971) 281-292.
17. J. A. Silverman, The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics 106, Springer-Verlag, New York, 1986.
18. G. W. Stewart and Ji Guang Sun, Matrix Perturbation Theory, Academic Press, Boston, MA, 1990.
19. V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969), 354-356.
20. S. Winograd and D. Coppersmith, Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, pp. 1-6. ACM, 1987.