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

DOI10.1109/TC.2005.55MaRDI QIDQ3417011zbMATH OpenOpenAlexFDO

Authors Damien Stehlé, Vincent Lefèvre, Paul Zimmermann

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)

Recommendations

• scientific article; zbMATH DE number 1440917
• Correct rounding of algebraic functions
• Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
• Approximating Rational Numbers by Fractions
• An LLL algorithm with quadratic complexity

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3417011)