2021-06-11 17:48:51 +0100 | received badge | ● Famous Question (source) |
2021-06-11 17:48:51 +0100 | received badge | ● Notable Question (source) |
2021-06-11 17:48:51 +0100 | received badge | ● Popular Question (source) |
2018-11-22 18:17:30 +0100 | received badge | ● Editor (source) |
2018-11-22 18:17:02 +0100 | asked a question | Eigenvectors of matrices over finite fields Hi. Is there a command which computes the eigenvectors of matrices over finite fields (if it exists). The eigenvalue command does compute the eigenvalues of the matrix but the eigenvectors_right() gives an error. Is there a workaround for this problem. Thanks in advance. |
2018-06-03 18:56:18 +0100 | asked a question | Elementary divisors of a matrix Hi, I need to compute elementary divisors of a matrix (xI-A), where A is a matrix defined over GF(2). So, i try to define a univariate polynomial ring (R) over GF(2) and compute the elementary divisors of (xI-A) using the elementary_divisors() procedure. But as the size of the matrix increases, the algorithm is too slow. My matrices are of dimension 100. Can anyone suggest an alternative approach to solve the problem. |
2018-01-19 06:45:10 +0100 | received badge | ● Student (source) |
2018-01-18 16:05:08 +0100 | asked a question | Regarding rational canonical form/frobenius form of matrices over finite fields Hi, The sagemath documentation on linear algebra describes a function frobenius which computes the frobenius normal form (rational canonical form) of a matrix over integers. The same command doesnt work on matrices over finite fields. Can someone help me to find the frobenius form of matrices over finite fields Sample code : A = matrix(GF(2),[[1,0,0],[0,0,1],[1,1,0]]) A.frobenius() This code gives the error 'sage.matrix.matrix_mod2_dense.Matrix_mod2_dense' object has no attribute 'frobenius' |