Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
From MaRDI portal
Publication:1248372
DOI10.1016/0020-0190(77)90010-2zbMath0383.68041OpenAlexW2066183341WikidataQ60198239 ScholiaQ60198239MaRDI QIDQ1248372
Publication date: 1977
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(77)90010-2
Related Items (11)
Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations ⋮ Some new variants of Cauchy's methods for solving nonlinear equations ⋮ Further development of Jarratt method for solving nonlinear equations ⋮ New eighth-order derivative-free methods for solving nonlinear equations ⋮ Convergence of the modified Halley's method for multiple zeros under Hölder continuous derivative ⋮ Two novel classes of two-step optimal methods for all the zeros in an interval ⋮ On new third-order convergent iterative formulas ⋮ Optimal eighth order iterative methods ⋮ Note on a cubically convergent Newton-type method under weak conditions ⋮ Characterization of the determinant of a Laguerre matrix ⋮ Several new third-order iterative methods for solving nonlinear equations
Cites Work
- Unnamed Item
- A new upper bound on the complexity of derivative evaluation
- Fast stable in-place sorting with \(O(n)\) data moves
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- Rounding Error Analysis for the Evaluation of a Polynomial and Some of Its Derivatives
- Evaluating Polynomials at Fixed Sets of Points
- Error Analysis of the Algorithm for Shifting the Zeros of a Polynomial by Synthetic Division
This page was built for publication: Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
