New algorithms for relaxed multiplication

DOI10.1016/J.JSC.2007.04.004MaRDI QIDQ2469229zbMATH OpenOpenAlexFDO

Authors 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

algorithmcomputer algebraFFTmultiplicationpower series

Mathematics Subject Classification ID

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

Recommendations

• Faster relaxed multiplication
• New iterative algorithms for modular multiplication
• A new algorithm for multiplication in finite fields
• A new multipliers algorithm
• New methods for binary multiplication
• New modular multiplication algorithms for fast modular exponentiation
• scientific article; zbMATH DE number 3291609
• New fast hybrid matrix multiplication algorithms
• An algorithm for fast multiplication of sedenions
• A faster modular multiplication algorithm

Cites work

• A long note on Mulders' short product
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fast Algorithms for Manipulating Formal Power Series
• Fast computation of power series solutions of systems of differential equations
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 1253958 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 2151193 (Why is no real title available?)
• scientific article; zbMATH DE number 3322464 (Why is no real title available?)
• New algorithms for relaxed multiplication
• Newton's method and FFT trading
• On effective analytic continuation
• 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

Cited in

(12)

• Relax, but don't be too lazy
• From implicit to recursive equations
• New algorithms for relaxed multiplication
• Tracking p-adic precision
• Faster relaxed multiplication
• Fast algorithms for elementary operations on complex power series
• Relaxed algorithms for \(p\)-adic numbers
• On the complexity of multivariate polynomial division
• scientific article; zbMATH DE number 2151193 (Why is no real title available?)
• Relaxed Hensel lifting of triangular sets
• A simple and fast online power series multiplication and its analysis
• Newton's method and FFT trading

Describes a project that uses

Uses Software

• Mathemagix
• Mmxlib

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

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