ó
    EñiF  ã                   óŒ   • S SK JrJr  S SKJr   " S S5      r " S S\5      r " S S\5      r " S	 S
\5      rS r	SS jr
S rg)é    )Úarray_namespaceÚxp_size)Úcached_propertyc                   ó,   • \ rS rSrSrSS jrSS jrSrg)ÚRuleé   a²  
Base class for numerical integration algorithms (cubatures).

Finds an estimate for the integral of ``f`` over the region described by two arrays
``a`` and ``b`` via `estimate`, and find an estimate for the error of this
approximation via `estimate_error`.

If a subclass does not implement its own `estimate_error`, then it will use a
default error estimate based on the difference between the estimate over the whole
region and the sum of estimates over that region divided into ``2^ndim`` subregions.

See Also
--------
FixedRule

Examples
--------
In the following, a custom rule is created which uses 3D Genz-Malik cubature for
the estimate of the integral, and the difference between this estimate and a less
accurate estimate using 5-node Gauss-Legendre quadrature as an estimate for the
error.

>>> import numpy as np
>>> from scipy.integrate import cubature
>>> from scipy.integrate._rules import (
...     Rule, ProductNestedFixed, GenzMalikCubature, GaussLegendreQuadrature
... )
>>> def f(x, r, alphas):
...     # f(x) = cos(2*pi*r + alpha @ x)
...     # Need to allow r and alphas to be arbitrary shape
...     npoints, ndim = x.shape[0], x.shape[-1]
...     alphas_reshaped = alphas[np.newaxis, :]
...     x_reshaped = x.reshape(npoints, *([1]*(len(alphas.shape) - 1)), ndim)
...     return np.cos(2*np.pi*r + np.sum(alphas_reshaped * x_reshaped, axis=-1))
>>> genz = GenzMalikCubature(ndim=3)
>>> gauss = GaussKronrodQuadrature(npoints=21)
>>> # Gauss-Kronrod is 1D, so we find the 3D product rule:
>>> gauss_3d = ProductNestedFixed([gauss, gauss, gauss])
>>> class CustomRule(Rule):
...     def estimate(self, f, a, b, args=()):
...         return genz.estimate(f, a, b, args)
...     def estimate_error(self, f, a, b, args=()):
...         return np.abs(
...             genz.estimate(f, a, b, args)
...             - gauss_3d.estimate(f, a, b, args)
...         )
>>> rng = np.random.default_rng()
>>> res = cubature(
...     f=f,
...     a=np.array([0, 0, 0]),
...     b=np.array([1, 1, 1]),
...     rule=CustomRule(),
...     args=(rng.random((2,)), rng.random((3, 2, 3)))
... )
>>> res.estimate
 array([[-0.95179502,  0.12444608],
        [-0.96247411,  0.60866385],
        [-0.97360014,  0.25515587]])
© c                 ó   • [         e)aÛ  
Calculate estimate of integral of `f` in rectangular region described by
corners `a` and ``b``.

Parameters
----------
f : callable
    Function to integrate. `f` must have the signature::
        f(x : ndarray, \*args) -> ndarray

    `f` should accept arrays ``x`` of shape::
        (npoints, ndim)

    and output arrays of shape::
        (npoints, output_dim_1, ..., output_dim_n)

    In this case, `estimate` will return arrays of shape::
        (output_dim_1, ..., output_dim_n)
a, b : ndarray
    Lower and upper limits of integration as rank-1 arrays specifying the left
    and right endpoints of the intervals being integrated over. Infinite limits
    are currently not supported.
args : tuple, optional
    Additional positional args passed to ``f``, if any.

Returns
-------
est : ndarray
    Result of estimation. If `f` returns arrays of shape ``(npoints,
    output_dim_1, ..., output_dim_n)``, then `est` will be of shape
    ``(output_dim_1, ..., output_dim_n)``.
©ÚNotImplementedError)ÚselfÚfÚaÚbÚargss        ÚY/home/mande/repo/quber/.venv/lib/python3.13/site-packages/scipy/integrate/_rules/_base.pyÚestimateÚRule.estimateC   s   € ôB "Ð!ó    c                 ó´   • U R                  XX45      nSn[        X#5       H  u  pxX`R                  XX„5      -  nM     U R                  R                  XV-
  5      $ )a  
Estimate the error of the approximation for the integral of `f` in rectangular
region described by corners `a` and `b`.

