Improved algorithms for computing determinants and resultants

Journal of Complexity

Volumn 21, Issue 1, 2005, Pages 43-71

  Emiris, Ioannis Z ^a   Pan, Victor Y ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Bit complexity; Computer algebra; Matrix determinant; Polynomial system solving; Randomized algorithms; Structured matrix

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES;

BIT COMPLEXITY; COMPUTER ALGEBRA; MATRIX DETERMINANT; POLYNOMIAL SYSTEM SOLVING; RANDOMIZED ALGORITHMS; STRUCTURED MATRIX;

COMPUTATIONAL COMPLEXITY;

EID: 11844252015     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jco.2004.03.003     Document Type: Article

References (64)

1. J. Abbott, M. Bronstein, T. Mulders, Fast deterministic computation of determinants of dense matrices, in: Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 1999, 197-203.
2. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading, MA
3. M. Agrawal, N. Kayal, N. Saxena, PRIMES is in P, 2002, Preprint.
4. P. Bürgisser, M. Clausen, M.A. Shokrollahi, Algebraic Complexity Theory 1997 Springer Berlin
5. H. Brönnimann, I.Z. Emiris, V. Pan, S. Pion, Sign determination in residue number systems Theoret. Comput. Sci. 210 1 1999 173-197 (Special Issue on Real Numbers and Computers)
6. D.J. Bernstein, Fast multiplication and its applications, 2003, Preprint, available from http://cr.yp.to/papers.html.
7. D.J. Bernstein, Multidigit arithmetic for mathematicians, Adv. Appl. Math. ( 2004), to appear.
8. R.P. Brent, F.G. Gustavson, D.Y.Y. Yun, Fast solution of Toeplitz systems of equations and computation of Padé approximations J. Algorithms 1 1980 259-295
9. Bini D. Numerical computation of polynomial zeros by means of Aberth's method Numer. Algorithms 13 3-4 1996 179-200
10. J. Canny, Some algebraic and geometric computations in PSPACE, in: Proceedings of the ACM Symposium Theory of Computing, ACM Press, New York, 1988, 460-467.
11. Canny J. Generalised characteristic polynomials J. Symbolic Comput. 9 1990 241-250
12. J.F. Canny, I.Z. Emiris, A subdivision-based algorithm for the sparse resultant J. ACM 47 3 2000 417-451
13. J.F. Canny, E. Kaltofen, Y. Lakshman, Solving systems of non-linear polynomial equations faster, in: Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 1989, 121-128.
14. G.E. Collins, R. Loos, Real zeros of polynomials, in: B. Buchberger, G.E. Collins, R. Loos (Eds.), Computer Algebra: Symbolic and Algebraic Computation, 2nd Edition, Springer, Wien, 1982, pp. 83-94.
15. D. Cox, J. Little, D. O'Shea, Using Algebraic Geometry, Graduate Texts in Mathematics, Vol. 185, Springer, New York, 1998.
16. Coppersmith D. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm Math. Comp. 62 205 1994 333-350
17. D'Andrea C. Macaulay-style formulas for the sparse resultant Trans. AMS 354 2002 2595-2629
18. C. D'Andrea, I.Z. Emiris, Computing sparse projection operators, in: Green E.L. Hosten S. Lanbenbacher R.C. Powers V.A. (Eds.). Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, Contemporary Mathematics Vol. 286 2001 121-139 AMS Providence, RI
19. I.Z. Emiris, J.F. Canny, Efficient incremental algorithms for the sparse resultant and the mixed volume J. Symbolic Comput. 20 2 1995 117-149
20. W. Eberly, M. Giesbrecht, G. Villard, Computing the determinant and Smith form of an integer matrix, in: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 2000, 675-685.
21. Emiris I.Z. A complete implementation for computing general dimensional convex hulls Internat. J. Comput. Geom. Appl. 8 2 1998 223-253 (Special Issue on Geometric Software)
22. I.Z. Emiris, V.Y. Pan, Improved algorithms for computing determinants and resultants, Technical Report TR -2002-019, Computer Science Dept, The Graduate Center of the City University of New York, New York, 2002. www.cs.gc.cuny.edu/tr/techreport.php?id=66 .
23. I.Z. Emiris, V.Y. Pan, Symbolic and numeric methods for exploiting structure in constructing resultant matrices J. Symbolic Comput. 33 2002 393-413
24. I.Z. Emiris, V.Y. Pan, Improved computation of determinants and resultants, in: Proceedings of the International Workshop on Computer Algebra in Scientific Computing (CASC), Passau, Germany, September 2003, 81-94.
25. S. Fortune, Polynomial root finding using iterated eigenvalue computation, in : Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 2001, 121-128.
26. A.J. Goldstein, R.L. Graham, A Hadamard-type bound on the coefficients of a determinant of polynomials SIAM Rev. 16 1974 394-395
27. G.H. Golub, C.F. Van Loan, Matrix Computations, 3rd Edition, Johns Hopkins University Press, Baltimore, MD, 1996.
28. E. Kaltofen, An output-sensitive variant of the baby steps/giant steps determinant algorithm, in: Proceedings of the ACM International Symposium on Symbolic - Algebraic Computation, ACM Press, New York, 2002, 138-144.
29. Kim M.-H. On approximate zeros and rootfinding algorithms for complex polynomials Math. Comp. 51 1988 707-719
30. E. Kaltofen, V.Y. Pan, Processor efficient parallel solution of linear systems over an abstract field, in: Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1991, 180-191.
31. E. Kaltofen, B.D. Saunders, On Wiedemann's method for solving sparse linear systems, in: H.F. Mattson, T. Mora, T.R.N. Rao (Eds.), Proceedings of the International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, Vol. 539, Springer, Berlin, 1991, 29-38.
32. E. Kaltofen, B.M. Trager, Computing with polynomials given black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators, in: Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, 296-305.
33. E. Kaltofen, G. Villard, On the complexity of computing determinants, in: K. Shirayanagi, K. Yokoyama (Eds.), Proceedings of the Fifth Asian Symposium on Computer Mathematics, Lecture Notes in Computing, Vol. 9, World Scientific, Singapore, 2001, 13-27.
34. Manocha D. Efficient algorithms for multipolynomial resultants Comput. J. 36 5 1993 485-496
35. D. Manocha, J. Canny, The implicit representation of rational parametric surfaces J. Symbolic Comput. 13 1992 485-510
36. D. Manocha, J. Canny, Multipolynomial resultant algorithms J. Symbolic Comput. 15 2 1993 99-122
37. McNamee J.M. A bibliography on roots of polynomials J. Comput. Appl. Math. 47 1993 391-394
38. J.M. McNamee, A supplementary bibliography on roots of polynomials, J. Comput. Appl. Math. 78 (1) 1997, http://www.elsevier.nl/homepage/ sac/cam/mcnamee/index.html.
39. Mourrain B. Computing isolated roots by matrix methods J. Symbolic Comput. 26 6 1998 715-738 (Special Issue on Symbolic-Numeric Algebra for Polynomials)
40. Pan V.Y. Parametrization of Newton's iteration for computations with structured matrices and applications Comput. Math. Appl. 24 3 1992 61-75
41. Pan V.Y. Solving a polynomial equation: Some history and recent progress SIAM Rev. 39 2 1997 187-220
42. Pan V.Y. Structured Matrices and Polynomials: Unified Superfast Algorithms 2001 Birkhäuser, Springer Boston, New York
43. V.Y. Pan, Nearly optimal Toeplitz/Hankel computations, Technical Reports 2002-001 and 2002-017, Computer Science Dept, The Graduate Center of the City University of New York, New York, 2002.
44. V.Y. Pan, Randomized acceleration of fundamental matrix computations, in: Proceedings of STACS, Lecture Notes in Computer Science, Springer, Berlin, 2002, 215-226.
45. Pan V.Y. Univariate polynomials: Nearly optimal algorithms for numerical factorization and rootfinding J. Symbolic Comput. 33 5 2002 701-733
46. V.Y. Pan, Superfast algorithm for singular integer Toeplitz/Hankel-like matrices, Technical Reports 2002-002 and 2003-004, Computer Science Dept, The Graduate Center of the City University of New York, New York, 2002 and 2003.
47. V.Y. Pan, Randomized computation of the determinant and the minimum polynomial of an integer matrix, 2003, Preprint.
48. M. Petkovic, D. Herceg, Point estimation of simultaneous methods for solving polynomial equations: A survey J. Comput. Appl. Math. 136 2001 183-307
49. M.S. Petkovic, D. Herceg, S. Illic, Safe convergence of simultaneous method for polynomials zeros Numer. Algorithms 17 1998 313-331
50. V.Y. Pan, B. Murphy, R.E. Rosholt, X. Wang, Toeplitz and Hankel meet Hensel and Newton: Nearly optimal algorithms and their safe practical acceleration, 2003, Preprint.
51. M. Petkovic, L. Petkovic, S. Illic, The guaranteed convergence of Laguerre-like methods Comput. Math. Appl. 46 2003 239-251
52. V.Y. Pan, Y. Yu, Certification of numerical computation of the sign of the determinant of a matrix Algorithmica 30 2001 708-724
53. Rouillier F. Solving zero-dimensional polynomial systems through the rational univariate representation Appl. Algebra Engrg. Comm. Comput. 9 5 1999 433-461
54. F. Rouillier, P. Zimmermann, Efficient isolation of a polynomial real roots, Technical Report 4113, INRIA-Lorraine, 2001.
55. Smale S. Newton's method estimates from data in one point Ewing R.E. Gross K.I. Martin C.F. Merging Disciplines: New Directions in Pure, Applied and Computational Mathematics 1986 185-196 Springer New York
56. Storjohann A. High-order lifting and integrality certification J. Symbolic Comput. 36 3-4 2003 613-648 (Special Issue)
57. A. Storjohann, The shifted number system for fast linear algebra on integer matrices, Tech Report CS -2004-18, School of Computer Science, University of Waterloo, April 2004.
58. Toom A.L. The complexity of a scheme of functional elements realizing the multiplication of integers Soviet Math. Dokl. 3 1963 714-716
59. von zur Gathen J. Gerhard J. Modern Computer Algebra 2nd Edition 2003 Cambridge University Press Cambridge, UK
60. Wiedemann D.H. Solving sparse linear equations over finite fields IEEE Trans. Inform. Theory 32 1 1986 54-62
61. D.Y.Y. Yun, On square-free decomposition algorithms, in: R.D. Jenks (Ed.), Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 1976, 26-35.
62. Z. Zeng, A method computing multiple roots of inexact polynomials, in: Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 2003, 266-272.
63. Zippel R. Effective Polynomial Computation 1993 Kluwer Academic Publishers Boston, MA
64. Zhao F. Wang D. The theory of Smale's point estimation and its application J. Comput. Appl. Math. 60 1995 253-269