New algorithms for relaxed multiplication

DOI10.1016/j.jsc.2007.04.004zbMath1130.68103OpenAlexW2085014043MaRDI QIDQ2469229

Joris van der Hoeven

Publication date: 4 February 2008

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.04.004

zbMATH Keywords

algorithmFFTpower seriescomputer algebramultiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (9)

On the Complexity of Multivariate Polynomial Division ⋮ Relaxed algorithms for \(p\)-adic numbers ⋮ Relaxed Hensel lifting of triangular sets ⋮ A simple and fast online power series multiplication and its analysis ⋮ New algorithms for relaxed multiplication ⋮ From implicit to recursive equations ⋮ Fast algorithms for elementary operations on complex power series ⋮ Newton's method and FFT trading ⋮ Tracking -adic precision

Uses Software

• Mathemagix
• Mmxlib

Cites Work

• Newton's method and FFT trading
• On fast multiplication of polynomials over arbitrary algebras
• Relax, but don't be too lazy
• The middle product algorithm. I: Speeding up the division and square root of power series
• On effective analytic continuation
• New algorithms for relaxed multiplication
• Fast multiplication of large numbers
• A long note on Mulders' short product
• Fast Algorithms for Manipulating Formal Power Series
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New algorithms for relaxed multiplication