^MhAdZddlZddlmZmZmZmZmZmZm Z m Z ddl m Z m Z ddlmZmZddlmZgdZ dd Zdd ZdZddZdd d d ddZdZdS)zSVD decomposition functions.N)zerosr_diagdotarccosarcsinwhereclip) LinAlgError _datacopied)get_lapack_funcs_compute_lwork)_asarray_validated)svdsvdvalsdiagsvdorthsubspace_angles null_spaceTFgesddct||}t|jdkrtd|j\}}|jdkrt t jd|j\} } } t j |d| j} |rkt j |||f| j} t j || d<t j |||f| j}t j ||d<n>> 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 matrixrdtype)r)shaper.zlapack_driver must be a string)rgesvdz/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)ilp64r ) compute_uv full_matrices)r$lworkr% overwrite_azSVD did not convergez0illegal value in %dth argument of internal gesdd)rlenr ValueErrorsizernpeyer empty_likeidentityr isinstancestr TypeErroriinfoint32maxrrr )ar%r$r'r lapack_drivera1mnu0s0v0suvmessagemax_mnmin_mnszfuncsgesXd gesXd_lworkr&infos X/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/scipy/linalg/_decomp_svd.pyrr sz AL 9 9 9B 28}}*+++ 8DAq w!||22233 B M"D 9 9 9  @ bAbh???A[^^AcF bAbh???A[^^AcFF bAbh???A bAbh???A  a7NH5+b!"4"4K mS ) ):8999...TMTTT!!! I#$q55!Qq!f  If}rx11555 "H6"H"Hf"H"H"HIII6 QZV,,B1v:q6z**RXbh-?-?-CCC "H"H"H"HIIIMH4 5E*%"kJJJE; ; RXa[&0  O O OEE"5(5;PPPMAq!T axx0111 axxK 5!"" "!Qwc(t|d||S)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.]) r)r$r'r)r)r5r'rs rHrrs%P qQK( * * **rIc&t|}|jj}t|}||kr*t j|t |||z f|fS||kr#t|t ||z |f|fStd)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))r=MNparttypMorNs rHrrsN 77D */C q66D qyyy$q!a%j < < <=>>> $q1uaj4444556777rIcRt|d\}}}|jd|jd}}|/tj|jjt ||z}tj|d|z}tj||kt}|ddd|f} | S) 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)r%rr Ninitialr) rrr+finforepsr4amaxsumint) Arcondr>r=vhrNrOtolnumQs rHrr0sL1E***HAq" 71:rx{qA }!!%Aq 1 '!R 5 (C &S $ $ $C !!!TcT' A HrI)r'rr6ct|d|||\}}}|jd|jd} }|/tj|jjt || z}tj|d|z} tj|| kt} || dddfj } | S) 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)r%r'rr6rr NrTrUr) rrr+rWrrXr4rYrZr[Tconj) r\r]r'rr6r>r=r^rNrOr_r`ras rHrr`sF1Dk ,MKKKHAq" 71:rx{qA }!!%Aq 1 '!R 5 (C &S $ $ $C 3446 A HrIc t|d}t|jdkrtd|jt |}~t|d}t|jdkrtd|jt|t|kr+td|jdd|jdt |}~t |j|}t|}|jd|jdkr|t ||z }n*|t ||jz }~~~|dzd k}| r.ttt|d d d }nd }t||tt|dddd d }|S)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 Trrzexpected 2D array, got shape z/A and B must have the same number of rows, got rz and r g?)r'gg?rTN)rr(rr)rrrcrdranyrr r r) r\BQAQBQA_H_QBsigmamask mu_arcsinthetas rHrrsF 14000A 17||qBBBCCC aB 14000A 17||qBBBCCC 1vvR;HQK;;./gaj;;<< < aB "$))++r""G G  E x{bhqk!! R!! ! R))** * B A: D xxzz4t < < rwsL""CCCCCCCCCCCCCCCCCCCC,+++++++44444444'''''' P P P=B)0````FI*I*I*I*X/8/8/8h- - - - `K U$K K K K K \hhhhhrI