A family of simultaneous zero-finding methods
From MaRDI portal
The authors propose a generally original iterative method to simultaneously calculate all zeros of a polynomial. The method improves on previously known methods accelerating the order of convergence from three to four. It contains, as particular cases, a number of other methods. Numerical examples, run in quadruple precision, illustrate the feasability of the method proposed.
Recommendations
- A family of simultaneous zero finding methods
- A new fourth-order family of simultaneous methods for finding polynomial zeros
- A family of simultaneous zero-finding accelerated methods
- A family of simultaneous zero-finding methods for polynomials
- On new higher order families of simultaneous methods for finding polynomial zeros
Cites work
- A family of root finding methods
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- A modified Newton method for polynomials
- A parallel algorithm for simple roots of polynomials
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 714514 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Iterative methods for simultaneous inclusion of polynomial zeros
- On some improvements of square root iteration for polynomial complex zeros
- On some simultaneous methods based on Weierstrass' correction
- Parallel Laguerre iterations: The complex case
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Zur iterativen Auflösung algebraischer Gleichungen
Cited in
(37)- Adams-like techniques for zero-finder methods
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- Comments on some recent methods for the simultaneous determination of polynomial zeros
- Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications
- A new fourth-order family of simultaneous methods for finding polynomial zeros
- Point estimation of a family of simultaneous zero-finding methods
- On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
- Family of simultaneous methods of Hansen--Patrick's type
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- The polynomial pivots as initial values for a new root-finding iterative method
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- A posteriori error bound methods for the inclusion of polynomial zeros
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- The simultaneous determination of all zeros of a polynomial
- A procedure for obtaining a family of iterative formulas for finding zeros of functions
- A family of simultaneous zero-finding accelerated methods
- A family of two-parameters accelerated zero-finding methods for algebraic equation
- scientific article; zbMATH DE number 1823832 (Why is no real title available?)
- scientific article; zbMATH DE number 4192960 (Why is no real title available?)
- Some families of two-step simultaneous methods for determining zeros of nonlinear equations
- On the construction of simultaneous methods for multiple zeros
- scientific article; zbMATH DE number 1507136 (Why is no real title available?)
- scientific article; zbMATH DE number 1839518 (Why is no real title available?)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- Family of simultaneous methods with corrections for approximating zeros of analytic functions
- On a cubically convergent derivative-free root finding method
- A family of simultaneous zero-finding methods for polynomials
- A new higher-order family of inclusion zero-finding methods
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
- Simultaneous roots for vectorial problems
- Jacobian-free vectorial iterative scheme to find simple several solutions simultaneously
- Construction of zero-finding methods by Weierstrass functions
- On new higher order families of simultaneous methods for finding polynomial zeros
This page was built for publication: A family of simultaneous zero-finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130393)
