scipy 1.15.3__cp313-cp313-macosx_12_0_arm64.whl → 1.16.0__cp313-cp313-macosx_12_0_arm64.whl

scipy/special/xsf/cephes/igami.h

@@ -1,313 +0,0 @@
-/* Translated into C++ by SciPy developers in 2024.
- * Original header with Copyright information appears below.
- */
-
-/*
- * (C) Copyright John Maddock 2006.
- * Use, modification and distribution are subject to the
- * Boost Software License, Version 1.0. (See accompanying file
- *  LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt)
- */
-#pragma once
-
-#include "../config.h"
-#include "../error.h"
-
-#include "const.h"
-#include "gamma.h"
-#include "igam.h"
-#include "polevl.h"
-
-namespace xsf {
-namespace cephes {
-
-    namespace detail {
-
-        XSF_HOST_DEVICE double find_inverse_s(double p, double q) {
-            /*
-             * Computation of the Incomplete Gamma Function Ratios and their Inverse
-             * ARMIDO R. DIDONATO and ALFRED H. MORRIS, JR.
-             * ACM Transactions on Mathematical Software, Vol. 12, No. 4,
-             * December 1986, Pages 377-393.
-             *
-             * See equation 32.
-             */
-            double s, t;
-            constexpr double a[4] = {0.213623493715853, 4.28342155967104, 11.6616720288968, 3.31125922108741};
-            constexpr double b[5] = {0.3611708101884203e-1, 1.27364489782223, 6.40691597760039, 6.61053765625462, 1};
-
-            if (p < 0.5) {
-                t = std::sqrt(-2 * std::log(p));
-            } else {
-                t = std::sqrt(-2 * std::log(q));
-            }
-            s = t - polevl(t, a, 3) / polevl(t, b, 4);
-            if (p < 0.5)
-                s = -s;
-            return s;
-        }
-
-        XSF_HOST_DEVICE inline double didonato_SN(double a, double x, unsigned N, double tolerance) {
-            /*
-             * Computation of the Incomplete Gamma Function Ratios and their Inverse
-             * ARMIDO R. DIDONATO and ALFRED H. MORRIS, JR.
-             * ACM Transactions on Mathematical Software, Vol. 12, No. 4,
-             * December 1986, Pages 377-393.
-             *
-             * See equation 34.
-             */
-            double sum = 1.0;
-
-            if (N >= 1) {
-                unsigned i;
-                double partial = x / (a + 1);
-
-                sum += partial;
-                for (i = 2; i <= N; ++i) {
-                    partial *= x / (a + i);
-                    sum += partial;
-                    if (partial < tolerance) {
-                        break;
-                    }
-                }
-            }
-            return sum;
-        }
-
-        XSF_HOST_DEVICE inline double find_inverse_gamma(double a, double p, double q) {
-            /*
-             * In order to understand what's going on here, you will
-             * need to refer to:
-             *
-             * Computation of the Incomplete Gamma Function Ratios and their Inverse
-             * ARMIDO R. DIDONATO and ALFRED H. MORRIS, JR.
-             * ACM Transactions on Mathematical Software, Vol. 12, No. 4,
-             * December 1986, Pages 377-393.
-             */
-            double result;
-
-            if (a == 1) {
-                if (q > 0.9) {
-                    result = -std::log1p(-p);
-                } else {
-                    result = -std::log(q);
-                }
-            } else if (a < 1) {
-                double g = xsf::cephes::Gamma(a);
-                double b = q * g;
-
-                if ((b > 0.6) || ((b >= 0.45) && (a >= 0.3))) {
-                    /* DiDonato & Morris Eq 21:
-                     *
-                     * There is a slight variation from DiDonato and Morris here:
-                     * the first form given here is unstable when p is close to 1,
-                     * making it impossible to compute the inverse of Q(a,x) for small
-                     * q. Fortunately the second form works perfectly well in this case.
-                     */
-                    double u;
-                    if ((b * q > 1e-8) && (q > 1e-5)) {
-                        u = std::pow(p * g * a, 1 / a);
-                    } else {
-                        u = std::exp((-q / a) - SCIPY_EULER);
-                    }
-                    result = u / (1 - (u / (a + 1)));
-                } else if ((a < 0.3) && (b >= 0.35)) {
-                    /* DiDonato & Morris Eq 22: */
-                    double t = std::exp(-SCIPY_EULER - b);
-                    double u = t * std::exp(t);
-                    result = t * std::exp(u);
-                } else if ((b > 0.15) || (a >= 0.3)) {
-                    /* DiDonato & Morris Eq 23: */
-                    double y = -std::log(b);
-                    double u = y - (1 - a) * std::log(y);
-                    result = y - (1 - a) * std::log(u) - std::log(1 + (1 - a) / (1 + u));
-                } else if (b > 0.1) {
-                    /* DiDonato & Morris Eq 24: */
-                    double y = -std::log(b);
-                    double u = y - (1 - a) * std::log(y);
-                    result = y - (1 - a) * std::log(u) -
-                             std::log((u * u + 2 * (3 - a) * u + (2 - a) * (3 - a)) / (u * u + (5 - a) * u + 2));
-                } else {
-                    /* DiDonato & Morris Eq 25: */
-                    double y = -std::log(b);
-                    double c1 = (a - 1) * std::log(y);
-                    double c1_2 = c1 * c1;
-                    double c1_3 = c1_2 * c1;
-                    double c1_4 = c1_2 * c1_2;
-                    double a_2 = a * a;
-                    double a_3 = a_2 * a;
-
-                    double c2 = (a - 1) * (1 + c1);
-                    double c3 = (a - 1) * (-(c1_2 / 2) + (a - 2) * c1 + (3 * a - 5) / 2);
-                    double c4 = (a - 1) * ((c1_3 / 3) - (3 * a - 5) * c1_2 / 2 + (a_2 - 6 * a + 7) * c1 +
-                                           (11 * a_2 - 46 * a + 47) / 6);
-                    double c5 = (a - 1) * (-(c1_4 / 4) + (11 * a - 17) * c1_3 / 6 + (-3 * a_2 + 13 * a - 13) * c1_2 +
-                                           (2 * a_3 - 25 * a_2 + 72 * a - 61) * c1 / 2 +
-                                           (25 * a_3 - 195 * a_2 + 477 * a - 379) / 12);
-
-                    double y_2 = y * y;
-                    double y_3 = y_2 * y;
-                    double y_4 = y_2 * y_2;
-                    result = y + c1 + (c2 / y) + (c3 / y_2) + (c4 / y_3) + (c5 / y_4);
-                }
-            } else {
-                /* DiDonato and Morris Eq 31: */
-                double s = find_inverse_s(p, q);
-
-                double s_2 = s * s;
-                double s_3 = s_2 * s;
-                double s_4 = s_2 * s_2;
-                double s_5 = s_4 * s;
-                double ra = std::sqrt(a);
-
-                double w = a + s * ra + (s_2 - 1) / 3;
-                w += (s_3 - 7 * s) / (36 * ra);
-                w -= (3 * s_4 + 7 * s_2 - 16) / (810 * a);
-                w += (9 * s_5 + 256 * s_3 - 433 * s) / (38880 * a * ra);
-
-                if ((a >= 500) && (std::abs(1 - w / a) < 1e-6)) {
-                    result = w;
-                } else if (p > 0.5) {
-                    if (w < 3 * a) {
-                        result = w;
-                    } else {
-                        double D = std::fmax(2, a * (a - 1));
-                        double lg = xsf::cephes::lgam(a);
-                        double lb = std::log(q) + lg;
-                        if (lb < -D * 2.3) {
-                            /* DiDonato and Morris Eq 25: */
-                            double y = -lb;
-                            double c1 = (a - 1) * std::log(y);
-                            double c1_2 = c1 * c1;
-                            double c1_3 = c1_2 * c1;
-                            double c1_4 = c1_2 * c1_2;
-                            double a_2 = a * a;
-                            double a_3 = a_2 * a;
-
-                            double c2 = (a - 1) * (1 + c1);
-                            double c3 = (a - 1) * (-(c1_2 / 2) + (a - 2) * c1 + (3 * a - 5) / 2);
-                            double c4 = (a - 1) * ((c1_3 / 3) - (3 * a - 5) * c1_2 / 2 + (a_2 - 6 * a + 7) * c1 +
-                                                   (11 * a_2 - 46 * a + 47) / 6);
-                            double c5 =
-                                (a - 1) * (-(c1_4 / 4) + (11 * a - 17) * c1_3 / 6 + (-3 * a_2 + 13 * a - 13) * c1_2 +
-                                           (2 * a_3 - 25 * a_2 + 72 * a - 61) * c1 / 2 +
-                                           (25 * a_3 - 195 * a_2 + 477 * a - 379) / 12);
-
-                            double y_2 = y * y;
-                            double y_3 = y_2 * y;
-                            double y_4 = y_2 * y_2;
-                            result = y + c1 + (c2 / y) + (c3 / y_2) + (c4 / y_3) + (c5 / y_4);
-                        } else {
-                            /* DiDonato and Morris Eq 33: */
-                            double u = -lb + (a - 1) * std::log(w) - std::log(1 + (1 - a) / (1 + w));
-                            result = -lb + (a - 1) * std::log(u) - std::log(1 + (1 - a) / (1 + u));
-                        }
-                    }
-                } else {
-                    double z = w;
-                    double ap1 = a + 1;
-                    double ap2 = a + 2;
-                    if (w < 0.15 * ap1) {
-                        /* DiDonato and Morris Eq 35: */
-                        double v = std::log(p) + xsf::cephes::lgam(ap1);
-                        z = std::exp((v + w) / a);
-                        s = std::log1p(z / ap1 * (1 + z / ap2));
-                        z = std::exp((v + z - s) / a);
-                        s = std::log1p(z / ap1 * (1 + z / ap2));
-                        z = std::exp((v + z - s) / a);
-                        s = std::log1p(z / ap1 * (1 + z / ap2 * (1 + z / (a + 3))));
-                        z = std::exp((v + z - s) / a);
-                    }
-
-                    if ((z <= 0.01 * ap1) || (z > 0.7 * ap1)) {
-                        result = z;
-                    } else {
-                        /* DiDonato and Morris Eq 36: */
-                        double ls = std::log(didonato_SN(a, z, 100, 1e-4));
-                        double v = std::log(p) + xsf::cephes::lgam(ap1);
-                        z = std::exp((v + z - ls) / a);
-                        result = z * (1 - (a * std::log(z) - z - v + ls) / (a - z));
-                    }
-                }
-            }
-            return result;
-        }
-
-    } // namespace detail
-
-    XSF_HOST_DEVICE inline double igamci(double a, double q);
-
-    XSF_HOST_DEVICE inline double igami(double a, double p) {
-        int i;
-        double x, fac, f_fp, fpp_fp;
-
-        if (std::isnan(a) || std::isnan(p)) {
-            return std::numeric_limits<double>::quiet_NaN();
-            ;
-        } else if ((a < 0) || (p < 0) || (p > 1)) {
-            set_error("gammaincinv", SF_ERROR_DOMAIN, NULL);
-        } else if (p == 0.0) {
-            return 0.0;
-        } else if (p == 1.0) {
-            return std::numeric_limits<double>::infinity();
-        } else if (p > 0.9) {
-            return igamci(a, 1 - p);
-        }
-
-        x = detail::find_inverse_gamma(a, p, 1 - p);
-        /* Halley's method */
-        for (i = 0; i < 3; i++) {
-            fac = detail::igam_fac(a, x);
-            if (fac == 0.0) {
-                return x;
-            }
-            f_fp = (igam(a, x) - p) * x / fac;
-            /* The ratio of the first and second derivatives simplifies */
-            fpp_fp = -1.0 + (a - 1) / x;
-            if (std::isinf(fpp_fp)) {
-                /* Resort to Newton's method in the case of overflow */
-                x = x - f_fp;
-            } else {
-                x = x - f_fp / (1.0 - 0.5 * f_fp * fpp_fp);
-            }
-        }
-
-        return x;
-    }
-
-    XSF_HOST_DEVICE inline double igamci(double a, double q) {
-        int i;
-        double x, fac, f_fp, fpp_fp;
-
-        if (std::isnan(a) || std::isnan(q)) {
-            return std::numeric_limits<double>::quiet_NaN();
-        } else if ((a < 0.0) || (q < 0.0) || (q > 1.0)) {
-            set_error("gammainccinv", SF_ERROR_DOMAIN, NULL);
-        } else if (q == 0.0) {
-            return std::numeric_limits<double>::infinity();
-        } else if (q == 1.0) {
-            return 0.0;
-        } else if (q > 0.9) {
-            return igami(a, 1 - q);
-        }
-
-        x = detail::find_inverse_gamma(a, 1 - q, q);
-        for (i = 0; i < 3; i++) {
-            fac = detail::igam_fac(a, x);
-            if (fac == 0.0) {
-                return x;
-            }
-            f_fp = (igamc(a, x) - q) * x / (-fac);
-            fpp_fp = -1.0 + (a - 1) / x;
-            if (std::isinf(fpp_fp)) {
-                x = x - f_fp;
-            } else {
-                x = x - f_fp / (1.0 - 0.5 * f_fp * fpp_fp);
-            }
-        }
-
-        return x;
-    }
-
-} // namespace cephes
-} // namespace xsf

