A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
From MaRDI portal
Publication:3566648
DOI10.1090/S0002-9939-10-10309-8zbMath1286.05176MaRDI QIDQ3566648
Publication date: 8 June 2010
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
generating functionsrecurrence relationsymmetric functionsmultiple rootsroot-findingiteration functions
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Numerical computation of solutions to single equations (65H05) Algorithms for approximation of functions (65D15)
Related Items (2)
Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity ⋮ On covariate importance for regression models with multivariate response
Cites Work
- Unnamed Item
- Unnamed Item
- A family of root finding methods
- A basic family of iteration functions for polynomial root finding and its characterizations
- On extraneous fixed-points of the basic family of iteration functions
- Symmetric functions and root-finding algorithms
- A new upper bound on the complexity of derivative evaluation
- On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials
- On K nig's root-finding algorithms*
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
- An Efficient Formula for Linear Recurrences
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
This page was built for publication: A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
