Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
From MaRDI portal
(Redirected from Publication:1248372)
Cites work
- A new upper bound on the complexity of derivative evaluation
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Error Analysis of the Algorithm for Shifting the Zeros of a Polynomial by Synthetic Division
- Evaluating Polynomials at Fixed Sets of Points
- Fast stable in-place sorting with \(O(n)\) data moves
- scientific article; zbMATH DE number 3433440 (Why is no real title available?)
- 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
Cited in
(11)- Some new variants of Cauchy's methods for solving nonlinear equations
- Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations
- Further development of Jarratt method for solving nonlinear equations
- New eighth-order derivative-free methods for solving nonlinear equations
- Two novel classes of two-step optimal methods for all the zeros in an interval
- Characterization of the determinant of a Laguerre matrix
- Convergence of the modified Halley's method for multiple zeros under Hölder continuous derivative
- Optimal eighth order iterative methods
- On new third-order convergent iterative formulas
- Note on a cubically convergent Newton-type method under weak conditions
- Several new third-order iterative methods for solving nonlinear equations
This page was built for publication: Selection of good algorithms from a family of algorithms for polynomial derivative evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248372)
