o o hQ9@sddlmZddlmZddlmZddlmZddlm Z ddl m Z ddl m Z mZdd lmZdd lmZmZmZmZdd lmZmZGd d d eZGdddee ZeZdS))Callable)Dict)sympy_deprecation_warning is_sequence)as_int) MatrixBase)MutableRepMatrix RepMatrix)_iszero)_liupc _row_structure_symbolic_cholesky_cholesky_sparse_LDLdecomposition_sparse)_lower_triangular_solve_sparse_upper_triangular_solve_sparsecseZdZdZefddZeddZddZdd Z d d Z d d Z ddZ ddZ ddZddZd*ddZd*ddZeedddZee dddZddZdd Zd+d"d#Zd+d$d%Zd&d'Zd(d)Zeje_eje_eje_eje_eje_eje_ZS),SparseRepMatrixa A sparse matrix (a matrix with a large number of zero elements). Examples ======== >>> from sympy import SparseMatrix, ones >>> SparseMatrix(2, 2, range(4)) Matrix([ [0, 1], [2, 3]]) >>> SparseMatrix(2, 2, {(1, 1): 2}) Matrix([ [0, 0], [0, 2]]) A SparseMatrix can be instantiated from a ragged list of lists: >>> SparseMatrix([[1, 2, 3], [1, 2], [1]]) Matrix([ [1, 2, 3], [1, 2, 0], [1, 0, 0]]) For safety, one may include the expected size and then an error will be raised if the indices of any element are out of range or (for a flat list) if the total number of elements does not match the expected shape: >>> SparseMatrix(2, 2, [1, 2]) Traceback (most recent call last): ... ValueError: List length (2) != rows*columns (4) Here, an error is not raised because the list is not flat and no element is out of range: >>> SparseMatrix(2, 2, [[1, 2]]) Matrix([ [1, 2], [0, 0]]) But adding another element to the first (and only) row will cause an error to be raised: >>> SparseMatrix(2, 2, [[1, 2, 3]]) Traceback (most recent call last): ... ValueError: The location (0, 2) is out of designated range: (1, 1) To autosize the matrix, pass None for rows: >>> SparseMatrix(None, [[1, 2, 3]]) Matrix([[1, 2, 3]]) >>> SparseMatrix(None, {(1, 1): 1, (3, 3): 3}) Matrix([ [0, 0, 0, 0], [0, 1, 0, 0], [0, 0, 0, 0], [0, 0, 0, 3]]) Values that are themselves a Matrix are automatically expanded: >>> SparseMatrix(4, 4, {(1, 1): ones(2)}) Matrix([ [0, 0, 0, 0], [0, 1, 1, 0], [0, 1, 1, 0], [0, 0, 0, 0]]) A ValueError is raised if the expanding matrix tries to overwrite a different element already present: >>> SparseMatrix(3, 3, {(0, 0): ones(2), (1, 1): 2}) Traceback (most recent call last): ... ValueError: collision at (1, 1) See Also ======== DenseMatrix MutableSparseMatrix ImmutableSparseMatrix c st|dkr"t|dtr"|dj}|dj}|d||fSit|dkr7|ddur7dd|dg}t|dkr|dd\}}||urPdurWnnd}}nd||fvratdt|dt|d}}t|dtr|d}d||fvrtd ||fddt |D}fd dt |D} |D]} | D]} || | } | j kr| | | f<qq||fSt|dt tfr3fd d } |dD]\\\}}}t|tr|D]\\} } }| || || |qqt|ttfr#j|fi|\}}D]\} } | || || | | fqqՈ |}| || |qnft|drtd d |dD }|sXj|dfi|\}}nA|d}t|||krptd t|||t |D]$} t |D]} || || } | } | j kr| | | f<qzqt|durÈ}|rtdd |Ddnd}|rtdd |Ddnd}n+D]&\} } | r| |ks| r| |krtd | | fd|dd|dq||fSt|dkrOt|dttfrO|d}d}t|D]0\} }t|ttfs|g}t|D]\} }|j kr4 || | f<q!t|t|}q|rFt|nd}|}||fStj|\}}}t |D]} t |D]} ||| | } | j krx| | | f<qbq\||fS)Nrrz*Pass rows=None and no cols for autosizing.z2{} and {} must be integers for this specification.cg|]}|qS_sympify.0iclsri/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/sympy/matrices/sparse.py z;SparseRepMatrix._handle_creation_inputs..crrr)rjrrrr r!csR|r'||fvr|||fkrtd||f|||f|||f<dSdS)Nz)There is a collision at {} for {} and {}.) ValueErrorformat)rr"v)smatrrupdatesz7SparseRepMatrix._handle_creation_inputs..updatecss|]}t|VqdSNrrrrr z:SparseRepMatrix._handle_creation_inputs..zMThe length of the flat list ({}) does not match the specified size ({} * {}).css|]\}}|VqdSr(r)rr_rrrr)r*css|]\}}|VqdSr(r)rr,crrrr)r*z?The location {} is out of the designated range[{}, {}]x[{}, {}])len isinstancer rowscolstodokr#rrr$rangerzerodictritemslisttuple_handle_creation_inputsranykeysmax enumeratesuper)rargskwargsr0r1r+r-op row_indices col_indicesrr"valuer'r%vvr,flat flat_listr;rowmat __class__)rr&rr9ks                        "  "       z'SparseRepMatrix._handle_creation_inputscCstdddd|S)Nz The private _smat attribute of SparseMatrix is deprecated. Use the .todok() method instead. z1.9z$deprecated-private-matrix-attributes)deprecated_since_versionactive_deprecations_target)rr2selfrrr_smats  zSparseRepMatrix._smatcKs(|j|dd|dt|dddS)NmethodLDL iszerofunctry_block_diagF)rQrSrT)invgetr )rOr@rrr _eval_inverses  zSparseRepMatrix._eval_inversecCsTt|stdi}|D]\}}||}|dkr |||<q||j|j|S)aXApply a function to each element of the matrix. Examples ======== >>> from sympy import SparseMatrix >>> m = SparseMatrix(2, 2, lambda i, j: i*2+j) >>> m Matrix([ [0, 1], [2, 3]]) >>> m.applyfunc(lambda i: 2*i) Matrix([ [0, 2], [4, 6]]) z`f` must be callable.r)callable TypeErrorr2r6_newr0r1)rOfdokkr%fvrrr applyfuncszSparseRepMatrix.applyfunccCsddlm}||S)z,Returns an Immutable version of this Matrix.r)ImmutableSparseMatrix) immutabler`)rOr`rrr as_immutables zSparseRepMatrix.as_immutablecCt|S)aCReturns a mutable version of this matrix. Examples ======== >>> from sympy import ImmutableMatrix >>> X = ImmutableMatrix([[1, 2], [3, 4]]) >>> Y = X.as_mutable() >>> Y[1, 1] = 5 # Can set values in Y >>> Y Matrix([ [1, 2], [3, 5]]) )MutableSparseMatrixrNrrr as_mutable$szSparseRepMatrix.as_mutablecs&fddtdddDS)aReturns a column-sorted list of non-zero elements of the matrix. Examples ======== >>> from sympy import SparseMatrix >>> a=SparseMatrix(((1, 2), (3, 4))) >>> a Matrix([ [1, 2], [3, 4]]) >>> a.CL [(0, 0, 1), (1, 0, 3), (0, 1, 2), (1, 1, 4)] See Also ======== sympy.matrices.sparse.SparseMatrix.row_list cg|] }t||fqSrr8rr]rNrrr Iz,SparseRepMatrix.col_list..cSs tt|Sr()r7reversed)r]rrrIs z*SparseRepMatrix.col_list..key)sortedr2r;rNrrNrcol_list5s&zSparseRepMatrix.col_listcCs t|S)z2Returns the number of non-zero elements in Matrix.)r.r2rNrrrnnzKs zSparseRepMatrix.nnzcs"fddttdDS)aReturns a row-sorted list of non-zero elements of the matrix. Examples ======== >>> from sympy import SparseMatrix >>> a = SparseMatrix(((1, 2), (3, 4))) >>> a Matrix([ [1, 2], [3, 4]]) >>> a.RL [(0, 0, 1), (0, 1, 2), (1, 0, 3), (1, 1, 4)] See Also ======== sympy.matrices.sparse.SparseMatrix.col_list crfrrgrhrNrrr criz,SparseRepMatrix.row_list..rl)rnr2r;r7rNrrNrrow_listOs zSparseRepMatrix.row_listcCs||S)z"Scalar element-wise multiplicationr)rOscalarrrrscalar_multiplyfszSparseRepMatrix.scalar_multiplyrRcCs|j}||j|d||S)aReturn the least-square fit to the data. By default the cholesky_solve routine is used (method='CH'); other methods of matrix inversion can be used. To find out which are available, see the docstring of the .inv() method. Examples ======== >>> from sympy import SparseMatrix, Matrix, ones >>> A = Matrix([1, 2, 3]) >>> B = Matrix([2, 3, 4]) >>> S = SparseMatrix(A.row_join(B)) >>> S Matrix([ [1, 2], [2, 3], [3, 4]]) If each line of S represent coefficients of Ax + By and x and y are [2, 3] then S*xy is: >>> r = S*Matrix([2, 3]); r Matrix([ [ 8], [13], [18]]) But let's add 1 to the middle value and then solve for the least-squares value of xy: >>> xy = S.solve_least_squares(Matrix([8, 14, 18])); xy Matrix([ [ 5/3], [10/3]]) The error is given by S*xy - r: >>> S*xy - r Matrix([ [1/3], [1/3], [1/3]]) >>> _.norm().n(2) 0.58 If a different xy is used, the norm will be higher: >>> xy += ones(2, 1)/10 >>> (S*xy - r).norm().n(2) 1.5 rQ)TrU)rOrhsrQtrrrsolve_least_squaresjs6z#SparseRepMatrix.solve_least_squarescCsD|js|j|jkr td|j|jkrtddS|j|d|S)zReturn solution to self*soln = rhs using given inversion method. For a list of possible inversion methods, see the .inv() docstring. zUnder-determined system.z]For over-determined system, M, having more rows than columns, try M.solve_least_squares(rhs).rtN) is_squarer0r1r#rUmultiply)rOrvrQrrrsolves  zSparseRepMatrix.solveNzAlternate faster representationcCrcr()r rNrrrliupczSparseRepMatrix.liupccCrcr()rrNrrrrow_structure_symbolic_choleskyr}z/SparseRepMatrix.row_structure_symbolic_choleskyTcC t||dSN) hermitian)rrOrrrrcholesky zSparseRepMatrix.choleskycCrr)rrrrrLDLdecompositionrz SparseRepMatrix.LDLdecompositioncC t||Sr()rrOrvrrrlower_triangular_solve z&SparseRepMatrix.lower_triangular_solvecCrr()rrrrrupper_triangular_solverz&SparseRepMatrix.upper_triangular_solve)rR)T)__name__ __module__ __qualname____doc__ classmethodr9propertyrPrWr_rbrerorprqrsrxr{RLCLr|r~rrrrr rrr __classcell__rrrJrrs>U     9  rc@seZdZeddZdS)rdcOs.|j|i|\}}}||||}||Sr()r9_smat_to_DomainMatrix_fromrep)rr?r@r0r1r&reprrrrZs zMutableSparseMatrix._newN)rrrrrZrrrrrdsrdN)collections.abcrsympy.core.containersrsympy.utilities.exceptionsrsympy.utilities.iterablesrsympy.utilities.miscr matrixbaser repmatrixr r utilitiesr decompositionsr rrrsolversrrrrd SparseMatrixrrrrs      <