If a subclass does not override this method, then a default error estimator is
used. This estimates the error as ``|est - refined_est|`` where ``est`` is
``estimate(f, a, b)`` and ``refined_est`` is the sum of
``estimate(f, a_k, b_k)`` where ``a_k, b_k`` are the coordinates of each
subregion of the region described by ``a`` and ``b``. In the 1D case, this
is equivalent to comparing the integral over an entire interval ``[a, b]`` to
the sum of the integrals over the left and right subintervals, ``[a, (a+b)/2]``
and ``[(a+b)/2, b]``.

Parameters
----------
f : callable
    Function to estimate error for. `f` must have the signature::
        f(x : ndarray, \*args) -> ndarray

    `f` should accept arrays `x` of shape::
        (npoints, ndim)

    and output arrays of shape::
        (npoints, output_dim_1, ..., output_dim_n)

    In this case, `estimate` will return arrays of shape::
        (output_dim_1, ..., output_dim_n)
a, b : ndarray
    Lower and upper limits of integration as rank-1 arrays specifying the left
    and right endpoints of the intervals being integrated over. Infinite limits
    are currently not supported.
args : tuple, optional
    Additional positional args passed to `f`, if any.

Returns
-------
err_est : ndarray
    Result of error estimation. If `f` returns arrays of shape
    ``(npoints, output_dim_1, ..., output_dim_n)``, then `est` will be
    of shape ``(output_dim_1, ..., output_dim_n)``.
r   )r   Ú_split_subregionÚxpÚabs)	r   r   r   r   r   ÚestÚrefined_estÚa_kÚb_ks	            r   Úestimate_errorÚRule.estimate_errorf   sV   € ðV �m‰m˜A !Ó*ˆØˆä(¨Ö.‰HˆCØŸ=™=¨°Ó;Ñ;ŠKñ /ð �w‰w�{‰{˜3Ñ,Ó-Ð-r   N©r	   )Ú__name__Ú
__module__Ú__qualname__Ú__firstlineno__Ú__doc__r   r   Ú__static_attributes__r	   r   r   r   r      s   † ñ:ôx!"÷F1.r   r   c                   ó8   • \ rS rSrSrS r\S 5       rSS jrSr	g)	Ú	FixedRuleéš   a^  
A rule implemented as the weighted sum of function evaluations at fixed nodes.

Attributes
----------
nodes_and_weights : (ndarray, ndarray)
    A tuple ``(nodes, weights)`` of nodes at which to evaluate ``f`` and the
    corresponding weights. ``nodes`` should be of shape ``(num_nodes,)`` for 1D
    cubature rules (quadratures) and more generally for N-D cubature rules, it
    should be of shape ``(num_nodes, ndim)``. ``weights`` should be of shape
    ``(num_nodes,)``. The nodes and weights should be for integrals over
    :math:`[-1, 1]^n`.

See Also
--------
GaussLegendreQuadrature, GaussKronrodQuadrature, GenzMalikCubature

Examples
--------

Implementing Simpson's 1/3 rule:

>>> import numpy as np
>>> from scipy.integrate._rules import FixedRule
>>> class SimpsonsQuad(FixedRule):
...     @property
...     def nodes_and_weights(self):
...         nodes = np.array([-1, 0, 1])
...         weights = np.array([1/3, 4/3, 1/3])
...         return (nodes, weights)
>>> rule = SimpsonsQuad()
>>> rule.estimate(
...     f=lambda x: x**2,
...     a=np.array([0]),
...     b=np.array([1]),
... )
 [0.3333333]
c                 ó   • S U l         g ©N©r   ©r   s    r   Ú__init__ÚFixedRule.__init__Â   s	   € Øˆ�r   c                 ó   • [         er+   r   r-   s    r   Únodes_and_weightsÚFixedRule.nodes_and_weightsÅ   s   € ä!Ð!r   c           	      óˆ   • U R                   u  pVU R                  c  [        U5      U l        [        XX5XdU R                  5      $ )am  
Calculate estimate of integral of `f` in rectangular region described by
corners `a` and `b` as ``sum(weights * f(nodes))``.

Nodes and weights will automatically be adjusted from calculating integrals over
:math:`[-1, 1]^n` to :math:`[a, b]^n`.

Parameters
----------
f : callable
    Function to integrate. `f` must have the signature::
        f(x : ndarray, \*args) -> ndarray

    `f` should accept arrays `x` of shape::
        (npoints, ndim)

    and output arrays of shape::
        (npoints, output_dim_1, ..., output_dim_n)

    In this case, `estimate` will return arrays of shape::
        (output_dim_1, ..., output_dim_n)
a, b : ndarray
    Lower and upper limits of integration as rank-1 arrays specifying the left
    and right endpoints of the intervals being integrated over. Infinite limits
    are currently not supported.
args : tuple, optional
    Additional positional args passed to `f`, if any.

Returns
-------
est : ndarray
    Result of estimation. If `f` returns arrays of shape ``(npoints,
    output_dim_1, ..., output_dim_n)``, then `est` will be of shape
    ``(output_dim_1, ..., output_dim_n)``.
)r1   r   r   Ú_apply_fixed_rule)r   r   r   r   r   ÚnodesÚweightss          r   r   ÚFixedRule.estimateÉ   s<   € ðH ×/Ñ/‰ˆà�7‰7‰?Ü% eÓ,ˆDŒGä   q°ÀÇÁÓHÐHr   r,   Nr    )
r!   r"   r#   r$   r%   r.   Úpropertyr1   r   r&   r	   r   r   r(   r(   š   s'   † ñ%òNð ñ"ó ð"÷)Ir   r(   c                   óH   • \ rS rSrSrS r\S 5       r\S 5       rS	S jr	Sr
g)
ÚNestedFixedRuleéõ   ab  
A cubature rule with error estimate given by the difference between two underlying
fixed rules.

