Symmetric functions and root-finding algorithms

DOI10.1016/J.AAM.2004.05.005MaRDI QIDQ1775732zbMATH OpenOpenAlexFDO

Authors Yi Jin, Bahman Kalantari

Publication date 4 May 2005

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2004.05.005

zbMATH Keywords

Iteration functionsKönig's familyRoot-findingSchröder's algorithmsSchur functionsSymmetric functions

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Recommendations

• On using symmetric polynomials for constructing root finding methods
• A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
• A basic family of iteration functions for polynomial root finding and its characterizations
• On extraneous fixed-points of the basic family of iteration functions
• A computational comparison of the first nine members of a determinantal family of root-finding methods

Cites work

• A basic family of iteration functions for polynomial root finding and its characterizations
• Accelerated Convergence in Newton’s Method
• Accelerated Convergence in Newton’s Method
• Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
• Families of rational maps and iterative root-finding algorithms
• Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 2156416 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Newton's method and generation of a determinantal family of iteration functions
• On extraneous fixed-points of the basic family of iteration functions
• On K nig's root-finding algorithms*
• Solving a Polynomial Equation: Some History and Recent Progress
• The fundamental theorem of algebra and complexity theory

Cited in

(5)

• New closed forms for Householder root finding functions and associated non-linear polynomial identities
• New theory and results from an algebraic application of Householder root finding schemes
• A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
• On \(\mu\)-symmetric polynomials
• On using symmetric polynomials for constructing root finding methods

Describes a project that uses

Uses Software

• SF

This page was built for publication: Symmetric functions and root-finding algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775732)