New higher-order methods for the simultaneous inclusion of polynomial zeros
From MaRDI portal
Publication:639989
convergencenumerical exampleshigh-order methodspolynomial zerossimultaneous methodsinclusion methodsmultiple zeroscomplex zerosGargantini-Henrici's inclusion methodGauss-Seidel approach
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 roots of polynomial equations (65H04)
Recommendations
- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- Improved higher order method for the inclusion of multiple zeros of polynomials
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- On the improved family of simultaneous methods for the inclusion of multiple polynomial zeros
- Laguerre-like methods for the simultaneous inclusion of multiple zeros of polynomials.
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 1194122 (Why is no real title available?)
- scientific article; zbMATH DE number 27984 (Why is no real title available?)
- scientific article; zbMATH DE number 1206066 (Why is no real title available?)
- A method for finding the zeros of polynomials using a companion matrix.
- A modification of Newton's method for analytic mappings having multiple zeros
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- An Existence Test for Root Clusters and Multiple Roots
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
- Circular arithmetic and the determination of polynomial zeros
- Fast multiplication of large numbers
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Improved Halley-like methods for the inclusion of polynomial zeros
- Iterative methods for simultaneous inclusion of polynomial zeros
- MPFR
- Modern computer arithmetic
- Numerical methods for roots of polynomials. Part I
- 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 a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- The self-validated method for polynomial zeros of high efficiency
- Weierstrass formula and zero-finding methods
Cited in
(7)- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- A high order iteration formula for the simultaneous inclusion of polynomial zeros
- scientific article; zbMATH DE number 5353990 (Why is no real title available?)
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- On the improved family of simultaneous methods for the inclusion of multiple polynomial zeros
- A new higher-order family of inclusion zero-finding methods
This page was built for publication: New higher-order methods for the simultaneous inclusion of polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639989)
