A basic family of iteration functions for polynomial root finding and its characterizations

DOI10.1016/S0377-0427(97)00014-9zbMATH Open0874.65037WikidataQ126572914 ScholiaQ126572914MaRDI QIDQ1360168FDOQ1360168

Authors: Bahman Kalantari, Iraj Kalantari, Rahim Zaare-Nahandi 

Publication date: 10 November 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Recommendations

• Newton's method and generation of a determinantal family of iteration functions
• scientific article; zbMATH DE number 3923973
• On the order of convergence of a determinantal family of root-finding methods

zbMATH Keywords

convergenceNewton's methodpolynomial root findingHalley's methoditeration formulas

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A family of root finding methods
• Accelerated Convergence in Newton’s Method
• On two sequences of algorithms for approximating square roots
• A family of one-point iteration formulae for finding roots
• On the Geometry of Halley's Method
• On Halley's Iteration Method
• On the Convergence of Halley's Method
• Title not available (Why is that?)
• On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
• A Type of Variation on Newton's Method
• The Solution of Equations by Continued Fractions
• High order iterative methods for approximating square roots
• On Halley's Variation of Newton's Method
• On the global convergence of Halley's iteration formula
• Computational complexity. On the geometry of polynomials and a theory of cost. I

Cited In (29)

• On rediscovered iteration methods for solving equations
• High order iterative methods for approximating square roots
• 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
• On the convergence of Halley's method for multiple polynomial zeros
• Title not available (Why is that?)
• Characterization of the determinant of a Laguerre matrix
• A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
• Recursive elucidation of polynomial congruences using root-finding numerical techniques
• On the rediscovery of Halley's iterative method for computing the zero of an analytic function
• Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
• On zeros of Hankel determinants with iterated polynomial entries
• On Schröder's families of root-finding methods
• Symmetric functions and root-finding algorithms
• On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
• The link on extraneous non-repelling cycles of Schröder's methods of the first and second kind
• Algorithms for quaternion polynomial root-finding
• Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary
• On the convergence of Chebyshev's method for multiple polynomial zeros
• Title not available (Why is that?)
• New formulas for approximation of \(\pi\) and other transcendental numbers
• On general convergence in extracting radicals via a fundamental family of iteration functions
• An iteration method with maximal order based on standard information
• A computational comparison of the first nine members of a determinantal family of root-finding methods
• The polynomial pivots as initial values for a new root-finding iterative method
• Symmetries of the Julia sets of König's methods for polynomials
• An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
• Iterative root approximation in \(p\)-adic numerical analysis
• Polynomial and rational approximations and the link between Schröder's processes of the first and second kind

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)