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

DOI10.1007/BF01388681zbMath0802.65064MaRDI QIDQ1326426

Martin Reinders, Carsten 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 estimatesnumerical examplesiterative methodszeros of generalized polynomials

Mathematics Subject Classification ID

Related Items (4)

Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding ⋮ Failure of convergence of the Newton-Weierstrass iterative method for simultaneous rootfinding of generalized polynomials ⋮ On some interval methods for algebraic, exponential and trigonometric polynomials ⋮ A note on simultaneous rootfinding for algebraic, exponential, and trigonometric polynomials

Cites Work

• Unnamed Item
• A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
• Iterative methods for simultaneous inclusion of polynomial zeros
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• On the Convergence of Two Methods for the Simultaneous Finding of All Roots of Exponential Equations
• Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

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