Pages that link to "Item:Q2557116"
From MaRDI portal
The following pages link to An algorithm for division of powerseries (Q2557116):
Displaying 18 items.
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method (Q393389) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- Cauchy index computation (Q1127957) (← links)
- Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications (Q1211341) (← links)
- Fast modular transforms (Q1216049) (← links)
- A method for calculating the reciprocal coefficients of function matrices (Q1224410) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- On computing reciprocals of power series (Q2265255) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
- Fast algorithms for elementary operations on complex power series (Q3586258) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
