scipy 1.15.3__cp311-cp311-musllinux_1_2_aarch64.whl → 1.16.0__cp311-cp311-musllinux_1_2_aarch64.whl

scipy/special/xsf/cephes/k0.h

@@ -1,164 +0,0 @@
-/* Translated into C++ by SciPy developers in 2024.
- * Original header with Copyright information appears below.
- */
-
-/*                                                     k0.c
- *
- *     Modified Bessel function, third kind, order zero
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, k0();
- *
- * y = k0( x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Returns modified Bessel function of the third kind
- * of order zero of the argument.
- *
- * The range is partitioned into the two intervals [0,8] and
- * (8, infinity).  Chebyshev polynomial expansions are employed
- * in each interval.
- *
- *
- *
- * ACCURACY:
- *
- * Tested at 2000 random points between 0 and 8.  Peak absolute
- * error (relative when K0 > 1) was 1.46e-14; rms, 4.26e-15.
- *                      Relative error:
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0, 30       30000       1.2e-15     1.6e-16
- *
- * ERROR MESSAGES:
- *
- *   message         condition      value returned
- *  K0 domain          x <= 0          INFINITY
- *
- */
-/*							k0e()
- *
- *	Modified Bessel function, third kind, order zero,
- *	exponentially scaled
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, k0e();
- *
- * y = k0e( x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Returns exponentially scaled modified Bessel function
- * of the third kind of order zero of the argument.
- *
- *
- *
- * ACCURACY:
- *
- *                      Relative error:
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0, 30       30000       1.4e-15     1.4e-16
- * See k0().
- *
- */
-
-/*
- * Cephes Math Library Release 2.8:  June, 2000
- * Copyright 1984, 1987, 2000 by Stephen L. Moshier
- */
-#pragma once
-
-#include "../config.h"
-#include "../error.h"
-
-#include "chbevl.h"
-#include "i0.h"
-
-namespace xsf {
-namespace cephes {
-
-    namespace detail {
-        /* Chebyshev coefficients for K0(x) + log(x/2) I0(x)
-         * in the interval [0,2].  The odd order coefficients are all
-         * zero; only the even order coefficients are listed.
-         *
-         * lim(x->0){ K0(x) + log(x/2) I0(x) } = -EUL.
-         */
-
-        constexpr double k0_A[] = {1.37446543561352307156E-16, 4.25981614279661018399E-14, 1.03496952576338420167E-11,
-                                   1.90451637722020886025E-9,  2.53479107902614945675E-7,  2.28621210311945178607E-5,
-                                   1.26461541144692592338E-3,  3.59799365153615016266E-2,  3.44289899924628486886E-1,
-                                   -5.35327393233902768720E-1};
-
-        /* Chebyshev coefficients for exp(x) sqrt(x) K0(x)
-         * in the inverted interval [2,infinity].
-         *
-         * lim(x->inf){ exp(x) sqrt(x) K0(x) } = sqrt(pi/2).
-         */
-        constexpr double k0_B[] = {
-            5.30043377268626276149E-18,  -1.64758043015242134646E-17, 5.21039150503902756861E-17,
-            -1.67823109680541210385E-16, 5.51205597852431940784E-16,  -1.84859337734377901440E-15,
-            6.34007647740507060557E-15,  -2.22751332699166985548E-14, 8.03289077536357521100E-14,
-            -2.98009692317273043925E-13, 1.14034058820847496303E-12,  -4.51459788337394416547E-12,
-            1.85594911495471785253E-11,  -7.95748924447710747776E-11, 3.57739728140030116597E-10,
-            -1.69753450938905987466E-9,  8.57403401741422608519E-9,   -4.66048989768794782956E-8,
-            2.76681363944501510342E-7,   -1.83175552271911948767E-6,  1.39498137188764993662E-5,
-            -1.28495495816278026384E-4,  1.56988388573005337491E-3,   -3.14481013119645005427E-2,
-            2.44030308206595545468E0};
-
-    } // namespace detail
-
-    XSF_HOST_DEVICE inline double k0(double x) {
-        double y, z;
-
-        if (x == 0.0) {
-            set_error("k0", SF_ERROR_SINGULAR, NULL);
-            return std::numeric_limits<double>::infinity();
-        } else if (x < 0.0) {
-            set_error("k0", SF_ERROR_DOMAIN, NULL);
-            return std::numeric_limits<double>::quiet_NaN();
-        }
-
-        if (x <= 2.0) {
-            y = x * x - 2.0;
-            y = chbevl(y, detail::k0_A, 10) - std::log(0.5 * x) * i0(x);
-            return (y);
-        }
-        z = 8.0 / x - 2.0;
-        y = std::exp(-x) * chbevl(z, detail::k0_B, 25) / std::sqrt(x);
-        return (y);
-    }
-
-    XSF_HOST_DEVICE double inline k0e(double x) {
-        double y;
-
-        if (x == 0.0) {
-            set_error("k0e", SF_ERROR_SINGULAR, NULL);
-            return std::numeric_limits<double>::infinity();
-        } else if (x < 0.0) {
-            set_error("k0e", SF_ERROR_DOMAIN, NULL);
-            return std::numeric_limits<double>::quiet_NaN();
-        }
-
-        if (x <= 2.0) {
-            y = x * x - 2.0;
-            y = chbevl(y, detail::k0_A, 10) - std::log(0.5 * x) * i0(x);
-            return (y * exp(x));
-        }
-
-        y = chbevl(8.0 / x - 2.0, detail::k0_B, 25) / std::sqrt(x);
-        return (y);
-    }
-
-} // namespace cephes
-} // namespace xsf

