Modern computer arithmetic
From MaRDI portal
Publication:3060337
fast Fourier transformfloating-point arithmeticmodular arithmeticcomputer arithmeticinteger arithmeticarbitrary precision arithmeticspecial functions evaluation
Computation of special functions and constants, construction of tables (65D20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for discrete and fast Fourier transforms (65T50) Mathematical problems of computer architecture (68M07)
Recommendations
Cited in
(58)- Speeding-up verification of digital signatures
- 2-D lossless FIR filter design using synthesis of the paraunitary transfer function matrix
- Continued fraction inequalities for the Euler-Mascheroni constant
- Multiple-correction and continued fraction approximation
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- A bound for the error term in the Brent-McMillan algorithm
- Tensors in computations
- An exponent one-fifth algorithm for deterministic integer factorisation
- Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\)
- Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
- New higher-order methods for the simultaneous inclusion of polynomial zeros
- Rounding error analysis of linear recurrences using generating series
- New lattice attacks on DSA schemes
- Computing hypergeometric functions rigorously
- Multipoint methods for solving nonlinear equations: a survey
- Multiple-correction and continued fraction approximation. II
- Fast evaluation and root finding for polynomials with floating-point coefficients
- IEEE-754 precision-\(p\) base-\(\beta\) arithmetic implemented in binary
- Fast and accurate computation of the Euclidean norm of a vector
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Scaling and modified squaring method for the matrix exponential
- Dynamics of number systems. Computation with arbitrary precision
- Integer multiplication in time \(O(n\log n)\)
- Computing period matrices and the Abel-Jacobi map of superelliptic curves
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM
- A fast algorithm for computing the number of magic series
- Multiple-correction and faster approximation
- Efficient quantum algorithms for state measurement and linear algebra applications
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- Polynomial multiplication over finite fields in time \(O(n\log n)\)
- A new sequence convergent to Euler-Mascheroni constant
- Computing class polynomials for abelian surfaces
- On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants
- Faster truncated integer multiplication
- On the computation of modular forms on noncongruence subgroups
- Formal Verification of Exact Computations Using Newton’s Method
- On a high-order one-parameter family for the simultaneous determination of polynomial roots
- Arithmetic software libraries
- A simple and fast online power series multiplication and its analysis
- On an efficient inclusion method for finding polynomial zeros
- An algorithm for calculating logarithms through displacement
- Finite precision number systems and arithmetic
- Matrix arithmetic-geometric mean and the computation of the logarithm
- Truncation bounds for differentially finite series
- Exponentially more precise quantum simulation of fermions in second quantization
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions
- Fast integer multiplication using generalized Fermat primes
- On an efficient simultaneous method for finding polynomial zeros
- The Borwein brothers, pi and the AGM
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- Recursive double-size fixed precision arithmetic
- Phragmén's voting methods and justified representation
- 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
- Missing a trick: Karatsuba variations
- Construction and efficiency of multipoint root-ratio methods for finding multiple zeros
This page was built for publication: Modern computer arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060337)
