Algorithms for computer algebra
Algorithms for computer algebra
Applied numerical linear algebra
Applied numerical linear algebra
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
Computer Methods for Mathematical Computations
Computer Methods for Mathematical Computations
Numerical Methods
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
International Journal of Parallel, Emergent and Distributed Systems
Using GPUs to improve multigrid solver performance on a cluster
International Journal of Computational Science and Engineering
Robust solvers for inverse imaging problems using dense single-precision hardware
Journal of Mathematical Imaging and Vision
Foreword: In honour of Keith Geddes on his 60th birthday
Journal of Symbolic Computation
Numeric-symbolic exact rational linear system solver
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |
We apply an iterative refinement method based on a linear Newton iteration to solve a particular group of high precision computation problems. The method generates an initial solution at hardware floating point precision using a traditional method and then repeatedly refines this solution to higher precision, exploiting hardware floating point computation in each iteration. This is in contrast to direct solution of the high precision problem completely in software floating point. Theoretical cost analysis, as well as experimental evidence, shows a significant reduction in computational cost is achieved by the iterative refinement method on this group of problems.