scipy/special/xsf/cephes/k1.h

@@ -1,163 +0,0 @@
-/* Translated into C++ by SciPy developers in 2024.
- * Original header with Copyright information appears below.
- */
-
-/*                                                     k1.c
- *
- *     Modified Bessel function, third kind, order one
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, k1();
- *
- * y = k1( x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Computes the modified Bessel function of the third kind
- * of order one of the argument.
- *
- * The range is partitioned into the two intervals [0,2] and
- * (2, infinity).  Chebyshev polynomial expansions are employed
- * in each interval.
- *
- *
- *
- * ACCURACY:
- *
- *                      Relative error:
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0, 30       30000       1.2e-15     1.6e-16
- *
- * ERROR MESSAGES:
- *
- *   message         condition      value returned
- * k1 domain          x <= 0          INFINITY
- *
- */
-/*							k1e.c
- *
- *	Modified Bessel function, third kind, order one,
- *	exponentially scaled
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, k1e();
- *
- * y = k1e( x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Returns exponentially scaled modified Bessel function
- * of the third kind of order one of the argument:
- *
- *      k1e(x) = exp(x) * k1(x).
- *
- *
- *
- * ACCURACY:
- *
- *                      Relative error:
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0, 30       30000       7.8e-16     1.2e-16
- * See k1().
- *
- */
-
-/*
- * Cephes Math Library Release 2.8:  June, 2000
- * Copyright 1984, 1987, 2000 by Stephen L. Moshier
- */
-#pragma once
-
-#include "../config.h"
-#include "../error.h"
-
-#include "chbevl.h"
-#include "const.h"
-
-namespace xsf {
-namespace cephes {
-
-    namespace detail {
-        /* Chebyshev coefficients for x(K1(x) - log(x/2) I1(x))
-         * in the interval [0,2].
-         *
-         * lim(x->0){ x(K1(x) - log(x/2) I1(x)) } = 1.
-         */
-
-        constexpr double k1_A[] = {
-            -7.02386347938628759343E-18, -2.42744985051936593393E-15, -6.66690169419932900609E-13,
-            -1.41148839263352776110E-10, -2.21338763073472585583E-8,  -2.43340614156596823496E-6,
-            -1.73028895751305206302E-4,  -6.97572385963986435018E-3,  -1.22611180822657148235E-1,
-            -3.53155960776544875667E-1,  1.52530022733894777053E0};
-
-        /* Chebyshev coefficients for exp(x) sqrt(x) K1(x)
-         * in the interval [2,infinity].
-         *
-         * lim(x->inf){ exp(x) sqrt(x) K1(x) } = sqrt(pi/2).
-         */
-        constexpr double k1_B[] = {
-            -5.75674448366501715755E-18, 1.79405087314755922667E-17,  -5.68946255844285935196E-17,
-            1.83809354436663880070E-16,  -6.05704724837331885336E-16, 2.03870316562433424052E-15,
-            -7.01983709041831346144E-15, 2.47715442448130437068E-14,  -8.97670518232499435011E-14,
-            3.34841966607842919884E-13,  -1.28917396095102890680E-12, 5.13963967348173025100E-12,
-            -2.12996783842756842877E-11, 9.21831518760500529508E-11,  -4.19035475934189648750E-10,
-            2.01504975519703286596E-9,   -1.03457624656780970260E-8,  5.74108412545004946722E-8,
-            -3.50196060308781257119E-7,  2.40648494783721712015E-6,   -1.93619797416608296024E-5,
-            1.95215518471351631108E-4,   -2.85781685962277938680E-3,  1.03923736576817238437E-1,
-            2.72062619048444266945E0};
-
-    } // namespace detail
-
-    XSF_HOST_DEVICE inline double k1(double x) {
-        double y, z;
-
-        if (x == 0.0) {
-            set_error("k1", SF_ERROR_SINGULAR, NULL);
-            return std::numeric_limits<double>::infinity();
-        } else if (x < 0.0) {
-            set_error("k1", SF_ERROR_DOMAIN, NULL);
-            return std::numeric_limits<double>::quiet_NaN();
-        }
-        z = 0.5 * x;
-
-        if (x <= 2.0) {
-            y = x * x - 2.0;
-            y = std::log(z) * i1(x) + chbevl(y, detail::k1_A, 11) / x;
-            return (y);
-        }
-
-        return (std::exp(-x) * chbevl(8.0 / x - 2.0, detail::k1_B, 25) / std::sqrt(x));
-    }
-
-    XSF_HOST_DEVICE double k1e(double x) {
-        double y;
-
-        if (x == 0.0) {
-            set_error("k1e", SF_ERROR_SINGULAR, NULL);
-            return std::numeric_limits<double>::infinity();
-        } else if (x < 0.0) {
-            set_error("k1e", SF_ERROR_DOMAIN, NULL);
-            return std::numeric_limits<double>::quiet_NaN();
-        }
-
-        if (x <= 2.0) {
-            y = x * x - 2.0;
-            y = std::log(0.5 * x) * i1(x) + chbevl(y, detail::k1_A, 11) / x;
-            return (y * exp(x));
-        }
-
-        return (chbevl(8.0 / x - 2.0, detail::k1_B, 25) / std::sqrt(x));
-    }
-
-} // namespace cephes
-} // namespace xsf

