论文信息 - Detection and Validation of Clusters of Polynomial Zeros

Detection and Validation of Clusters of Polynomial Zeros

We consider the task of partitioning the zeros of a real or complex polynomial into clusters and of determining their location and multiplicity for polynomials with coefficients of limited accuracy. We derive computational procedures for the solution of this task which combine symbolic computation with floating-point arithmetic. The validation of the existence ofmzeros in a specified small disk is described.

Hans J. Stetter | V. Hribernig | H. Stetter | V. Hribernig

[1] Ronald G Mosier. Root neighborhoods of a polynomial , 1986 .

[2] Arnold Schönhage,et al. Quasi-GCD computations , 1985, J. Complex..

[3] Hans J. Stetter. Analysis of zero clusters in multivariate polynomial systems , 1996, ISSAC '96.

[4] James H. Davenport,et al. Computer Algebra: Systems and Algorithms for Algebraic Computation , 1988 .

[5] H. M. Möller,et al. Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems , 1995 .

[6] Hans J. Stetter. Multivariate Polynomial Equations as Matrix Eigenproblems , 1993 .

[7] Rudolf Mathon,et al. The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence , 1996, TOMS.

[8] L. Trefethen,et al. Pseudozeros of polynomials and pseudospectra of companion matrices , 1994 .

[9] A. Neumaier. An Existence Test for Root Clusters and Multiple Roots , 1988 .

[10] T. Sasaki,et al. Approximate square-free decomposition and root-finding of lll-conditioned algebraic equations , 1989 .

[11] A. Neumaier. Interval methods for systems of equations , 1990 .

[12] W. Kahan. Conserving Confluence Curbs Ill-Condition , 1972 .