Resolution of multiple roots of nonlinear polynomial systems

International Journal of Shape Modeling

Volumn 11, Issue 1, 2005, Pages 121-147

  Ko, K H ^a   Sakkalis, T ^b   Patrikalakis, N M ^b  

^a STEVENS INSTITUTE OF TECHNOLOGY   (United States)

^b USA   (United States)

Author keywords

Cauchy index; Gauss map; Topological degree; Univariate and bivariate polynomials

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; IMAGE ANALYSIS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; POLYNOMIALS;

CAUCHY INDEX; GAUSS MAPS; NONLINEAR POLYNOMIAL SYSTEMS; TOPOLOGICAL DEGREE; TOPOLOGICAL DEGREE BISECTION (TDB); UNIVARIATE AND BIVARIATE POLYNOMIALS;

NONLINEAR SYSTEMS;

EID: 22944441619     PISSN: 02186543     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021865430500075X     Document Type: Article

References (17)

1. M. C. Carpentier and A. F. Dos Santos. Solution of equations involving analytic functions. J. Comput. Phys., 45:210-220, 1982.
2. R. T. Farouki and V. T. Rajan. Algorithms for polynomials in Bernstein form. Comput. Aided Geom. Design, 5(1):1-26, June 1988.
3. P. Henrici. Applied and Computational Complex Analysis. John Wiley, New York, 1974.
4. D. Manocha and J. F. Canny. Multipolynomial resultant algorithms. J. Symbolic Comput., 15:99-122, 1993.
5. D. Manocha and J. W. Demmel. Algorithms for intersecting parametric and algebraic curves II: Multiple intersections. Graphical Model and Image Processing, 57(2):81-100, 1995.
6. J. M. McNamee. A bibliography on roots of polynomials. J. Comput. Appl. Math., 47(3):391-394, 1993.
7. M. Mignotte. Mathematics for Computer Algebra. Springer-Verlag, New York, 1992.
8. H. M. Möller and H. J. Stetter. Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems. Numer. Math., 70(3):311-329, 1995.
9. S. Moritsugu and K. Kuriyama. On multiple zeros of systems of algebraic equations. In Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, pages 23-30, Vancouver, BC, Canada, 1999. ACM Press.
10. N. M. Patrikalakis and T. Maekawa. Shape Interrogation for Computer Aided Design and Manufacturing. Springer-Verlag, Heidelberg, February 2002.
11. S. M. Rump. Ten methods to bound multiple roots of polynomials. J. Comput. Appl. Math., 156(2):403-432, 2003.
12. T. Sakkalis. The Euclidean algorithm and the degree of the Gauss map. SIAM J. Comput, 19(3):538-543, 1990.
13. T. Sakkalis and R. Farouki. Singular points of algebraic curves. J. Symbolic Comput., 9:405-421, 1990.
14. E. C. Sherbrooke and N. M. Patrikalakis. Computation of the solutions of nonlinear polynomial systems. Comput. Aided Geom. Design, 10(5):379-405, October 1993.
15. R. J. Walker. Algebraic Curves. Springer-Verlag, New York, 1978.
16. H. S. Wilf. A global bisection algorithm for computing the zeros of polynomials in the complex plane. Journal of the Association for Computing Machinery, 25(3):415-420, July 1978.
17. X. Ying and I. N. Katz. A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain. Numer. Math., 53:143-163, 1988.