An algorithm for division of powerseries

DOI10.1007/BF02242389MaRDI QIDQ2557116zbMATH OpenWikidataFDO

Authors Malte Sieveking

Publication date 1972

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02242389

Mathematics Subject Classification ID

Acceleration of convergence in numerical analysis (65B99) Computation of special functions and constants, construction of tables (65D20) Algorithms in computer science (68W99)

Cited in

(19)

• Fast arithmetic for triangular sets: from theory to practice
• A fast numerical algorithm for the composition of power series with complex coefficients
• Cauchy index computation
• Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
• Fast modular transforms
• A method for calculating the reciprocal coefficients of function matrices
• A survey of techniques in applied computational complexity
• Relax, but don't be too lazy
• On computing reciprocals of power series
• Fast computation of special resultants
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• Fast algorithms for computing isogenies between elliptic curves
• Fast algorithms for elementary operations on complex power series
• Wiener-Hopf and spectral factorization of real polynomials by Newton's method
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
• Fast convolutions meet Montgomery
• Sylvester-Habicht sequences and fast Cauchy index computation
• A Gröbner free alternative for polynomial system solving
• Division of power series: recursive and non-recursive formulas

This page was built for publication: An algorithm for division of powerseries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557116)