passagemath-modules 10.5.46__cp310-cp310-macosx_14_0_arm64.whl → 10.6.20__cp310-cp310-macosx_14_0_arm64.whl

sage/matrix/matrix_complex_double_dense.pyx

@@ -78,7 +78,7 @@ cdef class Matrix_complex_double_dense(Matrix_double_dense):
     ``b = [5,6]``::
 
         sage: b = vector(CDF,[5,6])                                                     # needs sage.symbolic
-        sage: m.solve_right(b)  # abs tol 1e-14                                         # needs sage.symbolic
+        sage: m.solve_right(b)  # abs tol 1e-14                                         # needs scipy sage.symbolic
         (2.6666666666666665 + 0.6666666666666669*I, -0.3333333333333333 - 1.1666666666666667*I)
 
     See the methods :meth:`~.Matrix_double_dense.QR`,

sage/matrix/matrix_dense.pyx

@@ -12,7 +12,6 @@ TESTS::
 cimport sage.matrix.matrix as matrix
 
 from sage.structure.richcmp cimport richcmp_item, rich_to_bool
-from sage.calculus.functional import derivative
 import sage.matrix.matrix_space
 import sage.structure.sequence
 
@@ -116,7 +115,7 @@ cdef class Matrix_dense(matrix.Matrix):
             [1 2]
             [3 4]
 
-        ``.T`` is a convenient shortcut for the transpose::
+        :attr:`~sage.matrix.matrix2.Matrix.T` is a convenient shortcut for the transpose::
 
            sage: A.T
            [1 3]
@@ -212,7 +211,7 @@ cdef class Matrix_dense(matrix.Matrix):
                 e2 = self.get_unsafe(nrows - i - 1, ncols - j - 1)
                 self.set_unsafe(i, j, e2)
                 self.set_unsafe(nrows - i - 1, ncols - j - 1, e1)
-        if nrows % 2 == 1:
+        if nrows % 2:
             i = nrows // 2
             for j in range(ncols // 2):
                 e1 = self.get_unsafe(i, j)

sage/matrix/matrix_double_dense.pyx

@@ -1407,7 +1407,7 @@ cdef class Matrix_double_dense(Matrix_numpy_dense):
                     ev_group[location][2] = ev_group[location][0]/ev_group[location][1]
             return [(return_class(avg), m) for _, m, avg in ev_group]
 
-    def left_eigenvectors(self, other=None, *, homogeneous=False):
+    def eigenvectors_left(self, other=None, *, algorithm=None, homogeneous=False):
         r"""
         Compute the ordinary or generalized left eigenvectors of a matrix of
         double precision real or complex numbers (i.e. ``RDF`` or ``CDF``).
@@ -1418,6 +1418,10 @@ cdef class Matrix_double_dense(Matrix_numpy_dense):
           eigenvalue problem; if ``None``, an ordinary eigenvalue problem is
           solved
 
+        - ``algorithm`` (default: ``None``); for compatibility with
+          :meth:`sage.matrix.matrix2.Matrix.eigenvectors_left`, supported options
+          are ``None`` (select automatically) or ``'scipy'``
+
         - ``homogeneous`` -- boolean (default: ``False``); if ``True``, use
           homogeneous coordinates for the eigenvalues in the output
 
@@ -1539,6 +1543,8 @@ cdef class Matrix_double_dense(Matrix_numpy_dense):
             sage: spectrum
             [(1.0*I, [(1.0, 0.0)], 1), (1.0, [(0.0, 1.0)], 1)]
         """
+        if algorithm not in (None, "scipy"):
+            raise NotImplementedError(f"algorithm {algorithm} not implemented for matrix over {self.base_ring()}")
         if not self.is_square():
             raise ArithmeticError("self must be a square matrix")
         if other is not None and not other.is_square():
@@ -1567,9 +1573,9 @@ cdef class Matrix_double_dense(Matrix_numpy_dense):
             v = [CDF(e) for e in v]
         return [(v[i], [eig[i].conjugate()], 1) for i in range(len(v))]
 
-    eigenvectors_left = left_eigenvectors
+    left_eigenvectors = eigenvectors_left
 
-    def right_eigenvectors(self, other=None, *, homogeneous=False):
+    def eigenvectors_right(self, other=None, *, homogeneous=False):
         r"""
         Compute the ordinary or generalized right eigenvectors of a matrix of
         double precision real or complex numbers (i.e. ``RDF`` or ``CDF``).
@@ -1724,7 +1730,7 @@ cdef class Matrix_double_dense(Matrix_numpy_dense):
             v = [CDF(e) for e in v]
         return [(v[i], [eig[i]], 1) for i in range(len(v))]
 
-    eigenvectors_right = right_eigenvectors
+    right_eigenvectors = eigenvectors_right
 
     def _solve_right_nonsingular_square(self, B, check_rank=False):
         """
@@ -1914,7 +1920,7 @@ cdef class Matrix_double_dense(Matrix_numpy_dense):
 
         OUTPUT:
 
-        ``U, S, V`` -- immutable matrices such that ``A = U*S*V.conj().transpose()``
+        ``U, S, V`` -- immutable matrices such that ``A = U*S*V.conjugate_transpose()``
         where `U` and `V` are orthogonal and `S` is zero off of the diagonal
 
         Note that if ``self`` is m-by-n, then the dimensions of the

sage/matrix/matrix_generic_sparse.pyx

@@ -234,7 +234,7 @@ cdef class Matrix_generic_sparse(matrix_sparse.Matrix_sparse):
             self._entries = data
             self._zero = self._base_ring(0)
         else:
-            raise RuntimeError("unknown matrix version (=%s)"%version)
+            raise RuntimeError(f"unknown matrix version (={version})")
 
     ########################################################################
     # LEVEL 2 functionality