If constructed as ``NestedFixedRule(higher, lower)``, this will use::

    estimate(f, a, b) := higher.estimate(f, a, b)
    estimate_error(f, a, b) := \|higher.estimate(f, a, b) - lower.estimate(f, a, b)|

(where the absolute value is taken elementwise).

Attributes
----------
higher : Rule
    Higher accuracy rule.

lower : Rule
    Lower accuracy rule.

See Also
--------
GaussKronrodQuadrature

Examples
--------

>>> from scipy.integrate import cubature
>>> from scipy.integrate._rules import (
...     GaussLegendreQuadrature, NestedFixedRule, ProductNestedFixed
... )
>>> higher = GaussLegendreQuadrature(10)
>>> lower = GaussLegendreQuadrature(5)
>>> rule = NestedFixedRule(
...     higher,
...     lower
... )
>>> rule_2d = ProductNestedFixed([rule, rule])
c                 ó*   • Xl         X l        S U l        g r+   ©ÚhigherÚlowerr   )r   r>   r?   s      r   r.   ÚNestedFixedRule.__init__  s   € ØŒØŒ
Øˆ�r   c                 óT   • U R                   b  U R                   R                  $ [        er+   )r>   r1   r   r-   s    r   r1   Ú!NestedFixedRule.nodes_and_weights"  s"   € à�;‰;Ñ"Ø—;‘;×0Ñ0Ð0ä%Ð%r   c                 óT   • U R                   b  U R                   R                  $ [        er+   )r?   r1   r   r-   s    r   Úlower_nodes_and_weightsÚ'NestedFixedRule.lower_nodes_and_weights)  s"   € à�:‰:Ñ!Ø—:‘:×/Ñ/Ð/ä%Ð%r   c                 óD  • U R                   u  pVU R                  u  pxU R                  c  [        U5      U l        U R                  R	                  XW/SS9n	U R                  R	                  Xh* /SS9n
U R                  R                  [        XX9X¤U R                  5      5      $ )a  
Estimate the error of the approximation for the integral of `f` in rectangular
region described by corners `a` and `b`.

Parameters
----------
f : callable
    Function to estimate error for. `f` must have the signature::
        f(x : ndarray, \*args) -> ndarray

    `f` should accept arrays `x` of shape::
        (npoints, ndim)

    and output arrays of shape::
        (npoints, output_dim_1, ..., output_dim_n)

    In this case, `estimate` will return arrays of shape::
        (output_dim_1, ..., output_dim_n)
a, b : ndarray
    Lower and upper limits of integration as rank-1 arrays specifying the left
    and right endpoints of the intervals being integrated over. Infinite limits
    are currently not supported.
args : tuple, optional
    Additional positional args passed to `f`, if any.

Returns
-------
err_est : ndarray
    Result of error estimation. If `f` returns arrays of shape
    ``(npoints, output_dim_1, ..., output_dim_n)``, then `est` will be
    of shape ``(output_dim_1, ..., output_dim_n)``.
r   ©Úaxis)r1   rD   r   r   Úconcatr   r4   )r   r   r   r   r   r5   r6   Úlower_nodesÚlower_weightsÚerror_nodesÚerror_weightss              r   r   ÚNestedFixedRule.estimate_error0  s�   € ðD ×/Ñ/‰ˆØ%)×%AÑ%AÑ"ˆà�7‰7‰?Ü% eÓ,ˆDŒGà—g‘g—n‘n eÐ%9À�nÐBˆØŸ™Ÿ™¨°Ð'@Àq˜ÐIˆà�w‰w�{‰{Ü˜a A°MÈÏÉÓQó
ð 	
r   r=   Nr    )r!   r"   r#   r$   r%   r.   r8   r1   rD   r   r&   r	   r   r   r:   r:   õ   s:   † ñ%òNð
 ñ&ó ð&ð ñ&ó ð&÷-
