Arithmetically improved algorithmic performance
From MaRDI portal
An augmented set of floating-point arithmetic operations which includes the accurate inner product can be routinely employed with benefit in some standard iterative numerical algorithms. Benefits include the requirement of fewer iterations for achieving computational convergence criteria and more accurate results for a given number of iterations. Not all algorithms are benefited, but favorable results have been obtained for the QR algorithm, the conjugate gradient algorithm and the separating hyperplane algorithm.
Recommendations
- The arithmetic optimization algorithm
- scientific article; zbMATH DE number 4022626
- Faster arithmetic for number-theoretic transforms
- On Faster Integer Calculations Using Non-arithmetic Primitives
- Improvements on the accelerated integer GCD algorithm
- An improved rewriting-number algorithm
- scientific article; zbMATH DE number 1950620
- Improved algorithms for computing determinants and resultants
- Implementation of some algorithms for accelerating computer calculations
Cites work
- E-methods for fixed point equations f(x)=x
- scientific article; zbMATH DE number 3855012 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3711297 (Why is no real title available?)
- Linear and Nonlinear Methods in Pattern Classification
- The Arithmetic of the Digital Computer: A New Approach
Cited in
(2)
This page was built for publication: Arithmetically improved algorithmic performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266560)
