Pages that link to "Item:Q1095657"
From MaRDI portal
The following pages link to A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657):
Displaying 14 items.
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- Modular composition via factorization (Q722764) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- Composing power series over a finite ring in essentially linear time (Q1267071) (← links)
- Predicting zero coefficients in formal power series computations. (Q1599549) (← links)
- Numerics of analytic functions and complexity (Q1812812) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- On computing the coefficients of bivariate holonomic formal series (Q2581355) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- Nearly optimal computations with structured matrices (Q5919809) (← links)
- Fast summation of power series with coefficients analytic at infinity (Q5948209) (← links)
- Fast coefficient computation for algebraic power series in positive characteristic (Q6165860) (← links)
- Fast evaluation and root finding for polynomials with floating-point coefficients (Q6615413) (← links)
