ftjfdZddlZddlmZddlmZddlmZddlm Z ddlm Z m Z dgZ dZd d ZdS) zSparse matrix norms. N)issparse)svds)convert_pydata_sparse_to_scipy)sqrtabsnormc~tj|}tj|S)N)sp_sputils_todatanplinalgr)xdatas W/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/scipy/sparse/linalg/_norm.py_sparse_frobenius_normrs+ ;  q ! !D 9>>$  c t|d}t|std||dvrt|S|}|"t t |j}nbt|t sMd} t|}n"#t$r}t||d}~wwxYw||krt||f}|j}t|dkr|\}}| |cxkr|krnn| |cxkr|ksnd|d |j } t| ||z||zkrtd |dkrt|d d d \} } } | dS|dkrt|d kr5t||S|t$jkr5t||S|dkr5t||S|t$j kr5t||S|dvrt|Stdt|d kr|\} | | cxkr|ksnd|d |j } t| |t$jkr%t|| } n>|t$j kr%t|| } n|dkr|dk| } n|d kr$t|| } n|dvrDt+t|d| } nu |d zn"#t$r}td|d}~wwxYwt%jt||| d |z } t/| dr&| St/| dr| jS| Std)a Norm of a sparse matrix This function is able to return one of seven different matrix norms, depending on the value of the ``ord`` parameter. Parameters ---------- x : a sparse array Input sparse array. ord : {non-zero int, inf, -inf, 'fro'}, optional Order of the norm (see table under ``Notes``). inf means numpy's `inf` object. axis : {int, 2-tuple of ints, None}, optional If `axis` is an integer, it specifies the axis of `x` along which to compute the vector norms. If `axis` is a 2-tuple, it specifies the axes that hold 2-D matrices, and the matrix norms of these matrices are computed. If `axis` is None then either a vector norm (when `x` is 1-D) or a matrix norm (when `x` is 2-D) is returned. Returns ------- n : float or ndarray Notes ----- Some of the ord are not implemented because some associated functions like, _multi_svd_norm, are not yet available for sparse array. This docstring is modified based on numpy.linalg.norm. https://github.com/numpy/numpy/blob/main/numpy/linalg/linalg.py The following norms can be calculated: ===== ============================ ord norm for sparse arrays ===== ============================ None Frobenius norm 'fro' Frobenius norm inf max(sum(abs(x), axis=1)) -inf min(sum(abs(x), axis=1)) 0 abs(x).sum(axis=axis) 1 max(sum(abs(x), axis=0)) -1 min(sum(abs(x), axis=0)) 2 Spectral norm (the largest singular value) -2 Not implemented other Not implemented ===== ============================ The Frobenius norm is given by [1]_: :math:`||A||_F = [\sum_{i,j} abs(a_{i,j})^2]^{1/2}` References ---------- .. [1] G. H. Golub and C. F. Van Loan, *Matrix Computations*, Baltimore, MD, Johns Hopkins University Press, 1985, pg. 15 Examples -------- >>> from scipy.sparse import csr_array, diags_array >>> import numpy as np >>> from scipy.sparse.linalg import norm >>> a = np.arange(9) - 4 >>> a array([-4, -3, -2, -1, 0, 1, 2, 3, 4]) >>> b = a.reshape((3, 3)) >>> b array([[-4, -3, -2], [-1, 0, 1], [ 2, 3, 4]]) >>> b = csr_array(b) >>> norm(b) 7.745966692414834 >>> norm(b, 'fro') 7.745966692414834 >>> norm(b, np.inf) 9 >>> norm(b, -np.inf) 2 >>> norm(b, 1) 7 >>> norm(b, -1) 6 The matrix 2-norm or the spectral norm is the largest singular value, computed approximately and with limitations. >>> b = diags_array([-1, 1], offsets=[0, 1], shape=(9, 10)) >>> norm(b, 2) 1.9753... csr) target_formatz*input is not sparse. use numpy.linalg.normN)Nfrofz6'axis' must be None, an integer or a tuple of integersz Invalid axis z for an array with shape zDuplicate axes given.arpack)ksolverrngr)axis)Nrrz Invalid norm order for matrices.)rNzInvalid norm order for vectors.toarrayAz&Improper number of dimensions to norm.)rr TypeErrorrtocsrtuplerangendim isinstanceintlenshape ValueErrorrNotImplementedErrorrsummaxr infminrpowerhasattrr"ravelr#)rordr msgint_axisendrow_axiscol_axismessage_saMs rrrs| 'q>>>A A;;FDEEE |111%a(((  A |U16]]## e $ $F (4yyHH ( ( (C..a ' ( 8  C.. { B 4yyA~~!(x$$$$"$$$$$")=)=)=)=2)=)=)=)=RdRRqwRRGW%% % b=HrM ) )455 5 !881(===GAq!Q4K BYY% % AXXq66::8:,,0022 2 BF]]q66::8:,,0022 2 BYYq66::8:,,0022 2 RVG^^q66::8:,,0022 2 & & &)!,, ,?@@ @ Ta q 2 RdRRqwRRGW%% % "&==A  ""AA RVG^^A  ""AA AXXa ! $$AA AXXA  ""AA I  SVV\\!__((a(0011AA Ka K K K !BCCJ KQc**..A.66C@@A 1i  99;;$$&& & Q__ 399;; 7799 ABBBs0B%% C/B??C/O55 P?PP)NN)__doc__numpyr scipy.sparserscipy.sparse.linalgrscipy.sparse._sputilsrsparser rr__all__rrrrrJs!!!!!!$$$$$$@@@@@@ (   nCnCnCnCnCnCr