+
    /i'                     j    ^ RI t^ RIHt ^RIHtHtHt ^RIH	t	H
t
  ! R R]	4      t ! R R]
4      tR# )	    N)ode)validate_tolvalidate_first_stepwarn_extraneous)	OdeSolverDenseOutputc            	       l   a a ] tR t^t oRtRR]P                  RRRRRR3	V 3R lltR tR	 t	R
t
VtV ;t# )LSODAap  Adams/BDF method with automatic stiffness detection and switching.

This is a wrapper to the Fortran solver from ODEPACK [1]_. It switches
automatically between the nonstiff Adams method and the stiff BDF method.
The method was originally detailed in [2]_.

Parameters
----------
fun : callable
    Right-hand side of the system: the time derivative of the state ``y``
    at time ``t``. The calling signature is ``fun(t, y)``, where ``t`` is a
    scalar and ``y`` is an ndarray with ``len(y) = len(y0)``. ``fun`` must
    return an array of the same shape as ``y``. See `vectorized` for more
    information.
t0 : float
    Initial time.
y0 : array_like, shape (n,)
    Initial state.
t_bound : float
    Boundary time - the integration won't continue beyond it. It also
    determines the direction of the integration.
first_step : float or None, optional
    Initial step size. Default is ``None`` which means that the algorithm
    should choose.
min_step : float, optional
    Minimum allowed step size. Default is 0.0, i.e., the step size is not
    bounded and determined solely by the solver.
max_step : float, optional
    Maximum allowed step size. Default is np.inf, i.e., the step size is not
    bounded and determined solely by the solver.
rtol, atol : float and array_like, optional
    Relative and absolute tolerances. The solver keeps the local error
    estimates less than ``atol + rtol * abs(y)``. Here `rtol` controls a
    relative accuracy (number of correct digits), while `atol` controls
    absolute accuracy (number of correct decimal places). To achieve the
    desired `rtol`, set `atol` to be smaller than the smallest value that
    can be expected from ``rtol * abs(y)`` so that `rtol` dominates the
    allowable error. If `atol` is larger than ``rtol * abs(y)`` the
    number of correct digits is not guaranteed. Conversely, to achieve the
    desired `atol` set `rtol` such that ``rtol * abs(y)`` is always smaller
    than `atol`. If components of y have different scales, it might be
    beneficial to set different `atol` values for different components by
    passing array_like with shape (n,) for `atol`. Default values are
    1e-3 for `rtol` and 1e-6 for `atol`.
jac : None or callable, optional
    Jacobian matrix of the right-hand side of the system with respect to
    ``y``. The Jacobian matrix has shape (n, n) and its element (i, j) is
    equal to ``d f_i / d y_j``. The function will be called as
    ``jac(t, y)``. If None (default), the Jacobian will be
    approximated by finite differences. It is generally recommended to
    provide the Jacobian rather than relying on a finite-difference
    approximation.
lband, uband : int or None
    Parameters defining the bandwidth of the Jacobian,
    i.e., ``jac[i, j] != 0 only for i - lband <= j <= i + uband``. Setting
    these requires your jac routine to return the Jacobian in the packed format:
    the returned array must have ``n`` columns and ``uband + lband + 1``
    rows in which Jacobian diagonals are written. Specifically
    ``jac_packed[uband + i - j , j] = jac[i, j]``. The same format is used
    in `scipy.linalg.solve_banded` (check for an illustration).
    These parameters can be also used with ``jac=None`` to reduce the
    number of Jacobian elements estimated by finite differences.
vectorized : bool, optional
    Whether `fun` may be called in a vectorized fashion. False (default)
    is recommended for this solver.

    If ``vectorized`` is False, `fun` will always be called with ``y`` of
    shape ``(n,)``, where ``n = len(y0)``.

    If ``vectorized`` is True, `fun` may be called with ``y`` of shape
    ``(n, k)``, where ``k`` is an integer. In this case, `fun` must behave
    such that ``fun(t, y)[:, i] == fun(t, y[:, i])`` (i.e. each column of
    the returned array is the time derivative of the state corresponding
    with a column of ``y``).

    Setting ``vectorized=True`` allows for faster finite difference
    approximation of the Jacobian by methods 'Radau' and 'BDF', but
    will result in slower execution for this solver.

Attributes
----------
n : int
    Number of equations.
status : string
    Current status of the solver: 'running', 'finished' or 'failed'.
t_bound : float
    Boundary time.
direction : float
    Integration direction: +1 or -1.
t : float
    Current time.
y : ndarray
    Current state.
t_old : float
    Previous time. None if no steps were made yet.
nfev : int
    Number of evaluations of the right-hand side.
njev : int
    Number of evaluations of the Jacobian.

