A multiprecise integer arithmetic package

DOI10.1007/BF00129844zbMATH Open1215.65210MaRDI QIDQ547494FDOQ547494

Authors: Duncan A. Buell, Robert Ward 

Publication date: 2 July 2011

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Recommendations

• A design for a number theory package with an optimized trial division routine
• Algorithm 786: multiple-precision complex arithmetic and functions
• Algorithm 693: a FORTRAN package for floating-point multiple-precision arithmetic
• Algorithm 719: Multiprecision translation and execution of FORTRAN programs
• Recursive double-size fixed precision arithmetic

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Cites Work

• Title not available (Why is that?)
• Modular Multiplication Without Trial Division
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
• Title not available (Why is that?)

Cited In (10)

• A package for computations with sparse resultants
• Title not available (Why is that?)
• Algorithm 786: multiple-precision complex arithmetic and functions
• Numerical Software with Result Verification
• Title not available (Why is that?)
• A package for computations with classical resultants
• A Parallel Algorithm for Multiple-Precision Division by a Single-Precision Integer
• A design for a number theory package with an optimized trial division routine
• Recursive double-size fixed precision arithmetic
• Title not available (Why is that?)

This page was built for publication: A multiprecise integer arithmetic package

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