Rapid multiplication modulo the sum and difference of highly composite numbers

DOI10.1090/S0025-5718-02-01419-9zbMath1022.65146MaRDI QIDQ4780378

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

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

Related Items (2)

Error bounds on complex floating-point multiplication ⋮ Fast Convolutions of Packed Strings and Pattern Matching with Wildcards

Uses Software

• FFTW
• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete Weighted Transforms and Large-Integer Arithmetic
• The twenty-fourth Fermat number is composite
• Roundoff Error Analysis of the Fast Fourier Transform

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