References
----------
.. [1] A. C. Hindmarsh, "ODEPACK, A Systematized Collection of ODE
       Solvers," IMACS Transactions on Scientific Computation, Vol 1.,
       pp. 55-64, 1983.
.. [2] L. Petzold, "Automatic selection of methods for solving stiff and
       nonstiff systems of ordinary differential equations", SIAM Journal
       on Scientific and Statistical Computing, Vol. 4, No. 1, pp. 136-148,
       1983.
Ng        gMbP?gư>Fc                X  < \        V4       \        SV `	  WW4V4       Vf   ^ pM\        WRV4      pWPP                  ,          pV\
        P                  8X  d   ^ pMV^ 8:  d   \        R4      hV^ 8  d   \        R4      h\        WV P                  4      w  r\        V P                  V
4      pVP                  RWVWeWR7       VP                  W24       V P                  VP                  P                   ^ &   VP                  P                   VP                  P"                  ^&   Wn        R # )Nz`max_step` must be positive.z`min_step` must be nonnegative.lsoda)rtolatolmax_stepmin_step
first_steplbanduband)r   super__init__r   	directionnpinf
ValueErrorr   nr   funset_integratorset_initial_valuet_bound_integratorrwork	call_args_lsoda_solver)selfr   t0y0r   r   r   r   r   r   jacr   r   
vectorized
extraneoussolver	__class__s   &&&&&&&&&&&&&&, X/var/www/html/photoedit/myenv/lib/python3.14/site-packages/scipy/integrate/_ivp/lsoda.pyr   LSODA.__init__v   s    	
#"z:J,ZWEJnn$
rvvH];<<a<>??!$dff5
TXXs#gDh'/$) 	 	8 	  ( '+ll  #*0*<*<*B*B$$Q'#    c           	     p   V P                   pVP                  pVP                  ^,          p^VP                  ^&   TP                  VP                  VP
                  ;'       g    R VP                  VP                  V P                  VP                  VP                  4      w  Vn        Vn        W2P                  ^&   VP                  4       '       dc   VP                  V n        VP                  P                  4       V n        VP                  ^,          V n        VP                  ^,          V n        R# R# )   c                      R # )N r1   r-   r+   <lambda>"LSODA._step_impl.<locals>.<lambda>   s    Tr-   )TN)FzUnexpected istate in LSODA.)r"   r   r!   runfr&   _ytr   f_params
jac_params
successfulcopyyiworknjevnlu)r#   r)   
integratoritasks   &   r+   
_step_implLSODA._step_impl   s    ##''
 $$Q'"#
Q(nnHHfjj22\FIIvxxLL&//6+<+<>	68 #(QXXDF YY^^%DF"((,DI!''+DH77r-   c                   V P                   P                  P                  pV P                   P                  P                  pV^,          pV^,          p\        P
                  ! V^^V^,           V P                  ,          ,            V P                  V^,           3RR7      P                  4       pV^,          V8  d*   VR;;,          WB^
,          ,          V,          ,          uu&   \        V P                  V P                  WCV4      # )   F)order)NNN)r"   r   r=   r    r   reshaper   r;   LsodaDenseOutputt_oldr7   )r#   r=   r    rG   hyhs   &     r+   _dense_output_implLSODA._dense_output_impl   s    ""..44""..44 b	 "I ZZbuqyDFF&:!:;+388< 	9u uI!Bi-E11I

DFFAbAAr-   )r"   r>   r?   r7   r<   )__name__
__module____qualname____firstlineno____doc__r   r   r   rB   rO   __static_attributes____classdictcell____classcell__r*   __classdict__s   @@r+   r
   r
      s>     m\ 9=s&&t$D!$F84 B  Br-   r
   c                   8   a a ] tR t^t oV 3R ltR tRtVtV ;t# )rK   c                   < \         SV `  W4       W0n        WPn        \        P
                  ! V^,           4      V n        R# )   N)r   r   rM   rN   r   arangep)r#   rL   r7   rM   rG   rN   r*   s   &&&&&&r+   r   LsodaDenseOutput.__init__   s.    "519%r-   c                F   VP                   ^ 8X  d6   WP                  ,
          V P                  ,          V P                  ,          pM;WP                  ,
          V P                  ,          V P                  R,          ,          p\        P
                  ! V P                  V4      # )r   )rH   N)ndimr7   rM   r_   r   dotrN   )r#   r7   xs   && r+   
_call_implLsodaDenseOutput._call_impl   s`    66Q;ff*&4661Aff*&466'?:Avvdggq!!r-   )rM   r_   rN   )	rQ   rR   rS   rT   r   re   rV   rW   rX   rY   s   @@r+   rK   rK      s     &" "r-   rK   )numpyr   scipy.integrater   commonr   r   r   baser   r   r
   rK   r1   r-   r+   <module>rk      s1      F F (LBI LB^"{ "r-   