A basic family of iteration functions for polynomial root finding and its characterizations
From MaRDI portal
(Redirected from Publication:1360168)
Recommendations
Cites work
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- scientific article; zbMATH DE number 3222940 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A Type of Variation on Newton's Method
- A family of one-point iteration formulae for finding roots
- A family of root finding methods
- Accelerated Convergence in Newton’s Method
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- High order iterative methods for approximating square roots
- On Halley's Iteration Method
- On Halley's Variation of Newton's Method
- On the Convergence of Halley's Method
- On the Geometry of Halley's Method
- On the global convergence of Halley's iteration formula
- On two sequences of algorithms for approximating square roots
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
- The Solution of Equations by Continued Fractions
Cited in
(30)- Recursive elucidation of polynomial congruences using root-finding numerical techniques
- On general convergence in extracting radicals via a fundamental family of iteration functions
- An iteration method with maximal order based on standard information
- Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary
- Symmetric functions and root-finding algorithms
- The polynomial pivots as initial values for a new root-finding iterative method
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- Symmetries of the Julia sets of König's methods for polynomials
- Characterization of the determinant of a Laguerre matrix
- On the convergence of Halley's method for multiple polynomial zeros
- New formulas for approximation of \(\pi\) and other transcendental numbers
- High order iterative methods for approximating square roots
- Polynomial and rational approximations and the link between Schröder's processes of the first and second kind
- Algorithms for quaternion polynomial root-finding
- A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
- A computational comparison of the first nine members of a determinantal family of root-finding methods
- The link on extraneous non-repelling cycles of Schröder's methods of the first and second kind
- scientific article; zbMATH DE number 1944658 (Why is no real title available?)
- On the rediscovery of Halley's iterative method for computing the zero of an analytic function
- On the convergence of Chebyshev's method for multiple polynomial zeros
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
- On rediscovered iteration methods for solving equations
- On Schröder's families of root-finding methods
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity
- On zeros of Hankel determinants with iterated polynomial entries
- scientific article; zbMATH DE number 2156416 (Why is no real title available?)
- The Padé iterations for the matrix sign function and their reciprocals are optimal
- Newton's method and generation of a determinantal family of iteration functions
- Iterative root approximation in \(p\)-adic numerical analysis
This page was built for publication: A basic family of iteration functions for polynomial root finding and its characterizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360168)
