Schröder-like algorithms for multiple complex zeros of a polynomial
From MaRDI portal
Publication:756374
algorithmsconvergencecomputational efficiencyinterval methodspolynomial equationcircular arithmeticmultiple complex zeroSchröder's method
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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)
Recommendations
- scientific article; zbMATH DE number 2015316
- Convergence of Schröder method for polynomial zeros of unknown multiplicity
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
Cites work
- scientific article; zbMATH DE number 3890621 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3942922 (Why is no real title available?)
- scientific article; zbMATH DE number 3684883 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3260031 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3313124 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A family of root finding methods
- Circular arithmetic and the determination of polynomial zeros
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Iterative methods for simultaneous inclusion of polynomial zeros
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- On the efficiency of some combined methods for polynomial complex zeros
- Parallel Laguerre iterations: The complex case
- Some interval iterations for finding a zero of a polynomial with error bounds
Cited in
(5)- scientific article; zbMATH DE number 2015316 (Why is no real title available?)
- Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots
- Convergence of Schröder method for polynomial zeros of unknown multiplicity
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods
This page was built for publication: Schröder-like algorithms for multiple complex zeros of a polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756374)