Exploiting variable precision in GMRES

07/24/2019
by   Serge Gratton, et al.
0

We describe how variable precision floating point arithmetic can be used in the iterative solver GMRES. We show how the precision of the inner products carried out in the algorithm can be reduced as the iterations proceed, without affecting the convergence rate or final accuracy achieved by the iterates. Our analysis explicitly takes into account the resulting loss of orthogonality in the Arnoldi vectors. We also show how inexact matrix-vector products can be incorporated into this setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2016

Customizable Precision of Floating-Point Arithmetic with Bitslice Vector Types

Customizing the precision of data can provide attractive trade-offs betw...
research
02/24/2020

On the use of the Infinity Computer architecture to set up a dynamic precision floating-point arithmetic

We devise a variable precision floating-point arithmetic by exploiting t...
research
10/07/2022

Iterative Methods at Lower Precision

Since numbers in the computer are represented with a fixed number of bit...
research
10/01/2020

Computing the matrix sine and cosine simultaneously with a reduced number of products

A new procedure is presented for computing the matrix cosine and sine si...
research
04/11/2022

Multiplier with Reduced Activities and Minimized Interconnect for Inner Product Arrays

We present a pipelined multiplier with reduced activities and minimized ...
research
05/17/2023

The Complexity of Diagonalization

We survey recent progress on efficient algorithms for approximately diag...
research
04/14/2023

A Numerical-based Parametric Error Analysis Method for Goldschmidt Floating Point Division

This paper proposes a parametric error analysis method for Goldschmidt f...

Please sign up or login with your details

Forgot password? Click here to reset