Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Mixed precision GMRES-based iterative refinement with recycling

Oktay, EdaCarson, Erin — 2023

Programs and Algorithms of Numerical Mathematics

With the emergence of mixed precision hardware, mixed precision GMRES-based iterative refinement schemes for solving linear systems A x = b have recently been developed. However, in certain settings, GMRES may require too many iterations per refinement step, making it potentially more expensive than the alternative of recomputing the LU factors in a higher precision. In this work, we incorporate the idea of Krylov subspace recycling, a well-known technique for reusing information across sequential invocations,...

An adaptive s -step conjugate gradient algorithm with dynamic basis updating

Erin Claire Carson — 2020

Applications of Mathematics

The adaptive s -step CG algorithm is a solver for sparse symmetric positive definite linear systems designed to reduce the synchronization cost per iteration while still achieving a user-specified accuracy requirement. In this work, we improve the adaptive s -step conjugate gradient algorithm by the use of iteratively updated estimates of the largest and smallest Ritz values, which give approximations of the largest and smallest eigenvalues of A , using a technique due to G. Meurant and P. Tichý (2018)....

Page 1

Download Results (CSV)