Variations on computing reciprocals of power series

DOI10.1016/S0020-0190(00)00044-2zbMATH Open1014.68065OpenAlexW2053492675WikidataQ109955592 ScholiaQ109955592MaRDI QIDQ1607045FDOQ1607045

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1834648
• The middle product algorithm. I: Speeding up the division and square root of power series
• Faster algorithms for the square root and reciprocal of power series
• Inverting Polynomials and Formal Power Series
• scientific article; zbMATH DE number 1256648

zbMATH Keywords

reciprocalsGraeffe root squaring steps

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Parallel Solution of Certain Toeplitz Linear Systems
• Title not available (Why is that?)
• On computing reciprocals of power series
• Polynomial division and its computational complexity
• Title not available (Why is that?)
• Improved upper complexity bounds for the discrete Fourier transform
• Inverting Polynomials and Formal Power Series

Cited In (14)

• Inverting Polynomials and Formal Power Series
• RECIPROCALS OF BINARY POWER SERIES
• The complexity of bivariate power series arithmetic.
• Computations with infinite Toeplitz matrices and polynomials
• Title not available (Why is that?)
• A simple and fast algorithm for computing exponentials of power series
• A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
• The middle product algorithm. I: Speeding up the division and square root of power series
• Newton's method and FFT trading
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• On the number of multiplications needed to invert a monic power series over fields of characteristic two
• Faster algorithms for the square root and reciprocal of power series
• Fast algorithms for elementary operations on complex power series
• Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers

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

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