+ LV-j0Rt^RIt^RIt^RIHtRR.t]!RR4RRl4tRt Rt Rt Rt R t R tR tR tRR lt]!R4RRl4tR#)z-Frechet derivative of the matrix exponential.N)_apply_over_batch expm_frechet expm_condcV'd.\P!V4p\P!V4pM,\P!V4p\P!V4pVP^8wg*VP^,VP^,8wd \ R4hVP^8wg*VP^,VP^,8wd \ R4hVPVP8wd \ R4hVfRpVR8Xd\ W4wrVM#VR8Xd\W4wrVM\ RV 24hV'dWV3#V#)a Frechet derivative of the matrix exponential of A in the direction E. Parameters ---------- A : (N, N) array_like Matrix of which to take the matrix exponential. E : (N, N) array_like Matrix direction in which to take the Frechet derivative. method : str, optional Choice of algorithm. Should be one of - `SPS` (default) - `blockEnlarge` compute_expm : bool, optional Whether to compute also `expm_A` in addition to `expm_frechet_AE`. Default is True. check_finite : bool, optional Whether to check that the input matrix contains only finite numbers. Disabling may give a performance gain, but may result in problems (crashes, non-termination) if the inputs do contain infinities or NaNs. Returns ------- expm_A : ndarray Matrix exponential of A. expm_frechet_AE : ndarray Frechet derivative of the matrix exponential of A in the direction E. For ``compute_expm = False``, only `expm_frechet_AE` is returned. See Also -------- expm : Compute the exponential of a matrix. Notes ----- This section describes the available implementations that can be selected by the `method` parameter. The default method is *SPS*. Method *blockEnlarge* is a naive algorithm. Method *SPS* is Scaling-Pade-Squaring [1]_. It is a sophisticated implementation which should take only about 3/8 as much time as the naive implementation. The asymptotics are the same. .. versionadded:: 0.13.0 References ---------- .. [1] Awad H. Al-Mohy and Nicholas J. Higham (2009) Computing the Frechet Derivative of the Matrix Exponential, with an application to Condition Number Estimation. SIAM Journal On Matrix Analysis and Applications., 30 (4). pp. 1639-1657. ISSN 1095-7162 Examples -------- >>> import numpy as np >>> from scipy import linalg >>> rng = np.random.default_rng() >>> A = rng.standard_normal((3, 3)) >>> E = rng.standard_normal((3, 3)) >>> expm_A, expm_frechet_AE = linalg.expm_frechet(A, E) >>> expm_A.shape, expm_frechet_AE.shape ((3, 3), (3, 3)) Create a 6x6 matrix containing [[A, E], [0, A]]: >>> M = np.zeros((6, 6)) >>> M[:3, :3] = A >>> M[:3, 3:] = E >>> M[3:, 3:] = A >>> expm_M = linalg.expm(M) >>> np.allclose(expm_A, expm_M[:3, :3]) True >>> np.allclose(expm_frechet_AE, expm_M[:3, 3:]) True z expected A to be a square matrixz expected E to be a square matrixz%expected A and E to be the same shapeSPS blockEnlargezUnknown implementation )npasarray_chkfiniteasarrayndimshape ValueErrorexpm_frechet_algo_64expm_frechet_block_enlarge)AEmethod compute_expm check_finiteexpm_Aexpm_frechet_AEs&&&&& k/Volumes/fast/ai/experiments/ui-tars-smoke/.venv/lib/python3.14/site-packages/scipy/linalg/_expm_frechet.pyrr sj   #   # JJqM JJqMvv{aggajAGGAJ.;<<vv{aggajAGGAJ.;<<ww!''@AA ~ "6q"< > !"6"1"ab&> ))rcRpVPV4p\P!W4\P!W4,pVPV^,V,V^,V,,4pV^,V,V^,V,,pVPV^,V,4VPV^,V,V^,V,,4,pV^,V,p WgW3#)^@)r$gN@g(@?dotr) rridentbA2M2UVLuLvs &&& r _diff_pade3r0sA qB q $B ad2g!U "#A !R!A$u*A qtBw!%%!R!A$u* 45 5B 1bB <rctRpVPV4p\P!W4\P!W4,p\P!WD4p\P!WE4\P!WT4,pVPV^,V,V^,V,,V^,V,,4pV^,V,V^,V,,V^,V,,p VPV^,V,V^,V,,4VPV^,V,V^,V,,V^,V,,4,p V^,V,V^,V,,p WW3#)@)r2g@g@@g@z@g>@r%r&) rrr(r)r*r+A4M4r,r-r.r/s &&& r _diff_pade5r5s&.A qB q $B B "&&. (B ad2g!R!A$u*,-A !R!A$r'AaDJ&A %%!R!A$r'! " EE!A$r'AaDG#ad5j0 1 2B 1b1Q47 B <rcRpVPV4p\P!W4\P!W4,p\P!WD4p\P!WE4\P!WT4,p\P!WF4p\P!We4\P!Wt4,p VPV^,V,V^,V,,V^,V,,V^,V,,4p V^,V,V^,V,,V^,V,,V^,V,,p VPV^,V ,V^,V,,V^,V,,4VPV^,V,V^,V,,V^,V,,V^,V,,4,p V^,V ,V^,V,,V^,V,,p WW3#)~pA)r7g~`Ag@t>Ag@Ag@g@gL@r%r&)rrr(r)r*r+r3r4A6M6r,r-r.r/s&&& r _diff_pade7r:sHA qB q $B B "&&. (B B "&&. (B ad2g!R!A$r')AaDJ67A !R!A$r'AaDG#ad5j0A %%!R!A$r'!AaDG+ , EE!A$r'AaDG#ad2g-!U : ; \^\\P!\P!V\^ ,, 4444pVRV),,pVRV),,p\P!W4p \P!W4\P!W4,p\P!W4p\P!W4\P!W4,p\P!W4p\P!W4\P!VV 4,pRpV^ ,V,V^ ,V,,V^ ,V ,,pV^,V,V^,V,,V^,V ,,V^,V,,pV^ ,V,V^ ,V,,V^,V ,,pV^,V,V^,V,,V^,V ,,V^,V,,p\P!VV4V,p\P!VV4p \P!VV4V,p V^ ,V,V^ ,V,,V^ ,V,,pV^,V,V^,V,,V^,V,,pV^ ,V,V^ ,V,,V^,V,,pV^,V,V^,V,,V^,V,,p\P!VV4\P!VV4,V,p\P!VV4\P!VV4,p \P!VV4\P!VV4,V,p \PP!X )X ,4p\PP#VW,4p\PP#VX X ,\P!W, V4,4p \%V4FMp!\P!VV 4\P!V V4,p \P!VV4pKO VV 3#)Ng@)gD`lCgD`\Cg`=Hb;Cg eCgJXBg"5Bg/cBg\L8BgpķAgsyAgS-Ag@gf@r%)r ridentityrrnormr0r5r:r? ell_table_61maxintceillog2r' lu_factorlu_solverange)"rrr sr(A_norm_1 m_pade_pairsmpader,r-r.r/r*r+r3r4r8r9r)W1W2Z1Z2WLw1Lw2Lz1Lz2Lwlu_pivRLks"&& rrrs  A A KKNE||  A&H         L   |A &e,LA"A    y 3rwwrwwx,r2B'BCDE F aRK aRK VVA\ VVA\BFF1L ( VVB^ VVB^bffRn , VVB^ VVB^bffRn , "rU2X"b 1Q47 * qT"WqtBw 1b (1Q4: 5 rU2X"b 1Q47 * qT"WqtBw 1b (1Q4: 5 FF2rNR  FF1aL FF2rNR eBh2r!AaDG+d2g!R!A$r')eBh2r!AaDG+d2g!R!A$r') VVB_rvvb"~ - 3 VVAr]RVVAq\ ) VVB_rvvb"~ - 3 \\ # #QBF +F fae,A fb2g!0D&DEA 1X FF1aL266!Q< ' FF1aL a4Krc6VPP4#)z Stack columns of M to construct a single vector. This is somewhat standard notation in linear algebra. Parameters ---------- M : 2-D array_like Input matrix Returns ------- v : 1-D ndarray Output vector )Travel)r!s&rvecrbs" 3399;rc ~V'd\P!V4pM\P!V4p\VP4^8wg*VP^,VP^,8wd \ R4hVP^,p\P !V4p.p\V4Fap\V4FOp\P!WF,WG,4p\WVRRR7p VP\V 44KQ Kc \P!V4P#)a Construct the Kronecker form of the Frechet derivative of expm. Parameters ---------- A : array_like with shape (N, N) Matrix to be expm'd. method : str, optional Extra keyword to be passed to expm_frechet. check_finite : bool, optional Whether to check that the input matrix contains only finite numbers. Disabling may give a performance gain, but may result in problems (crashes, non-termination) if the inputs do contain infinities or NaNs. Returns ------- K : 2-D ndarray with shape (N*N, N*N) Kronecker form of the Frechet derivative of the matrix exponential. Notes ----- This function is used to help compute the condition number of the matrix exponential. See Also -------- expm : Compute a matrix exponential. expm_frechet : Compute the Frechet derivative of the matrix exponential. expm_cond : Compute the relative condition number of the matrix exponential in the Frobenius norm. expected a square matrixF)rrr)rr r lenr r rBrKouterrappendrbrr`) rrrr r(colsijrFs &&& rexpm_frechet_kronformrl1sB   # JJqM 177|qAGGAJ!''!*4344  A KKNE D 1XqA58,AQ!EKA KKA   99T?  rcBV'd\P!V4pM\P!V4p\VP4^8wg*VP^,VP^,8wd \ R4h\ PPV4p\VRR7p\ PPVR4p\ PPVR4p\ PPV^4pWd,V, pV#)a Relative condition number of the matrix exponential in the Frobenius norm. Parameters ---------- A : 2-D array_like Square input matrix with shape (N, N). check_finite : bool, optional Whether to check that the input matrix contains only finite numbers. Disabling may give a performance gain, but may result in problems (crashes, non-termination) if the inputs do contain infinities or NaNs. Returns ------- kappa : float The relative condition number of the matrix exponential in the Frobenius norm See Also -------- expm : Compute the exponential of a matrix. expm_frechet : Compute the Frechet derivative of the matrix exponential. Notes ----- A faster estimate for the condition number in the 1-norm has been published but is not yet implemented in SciPy. .. versionadded:: 0.14.0 Examples -------- >>> import numpy as np >>> from scipy.linalg import expm_cond >>> A = np.array([[-0.3, 0.2, 0.6], [0.6, 0.3, -0.1], [-0.7, 1.2, 0.9]]) >>> k = expm_cond(A) >>> k 1.7787805864469866 rdF)rfro) rr r rer r rrrrlrC)rrXKA_normX_normK_normkappas&& rrresT   # JJqM 177|qAGGAJ!''!*4344 !Aae4A \\  q% (F \\  q% (F \\  q! $F _ &E Lr)r)rru)NTT)NgaьV>gX|[T7?g_vO?gQI?g?g+?guV?gGz?g{Gz?g\(\@g ףp= @g333333@g(\@gQ@g= ףp=@gGz@g(\!@gQ#@g333333%@gffffff'@)NT)T)__doc__numpyr scipy.linalgrscipy._lib._utilr__all__rrrDr0r5r:r?rrbrlrrrr|s3. ; '8X&k'k\ * >   &5p(1h8;;r