Numerical analysis of Givens rotation

11/08/2022
by   Weslley da Silva Pereira, et al.
0

Generating 2-by-2 unitary matrices in floating-precision arithmetic is a delicate task. One way to reduce the accumulation error is to use less floating-point operations to compute each of the entries in the 2-by-2 unitary matrix. This paper shows an algorithm that reduces the number of operations to compute the entries of a Givens rotation. Overall, the new algorithm has more operations in total when compared to algorithms in different releases of LAPACK, but less operations per entry. Numerical tests show that the new algorithm is more accurate on average.

READ FULL TEXT
research
06/30/2023

Multigrid Methods using Block Floating Point Arithmetic

Block Floating Point (BFP) arithmetic is currently seeing a resurgence i...
research
03/11/2019

Correct Approximation of IEEE 754 Floating-Point Arithmetic for Program Verification

Verification of programs using floating-point arithmetic is challenging ...
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
03/10/2020

Parallel Robust Computation of Generalized Eigenvectors of Matrix Pencils

In this paper we consider the problem of computing generalized eigenvect...
research
08/02/2022

An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice

Let Ψ(x,y) count the number of positive integers n≤ x such that every pr...
research
07/22/2023

Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis

This paper deals with the problem of numerically computing the roots of ...
research
01/28/2018

BOPS, Not FLOPS! A New Metric and Roofline Performance Model For Datacenter Computing

The past decades witness FLOPS (Floating-point Operations per Second) as...

Please sign up or login with your details

Forgot password? Click here to reset