1*f3087befSAndrew Turner /* 2*f3087befSAndrew Turner * Double-precision polynomial coefficients for scalar asinh(x) 3*f3087befSAndrew Turner * 4*f3087befSAndrew Turner * Copyright (c) 2022-2024, Arm Limited. 5*f3087befSAndrew Turner * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 6*f3087befSAndrew Turner */ 7*f3087befSAndrew Turner 8*f3087befSAndrew Turner #include "math_config.h" 9*f3087befSAndrew Turner 10*f3087befSAndrew Turner /* asinh(x) is odd, and the first term of the Taylor expansion is x, so we can 11*f3087befSAndrew Turner approximate the function by x + x^3 * P(x^2), where P(z) has the form: 12*f3087befSAndrew Turner C0 + C1 * z + C2 * z^2 + C3 * z^3 + ... 13*f3087befSAndrew Turner Note P is evaluated on even powers of x only. See tools/asinh.sollya for the 14*f3087befSAndrew Turner algorithm used to generate these coefficients. */ 15*f3087befSAndrew Turner const struct asinh_data __asinh_data 16*f3087befSAndrew Turner = { .poly 17*f3087befSAndrew Turner = { -0x1.55555555554a7p-3, 0x1.3333333326c7p-4, -0x1.6db6db68332e6p-5, 18*f3087befSAndrew Turner 0x1.f1c71b26fb40dp-6, -0x1.6e8b8b654a621p-6, 0x1.1c4daa9e67871p-6, 19*f3087befSAndrew Turner -0x1.c9871d10885afp-7, 0x1.7a16e8d9d2ecfp-7, -0x1.3ddca533e9f54p-7, 20*f3087befSAndrew Turner 0x1.0becef748dafcp-7, -0x1.b90c7099dd397p-8, 0x1.541f2bb1ffe51p-8, 21*f3087befSAndrew Turner -0x1.d217026a669ecp-9, 0x1.0b5c7977aaf7p-9, -0x1.e0f37daef9127p-11, 22*f3087befSAndrew Turner 0x1.388b5fe542a6p-12, -0x1.021a48685e287p-14, 23*f3087befSAndrew Turner 0x1.93d4ba83d34dap-18 } }; 24