ftj]DddlZddlmZmZddlmZmZmZddl m Z ddl m Z ddl mZmZmZmZmZmZmZmZddlmZmZd Zd Zd Zd Zd ZdZdZGddeZ GddeZ!dS)N) lu_factorlu_solve)issparse csc_matrixeye)splu) group_columns)validate_max_step validate_tolselect_initial_stepnormEPSnum_jacvalidate_first_stepwarn_extraneous) OdeSolver DenseOutputg? ctjd|dzdddf}tjd|dz}tj|dz|dzf}|dz ||zz |z |ddddf<d|d<tj|dS)z6Compute the matrix for changing the differences array.r Nraxis)nparangezeroscumprod)orderfactorIJMs V/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/scipy/integrate/_ivp/bdf.py compute_Rr%s !UQY4(A !UQYA %!)UQY'((AQ!#q(Aabb!""fI AaD :aa  ct||}t|d}||}tj|j|d|dz|d|dz<dS)z " " CqMMvbk!nn%%  E Xb!a%#+/ * *rEz""  DD[(D  $!))!+,D9GCcII E R R qLL TQX%6%@3%F%FI E a!eQ !!r&cNeZdZdZejddddddffd ZdZdZd Z xZ 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 t| t||||| dt|_t ||j\__ j j } | .lusA Awwr&c,||S)N)solver:bs r$r;zBDF.__init__..solve_lusxx{{"r&csc)formatdtypecFxjdz c_t|dS)Nr T) overwrite_a)rOrrPs r$rSzBDF.__init__..lus%A  5555r&c&t||dS)NT) overwrite_b)rrVs r$r;zBDF.__init__..solve_lusA48888r&rZ)rgGzǿgqqgugsh|?rr)/rsuper__init__r max_stepr nrtolatolr5tr?r directionh_absr h_abs_olderror_norm_oldmaxrmin newton_tol jac_factor _validate_jacjacr"rrrZridentityrSr;r!arrayhstackcumsumr MAX_ORDERgammaalpha error_constemptyr*r n_equal_stepsr:)rRr5t0y0t_boundrdrfrgrr jac_sparsity vectorized first_step extraneousrCrSr;r!kappar* __class__s` r$rcz BDF.__init__s  ### b"gz)-  / / /)(33 +D$?? 49 HHTVTV $ $  ,TXtvtv-4h-1^Q-1Y CCDJJ -ZWEEDJ"b3hos4/E/EFF--c<@@$& DF   8      # # #DF5 ===AA 6 6 6 6 6 9 9 9 DF$&,777A  @@@AAY29Q1i!m1L1L-L#M#MNOO %i4:-  4:-BIaQ4O4O0OO Hi!mTV,DFL A A Av!4:~.! r&c4j}jG1trtt }|ffd}||}n:t r|}xjdz c_t|rt|j}fd}n"tj |j}fd}|j j j fkr'tdj j fd|j dntrtj}ntj j}|j j j fkr'tdj j fd|j dd}||fS) Nc xjdz c_||}tj|||jj\}_|SrN)njev fun_singlerfun_vectorizedrgrp)rhr?rCr"rRsparsitys r$ jac_wrappedz&BDF._validate_jac..jac_wrapped sY Q OOAq))%,T-@!Q-1Y-5&7&7"4?r&r r_cdxjdz c_t||jSNr r_)rrrZrhr?rrrRr~s r$rz&BDF._validate_jac..jac_wrappeds1IINII%cc!Qiirx@@@@r&cnxjdz c_tj||jSr)rrasarrayrZrs r$rz&BDF._validate_jac..jac_wrapped!s3IINII:cc!Qiirx@@@@r&z `jac` is expected to have shape z, but actually has .) rhr?rrr callablerrZrrshapere ValueError)rRrrrr}groupsrr"r~s``` @r$rqzBDF._validate_jacsW V V ;#H%%4)(33H&x00$f-       B##AA c]] B A IINII{{ Aq111AAAAAAAAJq111AAAAAAAw4646*** "ATVTVDT"A"A67g"A"A"ABBB+}} 4s"(333Js"(333w4646*** "ATVTVDT"A"A67g"A"A"ABBBKA~r&c n |j}|j}|j}dtjtj||jtjz|z z}|j|kr(|}t||j ||jz d|_ n:|j|kr(|}t||j ||jz d|_ n|j}|j }|j }|j }|j} |j} |j} |j} |j} |jdu}d}|s;||kr d|jfS||jz}||z}|j||jz zdkr9|j}t||tj||z |z d|_ d} ||z }tj|}tj|d|dzd}||tj|zz}tj|d|dzj| d|dz| |z }d}|| |z }|sn| ||j|| zz } t7|j||||| |j||j \}}}}|s|rn|||} d} d}|n|s#d}||z}t|||d|_ d} dd t>zdzzd t>z|zz }||tj|zz}| ||z}tA||z }|dkr?tCtD||d |dzz zz}||z}t|||d|_ nd}|;|xj dz c_ ||_||_#||_| |_| |_|||dzz ||d z<|||dz<tItK|dzD]}||xx||dzz cc<|j |dzkrd S|dkr'| |dz ||z}tA||z } n tj} |tLkr*| |dz||d zz}!tA|!|z }"n tj}"tj'| ||"g}#tj(d 5|#d tj)||dzz z}$dddn #1swxYwYtj*|$dz }%||%z }||_ tWtX|tj!|$z}|xj|zc_t|||d|_ d|_d S)NrrFr rTrLg?r`)TNignore)dividera)-rhr*rdrabs nextafterriinfrjr.rr|rgrfryrxrzr"r:rrTOO_SMALL_STEPrsumr(r)rSr!rGr5r;ror2rrm MIN_FACTORr?reversedr1rwrterrstaterargmaxrn MAX_FACTOR)&rRrhr*rdmin_steprjrgrfrryrxrzr"r: current_jac step_acceptedhr6r7r<r9rAr8n_itery_newr>r safetyerror error_normierror_m error_m_normerror_p error_p_norm error_normsfactors delta_orders& r$ _step_implzBDF._step_impl5s! F F=r|At~/FGG!KLLL : E Q Htz$9 : : :!"D   Z( " "E Q Htz$9 : : :!"D  JEyy   & F Wh$&  > %xd111&AEE~!56:: E26%!)#4#4u#<===%&" AF1IIEq%!)}1555I4"&"3"333E&1eai<*E!UQY,,?@@5<OCIE%L A ':!a%00B.>HeY3DM4?/,/,+ 65!!'" 22AB"&K ' E6***%&"A.23q>7I9?8@AF4"&--//E&*Eeem,,JA~~Z#jR5195E&FFHHE6***%&""!% } > %@ a  1UQY<'%!) %!) % **++  A aDDDAa!eH DDDD   ) ): 199!%!),qx7G%00LL6L 9  !%!),q|;G%00LL6Lh j,GHH [ ) ) ) H H!b29UEAI+F+F&FGG H H H H H H H H H H H H H H Hi((1,   Z"&//!9:: f E6"""zsR..R25R2c t|j|j|j|jz|j|jd|jdzSrN)BdfDenseOutputt_oldrhrjrirr*r0)rRs r$_dense_output_implzBDF._dense_output_implsNdj$&$*t~2M"j$&$*q.*A*F*F*H*HJJ Jr&) __name__ __module__ __qualname____doc__rrrcrqrr __classcell__rs@r$rIrIHs{{z79f4d!d::::::x111fMMM^JJJJJJJr&rIc$eZdZfdZdZxZS)rct||||_|j|t j|jzz |_|dt j|jzz|_||_dSrN) rbrcrrhrrt_shiftdenomr*)rRrrhrrr*rs r$rczBdfDenseOutput.__init__sk """ vBIdj$9$9 99 !bi 3334 r&c|jdkr'||jz |jz }tj|}n<||jdddfz |jdddfz }tj|d}tj|jddj|}|jdkr||jdz }n||jddddfz }|S)Nrrr )ndimrrrrr(r*r))rRrhxpr?s r$ _call_implzBdfDenseOutput._call_impls 6Q;;T\!TZ/A 1 AAT\!!!T'**djD.AAA 11%%%A F46!"":< # # 6Q;; NAA 111d # #Ar&)rrrrcrrrs@r$rrsGr&r)"numpyr scipy.linalgrr scipy.sparserrrscipy.sparse.linalgrscipy.optimize._numdiffr commonr r r rrrrrbaserrrwr2rrr%r.rGrIrr&r$rs,,,,,,,,2222222222$$$$$$111111&&&&&&&&&&&&&&&&&&&&)(((((((     !!!000!"!"!"H~J~J~J~J~J)~J~J~JB [r&