Pages that link to "Item:Q3214408"
From MaRDI portal
The following pages link to On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives (Q3214408):
Displayed 13 items.
- On a global descent method for polynomials (Q802279) (← links)
- On computation of a power series root with arbitrary degree of convergence (Q1002491) (← links)
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain (Q1033892) (← links)
- On the cost of evaluating polynomials and their derivatives (Q1164995) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Fast methods for computing the values of the derivatives of a rational function (Q1196841) (← links)
- Fast modular transforms (Q1216049) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372) (← links)
- Error analysis of splitting algorithms for polynomials (Q1253522) (← links)
- Rounding error analysis of Horner's scheme (Q1836266) (← links)
- A new upper bound on the complexity of derivative evaluation (Q1845616) (← links)
- Higher-order iteration functions for simultaneously approximating polynomial zeros (Q3311583) (← links)