o ֭jL@sddlZddlmZmZddlmZmZmZddl m Z ddl m Z ddl mZmZmZmZmZmZmZmZddlmZmZd Zed ed d ed dgZed d ed d edgdZdZdZegdgdgdgZegdgdgdgZ e dZ!e dde dZ"edd edddedddegdd edddedddeggdgZ#d Z$d!Z%d Z&d"d#Z'd$d%Z(Gd&d'd'eZ)Gd(d)d)eZ*dS)*N) lu_factorlu_solve) csc_matrixissparseeye)splu) group_columns)validate_max_step validate_tolselect_initial_stepnormnum_jacEPSwarn_extraneousvalidate_first_step) OdeSolver DenseOutputg.! @ igs>H @yrr@Gg)g{g]#-?g;@L¿ghm?)g }?gQ  ?gmؿ)r r r)gF@gN]?gV?)gFgN]Կg!R?)g$Z?goNg{??gUUUUUU@g竪 @)gUUUUUU?gUUUUUUrg?c Cs|jd} t|} t|} t|} |}td| f}|t}d}t| }d}d}t t D]}t dD]}|||||||||<q4t t |sPn~|j t| | d}|j t| | dd| d}| ||}| ||}||d<|j|d<|j|d<t||}|dur||}|dur|dks|t |d|||krn"| |7} t | }|dks|dur|d|||krd}n|}q.||d||fS) a^Solve the collocation system. Parameters ---------- fun : callable Right-hand side of the system. t : float Current time. y : ndarray, shape (n,) Current state. h : float Step to try. Z0 : ndarray, shape (3, n) Initial guess for the solution. It determines new values of `y` at ``t + h * C`` as ``y + Z0``, where ``C`` is the Radau method constants. scale : ndarray, shape (n) Problem tolerance scale, i.e. ``rtol * abs(y) + atol``. tol : float Tolerance to which solve the system. This value is compared with the normalized by `scale` error. LU_real, LU_complex LU decompositions of the system Jacobians. solve_lu : callable Callable which solves a linear system given a LU decomposition. The signature is ``solve_lu(LU, b)``. Returns ------- converged : bool Whether iterations converged. n_iter : int Number of completed iterations. Z : ndarray, shape (3, n) Found solution. rate : float The rate of convergence. rrNFr rrT)shapeMU_REAL MU_COMPLEXTIdotnpemptyC empty_likerangeNEWTON_MAXITERallisfiniteTTI_REAL TI_COMPLEXrealimagr )funtyhZ0scaletolLU_real LU_complexsolve_lunM_real M_complexWZFch dW_norm_olddW convergedratekif_real f_complexdW_real dW_complexdW_normrMW/var/www/html/CropPilot/venv/lib/python3.10/site-packages/scipy/integrate/_ivp/radau.pysolve_collocation_system0sJ '     $      rOcCsv|dus |dus |dkrd}n ||||d}tjddtd||d}Wd|S1s4wY|S)a9Predict by which factor to increase/decrease the step size. The algorithm is described in [1]_. Parameters ---------- h_abs, h_abs_old : float Current and previous values of the step size, `h_abs_old` can be None (see Notes). error_norm, error_norm_old : float Current and previous values of the error norm, `error_norm_old` can be None (see Notes). Returns ------- factor : float Predicted factor. Notes ----- If `h_abs_old` and `error_norm_old` are both not None then a two-step algorithm is used, otherwise a one-step algorithm is used. References ---------- .. [1] E. Hairer, S. P. Norsett G. Wanner, "Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems", Sec. IV.8. Nrr g?ignore)dividegп)r$errstatemin)h_abs h_abs_old error_normerror_norm_old multiplierfactorrMrMrNpredict_factors rZcsReZdZdZejddddddffdd Zdd Zd d Zd d Z ddZ Z S)RadauaImplicit Runge-Kutta method of Radau IIA family of order 5. The implementation follows [1]_. The error is controlled with a third-order accurate embedded formula. A cubic polynomial which satisfies the collocation conditions is used for the dense output. 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. 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)``. HHere `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, array_like, sparse_matrix, callable}, optional Jacobian matrix of the right-hand side of the system with respect to y, required by this method. The Jacobian matrix has shape (n, n) and its element (i, j) is equal to ``d f_i / d y_j``. There are three ways to define the Jacobian: * If array_like or sparse_matrix, the Jacobian is assumed to be constant. * If callable, the Jacobian is assumed to depend on both t and y; it will be called as ``jac(t, y)`` as necessary. For the 'Radau' and 'BDF' methods, the return value might be a sparse matrix. * 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. jac_sparsity : {None, array_like, sparse matrix}, optional Defines a sparsity structure of the Jacobian matrix for a finite-difference approximation. Its shape must be (n, n). This argument is ignored if `jac` is not `None`. If the Jacobian has only few non-zero elements in *each* row, providing the sparsity structure will greatly speed up the computations [2]_. A zero entry means that a corresponding element in the Jacobian is always zero. If None (default), the Jacobian is assumed to be dense. vectorized : bool, optional Whether `fun` can be called in a vectorized fashion. Default is False. 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 this method, but may result in slower execution overall in some circumstances (e.g. small ``len(y0)``). 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. step_size : float Size of the last successful step. 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. nlu : int Number of LU decompositions. References ---------- .. [1] E. Hairer, G. Wanner, "Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems", Sec. IV.8. .. [2] A. Curtis, M. J. D. Powell, and J. Reid, "On the estimation of sparse Jacobian matrices", Journal of the Institute of Mathematics and its Applications, 13, pp. 117-120, 1974. MbP?gư>NFc  s\t| t||||| d_t|_t||j\__ j j _ | durDtj j j ||j jdjj _nt| ||_d_d_tdt|td|d_d_d_|| \__tjrfdd} dd}tjd d }nfd d} d d}t j}| _!|_"|_#d _$d_%d_&d_'dS)NrrgQ??csjd7_t|SNr )nlurAselfrMrNluAszRadau.__init__..lucSs ||SN)solveLUbrMrMrNr:Es z Radau.__init__..solve_lucsc)formatcsjd7_t|ddS)Nr T) overwrite_a)r_rr`rbrMrNrdJs cSst||ddS)NT) overwrite_b)rrgrMrMrNr:NsT)(rsuper__init__y_oldr max_stepr r;rtolatolr1r2r3fr directionrTrrUrWmaxrrS newton_tolsol jac_factor _validate_jacjacJrrr$identityrdr:I current_jacr8r9r?)rcr1t0y0t_boundrqrrrsr{ jac_sparsity vectorized first_step extraneousrdr:r~ __class__rbrNro's@       zRadau.__init__csPj}j}dur0durtrtt}|ffdd}|||j}||fStry||}d_t|rMt|}d fdd }ntj |t d}d fdd }|j j j fkrut dj j fd|j d ||fStrt}ntj t d}|j j j fkrt dj j fd|j d d}||fS) Ncs2jd7_tj|||jj\}_|Sr^)njevrfun_vectorizedrsry)r2r3rtr|)rcsparsityrMrN jac_wrappedgs   z(Radau._validate_jac..jac_wrappedr cs jd7_t||tdSNr dtype)rrfloatr2r3_r{rcrMrNrtsrcs"jd7_tj||tdSr)rr$asarrayrrrrMrNr{sz `jac` is expected to have shape z, but actually has .re)r2r3rrrrtcallablerr$rrrr; ValueError)rcr{rrrgroupsrr|rM)r{rcrrNrz\sB      zRadau._validate_jacc# Cs|j}|j}|j}|j}|j}|j}dtt||j tj |}|j |kr/|}d} d} n|j |kr;|}d} d} n |j }|j } |j } |j} |j} |j} |j}|j}d}d}d}|sw||kred|jfS||j }||}|j ||jdkr{|j}||}t|}|jdurtd|jdf}n |||tj|}|t||}d}|s| dus| dur|t||j| } |t||j| } t|j||||||j | | |j! \}}}}|s|rn||||} d}d} d} |r|s|d9}d} d} qY||d}|j"t#|}|!| ||}|t$t|t||}t%||}dd t&d d t&|}|rW|d krW|!| |||||}t%||}|d krst'|| || } |t(t)|| 9}d} d} d}nd}|r\|duo|d ko|d k}!t'|| || } t*t+|| } |!s| d krd } nd} d} |||}"|!r||||"} d}n|durd}|j |_ ||_ || |_ ||_,||_||_|"|_||_-| |_| |_||_| |_||_.|/|_||fS) NrFrrTr]rg?rr r\g333333?)0r2r3rtrqrsrrr$abs nextafterruinfrTrUrWr|r8r9rr{TOO_SMALL_STEPrrxzerosrr&r,rdr r~r!rOr1rwr:r#Emaximumr r)rZrv MIN_FACTORrS MAX_FACTORrpr?t_old_compute_dense_output)#rcr2r3rtrqrsrrmin_steprTrUrWr|r8r9rr{rejected step_acceptedmessager4t_newr5r6rDn_iterr?rEy_newZEerrorrVsafetyrY recompute_jacf_newrMrMrN _step_impls"            D     zRadau._step_implcCs$t|jjt}t|j|j|j|Sre) r$r#r?r,PRadauDenseOutputrr2rp)rcQrMrMrNrszRadau._compute_dense_outputcCs|jSre)rxrbrMrMrN_dense_output_impl!szRadau._dense_output_impl) __name__ __module__ __qualname____doc__r$rrorzrrr __classcell__rMrMrrNr[ss53r[cs$eZdZfddZddZZS)rcs8t|||||_||_|jdd|_||_dSr^)rnror4rrorderrp)rcrr2rprrrMrNro&s   zRadauDenseOutput.__init__cCs||j|j}|jdkrt||jd}t|}nt||jddf}tj|dd}t|j|}|jdkrG||j dddf7}|S||j 7}|S)Nrr )axisr) rr4ndimr$tilercumprodr#rrp)rcr2xpr3rMrMrN _call_impl-s    zRadauDenseOutput._call_impl)rrrrorrrMrMrrNr%s r)+numpyr$ scipy.linalgrr scipy.sparserrrscipy.sparse.linalgrscipy.optimize._numdiffrcommonr r r r rrrrbaserrS6arrayr&rr r!r,r"r-r.rr)rrrOrZr[rrMrMrMrNsL  ( $(([(t