+ nDj8 vRt.t^RIt^RIHt!RR]P P4t^RI H t RRlt R#)zz Matrix square root for general matrices and for upper triangular matrices. This module exists to avoid cyclic imports. N)get_lapack_funcsc]tRt^tRtR#) SqrtmErrorN)__name__ __module__ __qualname____firstlineno____static_attributes__rV/data/cameron/venvs/s3viz/lib/python3.14/site-packages/scipy/linalg/_matfuncs_sqrtm.pyrrsr r)within_block_loopc \P!V4p\P!V4;'d\P!VRR7^8pV'gO\P!V\P RR7p\P!V\P R7pMM\P!V\P RR7p\P!V\P R7p\P!\P!V44p\RV3RR7pVPwp\Wa,^4p\Wg4wrV^,p Wy, p W,W,,V8wd \R 4h.p ^p W3W33F8wr\V4F$pV PWV,34W, p K& K: \W@W4\T4FpT T,wpp\T^, R R 4FpT T,wppTTT1TT13,pTT, ^8d3TTTT1TT13,P'TTT1TT13,4, pTTT1TT13,pTTT1TT13,pT!TTT4wpppTT,TTT1TT13&K K T# \ dp\#TP$!ThR p?ii;i) a Matrix square root of an upper triangular matrix. This is a helper function for `sqrtm` and `logm`. Parameters ---------- T : (N, N) array_like upper triangular Matrix whose square root to evaluate blocksize : int, optional If the blocksize is not degenerate with respect to the size of the input array, then use a blocked algorithm. (Default: 64) Returns ------- sqrtm : (N, N) ndarray Value of the sqrt function at `T` References ---------- .. [1] Edvin Deadman, Nicholas J. Higham, Rui Ralha (2013) "Blocked Schur Algorithms for Computing the Matrix Square Root, Lecture Notes in Computer Science, 7782. pp. 171-182. g)initialC)dtypeorder)rtrsyl preferred)ilp64zinternal inconsistencyN)npdiag isrealobjminasarray complex128float64sqrtrshapemaxdivmod Exceptionrangeappendr RuntimeErrorrargsdot)T blocksizeT_diag keep_it_realRrnnblocksbsmallnlargeblargensmallstart_stop_pairsstartcountsizeiejjstartjstopistartistopSRiiRjjxscaleinfos&& r _sqrtm_triurDs4WWQZF<<?FFrvvfb'AQ'FL  JJq S 9F"--8 JJq # 6F"**5  A Wqd+ >E 77DAq!.!$GA'NF aZF  F (A-011 E(6*:; uA  # #UDL$9 : ME< )! 0: 7^(+ qsB#A,Q/MFE&,u ,-A1uqy&,f 4599!E&LrMs: % && 4V r