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

DOI10.1007/BF01388681MaRDI QIDQ1326426zbMATH OpenFDO

Authors Martin Reinders, C. Carstensen

Publication date 11 December 1994

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/133697

zbMATH Keywords

convergenceerror estimatesiterative methodsnumerical exampleszeros of generalized polynomials

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Review text

The paper is devoted to the study of a class of iterative methods for simultaneous computation of all zeros of generalized polynomials. It is proved that these methods are of convergence order \(N\), and also certain relations to other methods are discussed. Finally, a priori and a posteriori error estimates and some illustrating numerical examples are given.

Recommendations

• A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
• The simultaneous determination of all zeros of a polynomial
• One family of methods for finding of zeros of generalized polynomials
• On the R-order of some accelerated methods for the simultaneous finding of polynomial zeros

Cites work

• A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• Iterative methods for simultaneous inclusion of polynomial zeros
• Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations
• On the Convergence of Two Methods for the Simultaneous Finding of All Roots of Exponential Equations
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation

Cited in

(11)

• On a family of parallel root-finding methods for generalized polynomials
• On some interval methods for algebraic, exponential and trigonometric polynomials
• A note on simultaneous rootfinding for algebraic, exponential, and trigonometric polynomials
• Failure of convergence of the Newton-Weierstrass iterative method for simultaneous rootfinding of generalized polynomials
• One family of methods for finding of zeros of generalized polynomials
• scientific article; zbMATH DE number 3945258 (Why is no real title available?)
• scientific article; zbMATH DE number 1167611 (Why is no real title available?)
• scientific article; zbMATH DE number 786563 (Why is no real title available?)
• Generalized Ostrowski root-finding method
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
• New optimal class of higher-order methods for multiple roots, permitting \(f'(x_{n})=0\)

This page was built for publication: On a class of higher order methods for simultaneous rootfinding of generalized polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326426)