1 // polynomial for approximating e^x
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 deg = 4; // poly degree
8 N = 128; // table entries
9 b = log(2)/(2*N); // interval
12 // find polynomial with minimal abs error
14 // return p that minimizes |exp(x) - poly(x) - x^d*p(x)|
15 approx = proc(poly,d) {
16 return remez(exp(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
19 // first 2 coeffs are fixed, iteratively find optimal double prec coeffs
21 for i from 2 to deg do {
22 p = roundcoefficients(approx(poly,i), [|D ...|]);
23 poly = poly + x^i*coeff(p,0);
26 display = hexadecimal;
27 print("rel error:", accurateinfnorm(1-poly(x)/exp(x), [a;b], 30));
28 print("abs error:", accurateinfnorm(exp(x)-poly(x), [a;b], 30));
29 print("in [",a,b,"]");
31 for i from 0 to deg do coeff(poly,i);