a BCCfrD@sddlZddlmZmZddlmZmZmZddl m Z ddl m Z ddl mZmZmZmZmZmZmZmZddlmZmZd Zd Zd Zd Zd dZddZddZGdddeZ GdddeZ!dS)N) lu_factorlu_solve)issparse csc_matrixeye)splu) group_columns)validate_max_step validate_tolselect_initial_stepnormEPSnum_jacvalidate_first_stepwarn_extraneous) OdeSolver DenseOutputg? cCs|td|ddddf}td|d}t|d|df}|d||||ddddf<d|d<tj|ddS)z6Compute the matrix for changing the differences array.r NrZaxis)nparangeZzeroscumprod)orderfactorIJMr T/var/www/html/django/DPS/env/lib/python3.9/site-packages/scipy/integrate/_ivp/bdf.py compute_Rs $r"cCsHt||}t|d}||}t|j|d|d|d|d<dS)zq|||||| }t||}| durnd}n|| }|dur|dks|t| d|||krq| |7} | |7} |dks|dur|d|||krd} q|} q| | d| | fS)z5Solve the algebraic system resulting from BDF method.rNFr T)copyrangeNEWTON_MAXITERrallisfiniter )funt_new y_predictcpsiLUsolve_luscaleZtoldyZ dy_norm_old convergedkfZdyZdy_normZrater r r!solve_bdf_system$s8   r;csJeZdZdZejddddddffdd Zdd Zd d Zd d Z Z S)BDFaImplicit method based on backward-differentiation formulas. This is a variable order method with the order varying automatically from 1 to 5. The general framework of the BDF algorithm is described in [1]_. This class implements a quasi-constant step size as explained in [2]_. The error estimation strategy for the constant-step BDF is derived in [3]_. An accuracy enhancement using modified formulas (NDF) [2]_ is also implemented. Can be applied in the complex domain. 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)``. 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, 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 [4]_. 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] G. D. Byrne, A. C. Hindmarsh, "A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations", ACM Transactions on Mathematical Software, Vol. 1, No. 1, pp. 71-96, March 1975. .. [2] L. F. Shampine, M. W. Reichelt, "THE MATLAB ODE SUITE", SIAM J. SCI. COMPUTE., Vol. 18, No. 1, pp. 1-22, January 1997. .. [3] E. Hairer, G. Wanner, "Solving Ordinary Differential Equations I: Nonstiff Problems", Sec. III.2. .. [4] 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. gMbP?gư>NFc  st| tj||||| ddt|_t||j\__ j j } | dur~t j j j | j djj_nt| ||_d_d_tdt|td|d_d_|| \__tjrfdd}d d }tjd j jd }n(fd d}dd }tjjj jd}|_|_ |_!t"gd}t#dt$dt%dt&df_'d|j'_(|j'dt%dt&d_)tj*t&djfj jd}j |d<| jj |d<|_+d_,d_-d_.dS)NT)Zsupport_complexr rgQ??csjd7_t|SNr )nlurAselfr r!luszBDF.__init__..lucSs ||S)N)Zsolver3br r r!r4szBDF.__init__..solve_luZcsc)formatdtypecsjd7_t|ddS)Nr T)Z overwrite_a)r?rr@rBr r!rDscSst||ddS)NT)Z overwrite_b)rrEr r r!r4srH)rgGzǿgqqgugsh|?rr)/rsuper__init__r max_stepr nrtolatolr.tr7r directionh_absrZ h_abs_oldZerror_norm_oldmaxrmin newton_tol jac_factor _validate_jacjacrrrrHridentityrDr4rarrayZhstackZcumsumr MAX_ORDERgammaalpha error_constemptyr%r n_equal_stepsr3)rCr.t0y0t_boundrNrPrQrZZ jac_sparsityZ vectorizedZ first_stepZ extraneousr:rDr4rkappar% __class__rBr!rMsN    &  z BDF.__init__csPj}jdurVdurjd7_||}tj|||jj\}_|Sr>)njevZ fun_singlerZfun_vectorizedrQrX)rRr7r:r)rCsparsityr r! jac_wrapped s   z&BDF._validate_jac..jac_wrappedr rIcs"jd7_t||jdSNr rI)rirrHrRr7rZrCrdr r!rkscs$jd7_tj||jdSrl)rirasarrayrHrmrnr r!rksz8`jac` is expected to have shape {}, but actually has {}.)rRr7rrrcallablerirHrroshaperO ValueErrorrG)rCrZrjrcgroupsrkrr )rZrCrjrdr!rYs>   zBDF._validate_jacc& Cs|j}|j}|j}dtt||jtj|}|j|kr^|}t ||j ||jd|_ n0|j|kr|}t ||j ||jd|_ n|j}|j }|j }|j }|j} |j} |j} |j} |j} |jdu}d}|s||krd|jfS||j}||}|j||jdkr6|j}t ||t|||d|_ d} ||}t|}tj|d|ddd}||t|}t|d|dj| d|d| |}d}|| |}|s$| dur||j|| } t|j||||| |j||j \}}}}|s|r q$|||} d} d}q|sNd}||9}t |||d|_ d} qdd tdd t|}||t|}| ||}t ||}|dkrt!t"||d |d}||9}t |||d|_ qd}q|j d7_ ||_||_#||_| |_| |_|||d||d <|||d<t$t%|dD]}||||d7<q:|j |dkrnd S|dkr| |d||}t ||} ntj} |t&kr| |d||d }!t |!|}"ntj}"t'| ||"g}#tj(d d (|#d t)||d}$Wdn1s"0Yt*|$d}%||%7}||_ t+t,|t!|$}|j|9_t |||d|_ d|_d S)NrrFr rTr=g?rJ)TNignore)dividerK)-rRr%rNrabs nextafterrSinfrTr(rrbrQrPr_r^r`rr3rZZTOO_SMALL_STEPresumr#r$rDrr;r.r4rWr+r rU MIN_FACTORr7reversedr*r]r\ZerrstaterZargmaxrV MAX_FACTOR)&rCrRr%rNZmin_steprTrQrPrr_r^r`rr3Z current_jacZ step_acceptedhr/r0r5r2r8r1Zn_iterZy_newr6rZsafetyerrorZ error_normiZerror_mZ error_m_normZerror_pZ error_p_normZ error_normsZfactorsZ delta_orderr r r! _step_impl5s"      .            8 zBDF._step_implc Cs2t|j|j|j|j|j|jd|jdSr>)BdfDenseOutputt_oldrRrTrSrr%r)rBr r r!_dense_output_implszBDF._dense_output_impl) __name__ __module__ __qualname____doc__rryrMrYrr __classcell__r r rgr!r<Hs|;5r<cs$eZdZfddZddZZS)rcsLt||||_|j|t|j|_|dt|j|_||_dSr>) rLrMrrRrrt_shiftdenomr%)rCrrRr~rr%rgr r!rMs zBdfDenseOutput.__init__cCs|jdkr&||j|j}t|}n6||jdddf|jdddf}tj|dd}t|jddj|}|jdkr||jd7}n||jddddf7}|S)Nrrr )ndimrrrrr#r%r$)rCrRxpr7r r r! _call_impls  ( zBdfDenseOutput._call_impl)rrrrMrrr r rgr!rs r)"numpyrZ scipy.linalgrrZ scipy.sparserrrZscipy.sparse.linalgrZscipy.optimize._numdiffrcommonr r r r rrrrbaserrr]r+r{r}r"r(r;r<rr r r r!s$  ( $