1*f3087befSAndrew Turner// polynomial used for __v_log10(x) 2*f3087befSAndrew Turner// 3*f3087befSAndrew Turner// Copyright (c) 2019-2024, Arm Limited. 4*f3087befSAndrew Turner// SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 5*f3087befSAndrew Turner 6*f3087befSAndrew Turnerdeg = 6; // poly degree 7*f3087befSAndrew Turnera = -0x1.fc1p-9; 8*f3087befSAndrew Turnerb = 0x1.009p-8; 9*f3087befSAndrew Turner 10*f3087befSAndrew Turner// find log(1+x)/x polynomial with minimal relative error 11*f3087befSAndrew Turner// (minimal relative error polynomial for log(1+x) is the same * x) 12*f3087befSAndrew Turnerdeg = deg-1; // because of /x 13*f3087befSAndrew Turner 14*f3087befSAndrew Turner// f = log(1+x)/x; using taylor series 15*f3087befSAndrew Turnerf = 0; 16*f3087befSAndrew Turnerfor i from 0 to 60 do { f = f + (-x)^i/(i+1); }; 17*f3087befSAndrew Turner 18*f3087befSAndrew Turner// return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)| 19*f3087befSAndrew Turnerapprox = proc(poly,d) { 20*f3087befSAndrew Turner return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10); 21*f3087befSAndrew Turner}; 22*f3087befSAndrew Turner 23*f3087befSAndrew Turner// first coeff is fixed, iteratively find optimal double prec coeffs 24*f3087befSAndrew Turnerpoly = 1; 25*f3087befSAndrew Turnerfor i from 1 to deg do { 26*f3087befSAndrew Turner p = roundcoefficients(approx(poly,i), [|D ...|]); 27*f3087befSAndrew Turner poly = poly + x^i*coeff(p,0); 28*f3087befSAndrew Turner}; 29*f3087befSAndrew Turner 30*f3087befSAndrew Turner// scale coefficients by 1/ln(10) 31*f3087befSAndrew Turnerln10 = evaluate(log(10),0); 32*f3087befSAndrew Turnerpoly = poly/ln10; 33*f3087befSAndrew Turner 34*f3087befSAndrew Turnerdisplay = hexadecimal; 35*f3087befSAndrew Turnerprint("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30)); 36*f3087befSAndrew Turnerprint("in [",a,b,"]"); 37*f3087befSAndrew Turnerprint("coeffs:"); 38*f3087befSAndrew Turnerfor i from 0 to deg do double(coeff(poly,i)); 39