Variations on computing reciprocals of power series

DOI10.1016/S0020-0190(00)00044-2zbMath1014.68065OpenAlexW2053492675WikidataQ109955592 ScholiaQ109955592MaRDI QIDQ1607045

Arnold Schönhage

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00044-2

zbMATH Keywords

reciprocalsGraeffe root squaring steps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (8)

A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial ⋮ Computations with infinite Toeplitz matrices and polynomials ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ Fast algorithms for elementary operations on complex power series ⋮ Newton's method and FFT trading ⋮ A simple and fast algorithm for computing exponentials of power series ⋮ Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers ⋮ Faster algorithms for the square root and reciprocal of power series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved upper complexity bounds for the discrete Fourier transform
• Polynomial division and its computational complexity
• On computing reciprocals of power series
• Parallel Solution of Certain Toeplitz Linear Systems
• Inverting Polynomials and Formal Power Series

This page was built for publication: Variations on computing reciprocals of power series