Construction of zero-finding methods by Weierstrass functions
From MaRDI portal
Publication:879490
DOI10.1016/j.amc.2006.05.159zbMath1114.65049OpenAlexW1967829041MaRDI QIDQ879490
Ljiljana D. Petković, Miodrag S. Petković
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.159
convergenceiterative methodsnumerical stabilitypolynomial zerossimultaneous methodscircular interval arithmeticWeierstrass' functionsinclusion of zeroszero-finding methods
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ Accelerating generators of iterative methods for finding multiple roots of nonlinear equations ⋮ Efficient Steffensen-type algorithms for solving nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some improvements of square root iteration for polynomial complex zeros
- A parallel algorithm for simple roots of polynomials
- A family of simultaneous zero-finding methods
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- A family of root finding methods
- An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
- Family of simultaneous methods of Hansen--Patrick's type
- On some simultaneous methods based on Weierstrass' correction
- A posteriori error bounds for the zeros of polynomials
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- A class of iterative methods for holomorphic functions
- Simultaneous inclusion of the zeros of a polynomial
- Zur iterativen Auflösung algebraischer Gleichungen
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
This page was built for publication: Construction of zero-finding methods by Weierstrass functions
