Variations on computing reciprocals of power series
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 641702 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- Improved upper complexity bounds for the discrete Fourier transform
- Inverting Polynomials and Formal Power Series
- On computing reciprocals of power series
- Parallel Solution of Certain Toeplitz Linear Systems
- Polynomial division and its computational complexity
Cited in
(14)- The complexity of bivariate power series arithmetic.
- Computations with infinite Toeplitz matrices and polynomials
- A simple and fast algorithm for computing exponentials of power series
- Faster algorithms for the square root and reciprocal of power series
- Inverting Polynomials and Formal Power Series
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- scientific article; zbMATH DE number 1834648 (Why is no real title available?)
- Newton's method and FFT trading
- RECIPROCALS OF BINARY POWER SERIES
- On the number of multiplications needed to invert a monic power series over fields of characteristic two
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
- Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers
- The middle product algorithm. I: Speeding up the division and square root of power series
- Fast algorithms for elementary operations on complex power series
This page was built for publication: Variations on computing reciprocals of power series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607045)