An Improved Algorithm for hypot(a,b)

04/20/2019
by   Carlos F. Borges, et al.
0

We develop a fast and accurate algorithm for evaluating √(a^2+b^2) for two floating point numbers a and b. Library functions that perform this computation are generally named hypot(a,b). We will compare four approaches that we will develop in this paper to the current resident library function that is delivered with Julia 1.1 and to the code that has been distributed with the C math library for decades. We will demonstrate the performance of our algorithms by simulation and settle on a final version that we believe is best.

READ FULL TEXT
research
10/10/2018

Generalized Ziggurat Algorithm for Unimodal and Unbounded Probability Density Functions with Zest

We present a modified Ziggurat algorithm that could generate a random nu...
research
01/25/2020

SLEEF: A Portable Vectorized Library of C Standard Mathematical Functions

In this paper, we present techniques used to implement our portable vect...
research
01/02/2022

High Precision Computation of Riemann's Zeta Function by the Riemann-Siegel Formula, II

(This is only a first preliminary version, any suggestions about it will...
research
12/13/2022

Fast Number Parsing Without Fallback

In recent work, Lemire (2021) presented a fast algorithm to convert numb...
research
12/06/2021

SIMD-Optimized Search Over Sorted Data

Applications often require a fast, single-threaded search algorithm over...
research
10/26/2017

Fast Linear Transformations in Python

This paper introduces a new free library for the Python programming lang...
research
02/12/2020

Task-based, GPU-accelerated and Robust Library for Solving Dense Nonsymmetric Eigenvalue Problems

In this paper, we present the StarNEig library for solving dense nonsymm...

Please sign up or login with your details

Forgot password? Click here to reset