Construction of zero-finding methods by Weierstrass functions
DOI10.1016/J.AMC.2006.05.159zbMATH Open1114.65049OpenAlexW1967829041MaRDI QIDQ879490FDOQ879490
Authors: L. D. Petković, M. 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
Recommendations
- On the construction of simultaneous methods for multiple zeros
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- On some simultaneous methods based on Weierstrass' correction
- A family of simultaneous zero-finding methods for polynomials
- Weierstrass formula and zero-finding methods
convergenceiterative methodsnumerical stabilitypolynomial zerossimultaneous methodscircular interval arithmeticWeierstrass' functionsinclusion of zeroszero-finding methods
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Interval and finite arithmetic (65G30)
Cites Work
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Title not available (Why is that?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
- Title not available (Why is that?)
- A family of root finding methods
- A posteriori error bounds for the zeros of polynomials
- Zur iterativen Auflösung algebraischer Gleichungen
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Title not available (Why is that?)
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- 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
- A family of simultaneous zero-finding methods
- On some improvements of square root iteration for polynomial complex zeros
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- Simultaneous inclusion of the zeros of a polynomial
- On some simultaneous methods based on Weierstrass' correction
- A class of iterative methods for holomorphic functions
- A parallel algorithm for simple roots of polynomials
- Family of simultaneous methods of Hansen--Patrick's type
Cited In (8)
- Weierstrass formula and zero-finding methods
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- Title not available (Why is that?)
- ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
- Efficient Steffensen-type algorithms for solving nonlinear equations
- On new higher order families of simultaneous methods for finding polynomial zeros
- Solving triangular algebraic systems by means of simultaneous iterations
This page was built for publication: Construction of zero-finding methods by Weierstrass functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879490)
