Rapid multiplication modulo the sum and difference of highly composite numbers

DOI10.1090/S0025-5718-02-01419-9zbMATH Open1022.65146MaRDI QIDQ4780378FDOQ4780378

Authors: Colin Percival 

Publication date: 19 November 2002

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete Weighted Transforms and Large-Integer Arithmetic
• Title not available (Why is that?)
• The twenty-fourth Fermat number is composite
• Roundoff Error Analysis of the Fast Fourier Transform

Cited In (6)

• 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
• Fast convolutions of packed strings and pattern matching with wildcards
• Multiple product modulo arbitrary numbers
• Multiple product modulo arbitrary numbers

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)