scipy/special/xsf/cephes/j0.h

@@ -1,225 +0,0 @@
-/* Translated into C++ by SciPy developers in 2024.
- * Original header with Copyright information appears below.
- */
-
-/*                                                     j0.c
- *
- *     Bessel function of order zero
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, j0();
- *
- * y = j0( x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Returns Bessel function of order zero of the argument.
- *
- * The domain is divided into the intervals [0, 5] and
- * (5, infinity). In the first interval the following rational
- * approximation is used:
- *
- *
- *        2         2
- * (w - r  ) (w - r  ) P (w) / Q (w)
- *       1         2    3       8
- *
- *            2
- * where w = x  and the two r's are zeros of the function.
- *
- * In the second interval, the Hankel asymptotic expansion
- * is employed with two rational functions of degree 6/6
- * and 7/7.
- *
- *
- *
- * ACCURACY:
- *
- *                      Absolute error:
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0, 30       60000       4.2e-16     1.1e-16
- *
- */
-/*							y0.c
- *
- *	Bessel function of the second kind, order zero
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, y0();
- *
- * y = y0( x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Returns Bessel function of the second kind, of order
- * zero, of the argument.
- *
- * The domain is divided into the intervals [0, 5] and
- * (5, infinity). In the first interval a rational approximation
- * R(x) is employed to compute
- *   y0(x)  = R(x)  +   2 * log(x) * j0(x) / M_PI.
- * Thus a call to j0() is required.
- *
- * In the second interval, the Hankel asymptotic expansion
- * is employed with two rational functions of degree 6/6
- * and 7/7.
- *
- *
- *
- * ACCURACY:
- *
- *  Absolute error, when y0(x) < 1; else relative error:
- *
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0, 30       30000       1.3e-15     1.6e-16
- *
- */
-
-/*
- * Cephes Math Library Release 2.8:  June, 2000
- * Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
- */
-
-/* Note: all coefficients satisfy the relative error criterion
- * except YP, YQ which are designed for absolute error. */
-#pragma once
-
-#include "../config.h"
-#include "../error.h"
-
-#include "const.h"
-#include "polevl.h"
-
-namespace xsf {
-namespace cephes {
-
-    namespace detail {
-
-        constexpr double j0_PP[7] = {
-            7.96936729297347051624E-4, 8.28352392107440799803E-2, 1.23953371646414299388E0,  5.44725003058768775090E0,
-            8.74716500199817011941E0,  5.30324038235394892183E0,  9.99999999999999997821E-1,
-        };
-
-        constexpr double j0_PQ[7] = {
-            9.24408810558863637013E-4, 8.56288474354474431428E-2, 1.25352743901058953537E0, 5.47097740330417105182E0,
-            8.76190883237069594232E0,  5.30605288235394617618E0,  1.00000000000000000218E0,
-        };
-
-        constexpr double j0_QP[8] = {
-            -1.13663838898469149931E-2, -1.28252718670509318512E0, -1.95539544257735972385E1, -9.32060152123768231369E1,
-            -1.77681167980488050595E2,  -1.47077505154951170175E2, -5.14105326766599330220E1, -6.05014350600728481186E0,
-        };
-
-        constexpr double j0_QQ[7] = {
-            /*  1.00000000000000000000E0, */
-            6.43178256118178023184E1, 8.56430025976980587198E2, 3.88240183605401609683E3, 7.24046774195652478189E3,
-            5.93072701187316984827E3, 2.06209331660327847417E3, 2.42005740240291393179E2,
-        };
-
-        constexpr double j0_YP[8] = {
-            1.55924367855235737965E4,   -1.46639295903971606143E7,  5.43526477051876500413E9,
-            -9.82136065717911466409E11, 8.75906394395366999549E13,  -3.46628303384729719441E15,
-            4.42733268572569800351E16,  -1.84950800436986690637E16,
-        };
-
-        constexpr double j0_YQ[7] = {
-            /* 1.00000000000000000000E0, */
-            1.04128353664259848412E3,  6.26107330137134956842E5,  2.68919633393814121987E8,  8.64002487103935000337E10,
-            2.02979612750105546709E13, 3.17157752842975028269E15, 2.50596256172653059228E17,
-        };
-
-        /*  5.783185962946784521175995758455807035071 */
-        constexpr double j0_DR1 = 5.78318596294678452118E0;
-
-        /* 30.47126234366208639907816317502275584842 */
-        constexpr double j0_DR2 = 3.04712623436620863991E1;
-
-        constexpr double j0_RP[4] = {
-            -4.79443220978201773821E9,
-            1.95617491946556577543E12,
-            -2.49248344360967716204E14,
-            9.70862251047306323952E15,
-        };
-
-        constexpr double j0_RQ[8] = {
-            /* 1.00000000000000000000E0, */
-            4.99563147152651017219E2,  1.73785401676374683123E5,  4.84409658339962045305E7,  1.11855537045356834862E10,
-            2.11277520115489217587E12, 3.10518229857422583814E14, 3.18121955943204943306E16, 1.71086294081043136091E18,
-        };
-
-    } // namespace detail
-
-    XSF_HOST_DEVICE inline double j0(double x) {
-        double w, z, p, q, xn;
-
-        if (x < 0) {
-            x = -x;
-        }
-
-        if (x <= 5.0) {
-            z = x * x;
-            if (x < 1.0e-5) {
-                return (1.0 - z / 4.0);
-            }
-
-            p = (z - detail::j0_DR1) * (z - detail::j0_DR2);
-            p = p * polevl(z, detail::j0_RP, 3) / p1evl(z, detail::j0_RQ, 8);
-            return (p);
-        }
-
-        w = 5.0 / x;
-        q = 25.0 / (x * x);
-        p = polevl(q, detail::j0_PP, 6) / polevl(q, detail::j0_PQ, 6);
-        q = polevl(q, detail::j0_QP, 7) / p1evl(q, detail::j0_QQ, 7);
-        xn = x - M_PI_4;
-        p = p * std::cos(xn) - w * q * std::sin(xn);
-        return (p * detail::SQRT2OPI / std::sqrt(x));
-    }
-
-    /*                                                     y0() 2  */
-    /* Bessel function of second kind, order zero  */
-
-    /* Rational approximation coefficients YP[], YQ[] are used here.
-     * The function computed is  y0(x)  -  2 * log(x) * j0(x) / M_PI,
-     * whose value at x = 0 is  2 * ( log(0.5) + EUL ) / M_PI
-     * = 0.073804295108687225.
-     */
-
-    XSF_HOST_DEVICE inline double y0(double x) {
-        double w, z, p, q, xn;
-
-        if (x <= 5.0) {
-            if (x == 0.0) {
-                set_error("y0", SF_ERROR_SINGULAR, NULL);
-                return -std::numeric_limits<double>::infinity();
-            } else if (x < 0.0) {
-                set_error("y0", SF_ERROR_DOMAIN, NULL);
-                return std::numeric_limits<double>::quiet_NaN();
-            }
-            z = x * x;
-            w = polevl(z, detail::j0_YP, 7) / p1evl(z, detail::j0_YQ, 7);
-            w += M_2_PI * std::log(x) * j0(x);
-            return (w);
-        }
-
-        w = 5.0 / x;
-        z = 25.0 / (x * x);
-        p = polevl(z, detail::j0_PP, 6) / polevl(z, detail::j0_PQ, 6);
-        q = polevl(z, detail::j0_QP, 7) / p1evl(z, detail::j0_QQ, 7);
-        xn = x - M_PI_4;
-        p = p * std::sin(xn) + w * q * std::cos(xn);
-        return (p * detail::SQRT2OPI / std::sqrt(x));
-    }
-
-} // namespace cephes
-} // namespace xsf