Optimal approximation of the 1/x function using Chebyshev polynomials and magic constants

DOI10.1145/3708472MaRDI QIDQ6966607zbMATH OpenFDO

Authors Cezary J. Walczyk, Leonid V. Moroz, Volodymyr Samotyy, Jan L. Cieśliński

Publication date 27 June 2025

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3708472

zbMATH Keywords

Chebyshev polynomialsESP32floating-point arithmeticfloating-point divisionHorner's schememagic constantspolynomial approximationSollya toolSTM32

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
• Choosing starting values for certain Newton-Raphson iterations
• Computing machine-efficient polynomial approximations
• Handbook of floating-point arithmetic
• High-speed double-precision computation of reciprocal, division, square root, and inverse square root
• Minimum relative error approximations for 1/t
• On Division by Functional Iteration
• Optimal initial approximations for the Newton-Raphson division algorithm

This page was built for publication: Optimal approximation of the \(1/x\) function using Chebyshev polynomials and magic constants

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