Searching worst cases of a one-variable function using lattice reduction

DOI10.1109/TC.2005.55zbMath1171.65361OpenAlexW2149538173MaRDI QIDQ3417011

Paul Zimmermann, Vincent Lefèvre, Damien Stehlé

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2005.55

zbMATH Keywords

Computer arithmeticmultiple precision arithmeticspecial function approximations

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20)

Related Items (6)

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format ⋮ Standardization and testing of implementations of mathematical functions in floating point numbers ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Correct rounding of algebraic functions ⋮ Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) ⋮ Formally verified certificate checkers for hardest-to-round computation

This page was built for publication: Searching worst cases of a one-variable function using lattice reduction