An algorithm for division of powerseries
From MaRDI portal
Publication:2557116
DOI10.1007/BF02242389zbMath0251.68023WikidataQ109691993 ScholiaQ109691993MaRDI QIDQ2557116
Publication date: 1972
Published in: Computing (Search for Journal in Brave)
Computation of special functions and constants, construction of tables (65D20) Algorithms in computer science (68W99) Acceleration of convergence in numerical analysis (65B99)
Related Items
A fast numerical algorithm for the composition of power series with complex coefficients, Cauchy index computation, Wiener-Hopf and spectral factorization of real polynomials by Newton's method, Fast computation of special resultants, Fast algorithms for computing isogenies between elliptic curves, Sylvester-Habicht sequences and fast Cauchy index computation, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications, Fast algorithms for elementary operations on complex power series, A Gröbner free alternative for polynomial system solving, Fast modular transforms, On computing reciprocals of power series, A method for calculating the reciprocal coefficients of function matrices, A survey of techniques in applied computational complexity, Fast convolutions meet Montgomery, Fast arithmetic for triangular sets: from theory to practice, Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence, Relax, but don't be too lazy
