Modern Computer Arithmetic

DOI10.1017/CBO9780511921698zbMath1230.68014OpenAlexW4211076402WikidataQ56938970 ScholiaQ56938970MaRDI QIDQ3060337

Publication date: 2 December 2010

Full work available at URL: https://doi.org/10.1017/cbo9780511921698

fast Fourier transform floating-point arithmetic integer arithmetic modular arithmetic computer arithmetic arbitrary precision arithmetic special functions evaluation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical problems of computer architecture (68M07)

Related Items

A new sequence convergent to Euler-Mascheroni constant, Tensors in computations, New lattice attacks on DSA schemes, Multiple-correction and continued fraction approximation. II, Formal Verification of Exact Computations Using Newton’s Method, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), A fast algorithm for computing the number of magic series, A log-log speedup for exponent one-fifth deterministic integer factorisation, Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights, Computing period matrices and the Abel-Jacobi map of superelliptic curves, Dirichlet’s proof of the three-square theorem: An algorithmic perspective, An algorithm for calculating logarithms through displacement, On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants, Integer multiplication in time \(O(n\log n)\), On a high-order one-parameter family for the simultaneous determination of polynomial roots, Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\), Fast evaluation and root finding for polynomials with floating-point coefficients, Fast and accurate computation of the Euclidean norm of a vector, Phragmén's voting methods and justified representation, Rounding error analysis of linear recurrences using generating series, Faster truncated integer multiplication, On the computation of modular forms on noncongruence subgroups, Rigorous uniform approximation of D-finite functions using Chebyshev expansions, New higher-order methods for the simultaneous inclusion of polynomial zeros, Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers, Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians, Fast integer multiplication using generalized Fermat primes, Construction and efficiency of multipoint root-ratio methods for finding multiple zeros, Efficient quantum algorithms for state measurement and linear algebra applications, Speeding-up verification of digital signatures, Multiple-correction and continued fraction approximation, The Borwein Brothers, Pi and the AGM, A simple and fast online power series multiplication and its analysis, On an efficient inclusion method for finding polynomial zeros, Multipoint methods for solving nonlinear equations: a survey, Missing a trick: Karatsuba variations, Multiple-correction and faster approximation, An exponent one-fifth algorithm for deterministic integer factorisation, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Computing Hypergeometric Functions Rigorously, Matrix Arithmetic-Geometric Mean and the Computation of the Logarithm, Recursive Double-Size Fixed Precision Arithmetic, Truncation bounds for differentially finite series, AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM, Scaling and modified squaring method for the matrix exponential, Exponentially more precise quantum simulation of fermions in second quantization, A deterministic algorithm for finding \(r\)-power divisors, Frobenius action on a hypergeometric curve and an algorithm for computing values of Dwork's \(p\)-adic hypergeometric functions, On an efficient simultaneous method for finding polynomial zeros, A bound for the error term in the Brent-McMillan algorithm, Computing Class Polynomials for Abelian Surfaces, Continued fraction inequalities for the Euler-Mascheroni constant