Home
last modified time | relevance | path

Searched full:approximation (Results 1 – 25 of 333) sorted by relevance

12345678910>>...14

/freebsd/contrib/arm-optimized-routines/pl/math/
H A Dv_asinf_2u5.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
42 following approximation.
45 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
50 For |x| in [0.5, 1.0], use same approximation with a change of variable
82 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_F1()
H A Dv_asin_3u.c19 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
47 following approximation.
50 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
56 For |x| in [0.5, 1.0], use same approximation with a change of variable
88 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_D1()
H A Dv_acosf_1u4.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
44 approximation.
47 approximation of asin is an odd polynomial:
54 For |x| in [0.5, 1.0], use same approximation with a change of variable
86 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_F1()
H A Dv_acos_2u.c19 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
49 approximation.
52 approximation of asin is an odd polynomial:
60 For |x| in [0.5, 1.0], use same approximation with a change of variable
91 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_D1()
H A Dsv_asinf_2u5.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
28 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
34 For |x| in [0.5, 1.0], use same approximation with a change of variable
57 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_F1()
H A Dsv_acosf_1u4.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
29 approximation of asin is an odd polynomial:
37 For |x| in [0.5, 1.0], use same approximation with a change of variable
59 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_F1()
H A Dsv_asin_3u.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
34 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
40 For |x| in [0.5, 1.0], use same approximation with a change of variable
62 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_D1()
H A Dacosf_1u4.c23 approximation of single-precision asin(x).
32 and use an order 4 polynomial P such that the final approximation of asin is
43 approximation of asin near 0.
78 /* Use a single polynomial approximation P for both intervals. */ in acosf()
H A Dacos_2u.c23 approximation of double-precision asin(x).
32 and use an order 11 polynomial P such that the final approximation of asin is
44 approximation of asin near 0.
75 /* Use a single polynomial approximation P for both intervals. */ in acos()
H A Dsv_acos_2u.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
31 approximation of asin is an odd polynomial:
39 For |x| in [0.5, 1.0], use same approximation with a change of variable
62 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_D1()
H A Dasinf_2u5.c22 approximation.
27 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
32 No cheap approximation can be obtained near x = 1, since the function is not
80 /* Use a single polynomial approximation P for both intervals. */ in asinf()
H A Dasin_3u.c22 approximation.
27 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
33 No cheap approximation can be obtained near x = 1, since the function is not
82 /* Use a single polynomial approximation P for both intervals. */ in asin()
H A Dlog1pf_2u1.c52 scheme. Our polynomial approximation for log1p has the form in eval_poly()
54 Hence approximation has the form m + m^2 * P(m) in eval_poly()
59 #error No log1pf approximation exists with the requested precision. Options are 13 or 25. in eval_poly()
69 /* log1pf approximation using polynomial on reduced interval. Worst-case error
H A Dv_cbrtf_1u7.c18 .poly = { /* Very rough approximation of cbrt(x) in [0.5, 1], generated with
46 /* Approximation for vector single-precision cbrt(x) using Newton iteration
67 /* p is a rough approximation for cbrt(m) in [0.5, 1.0]. The better this is, in V_NAME_F1()
H A Dsv_cbrtf_1u7.c19 /* Very rough approximation of cbrt(x) in [0.5, 1], generated with FPMinimax.
46 /* Approximation for vector single-precision cbrt(x) using Newton iteration
70 /* p is a rough approximation for cbrt(m) in [0.5, 1.0]. The better this is, in SV_NAME_F1()
H A Dlog1p_2u.c34 /* log1p approximation using polynomial on reduced interval. Largest
115 log1p(0)=0 we choose an approximation of the form: in log1p()
117 Hence approximation has the form f + f^2 * P(f) in log1p()
H A Dv_tanf_3u5.c100 - is finite, then use a polynomial approximation of the form in V_NAME_F1()
104 the same polynomial approximation of tan as above. */ in V_NAME_F1()
109 /* Evaluate polynomial approximation of tangent on [-pi/4, pi/4]. */ in V_NAME_F1()
H A Dsv_log1p_2u5.c47 /* Vector approximation for log1p using polynomial on reduced interval. Maximum
91 log1p(0)=0 we choose an approximation of the form: in SV_NAME_D1()
93 Hence approximation has the form f + f^2 * P(f) in SV_NAME_D1()
H A Dsv_tanf_3u5.c75 - is finite, then use a polynomial approximation of the form in SV_NAME_F1()
79 the same polynomial approximation of tan as above. */ in SV_NAME_F1()
84 /* Evaluate polynomial approximation of tangent on [-pi/4, pi/4], in SV_NAME_F1()
H A Dv_log1p_2u5.c49 /* Vector log1p approximation using polynomial on reduced interval. Routine is
102 log1p(0)=0 we choose an approximation of the form: in V_NAME_D1()
104 Hence approximation has the form f + f^2 * P(f) in V_NAME_D1()
H A Dcbrtf_1u5.c19 /* Approximation for single-precision cbrt(x), using low-order polynomial and
40 /* p is a rough approximation for cbrt(m) in [0.5, 1.0]. The better this is, in cbrtf()
H A Dcbrt_2u.c20 /* Approximation for double-precision cbrt(x), using low-order polynomial and
42 /* Calculate rough approximation for cbrt(m) in [0.5, 1.0], starting point for in cbrt()
/freebsd/contrib/arm-optimized-routines/math/
H A Derff_data.c2 * Data for approximation of erff.
10 /* Minimax approximation of erff. */
H A Derf_data.c11 Minimax approximation of erf
22 /* Rational approximation on [0x1p-28, 0.84375] */
31 /* Rational approximation on [0.84375, 1.25] */
/freebsd/contrib/llvm-project/libcxx/src/include/ryu/
H A Dcommon.h69 // This approximation works up to the point that the multiplication overflows at __e = 3529. in __pow5bits()
79 // The first value this approximation fails for is 2^1651 which is just greater than 10^297. in __log10Pow2()
87 // The first value this approximation fails for is 5^2621 which is just greater than 10^1832. in __log10Pow5()

12345678910>>...14