On the complexity of computing determinants

Computational Complexity

Volumn 13, Issue 3-4, 2005, Pages 91-130

  Kaltofen, Erich ^a   Villard, Gilles ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Bit complexity; Block Lanczos algorithm; Block Wiedemann algorithm; Characteristic polynomial; Division free complexity; Integer matrix; Matrix determinant; Matrix sequence; Multivariable control theory; Randomized algorithm; Realization; Smith normal form

Indexed keywords

EID: 15244346390     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-004-0185-3     Document Type: Article

References (83)

1. J. ABBOTT, M. BRONSTEIN & T. MULDERS (1999). Fast deterministic computation of determinants of dense matrices. In ISSAC 99, Proc. 1999 Internat. Symp. Symbolic Algebraic Comput., S. Dooley (ed.), ACM Press, New York, 181-188.
2. M. AGRAWAL, N. KAYAL & NITIN SAXENA (2002). PRIMES is in P. Manuscript. Available from http://www.cse.iitk.ac.in/news/primality.pdf.
3. A. AHO, J. HOPCROFT & J. ULLMAN (1974). The Design and Analysis of Algorithms. Addison and Wesley, Reading, MA.
4. E. BACH & J. SHALLIT (1996). Algorithmic Number Theory. Volume 1: Efficient Algorithms. The MIT Press, Cambridge, MA.
5. W. BAUR & V. STRASSEN (1983). The complexity of partial derivatives. Theoret. Comput. Sci. 22, 317-330.
6. B. BECKERMANN & G. LABAHN (1994). A uniform approach for fast computation of matrix-type Padé approximants. SIAM J. Matrix Anal. Appl. 15, 804-823.
7. R. P. BRENT, F. G. GUSTAVSON & D. Y. Y. YUN (1980). Fast solution of Toeplitz systems of equations and computation of Padé approximants. J. Algorithms 1, 259-295.
8. R. P. BRENT, S. H. GAO & A. G. B. LAUDER (2003). Random Krylov spaces over finite fields. SIAM J. Discrete Math. 16, 276-287.
9. H. BRÖNNIMANN, I. EMIRIS, V. PAN & S. PION (1999). Sign determination in residue number systems. Theoret. Comput. Sci. 210, 173-197.
10. H. BRÖNNIMANN & M. YVINEC (2000). Efficient exact evaluation of signs of determinants. Algorithmica 27, 21-56.
11. W. S. BROWN & J. F. TRAUB (1971). On Euclid's algorithm and the theory of subresultants. J. ACM 18, 505-514.
12. D. G. CANTOR & E. KALTOFEN (1991). On fast multiplication of polynomials over arbitrary algebras. Acta Inform. 28, 693-701.
13. L. CHEN, W. EBERLY, E. KALTOFEN, B. D. SAUNDERS, W. J. TURNER & G. VILLARD (2002). Efficient matrix preconditioners for black box linear algebra. Linear Algebra Appl. 343-344, 119-146.
14. K. L. CLARKSON (1992). Safe and efficient determinant evaluation. In Proc. 33rd Annual Sympos. Foundations of Comput. Sci., IEEE Comput. Soc. Press, Los Alamitos, CA, 387-395.
15. D. COPPERSMITH (1994). Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comp. 62, 333-350.
16. D. COPPERSMITH (1997). Rectangular matrix multiplication revisited. J. Complexity 13, 42-49.
17. D. COPPERSMITH & S. WINOGRAD (1990). Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 251-280.
18. R. A. DEMILLO & R. J. LIPTON (1978). A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7, 193-195.
19. B. W. DICKINSON, M. MORF & T. KAILATH (1974). A minimal realization algorithm for matrix sequences. IEEE Trans. Automat. Control AC-19, 31-38.
20. J. DIXON (1982). Exact solution of linear equations using p-adic expansions. Numer. Math. 40, 137-141.
21. J. L. DORNSTETTER (1987). On the equivalence between Berlekamp's and Euclid's algorithms. IEEE Trans. Inform. Theory 33, 428-431.
22. W. EBERLY (2002). Avoidance of look-ahead in Lanczos by random projections. Manuscript in preparation.
23. W. EBERLY, M. GIESBRECHT & G. VILLARD (2000). On computing the determinant and Smith form of an integer matrix. In Proc. 41st Annual Sympos. Foundations of Comput. Sci., IEEE Comput. Soc. Press, Los Alamitos, CA, 675-685.
24. W. EBERLY & E. KALTOFEN (1997). On randomized Lanczos algorithms. In Küchlin (1997), 176-183.
25. I. Z. EMIRIS (1998). A complete implementation for computing general dimensional convex hulls. Int. J. Comput. Geom. Appl. 8, 223-254.
26. G. D. FORNEY, JR. (1975). Minimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J. Control 13, 493-520.
27. J. VON ZUR GATHEN & J. GERHARD (1999). Modern Computer Algebra. Cambridge Univ. Press, Cambridge.
28. J. GERHARD (2001). Fast modular algorithms for squarefree factorization and Hermite integration. Appl. Algebra Engrg. Comm. Comput. 11, 203-226.
29. M. GIESBRECHT (2001). Fast computation of the Smith form of a sparse integer matrix. Comput. Complexity 10, 41-69.
30. M. GIESBRECHT & A. STORJOHANN (2002). Computing rational forms of integer matrices. J. Symbolic Comput. 34, 157-172.
31. P. GIORGI, C.-P. JEANNEROD & G. VILLARD (2003). On the complexity of polynomial matrix computations. In Sendra (2003), 135-142.
32. L. E. HEINDEL & E. HOROWITZ (1971). On decreasing the computing time for modular arithmetic. In Conference Record, IEEE 12th Annual Sympos. on Switching and Automata Theory, 126-128.
33. X. H. HUANG & V. Y. PAN (1998). Fast rectangular matrix multiplication and applications. J. Complexity 14, 257-299.
34. C.-P. JEANNEROD & G. VILLARD (2004). Essentially optimal computation of the inverse of generic polynomial matrices. J. Complexity, to appear. Available from http://perso.ens-lyon.fr/gilles.villard.
35. R. D. JENKS, R. S. SUTOR & S. M. WATT (1988). Scratchpad II: An abstract datatype system for mathematical computation. In Mathematical Aspects of Scientific Software, J. R. Rice (ed.), IMA Vol. Math. Appl. 14, Springer, New York, 157-182.
36. T. KAILATH (1980). Linear Systems. Prentice-Hall.
37. E. KALTOFEN (1988). Greatest common divisors of polynomials given by straight-line programs. J. ACM 35, 231-264.
38. E. KALTOFEN (1992). On computing determinants of matrices without divisions. In Proc. 1992 Internat. Sympos. Symbolic Algebraic Comput. (ISSAC'92), P. S. Wang (ed.), ACM Press, New York, 342-349.
39. E. KALTOFEN (1995). Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comput. 64, 777-806.
40. E. KALTOFEN (2000). Challenges of symbolic computation: my favorite open problems. J. Symbolic Comput. 29, 891-919. With an additional open problem by R. M. Corless and D. J. Jeffrey.
41. E. KALTOFEN (2002). An output-sensitive variant of the baby steps/giant steps determinant algorithm. In Mora (2002), 138-144.
42. E. KALTOFEN & W.-S. LEE (2003). Early termination in sparse interpolation algorithms. J. Symbolic Comput. 36, 365-400.
43. E. KALTOFEN, W.-S. LEE & A. A. LOBO (2000). Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. In Proc. 2000 Internat. Sympos. Symbolic Algebraic Comput. (ISSAC'00), C. Traverso (ed.), ACM Press, New York, 192-201.
44. E. KALTOFEN & J. MAY (2003). On approximate irreducibility of polynomials in several variables. In Sendra (2003), 161-168.
45. E. KALTOFEN & B. D. SAUNDERS (1991). On Wiedemann's method of solving sparse linear systems. In Proc. AAECC-9, H. F. Mattson et al. (eds.) Lecture Notes in Comput. Sci. 539, Springer, Heidelberg, 29-38.
46. E. KALTOFEN & G. VILLARD (2001). On the complexity of computing determinants. In Proc. Fifth Asian Symposium on Computer Mathematics (ASCM 2001), K. Shirayanagi and K. Yokoyama (eds.), Lecture Notes Ser. Comput. 9, World Sci., Singapore, 13-27.
47. E. KALTOFEN & G. VILLARD (2004). Computing the sign or the value of the determinant of an integer matrix, a complexity survey. J. Comput. Appl. Math. 162, 133-146.
48. D. E. KNUTH (1970). The analysis of algorithms. In Congrès Int. Math., Nice, Volume 3, 269-274.
49. W. KÜCHLIN (ed.) (1997). ISSAC 97, Proc. 1997 Internat. Sympos. Symbolic Algebraic Comput. ACM Press, New York.
50. R. T. MOENCK (1973). Fast computation of GCDs. In Proc. 5th ACM Sympos. Theory Comp., 142-151.
51. T. MORA (ed.) (2002). ISSAC 2002 Proc. 2002 Internat. Sympos. Symbolic Algebraic Comput. ACM Press, New York.
52. T. MULDERS & A. STORJOHANN (2003). On lattice reduction for polynomial matrices. J. Symbolic Comput. 35, 377-401.
53. T. MULDERS & A. STORJOHANN (2004). Certified dense linear system solving. J. Symbolic Comput. 37 (2004), 485-510.
54. M. NEWMAN (1972). Integral Matrices. Academic Press.
55. V. Y. PAN (1988). Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations. Inform. Process. Lett. 28, 71-75.
56. V. Y. PAN (2002). Randomized acceleration of fundamental matrix computations. In Proc. STACS 2002, Lecture Notes in Comput. Sci. 2285, Springer, Heidelberg, 215-226.
57. M. S. PATERSON & L. J. STOCKMEYER (1973). On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2, 60-66.
58. V. M. POPOV (1970). Some properties of control systems with irreducible matrix-transfer functions. In Seminar on Differential Equations and Dynamical Systems, II (College Park, MD, 1969), Lecture Notes in Math. 144, Springer, Berlin, 169-180.
59. J. RISSANEN (1972). Realizations of matrix sequences. Technical Report RJ-1032, IBM Research, Yorktown Heights, NY.
60. J. B. ROSSER, & L. SCHOENFELD (1962). Approximate formulas of some functions of prime numbers. Illinois J. Math. 6, 64-94.
61. A. SCHÖNHAGE (1971). Schnelle Berechnung von Kettenbruchentwicklungen. Acta Inform. 1, 139-144.
62. J. T. SCHWARTZ (1980). Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701-717.
63. T. R. SEIFULLIN (2003). Acceleration of computation of determinants and characteristic polynomials without divisions. Cybernet. Systems Anal. 39, 805-815.
64. J. R. SENDRA (ed.) (2003). ISSAC 2003, Proc. 2003 Internat. Sympos. Symbolic Algebraic Comput. ACM Press, New York.
65. A. STORJOHANN (1996). Near optimal algorithms for computing Smith normal forms of integer matrices. In ISSAC 96, Proc. 1996 Internat. Sympos. Symbolic Algebraic Comput., Y. N. Lakshman (ed.), ACM Press, New York, 267-274.
66. A. STORJOHANN (2000a). Algorithms for matrix canonical forms. Dissertation, Swiss Federal Institute of Technology (ETH), Zurich.
67. A. STORJOHANN (2000b). Computing the Frobenius form of a sparse integer matrix. Paper to be submitted.
68. A. STORJOHANN (2002). Higher-order lifting. In Mora (2002), 246-254.
69. A. STORJOHANN (2003). High-order lifting and integrality certification. J. Symbolic Comput. 36, 613-648.
70. A. STORJOHANN (2004). The shifted number system for fast linear algebra on integer matrices. Technical Report CS-2004-18, School of Computer Science, University of Waterloo, http://www.scg.uwaterloo.ca/~astorjoh/publications.html.
71. V. STRASSEN (1973). Vermeidung von Divisionen. J. Reine Angew. Math. 264, 182-202.
72. V. STRASSEN (1990). Algebraic complexity theory. In Handbook of Theoretical Computer Science, Algorithms and Complexity, J. van Leeuwen (ed.), Volume A, Elsevier, Amsterdam, 633-672.
73. Y. SUGIYAMA, M. KASAHARA, S. HIRASAWA & T. NAMEKAWA (1975). A method for solving key equation for decoding Goppa codes. Inform. and Control 27, 87-99.
74. E. THOMÉ (2002). Subquadratic computation of vector generating polynomials and improvements of the block Wiedemann method. J. Symbolic Comput. 33, 757-775.
75. W. J. TURNER (2001). A note on determinantal divisors and matrix preconditioners. Paper to be submitted.
76. W. J. TURNER (2002). Black box linear algebra with the LINBOX library. Ph.D. thesis, North Carolina State Univ., Raleigh, NC, 193 pp.
77. M. VAN BAREL & A. BULTHEEL (1992). A general module theoretic framework for vector M-Padé and matrix rational interpolation. Numerical Algorithms 3, 451-462.
78. G. VILLARD (1988). Calcul Formel et Parallélisme : Résolution de Systèmes Linéaires. Ph.D. thesis, Institut National Polytechnique de Grenoble.
79. G. VILLARD (1997a). Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems. In Küchlin (1997), 32-39.
80. G. VILLARD (1997b). A study of Coppersmith's block Wiedemann algorithm using matrix polynomials. Rapport de Recherche 975 IM, Institut d'Informatique et de Mathématiques Appliquées de Grenoble, www.imag.fr.
81. G. VILLARD (2000). Computing the Frobenius normal form of a sparse matrix. In CASC 2000, Proc. 3rd Internat. Workshop on Computer Algebra in Scientific Computing, V. G. Ganzha et al. (eds.), Springer, 395-407.
82. D. WIEDEMANN (1986). Solving sparse linear equations over finite fields. IEEE Trans. Inform Theory 32, 54-62.
83. R. ZIPPEL (1979). Probabilistic algorithms for sparse polynomials. In Proc. EUROSAM '79, Lecture Notes in Comput. Sci. 72, Springer, Heidelberg, 216-226.