scipy/special/xsf/cephes/kn.h

@@ -1,243 +0,0 @@
-/* Translated into C++ by SciPy developers in 2024.
- * Original header with Copyright information appears below.
- */
-
-/*                                                     kn.c
- *
- *     Modified Bessel function, third kind, integer order
- *
- *
- *
- * SYNOPSIS:
- *
- * double x, y, kn();
- * int n;
- *
- * y = kn( n, x );
- *
- *
- *
- * DESCRIPTION:
- *
- * Returns modified Bessel function of the third kind
- * of order n of the argument.
- *
- * The range is partitioned into the two intervals [0,9.55] and
- * (9.55, infinity).  An ascending power series is used in the
- * low range, and an asymptotic expansion in the high range.
- *
- *
- *
- * ACCURACY:
- *
- *                      Relative error:
- * arithmetic   domain     # trials      peak         rms
- *    IEEE      0,30        90000       1.8e-8      3.0e-10
- *
- *  Error is high only near the crossover point x = 9.55
- * between the two expansions used.
- */
-
-/*
- * Cephes Math Library Release 2.8:  June, 2000
- * Copyright 1984, 1987, 1988, 2000 by Stephen L. Moshier
- */
-
-/*
- * Algorithm for Kn.
- *                        n-1
- *                    -n   -  (n-k-1)!    2   k
- * K (x)  =  0.5 (x/2)     >  -------- (-x /4)
- *  n                      -     k!
- *                        k=0
- *
- *                     inf.                                   2   k
- *        n         n   -                                   (x /4)
- *  + (-1)  0.5(x/2)    >  {p(k+1) + p(n+k+1) - 2log(x/2)} ---------
- *                      -                                  k! (n+k)!
- *                     k=0
- *
- * where  p(m) is the psi function: p(1) = -EUL and
- *
- *                       m-1
- *                        -
- *       p(m)  =  -EUL +  >  1/k
- *                        -
- *                       k=1
- *
- * For large x,
- *                                          2        2     2
- *                                       u-1     (u-1 )(u-3 )
- * K (z)  =  sqrt(pi/2z) exp(-z) { 1 + ------- + ------------ + ...}
- *  v                                        1            2
- *                                     1! (8z)     2! (8z)
- * asymptotically, where
- *
- *            2
- *     u = 4 v .
- *
- */
-#pragma once
-
-#include "../config.h"
-#include "../error.h"
-
-#include "const.h"
-
-namespace xsf {
-namespace cephes {
-
-    namespace detail {
-
-        constexpr int kn_MAXFAC = 31;
-
-    }
-
-    XSF_HOST_DEVICE inline double kn(int nn, double x) {
-        double k, kf, nk1f, nkf, zn, t, s, z0, z;
-        double ans, fn, pn, pk, zmn, tlg, tox;
-        int i, n;
-
-        if (nn < 0)
-            n = -nn;
-        else
-            n = nn;
-
-        if (n > detail::kn_MAXFAC) {
-        overf:
-            set_error("kn", SF_ERROR_OVERFLOW, NULL);
-            return (std::numeric_limits<double>::infinity());
-        }
-
-        if (x <= 0.0) {
-            if (x < 0.0) {
-                set_error("kn", SF_ERROR_DOMAIN, NULL);
-                return std::numeric_limits<double>::quiet_NaN();
-            } else {
-                set_error("kn", SF_ERROR_SINGULAR, NULL);
-                return std::numeric_limits<double>::infinity();
-            }
-        }
-
-        if (x > 9.55)
-            goto asymp;
-
-        ans = 0.0;
-        z0 = 0.25 * x * x;
-        fn = 1.0;
-        pn = 0.0;
-        zmn = 1.0;
-        tox = 2.0 / x;
-
-        if (n > 0) {
-            /* compute factorial of n and psi(n) */
-            pn = -detail::SCIPY_EULER;
-            k = 1.0;
-            for (i = 1; i < n; i++) {
-                pn += 1.0 / k;
-                k += 1.0;
-                fn *= k;
-            }
-
-            zmn = tox;
-
-            if (n == 1) {
-                ans = 1.0 / x;
-            } else {
-                nk1f = fn / n;
-                kf = 1.0;
-                s = nk1f;
-                z = -z0;
-                zn = 1.0;
-                for (i = 1; i < n; i++) {
-                    nk1f = nk1f / (n - i);
-                    kf = kf * i;
-                    zn *= z;
-                    t = nk1f * zn / kf;
-                    s += t;
-                    if ((std::numeric_limits<double>::max() - std::abs(t)) < std::abs(s)) {
-                        goto overf;
-                    }
-                    if ((tox > 1.0) && ((std::numeric_limits<double>::max() / tox) < zmn)) {
-                        goto overf;
-                    }
-                    zmn *= tox;
-                }
-                s *= 0.5;
-                t = std::abs(s);
-                if ((zmn > 1.0) && ((std::numeric_limits<double>::max() / zmn) < t)) {
-                    goto overf;
-                }
-                if ((t > 1.0) && ((std::numeric_limits<double>::max() / t) < zmn)) {
-                    goto overf;
-                }
-                ans = s * zmn;
-            }
-        }
-
-        tlg = 2.0 * log(0.5 * x);
-        pk = -detail::SCIPY_EULER;
-        if (n == 0) {
-            pn = pk;
-            t = 1.0;
-        } else {
-            pn = pn + 1.0 / n;
-            t = 1.0 / fn;
-        }
-        s = (pk + pn - tlg) * t;
-        k = 1.0;
-        do {
-            t *= z0 / (k * (k + n));
-            pk += 1.0 / k;
-            pn += 1.0 / (k + n);
-            s += (pk + pn - tlg) * t;
-            k += 1.0;
-        } while (fabs(t / s) > detail::MACHEP);
-
-        s = 0.5 * s / zmn;
-        if (n & 1) {
-            s = -s;
-        }
-        ans += s;
-
-        return (ans);
-
-        /* Asymptotic expansion for Kn(x) */
-        /* Converges to 1.4e-17 for x > 18.4 */
-
-    asymp:
-
-        if (x > detail::MAXLOG) {
-            set_error("kn", SF_ERROR_UNDERFLOW, NULL);
-            return (0.0);
-        }
-        k = n;
-        pn = 4.0 * k * k;
-        pk = 1.0;
-        z0 = 8.0 * x;
-        fn = 1.0;
-        t = 1.0;
-        s = t;
-        nkf = std::numeric_limits<double>::infinity();
-        i = 0;
-        do {
-            z = pn - pk * pk;
-            t = t * z / (fn * z0);
-            nk1f = std::abs(t);
-            if ((i >= n) && (nk1f > nkf)) {
-                goto adone;
-            }
-            nkf = nk1f;
-            s += t;
-            fn += 1.0;
-            pk += 2.0;
-            i += 1;
-        } while (std::abs(t / s) > detail::MACHEP);
-
-    adone:
-        ans = std::exp(-x) * std::sqrt(M_PI / (2.0 * x)) * s;
-        return (ans);
-    }
-
-} // namespace cephes
-} // namespace xsf

