Rapid multiplication modulo the sum and difference of highly composite numbers

DOI10.1090/S0025-5718-02-01419-9MaRDI QIDQ4780378zbMATH OpenFDO

Authors Colin Percival

Publication date 19 November 2002

Published in Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformrapid multiplicationrouding errors

Mathematics Subject Classification ID

Roundoff error (65G50) Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50) Factorization; primality (11A51)

Recommendations

• Discrete Weighted Transforms and Large-Integer Arithmetic
• scientific article; zbMATH DE number 3856407
• Fast multiplication of large numbers
• A faster modular multiplication algorithm
• Faster arithmetic for number-theoretic transforms

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 846277 (Why is no real title available?)
• Discrete Weighted Transforms and Large-Integer Arithmetic
• Roundoff Error Analysis of the Fast Fourier Transform
• The twenty-fourth Fermat number is composite

Cited in

(6)

• Fast convolutions of packed strings and pattern matching with wildcards
• Multiple product modulo arbitrary numbers
• Multiple product modulo arbitrary numbers
• Error bounds on complex floating-point multiplication
• Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
• Discrete Weighted Transforms and Large-Integer Arithmetic

Describes a project that uses

Uses Software

• FFTW
• mctoolbox

This page was built for publication: Rapid multiplication modulo the sum and difference of highly composite numbers

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