ftj_ jdZgZddlZddlmZmZGddejjZ ddl m Z d d Z dS) zz Matrix square root for general matrices and for upper triangular matrices. This module exists to avoid cyclic imports. N)ztrsyldtrsylceZdZdS) SqrtmErrorN)__name__ __module__ __qualname__Z/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/scipy/linalg/_matfuncs_sqrtm.pyrrsDr r)within_block_loop@c :tj|}tj|otj|ddk}|sBtj|tjd}tj|tj}nAtj|tjd}tj|tj}tjtj|}|j\}}t||zd}t||\}}|dz} ||z } | |z|| zz|krtdg} d} | |f|| ffD]6\} }t| D]!}| | | |zf| |z } "7 t||| |n!#t$r}t!|j|d }~wwxYwt|D]}| |\}}t|dz d d D]}| |\}}|||||f}||z dkr0||||||f|||||fz }|||||f}|||||f}|rt'|||\}}}nt)|||\}}}||z|||||f<|S) 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)initialrC)dtypeorder)rrzinternal inconsistencyN)npdiag isrealobjminasarray complex128float64sqrtshapemaxdivmod Exceptionrangeappendr RuntimeErrorrargsdotrr)T blocksizeT_diag keep_it_realRnnblocksbsmallnlargeblargensmallstart_stop_pairsstartcountsizeiejjstartjstopistartistopSRiiRjjxscaleinfos r _sqrtm_triurCs54WQZZF<??Frvfb'A'A'AQ'FL 6 Jq S 9 9 9F"-888 Jq # 6 6 6F"*555   A 7DAq!y.!$$GAw''NFF aZF v F &(A--0111 E(66*:; tu  A  # #UEDL$9 : : : TMEE  )!Q 0':::: )))!&!q()7^^66(+ qsB## 6 6A,Q/MFE&,u ,-A1uqyy&,f 4599!E&LrKs #"""""""     &   433333W W W W W W r