Iterative methods for simultaneous inclusion of polynomial zeros
From MaRDI portal
Publication:1801245
DOI10.1007/BFb0083599zbMath0689.65028OpenAlexW633035909MaRDI QIDQ1801245
Publication date: 5 June 1993
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0083599
interval analysisnumerical testsiterative methodsnumerical stabilitycomputational efficiencypolynomial equationsorder of convergencepolynomial zerosConvergence conditionssingle step methodsclusters of zerosdisk iterationpoint iterationrectangular intervalsreserach surveytotal step methods
Interval and finite arithmetic (65G30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) 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)
Related Items (88)
On a class of higher order methods for simultaneous rootfinding of generalized polynomials ⋮ Laguerre-like inclusion method for polynomial zeros ⋮ An efficient derivative free family of fourth order methods for solving systems of nonlinear equations ⋮ Family of simultaneous methods of Hansen--Patrick's type ⋮ Improved methods for the simultaneous inclusion of multiple polynomial zeros ⋮ On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane ⋮ On iteration methods without derivatives for the simultaneous determination of polynomial zeros ⋮ On searching for roots of a polynomial in a circular annulus ⋮ Efficient derivative-free numerical methods for solving systems of nonlinear equations ⋮ Multi-step root solvers of Traub's type in real interval arithmetic ⋮ On a cubically convergent derivative-free root finding method ⋮ On a modification of the Koenig theorem ⋮ A highly efficient root-solver of very fast convergence ⋮ A posteriori error bound methods for the inclusion of polynomial zeros ⋮ The behaviour of approximations of the SOR Weierstrass method ⋮ A high order iteration formula for the simultaneous inclusion of polynomial zeros ⋮ Initial approximations in Euler-Chebyshev's method ⋮ Lower bounds for the \(R\)-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ Modified Newton method in circular interval arithmetic ⋮ On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros ⋮ Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices ⋮ Euler-Like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction ⋮ A family of simultaneous zero finding methods ⋮ Forward-backward serial iteration methods for simultaneously approximating polynomial zeros ⋮ On some simultaneous methods based on Weierstrass' correction ⋮ On initial conditions for the convergence of simultaneous root finding methods ⋮ On a high-order one-parameter family for the simultaneous determination of polynomial roots ⋮ A family of simultaneous zero-finding methods ⋮ A general method to generate parallel iterations for finding all zeros of polynomial simultaneously ⋮ The Root Separation of Polynomials and Some Applications ⋮ A Halley-Like Hybrid Method for Solving Polynomial Equations ⋮ Enclosing clusters of zeros of polynomials ⋮ On simultaneous factoring of a polynomial ⋮ Some families of two-step simultaneous methods for determining zeros of nonlinear equations ⋮ A new method of increasing the order of convergence step by step ⋮ On the efficiency of some combined methods for polynomial complex zeros ⋮ New higher-order methods for the simultaneous inclusion of polynomial zeros ⋮ 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 ⋮ A Halley‐Like Hybrid Method for Solving Polynomial Equations ⋮ On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ On an efficient inclusion method for finding polynomial zeros ⋮ Higher-order iterative methods for approximating zeros of analytic functions ⋮ On the construction of simultaneous methods for multiple zeros ⋮ A class of simultaneous methods for the zeros of analytic functions ⋮ Chebyshev-like root-finding methods with accelerated convergence ⋮ Methods with corrections for the simultaneous inclusion of polynomial zeros ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ Generalized Ostrowski root-finding method ⋮ Börsch-supan-like methods: point estimation and parallel implementation ⋮ A family of root-finding methods with accelerated convergence ⋮ High order Euler-like method for the inclusion of polynomial zeros ⋮ On the decidability of the theory of modules over the ring of algebraic integers ⋮ On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros ⋮ An efficient higher order family of root finders ⋮ Efficient methods for the inclusion of polynomial zeros ⋮ Weierstrass-like methods with corrections for the inclusion of polynomial zeros ⋮ Derivative free inclusion methods for polynomial zeros ⋮ A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic ⋮ On the new fourth-order methods for the simultaneous approximation of polynomial zeros ⋮ A new higher-order family of inclusion zero-finding methods ⋮ On the improved Newton-like methods for the inclusion of polynomial zeros ⋮ On a generalization of the Euler-Chebyshev method for simultaneous extraction of only a part of all roots of polynomials ⋮ A new fourth-order family of simultaneous methods for finding polynomial zeros ⋮ Accelerating generators of iterative methods for finding multiple roots of nonlinear equations ⋮ Iteration functions re-visited ⋮ Sigmoid-like functions and root finding methods ⋮ Computational efficiency of some combined methods for polynomial equations ⋮ Enclosing all zeros of an analytic function - a rigorous approach ⋮ Schröder-like algorithms for multiple complex zeros of a polynomial ⋮ Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic ⋮ A hybrid method for polynomial complex zero ⋮ Floating point Gröbner bases. ⋮ Higher-order simultaneous methods for the determination of polynomial multiple zeros ⋮ The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros ⋮ The self-validated method for polynomial zeros of high efficiency ⋮ On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial ⋮ Some simultaneous iterations for finding all zeros of a polynomial with high order convergence ⋮ On the convergence of Wang-Zheng's method ⋮ On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros ⋮ Improved Halley-like methods for the inclusion of polynomial zeros ⋮ Finding a cluster of zeros of univariate polynomials ⋮ On an efficient simultaneous method for finding polynomial zeros ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods ⋮ An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction ⋮ Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders ⋮ A note on simultaneous rootfinding for algebraic, exponential, and trigonometric polynomials ⋮ Containment regions for zeros of polynomials from numerical ranges of companion matrices
This page was built for publication: Iterative methods for simultaneous inclusion of polynomial zeros