scipy/special/xsf/cephes/lanczos.h

@@ -1,112 +0,0 @@
-/*  (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)
- */
-
-/* Both lanczos.h and lanczos.c were formed from Boost's lanczos.hpp
- *
- * Scipy changes:
- * - 06-22-2016: Removed all code not related to double precision and
- *   ported to c for use in Cephes. Note that the order of the
- *   coefficients is reversed to match the behavior of polevl.
- */
-
-/*
- * Optimal values for G for each N are taken from
- * https://web.viu.ca/pughg/phdThesis/phdThesis.pdf,
- * as are the theoretical error bounds.
- *
- * Constants calculated using the method described by Godfrey
- * https://my.fit.edu/~gabdo/gamma.txt and elaborated by Toth at
- * https://www.rskey.org/gamma.htm using NTL::RR at 1000 bit precision.
- */
-
-/*
- * Lanczos Coefficients for N=13 G=6.024680040776729583740234375
- * Max experimental error (with arbitrary precision arithmetic) 1.196214e-17
- * Generated with compiler: Microsoft Visual C++ version 8.0 on Win32 at Mar 23 2006
- *
- * Use for double precision.
- */
-
-#pragma once
-
-#include "../config.h"
-#include "polevl.h"
-
-namespace xsf {
-namespace cephes {
-
-    namespace detail {
-
-        constexpr double lanczos_num[] = {
-            2.506628274631000270164908177133837338626, 210.8242777515793458725097339207133627117,
-            8071.672002365816210638002902272250613822, 186056.2653952234950402949897160456992822,
-            2876370.628935372441225409051620849613599, 31426415.58540019438061423162831820536287,
-            248874557.8620541565114603864132294232163, 1439720407.311721673663223072794912393972,
-            6039542586.35202800506429164430729792107,  17921034426.03720969991975575445893111267,
-            35711959237.35566804944018545154716670596, 42919803642.64909876895789904700198885093,
-            23531376880.41075968857200767445163675473};
-
-        constexpr double lanczos_denom[] = {1,        66,        1925,      32670,     357423,   2637558, 13339535,
-                                            45995730, 105258076, 150917976, 120543840, 39916800, 0};
-
-        constexpr double lanczos_sum_expg_scaled_num[] = {
-            0.006061842346248906525783753964555936883222, 0.5098416655656676188125178644804694509993,
-            19.51992788247617482847860966235652136208,    449.9445569063168119446858607650988409623,
-            6955.999602515376140356310115515198987526,    75999.29304014542649875303443598909137092,
-            601859.6171681098786670226533699352302507,    3481712.15498064590882071018964774556468,
-            14605578.08768506808414169982791359218571,    43338889.32467613834773723740590533316085,
-            86363131.28813859145546927288977868422342,    103794043.1163445451906271053616070238554,
-            56906521.91347156388090791033559122686859};
-
-        constexpr double lanczos_sum_expg_scaled_denom[] = {
-            1, 66, 1925, 32670, 357423, 2637558, 13339535, 45995730, 105258076, 150917976, 120543840, 39916800, 0};
-
-        constexpr double lanczos_sum_near_1_d[] = {
-            0.3394643171893132535170101292240837927725e-9,  -0.2499505151487868335680273909354071938387e-8,
-            0.8690926181038057039526127422002498960172e-8,  -0.1933117898880828348692541394841204288047e-7,
-            0.3075580174791348492737947340039992829546e-7,  -0.2752907702903126466004207345038327818713e-7,
-            -0.1515973019871092388943437623825208095123e-5, 0.004785200610085071473880915854204301886437,
-            -0.1993758927614728757314233026257810172008,    1.483082862367253753040442933770164111678,
-            -3.327150580651624233553677113928873034916,     2.208709979316623790862569924861841433016};
-
-        constexpr double lanczos_sum_near_2_d[] = {
-            0.1009141566987569892221439918230042368112e-8,  -0.7430396708998719707642735577238449585822e-8,
-            0.2583592566524439230844378948704262291927e-7,  -0.5746670642147041587497159649318454348117e-7,
-            0.9142922068165324132060550591210267992072e-7,  -0.8183698410724358930823737982119474130069e-7,
-            -0.4506604409707170077136555010018549819192e-5, 0.01422519127192419234315002746252160965831,
-            -0.5926941084905061794445733628891024027949,    4.408830289125943377923077727900630927902,
-            -9.8907772644920670589288081640128194231,       6.565936202082889535528455955485877361223};
-
-        XSF_HOST_DEVICE double lanczos_sum(double x) { return ratevl(x, lanczos_num, 12, lanczos_denom, 12); }
-
-        XSF_HOST_DEVICE double lanczos_sum_near_1(double dx) {
-            double result = 0;
-            unsigned k;
-
-            for (k = 1; k <= 12; ++k) {
-                result += (-lanczos_sum_near_1_d[k - 1] * dx) / (k * dx + k * k);
-            }
-            return result;
-        }
-
-        XSF_HOST_DEVICE double lanczos_sum_near_2(double dx) {
-            double result = 0;
-            double x = dx + 2;
-            unsigned k;
-
-            for (k = 1; k <= 12; ++k) {
-                result += (-lanczos_sum_near_2_d[k - 1] * dx) / (x + k * x + k * k - 1);
-            }
-            return result;
-        }
-    } // namespace detail
-
-    constexpr double lanczos_g = 6.024680040776729583740234375;
-    XSF_HOST_DEVICE double lanczos_sum_expg_scaled(double x) {
-        return ratevl(x, detail::lanczos_sum_expg_scaled_num, 12, detail::lanczos_sum_expg_scaled_denom, 12);
-    }
-} // namespace cephes
-} // namespace xsf