Multivariate Polynomials, Duality, and Structured Matrices

Journal of Complexity

Volumn 16, Issue 1, 2000, Pages 110-180

  Mourrain, Bernard ^a   Pan, Victor Y ^b  

^a INRIA   (France)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Structured matrices; polynomial equations; ideals; roots; quotient algebra; dual algebra; residues; basis of idempotents; Jacobians

Indexed keywords

EID: 0000692349     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1999.0530     Document Type: Article

References (42)

1. Auzinger W., Stetter H. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. Proc. Intern. Conf. on Numerical Math. Internat. Ser. Numer. 86:1988;Birkhäuser, Basel. p. 11-30.
2. Bernshtein D. The number of roots of a system of equations. Funct. Anal. Appl. 9:1975;183-185.
3. Bini D., Pan V. Y. Polynomial and Matrix Computations, Vol. 1. Fundamental Algorithms. 1994;Birkhäuser, Boston.
4. Bondyfalat D., Mourrain B., Pan V. Y. Controlled iterative methods for solving polynomial systems. Proc. ACM Intern. Symp. on Symb. Algebr. Comp. 1998;ACM Press, New York. p. 252-259.
5. Canny J., Emiris I. An efficient algorithm for the sparse mixed resultant. Cohen G., Mora T., Moreno O. Proc. Intern. Symp. Applied Algebra, Algebraic Algor. and Error-Corr. Codes, Puerto Rico. Lecture Notes in Comput. Sci. 263:1993;89-104 Springer Verlag, New York/Berlin.
6. Canny J., Kaltofen E., Lakshman Y. Solving systems of non-linear polynomial equations faster. Proc. of the Annual ACM-SIGSAM Int. Symp. on Symb. and Alg. Comp. (ISSAC'89). 1989;ACM Press, New York. p. 121-128.
7. Cardinal J. On two iterative methods for approximating the roots of a polynomial. Renegar J., Shub M., Smale S. Proc. AMS-SIAM Summer Seminar on Math. of Numerical Analysis, Park City, Utah, 1995. Lectures in Appl. Math. 32:1996;165-188 Amer. Math. Soc. Providence.
8. Cardinal J., Mourrain B. Algebraic approach of residues and applications. Renegar J., Shub M., Smale S. Proc. AMS-SIAM Summer Seminar on Math. of Numerical Analysis, Park City, Utah, 1995. Lectures in Appl. Math. 32:1996;189-210 Amer. Math. Soc. Providence.
9. Cox D., Little J., O'Shea D. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. 1992;Springer-Verlag, New York/Berlin.
10. Cattani E., Dickenstein A., Sturmfels B. Computing multidimensional residues. González-Vega L., Recio T. Algorithms in Algebraic Geometry and Applications. Prog. in Math. 143:1996;Birkhäuser, Basel.
11. Corless R. M., Gianni P. M., Trager B. M. A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots. Proc. ACM Intern. Symp. on Symbolic and Algebraic Computation. 1997;ACM Press, New York. p. 133-140.
12. Demazure M. Charles Hermite, déjà. Notes informelles de calcul formel 8. 1987;Ecole PolytechniqueCentre de Math.
13. Elkadi M., Mourrain B. Rapport de Recherche. 1996.
14. M. Elkadi, and, B. Mourrain, Algorithms for residues and lojasiewicz exponents, J. Pure Appl. Algebra, in press.
15. Emiris I. Z., Pan V. Y. The structure of sparse resultant matrices. Proc. ACM Intern. Symp. on Symbolic and Algebraic Computation. 1997;ACM Press, New York. p. 189-196.
16. Emiris I., Rege A. Monomial bases and polynomial system solving. Proc. ACM Intern. Symp. on Symbolic and Algebraic Computation. 1994;ACM Press, New York. p. 114-122.
17. Fuhrmann P. A Polynomial Approach to Linear Algebra. 1996;Springer-Verlag, New York/Berlin.
18. Gelfand I., Kapranov M., Zelevinsky A. Discriminants, Resultants and Multidimensional Determinants. 1994;Birkhäuser, Boston/Basel/Berlin.
19. Golub G. H., Van Loan C. F. Matrix Computations. 1996;John Hopkins Univ. Press, Baltimore.
20. Henrici P. Applied and Computational Complex Analysis. 1988;Wiley, New York.
21. Hermite C. Remarques sur le théorème de Sturm. C. R. Acad. Sci. Paris. 36:1853;52-54.
22. Kapur D., Lakshman Y. N. Elimination methods: An introduction. Donald B., Kapur D., Mundy J. Symbolic and Numerical Computation for Artificial Intelligence. 1992;45-89 Academic Press, New York.
23. Kushnirenko A. A Newton polyhedron and the number of solutions of a system of k equations in k unknowns. Uspekhi Mat. Nauk. 30:1975;266-267.
24. Macaulay F. S. Some formulae in elimination. Proc. London Math. Soc. 1:1902;3-27.
25. Macaulay F. S. The Algebraic Theory of Modular Systems. 1916;Cambridge Univ. Press, Cambridge.
26. Mourrain B. Computing isolated polynomial roots by matrix methods. J. Symbol. Comput. 26:1998;715-738.
27. Mourrain B., Pan V. Y. Multidimensional structured matrices and polynomial systems. Calcolo. 33:1996;389-401.
28. Mourrain B., Pan V. Y. Solving special polynomial systems by using structured matrices and algebraic residues. Cucker F., Shub M. Proc. of the Workshop on Foundations of Computational Mathematics, Rio de Janeiro, 1997. 1997;287-304 Springer-Verlag, New York/Berlin.
29. Mourrain B., Pan V. Y. Asymptotic acceleration of solving multivariate polynomial systems of equations. Proc. 3th Ann. ACM Symp. on Theory of Computing. 1998;ACM Press, New York. p. 488-496.
30. Pan V. Y. Nearly optimal computations with structured matrices. Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms. 2000;ACM Press, New York. p. 953-962.
31. Pan V. Y., Chen Z. Q. The complexity of the matrix eigenproblem. Proc. 31st Ann. ACM Symp. on Theory of Computing. 1999;ACM Press, New York.
32. Pedersen P. S., Roy M.-F., Szpirglas A. Counting real zeros in the multivariate case. Galligo A., Eyssette F. Effective Methods in Algebraic Geometry, MEGA'92. Progr. Math. 1993;203-223 Birkhäuser, Basel.
33. Pedersen P. S., Sturmfels B. Product formulas for resultants and Chow forms. Math. Z. 214:1993;377-396.
34. Pedersen P. S., Sturmfels B. Mixed monomials basis. Effective Methods in Algebraic Geometry, MEGA'94. Progr. Math. 143:1994;Birkhäuser, Basel. p. 285-306.
35. Penfield P. Jr., Spencer R., Duinker S. Tellegen's Theorem and Electrical Networks. 1970;MIT Press, Cambridge.
36. Olshevsky V., Pan V. Y. A unified superfast algorithm for boundary rational tangential interpolation problem and for inversion and factorization of dense structured matrices. Proc. 39th Annual IEEE Symposium on Foundations of Computer Science. 1998;IEEE Comput. Soc. Los Alamitos. p. 192-201.
37. Renegar J. On the worst-case arithmetic complexity of approximating zeros of systems of polynomials. SIAM J. Comput. 18:1989;350-370.
38. Rouillier F. Systèmes polynomiaux. 1996;Univ. de Rennes.
39. Sebastiao e Silva J. Sur une méthode d'approximation semblable à celle de Graeffe. Portugal Math. J. 2:1941;271-279.
40. Stetter H. J. Eigenproblems are at the heart of polynomial system solving. SIGSAM Bull. 30:1996;22-25.
41. Tyrtyshnikov E. E. A unified approach to old and new theorems on distribution and clustering. Linear Algebra Appl. 232:1998;1-43.
42. Van der Waerden B. Modern Algebra. 1948;Ungar, New York.