Computing machine-efficient polynomial approximations

Author:

Brisebarre Nicolas1,Muller Jean-Michel2,Tisserand Arnaud3

Affiliation:

1. Université J. Monnet, St-Étienne and LIP-E.N.S. Lyon, Lyon Cedex, France

2. CNRS, LIP-ENS Lyon, Lyon Cedex, France

3. INRIA, LIP-ENS Lyon, Lyon Cedex, France

Abstract

Polynomial approximations are almost always used when implementing functions on a computing system. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite---and sometimes small---number of bits. This is due to the finiteness of the floating-point representations (for software implementations), and to the need to have small, hence fast and/or inexpensive, multipliers (for hardware implementations). We then have to consider polynomial approximations for which the degree- i coefficient has at most m i fractional bits; in other words, it is a rational number with denominator 2 m i . We provide a general and efficient method for finding the best polynomial approximation under this constraint. Moreover, our method also applies if some other constraints (such as requiring some coefficients to be equal to some predefined constants or minimizing relative error instead of absolute error) are required.

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Reference25 articles.

1. Borwein P. and Erdélyi T. 1995. Polynomials and Polynomials Inequalities. Graduate Texts in Mathematics 161. Springer-Verlag New York NY. Borwein P. and Erdélyi T. 1995. Polynomials and Polynomials Inequalities. Graduate Texts in Mathematics 161. Springer-Verlag New York NY.

2. Construction of do loops from systems of affine constraints;Collard J.-F.;Parall. Process. Lett.,1995

3. Cornea M. Harrison J. and Tang P. T. P. 2002. Scientific Computing on Itanium-Based Systems. Intel Press. Cornea M. Harrison J. and Tang P. T. P. 2002. Scientific Computing on Itanium-Based Systems. Intel Press.

4. Parametric integer programming;Feautrier P.;RAIRO Rech. Opér.,1988

Cited by 24 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Effects of Inclination Angle and Height of Blast Load on the Dynamic Behavior of Floor Slabs with Stiffening Beams;Civil and Environmental Engineering;2024-06-01

2. Computational Techniques;Design for Embedded Image Processing on FPGAs;2023-09-05

3. Towards Machine-Efficient Rational L-Approximations of Mathematical Functions;2023 IEEE 30th Symposium on Computer Arithmetic (ARITH);2023-09-04

4. Fast Polynomial Evaluation for Correctly Rounded Elementary Functions using the RLIBM Approach;Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization;2023-02-17

5. Design of variable precision transcendental function automatic generator;The Journal of Supercomputing;2021-06-25

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3