Pages that link to "Item:Q1607045"
From MaRDI portal
The following pages link to Variations on computing reciprocals of power series (Q1607045):
Displaying 13 items.
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
- The complexity of bivariate power series arithmetic. (Q1401232) (← links)
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial (Q1874670) (← links)
- The middle product algorithm. I: Speeding up the division and square root of power series (Q1879478) (← links)
- On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← links)
- Faster algorithms for the square root and reciprocal of power series (Q3081289) (← links)
- RECIPROCALS OF BINARY POWER SERIES (Q3421782) (← links)
- Fast algorithms for elementary operations on complex power series (Q3586258) (← links)
- (Q4779144) (← links)
- Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers (Q5965414) (← links)