论文信息 - On a class of higher order methods for simultaneous rootfinding of generalized polynomials

On a class of higher order methods for simultaneous rootfinding of generalized polynomials

SummaryUsing the argument principle higher order methods for simultaneous computation of all zeros of generalized polynomials (like algebraic, trigonometric and exponential polynomials or exponential sums) are derived. The methods can also be derived following the continuation principle from [3]. Thereby, the unified approach of [7] is enlarged to arbitrary orderN. The local convergence as well as a-priori and a-posteriori error estimates for these methods are treated on a general level. Numerical examples are included.

Carsten Carstensen | C. Carstensen | Martin Reinders | M. Reinders

[1] Andreas Frommer,et al. A unified approach to methods for the simultaneous computation of all zeros of generalized polynomials , 1988 .

[2] I. V. Makrelov,et al. On the Convergence of Two Methods for the Simultaneous Finding of All Roots of Exponential Equations , 1985 .

[3] A. Ostrowski. Solution of equations and systems of equations , 1967 .

[4] Immo O. Kerner,et al. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .

[5] Jürgen Herzberger,et al. On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots , 1974 .

[6] L. Ahlfors. Complex Analysis , 1979 .

[7] Wolfgang Börsch-supan,et al. Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation , 1970 .

[8] Miodrag S. Petković,et al. Iterative Methods for Simultaneous Inclusion of Polynomial Zeros , 1989 .

[9] E. D. Angelova,et al. Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations☆ , 1982 .