+ /iBDRt^RIt^RIHtHtHtHtHtHtH t H t ^RI H t ^RI HtHt^RIHtHt^RIHt.ROt] !R4RR l4t] !R4RR l4t] !R4R 4t] !R4RR l4t] !R4RRRRRRR /Rll4t] !RR4R4tR#)zSVD decomposition functions.N)zerosr_diagdotarccosarcsinwhereclip)_apply_over_batch) LinAlgError _datacopied)get_lapack_funcs_compute_lwork)_asarray_validatedTFgesddc\WR7p\VP4^8wd \R4hVPwrxVP^8XEd,\ \ P!^VPR74wrp \ P!VRV PR7p V'd|\ P!WgV3V PR7p \ P!V4V R&\ P!WhV3V PR7p\ P!V4VR&MI\ P!Wg^3V PR7p \ P!V^V3V PR7pV'dWV3#V #T;'g \W`4p\V\4'g \R4hVR9dRV R 2p\V4hV'dWx8dWx3MW3wppV'dNVV,\ P!\ P 4P"8d\R V R V R 24hMt\#VV,VV,4p\#VV,VV,4\ P!\ P 4P"8d\R V R24hWUR,3p\%VV3RR7wpp\'VVP^,VP^,W!R7pV!WbVWR7wrppV^8d \)R4hV^8d,VR8XdVR8XdRp\V4h\RV) R24hV'dWV3#V #)a Singular Value Decomposition. Factorizes the matrix `a` into two unitary matrices ``U`` and ``Vh``, and a 1-D array ``s`` of singular values (real, non-negative) such that ``a == U @ S @ Vh``, where ``S`` is a suitably shaped matrix of zeros with main diagonal ``s``. Parameters ---------- a : (M, N) array_like Matrix to decompose. full_matrices : bool, optional If True (default), `U` and `Vh` are of shape ``(M, M)``, ``(N, N)``. If False, the shapes are ``(M, K)`` and ``(K, N)``, where ``K = min(M, N)``. compute_uv : bool, optional Whether to compute also ``U`` and ``Vh`` in addition to ``s``. Default is True. overwrite_a : bool, optional Whether to overwrite `a`; may improve performance. Default is False. 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. lapack_driver : {'gesdd', 'gesvd'}, optional Whether to use the more efficient divide-and-conquer approach (``'gesdd'``) or general rectangular approach (``'gesvd'``) to compute the SVD. MATLAB and Octave use the ``'gesvd'`` approach. Default is ``'gesdd'``. Returns ------- U : ndarray Unitary matrix having left singular vectors as columns. Of shape ``(M, M)`` or ``(M, K)``, depending on `full_matrices`. s : ndarray The singular values, sorted in non-increasing order. Of shape (K,), with ``K = min(M, N)``. Vh : ndarray Unitary matrix having right singular vectors as rows. Of shape ``(N, N)`` or ``(K, N)`` depending on `full_matrices`. For ``compute_uv=False``, only ``s`` is returned. Raises ------ LinAlgError If SVD computation does not converge. See Also -------- svdvals : Compute singular values of a matrix. diagsvd : Construct the Sigma matrix, given the vector s. Examples -------- >>> import numpy as np >>> from scipy import linalg >>> rng = np.random.default_rng() >>> m, n = 9, 6 >>> a = rng.standard_normal((m, n)) + 1.j*rng.standard_normal((m, n)) >>> U, s, Vh = linalg.svd(a) >>> U.shape, s.shape, Vh.shape ((9, 9), (6,), (6, 6)) Reconstruct the original matrix from the decomposition: >>> sigma = np.zeros((m, n)) >>> for i in range(min(m, n)): ... sigma[i, i] = s[i] >>> a1 = np.dot(U, np.dot(sigma, Vh)) >>> np.allclose(a, a1) True Alternatively, use ``full_matrices=False`` (notice that the shape of ``U`` is then ``(m, n)`` instead of ``(m, m)``): >>> U, s, Vh = linalg.svd(a, full_matrices=False) >>> U.shape, s.shape, Vh.shape ((9, 6), (6,), (6, 6)) >>> S = np.diag(s) >>> np.allclose(a, np.dot(U, np.dot(S, Vh))) True >>> s2 = linalg.svd(a, compute_uv=False) >>> np.allclose(s, s2) True  check_finitezexpected matrixdtype)shaper.zlapack_driver must be a stringrz/lapack_driver must be "gesdd" or "gesvd", not ""zIndexing a matrix size z x zL would incur integer overflow in LAPACK. Try using numpy.linalg.svd instead.zIndexing a matrix of z[ elements would incur an in integer overflow in LAPACK. Try using numpy.linalg.svd instead._lwork preferred)ilp64) compute_uv full_matrices)rlworkr overwrite_azSVD did not convergezA has a NaN entryzillegal value in zth argument of internal gesdd))rgesvd)rlenr ValueErrorsizesvdnpeyer empty_likeidentityr isinstancestr TypeErroriinfoint32maxr rr )arrrr lapack_drivera1mnu0s0v0suvmessagemax_mnmin_mnszfuncsgesXd gesXd_lworkrinfomsgs&&&&&& V/var/www/html/photoedit/myenv/lib/python3.14/site-packages/scipy/linalg/_decomp_svd.pyr%r%s| A 9B 288}*++ 88DA ww!|23  MM"D 9  bAbhh?A[[^AcF bAbhh?A[[^AcF bAbhh?A bAbhh?A 7NH55+b"4K mS ) )899..CM?RST!!#$5!qf f}rxx1555 #:6(#fXNH"HII6 QZV,B1v:q6z*RXXbhh-?-C-CC #8=H"HIIH4 5E*%"kJE; ; RXXa[&0 OE"5(5PMA!T ax011 ax G # %CS/ !,dUG3PQRRQwc \V^VVR7#)a Compute singular values of a matrix. Parameters ---------- a : (M, N) array_like Matrix to decompose. overwrite_a : bool, optional Whether to overwrite `a`; may improve performance. Default is False. 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 ------- s : (min(M, N),) ndarray The singular values, sorted in decreasing order. Raises ------ LinAlgError If SVD computation does not converge. See Also -------- svd : Compute the full singular value decomposition of a matrix. diagsvd : Construct the Sigma matrix, given the vector s. Examples -------- >>> import numpy as np >>> from scipy.linalg import svdvals >>> m = np.array([[1.0, 0.0], ... [2.0, 3.0], ... [1.0, 1.0], ... [0.0, 2.0], ... [1.0, 0.0]]) >>> svdvals(m) array([ 4.28091555, 1.63516424]) We can verify the maximum singular value of `m` by computing the maximum length of `m.dot(u)` over all the unit vectors `u` in the (x,y) plane. We approximate "all" the unit vectors with a large sample. Because of linearity, we only need the unit vectors with angles in [0, pi]. >>> t = np.linspace(0, np.pi, 2000) >>> u = np.array([np.cos(t), np.sin(t)]) >>> np.linalg.norm(m.dot(u), axis=0).max() 4.2809152422538475 `p` is a projection matrix with rank 1. With exact arithmetic, its singular values would be [1, 0, 0, 0]. >>> v = np.array([0.1, 0.3, 0.9, 0.3]) >>> p = np.outer(v, v) >>> svdvals(p) array([ 1.00000000e+00, 2.02021698e-17, 1.56692500e-17, 8.15115104e-34]) The singular values of an orthogonal matrix are all 1. Here, we create a random orthogonal matrix by using the `rvs()` method of `scipy.stats.ortho_group`. >>> from scipy.stats import ortho_group >>> orth = ortho_group.rvs(4) >>> svdvals(orth) array([ 1., 1., 1., 1.]) )rrr)r%)r0rrs&&&rDsvdvalsrGsR qQK( **rEc"\V4pVPPp\V4pWQ8Xd,\P !V\ WV, 3VR734#WR8Xd#\V\ W, V3VR73,#\R4h)a' Construct the sigma matrix in SVD from singular values and size M, N. Parameters ---------- s : (M,) or (N,) array_like Singular values M : int Size of the matrix whose singular values are `s`. N : int Size of the matrix whose singular values are `s`. Returns ------- S : (M, N) ndarray The S-matrix in the singular value decomposition See Also -------- svd : Singular value decomposition of a matrix svdvals : Compute singular values of a matrix. Examples -------- >>> import numpy as np >>> from scipy.linalg import diagsvd >>> vals = np.array([1, 2, 3]) # The array representing the computed svd >>> diagsvd(vals, 3, 4) array([[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0]]) >>> diagsvd(vals, 4, 3) array([[1, 0, 0], [0, 2, 0], [0, 0, 3], [0, 0, 0]]) rzLength of s must be M or N.) rrcharr"r&hstackrrr#)r8MNparttypMorNs&&& rDdiagsvdrPsxP 7D **//C q6D yyy$qa%j <=>> $quaj4455677rEc\VRR7wr#pVP^,VP^,reVf;\P!VP4P \ WV4,p\P!VRR7V,p\P!W78\R7pVRRV13,p V #)a Construct an orthonormal basis for the range of A using SVD Parameters ---------- A : (M, N) array_like Input array rcond : float, optional Relative condition number. Singular values ``s`` smaller than ``rcond * max(s)`` are considered zero. Default: floating point eps * max(M,N). Returns ------- Q : (M, K) ndarray Orthonormal basis for the range of A. K = effective rank of A, as determined by rcond See Also -------- svd : Singular value decomposition of a matrix null_space : Matrix null space Examples -------- >>> import numpy as np >>> from scipy.linalg import orth >>> A = np.array([[2, 0, 0], [0, 5, 0]]) # rank 2 array >>> orth(A) array([[0., 1.], [1., 0.]]) >>> orth(A.T) array([[0., 1.], [1., 0.], [0., 0.]]) F)rNinitialrNNN) r%rr&finforepsr/amaxsumint) Arcondr9r8vhrKrLtolnumQs && rDorthra8sN1E*HA" 771:rxx{q }!%%A 1 ''!R 5 (C && $C !TcT' A HrErrr1c\VRVW4R7wrVpVP^,VP^,rVf;\P!VP4P \ W4,p\P!VRR7V,p \P!Wj8\R7p W{R1R3,PP4p V #)a Construct an orthonormal basis for the null space of A using SVD Parameters ---------- A : (M, N) array_like Input array rcond : float, optional Relative condition number. Singular values ``s`` smaller than ``rcond * max(s)`` are considered zero. Default: floating point eps * max(M,N). overwrite_a : bool, optional Whether to overwrite `a`; may improve performance. Default is False. 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. lapack_driver : {'gesdd', 'gesvd'}, optional Whether to use the more efficient divide-and-conquer approach (``'gesdd'``) or general rectangular approach (``'gesvd'``) to compute the SVD. MATLAB and Octave use the ``'gesvd'`` approach. Default is ``'gesdd'``. Returns ------- Z : (N, K) ndarray Orthonormal basis for the null space of A. K = dimension of effective null space, as determined by rcond See Also -------- svd : Singular value decomposition of a matrix orth : Matrix range Examples -------- 1-D null space: >>> import numpy as np >>> from scipy.linalg import null_space >>> A = np.array([[1, 1], [1, 1]]) >>> ns = null_space(A) >>> ns * np.copysign(1, ns[0,0]) # Remove the sign ambiguity of the vector array([[ 0.70710678], [-0.70710678]]) 2-D null space: >>> from numpy.random import default_rng >>> rng = default_rng() >>> B = rng.random((3, 5)) >>> Z = null_space(B) >>> Z.shape (5, 2) >>> np.allclose(B.dot(Z), 0) True The basis vectors are orthonormal (up to rounding error): >>> Z.T.dot(Z) array([[ 1.00000000e+00, 6.92087741e-17], [ 6.92087741e-17, 1.00000000e+00]]) T)rrrr1NrRrSrrU) r%rr&rVrrWr/rXrYrZTconj) r[r\rrr1r9r8r]rKrLr^r_r`s &&$$$ rD null_spacereisH1Dk ,KHA" 771:rxx{q }!%%A 1 ''!R 5 (C && $C 46 A HrEc \VRR7p\VP4^8wd\RVP 24h\ V4p?\VRR7p\VP4^8wd\RVP 24h\V4\V48wd4\RVP^, RVP^, 24h\ V4p?\ VP P4V4p\V4pVP^,VP^,8dV\ W$4, pM*V\ W4P P44, p???V^,R8pVP4'd#\\\VRR7R R44pMR p\Wg\\VR R R 1,R R444pV#) a Compute the subspace angles between two matrices. Parameters ---------- A : (M, N) array_like The first input array. B : (M, K) array_like The second input array. Returns ------- angles : ndarray, shape (min(N, K),) The subspace angles between the column spaces of `A` and `B` in descending order. See Also -------- orth svd Notes ----- This computes the subspace angles according to the formula provided in [1]_. For equivalence with MATLAB and Octave behavior, use ``angles[0]``. .. versionadded:: 1.0 References ---------- .. [1] Knyazev A, Argentati M (2002) Principal Angles between Subspaces in an A-Based Scalar Product: Algorithms and Perturbation Estimates. SIAM J. Sci. Comput. 23:2008-2040. Examples -------- An Hadamard matrix, which has orthogonal columns, so we expect that the suspace angle to be :math:`\frac{\pi}{2}`: >>> import numpy as np >>> from scipy.linalg import hadamard, subspace_angles >>> rng = np.random.default_rng() >>> H = hadamard(4) >>> print(H) [[ 1 1 1 1] [ 1 -1 1 -1] [ 1 1 -1 -1] [ 1 -1 -1 1]] >>> np.rad2deg(subspace_angles(H[:, :2], H[:, 2:])) array([ 90., 90.]) And the subspace angle of a matrix to itself should be zero: >>> subspace_angles(H[:, :2], H[:, :2]) <= 2 * np.finfo(float).eps array([ True, True], dtype=bool) The angles between non-orthogonal subspaces are in between these extremes: >>> x = rng.standard_normal((4, 3)) >>> np.rad2deg(subspace_angles(x[:, :2], x[:, [2]])) array([ 55.832]) # random Trzexpected 2D array, got shape z/A and B must have the same number of rows, got z and g?)rg?rRNg)rr"rr#rarrcrdrGanyrr rr) r[BQAQBQA_H_QBsigmamask mu_arcsinthetas && rDsubspace_anglesrqsH 140A 177|q8 BCC aB 140A 177|q8 BCC 1vRJHHQK=aggaj\;< < aB "$$))+r"G G E xx{bhhqk! R! ! R)* * B A: D xxzz4t r|s"CCC.,4' Q8bbJ8I*I*X8/8/8h8- - `8K UK K $K K \8X&h'hrE