scientific article; zbMATH DE number 3872575
[For the entire collection see Zbl 0527.00029.] Starting from the known simultaneous interval processes of the third and fourth order, based on Laguerre's result, two generalised iterative methods in terms of real intervals are derived in the paper. These interval methods make use of the definition of the k-th root of a real interval. The order of convergence of the proposed interval methods is \(k+2\) (\(k\geq 1)\), where k is the highest polynomial derivative order. Both procedures are suitable for simultaneous determination of interval approximations containing simple real zeros of a polynomial. For one of the suggested methods procedures for accelerating the convergence and for multiple real zeros are proposed.
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- Algorithms for \(n\)-th root approximation.
- scientific article; zbMATH DE number 5130550 (Why is no real title available?)
- scientific article; zbMATH DE number 3938455 (Why is no real title available?)
- On two generalizations of the Alon-Tarsi polynomial method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339183)