r   r:   c                   ó>   • \ rS rSrSrS r\S 5       r\S 5       rSr	g)ÚProductNestedFixedi`  aÔ  
Find the n-dimensional cubature rule constructed from the Cartesian product of 1-D
`NestedFixedRule` quadrature rules.

Given a list of N 1-dimensional quadrature rules which support error estimation
using NestedFixedRule, this will find the N-dimensional cubature rule obtained by
taking the Cartesian product of their nodes, and estimating the error by taking the
difference with a lower-accuracy N-dimensional cubature rule obtained using the
``.lower_nodes_and_weights`` rule in each of the base 1-dimensional rules.

Parameters
----------
base_rules : list of NestedFixedRule
    List of base 1-dimensional `NestedFixedRule` quadrature rules.

Attributes
----------
base_rules : list of NestedFixedRule
    List of base 1-dimensional `NestedFixedRule` qudarature rules.

Examples
--------

Evaluate a 2D integral by taking the product of two 1D rules:

>>> import numpy as np
>>> from scipy.integrate import cubature
>>> from scipy.integrate._rules import (
...  ProductNestedFixed, GaussKronrodQuadrature
... )
>>> def f(x):
...     # f(x) = cos(x_1) + cos(x_2)
...     return np.sum(np.cos(x), axis=-1)
>>> rule = ProductNestedFixed(
...     [GaussKronrodQuadrature(15), GaussKronrodQuadrature(15)]
... ) # Use 15-point Gauss-Kronrod, which implements NestedFixedRule
>>> a, b = np.array([0, 0]), np.array([1, 1])
>>> rule.estimate(f, a, b) # True value 2*sin(1), approximately 1.6829
 np.float64(1.682941969615793)
>>> rule.estimate_error(f, a, b)
 np.float64(2.220446049250313e-16)
c                 óp   • U H#  n[        U[        5      (       a  M  [        S5      e   Xl        S U l        g )Nz<base rules for product need to be instance ofNestedFixedRule)Ú
isinstancer:   Ú
ValueErrorÚ
base_rulesr   )r   rT   Úrules      r   r.   ÚProductNestedFixed.__init__Œ  s9   € ÛˆDÜ˜d¤O×4Ó4Ü ð "3ó 4ð 4ñ ð
 %ŒØˆ�r   c           	      óN  • [        U R                   Vs/ s H  oR                  S   PM     sn5      nU R                  c  [	        U5      U l        U R                  R                  [        U R                   Vs/ s H  oR                  S   PM     sn5      SS9nX#4$ s  snf s  snf ©Nr   é   éÿÿÿÿrG   )Ú_cartesian_productrT   r1   r   r   Úprod)r   rU   r5   r6   s       r   r1   Ú$ProductNestedFixed.nodes_and_weights•  s›   € ä"Ø37·?²?ÓC²?¨4×#Ñ# AÔ&±?ÑCó
ˆð �7‰7‰?Ü% eÓ,ˆDŒGà—'‘'—,‘,ÜØ7;·²ÓG²¨t×'Ñ'¨Ô*±ÑGóð ð	 ð 
ˆð ˆ~Ðùò Dùò Hó   ”BÁ8B"c           	      óN  • [        U R                   Vs/ s H  oR                  S   PM     sn5      nU R                  c  [	        U5      U l        U R                  R                  [        U R                   Vs/ s H  oR                  S   PM     sn5      SS9nX#4$ s  snf s  snf rX   )r[   rT   rD   r   r   r\   )r   Úcubaturer5   r6   s       r   rD   Ú*ProductNestedFixed.lower_nodes_and_weights§  s›   € ä"ØAEÇÂÓQÂ°X×-Ñ-¨aÔ0ÁÑQó
ˆð �7‰7‰?Ü% eÓ,ˆDŒGà—'‘'—,‘,ÜØEIÇ_Â_ÓUÂ_¸×1Ñ1°!Ô4Á_ÑUóð ð	 ð 
ˆð ˆ~Ðùò Rùò Vr^   )rT   r   N)
r!   r"   r#   r$   r%   r.   r   r1   rD   r&   r	   r   r   rP   rP   `  s5   † ñ)òVð ñó ðð" ñó ór   rP   c                 ó�   • [        U 6 nUR                  " U SS06nUR                  UR                  USS9S[	        U 5      45      nU$ )NÚindexingÚijrZ   rG   )r   ÚmeshgridÚreshapeÚstackÚlen)Úarraysr   Ú	arrays_ixÚresults       r   r[   r[   º  sJ   € Ü	˜&Ð	!€Bà—’˜VÐ3¨dÑ3€IØ�Z‰Z˜Ÿ™ °˜Ð4°r¼3¸v»;Ð6GÓH€Fà€Mr   Nc              #   óÀ  #   • [        X5      nUc  X-   S-  n[        U R                  S   5       Vs/ s H  oBR                  X   X4   45      PM     nn[        UR                  S   5       Vs/ s H  oBR                  X4   X   45      PM     nn[	        U5      n[	        U5      n[        UR                  S   5       H  nXtS4   X„S4   4v •  M     gs  snf s  snf 7f)zî
Given the coordinates of a region like a=[0, 0] and b=[1, 1], yield the coordinates
of all subregions, which in this case would be::

    ([0, 0], [1/2, 1/2]),
    ([0, 1/2], [1/2, 1]),
    ([1/2, 0], [1, 1/2]),
    ([1/2, 1/2], [1, 1])
Né   r   .)r   ÚrangeÚshaperg   r[   )	r   r   r   Úsplit_atÚiÚleftÚrightÚa_subÚb_subs	            r   r   r   Ã  sÓ   é € ô 
˜Ó	€BàÑØ‘E˜Q‘;ˆä38¸¿¹À¹Ô3DÓEÒ3D¨a�H‰H�a‘d˜H™KÐ(Ö)Ñ3D€DÐEÜ49¸!¿'¹'À!¹*Ô4EÓFÒ4E¨q�X‰X�x‘{ A¡DÐ)Ö*Ñ4E€EÐFä˜tÓ$€EÜ˜uÓ%€Eä�5—;‘;˜q‘>Ö"ˆØ�s�F‰m˜U c 6™]Ð*Ô*ò #ùò FùÚFùs   ‚0C² CÁCÁ. CÂACc                 óø  • UR                   nUR                  X75      nUR                  XG5      nUR                  S:X  a	  US S 2S 4   nUR                  S   n[	        U5      n	[	        U5      n
X‰:w  d  XŠ:w  a  [        SU SU	 SU
 35      eX!-
  nUS-   US-  -  U-   nUR                  X·S9SU-  -  nXM-  nU " U/UQ76 nUR                  US/S/UR                  S-
  -  Q75      nUR                  UU-  S	US
9nU$ )NrY   rZ   z@rule and function are of incompatible dimension, nodes havendim z,, while limit of integration has ndima_ndim=z	, b_ndim=g      à?)Údtyperm   r   )rH   rw   )	rw   ÚastypeÚndimro   r   rS   r\   rf   Úsum)r   r   r   Ú
orig_nodesÚorig_weightsr   r   Úresult_dtypeÚ	rule_ndimÚa_ndimÚb_ndimÚlengthsr5   Úweight_scale_factorr6   Úf_nodesÚweights_reshapedr   s                     r   r4   r4   Ü  s9  € à—7‘7€LØ—‘˜:Ó4€JØ—9‘9˜\Ó8€Lð ‡�˜!ÓØ¢ 4 Ñ(ˆ
à× Ñ  Ñ$€Iä�Q‹Z€FÜ�Q‹Z€FàÓ˜iÓ1Üð !Ø!* ð ,#Ø#) (¨)°F°8ð=ó >ð 	>ð ‰e€Gð ˜!‰^ ¨#¡Ñ.°Ñ2€Eð Ÿ'™' '˜'Ð>ÀÀIÁÑMÐØÑ0€Gá�ˆo˜Šo€GØ—z‘z '¨BÐ+L°1°#¸¿¹ÈÑ9IÑ2JÑ+LÓMÐð
 �&‰&Ð! GÑ+°!¸<ˆ&Ð
H€Cà€Jr   r+   )Úscipy._lib._array_apir   r   Ú	functoolsr   r   r(   r:   rP   r[   r   r4   r	   r   r   Ú<module>r‡      sV   ðß :å %÷Q.ñ Q.ôhXI�ô XIôvh
�iô h
ôVW˜ô Wòtô+ó2*r   