Certification of numerical computation of the sign of the determinant of a matrix

Algorithmica (New York)

Volumn 30, Issue 4, 2001, Pages 708-724

  Pan, V Y ^a   Yu, Y ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Arithmetic filters; Certified geometric computations; Convex hull; Distance to a singular matrix; Sign of matrix determinant

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; INVARIANCE; MATRIX ALGEBRA;

ARITHMETIC FILTERS;

COMPUTATIONAL METHODS;

EID: 0012093747     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0032-8     Document Type: Article

References (48)

1. F. Avnaim, J.-D. Boissonnat, O. Devillers, F. P. Preparata, M. Yvinec, Evaluating Signs of Determinants Using Single-Precision Arithmetic, Algorithmica, 17, 111-132, 1997.
2. D. Avis, K. Fukuda, A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra, Discrete Comput. Geometry, 8, 295-313, 1992.
3. E. H. Bareiss, Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination, Math. Comp., 22, 565-578, 1968.
4. H. Brönnimann, I. Z. Emiris, V. Y. Pan, S. Pion, Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision, Proc. 13th Ann. ACM Symp. on Computational Geometry, pp. 174-182, ACM Press, New York, 1997.
5. H. Brönnimann, I. Z. Emiris, V. Y. Pan, S. Pion, Sign Determination in Residue Number Systems, Theoret. Comput. Sci., 210(1), 173-197, 1999.
6. C. Burnikel, J. Könnemann, K. Mehlhorn, S. Näher, S. Schirra, C. Uhrig, Exact Geometric Computation in LEDA, Proc. 11th Ann. ACM Symp. on Computational Geometry, pp. C18-C19, 1995. Package available at http://www.mpi-sb.mpg.de/LEDA/leda.html.
7. D. Bini, V. Y. Pan, Polynomial and Matrix Computations, vol. 1, Birkhäuser, Boston, 1994.
8. K. L. Clarkson, Safe and Effective Determinant Evaluation, Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, pp. 387-395, IEEE Computer Society Press, Los Alamitos, CA, 1992.
9. A. K. Cline, C. B. Moler, G. W. Stewart, J. H. Wilkinson, An Estimate for the Condition Number of a Matrix, SIAM J. Numer. Anal., 16, 368-375, 1979.
10. E. Durand, Solutions Numériques des Équations Algébriques, vol. II, Masson, Paris, 1961.
11. J. J. D. Dixon, Estimating Extremal Eigenvalues and Conditional Numbers of Matrices, SIAM J. Numer. Anal., 20(4), 812-814, 1983.
12. M. Deza, M. Laurent, Applications of Cut Polyhedra, J. Comput. Appl. Math., 55(1), 191-216, and 55(2), 217-247, 1994.
13. M. Deza, M. Laurent, Applications of Cut Polyhedra, J. Comput. Appl. Math., 55(1), 191-216, and 55(2), 217-247, 1994.
14. M. M. Deza, M. Laurent, Geometry of Cuts and Metrics, Springer-Verlag, Berlin, 1997.
15. J. Edmonds, Systems of Distinct Representatives and Linear Algebra, J. Res. Nat. Bur. Standards, Sect. B, 71(4), 241-245, 1967.
16. I. Z. Emiris, A Complete Implementation for Computing General Dimensional Convex Hulls, Internat. J. Comput. Geom. Appl, 8(2), 223-253, 1998.
17. I. Z. Emiris, J. F. Canny, A General Approach to Removing Degeneracies, SIAM J. Comput., 24(3), 650-664, 1995.
18. I. Z. Emiris, V. Y. Pan, Y. Yu, Modular Arithmetic for Linear Algebra Computations in the Real Field, J. Symbolic Comput., 21, 1-17, 1998.
19. R. M. Erdahl, V. H. Smith (editors). Density Matrices and Density Functionals (Proc. of the A. John Coleman Symp.), Reidel, Dordrecht, 1987.
20. C. Eckart, G. Young, A Principal Axis Transformation for Non-Hermitian Matrices, Bull. Amer. Math. Soc. (New Series), 45, 118-121, 1939.
21. L. Fox, An Introduction to Numerical Linear Algebra, Clarendon Press, Oxford, 1964.
22. K. Fukuda, V. Rosta, Combinatorial Face Enumeration in Convex Polytopes, Comput. Geom., Theory Appl., 4, 191-198, 1994.
23. S. Fortune, C. J. van Wyk, Efficient Exact Arithmetic for Computational Geometry, Proc. 9th Ann. ACM Symp. on Computational Geometry, pp. 163-172, 1993.
24. S. Fortune, C. J. van Wyk, Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry, ACM Trans. Graph, 15(3), 223-248, July 1996.
25. P. E. Gill, G. H. Golub, W. Murray, M. A. Saunders, Methods for Modifying Matrix Factorizations, Math. Comput., 28, 505-535, 1974.
26. G. H. Golub, C. F. van Loan, Matrix Computations (third edition), Johns Hopkins University Press, Baltimore, MD, 1996.
27. N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
28. IEEE Standard 754-1985 for Binary Floating Point Arithmetic, reprinted in SICPLAN Notices, 22(2), 9-25, 1987.
29. W. Kahan, Numerical Linear Algebra, Canad. Math. Bull., 9, 757-801, 1966.
30. E. Kaltofen, Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems, Math. Comput., 64(210), 777-806, 1995.
31. E. Kaltofen, V. Y. Pan, Processor Efficient Parallel Solution of Linear Systems over an Abstract Field, Proc. 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 180-191, ACM Press, New York, 1991.
32. E. Kaltofen, V. Y. Pan, Processor Efficient Parallel Solution of Linear Systems, II. The Positive Characteristic and Singular Cases, Proc. 33rd Ann. IEEE Symp. on Foundation of Computer Science, pp. 714-723, IEEE Computer Society Press, Los Alamitos, CA, 1992.
33. J. Kuczyński, H. Woźniakowski, Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start, SIAM J. Matrix Anal. Appl., 13(4), 1094-1122, 1992.
34. J. Kuczyński, H. Woźniakowski, Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm, SIAM J. Matrix Anal. Appl., 15(2), 672-691, 1994.
35. T. Muir, The Theory of Determinants in Historical Order of Development, four volumes bound as two (I, 1693-1841; II, 1841-1860; III, 1861-1880; IV, 1881-1900), Dover, New York, 1960; Contributions to the History of Determinants, 1900-1920, Blackie and Son, London, 1930 and 1950.
36. T. Muir, The Theory of Determinants in Historical Order of Development, four volumes bound as two (I, 1693-1841; II, 1841-1860; III, 1861-1880; IV, 1881-1900), Dover, New York, 1960; Contributions to the History of Determinants, 1900-1920, Blackie and Son, London, 1930 and 1950.
37. T. Muir, The Theory of Determinants in Historical Order of Development, four volumes bound as two (I, 1693-1841; II, 1841-1860; III, 1861-1880; IV, 1881-1900), Dover, New York, 1960; Contributions to the History of Determinants, 1900-1920, Blackie and Son, London, 1930 and 1950.
38. T. Muir, The Theory of Determinants in Historical Order of Development, four volumes bound as two (I, 1693-1841; II, 1841-1860; III, 1861-1880; IV, 1881-1900), Dover, New York, 1960; Contributions to the History of Determinants, 1900-1920, Blackie and Son, London, 1930 and 1950.
39. T. Muir, The Theory of Determinants in Historical Order of Development, four volumes bound as two (I, 1693-1841; II, 1841-1860; III, 1861-1880; IV, 1881-1900), Dover, New York, 1960; Contributions to the History of Determinants, 1900-1920, Blackie and Son, London, 1930 and 1950.
40. R. H. Macmillan, A New Method for the Numerical Evaluation of Determinants, J. Roy. Aeronaut. Soc., 59, 772ff, 1955.
41. R. E. M. Moore, I. O. Angell, Voronoi Polygons and Polyhedra, J. Comput. Phys., 105, 301-305, 1993.
42. V. Y. Pan, Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations, Inform. Process. Lett., 28(2), 71-75, 1988.
43. V. Y. Pan, R. Schreiber, An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications, SIAM J. Sci. Statist. Comput., 12(5), 1109-1131, 1991.
44. V. Y. Pan, Y. Yu, C. Stewart, Algebraic and Numerical Techniques for the Computation of Matrix Determinants, Comput. Math. Appl., 34(1), 43-70, 1997.
45. J. B. Rosser, A Method of Computing Exact Inverses of Matrices with Integer Coefficients, J. Res. Nat. Bur. Standards, Sect. B, 49, 349-358, 1952.
46. D. H. Wiedemann, Solving Sparse Linear Equations over Finite Fields, IEEE Trans. Inform. Theory, 32(1), 54-62, 1986.
47. C. Yap, Towards Exact Geometric Computation, Comput. Geom. Theory Appl., 7, 3-23, 1997.
48. C. K. Yap, T. Dubhe, The Exact Computation Paradigm, in D. Du and F. Hwang, editors, Computing in Euclidean Geometry. World Scientific Press, Singapore, 1995.