arXiv 0705.09332007-05math.RAcs.DS

Computing Minimal Polynomials of Matrices

Max Neunhoeffer, Cheryl E. Praeger

英文摘要：

We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We compare features of the algorithm with several other algorithms in the literature. In addition we present a deterministic verification procedure which is similarly efficient in most cases but has a worst-case complexity of $O(n^4)$. Finally, we report the results of practical experiments with an implementation of our algorithms in comparison with the current algorithms in the {\sf GAP} library.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An explicit expression for the minimal polynomial of the Kronecker product of matrices. Explicit formulas for matrix logarithm and matrix exponential

Using $\mathcal{P}$-canonical forms of matrices, we derive the minimal polynomial of the Kronecker product of a given family of matrices in terms of the minimal polynomials of these matrices. This, allows us to prove that the product $\prod\limits_{i=1}^{m}L(P_{i})$, $L(P_{i})$ is the set of linear recurrence sequences over a field $F$ with characteristic polynomial $P_{i}$, is equal to $L(P)$ where $P$ is the minimal polynomial of the Kronecker product of the companion matrices of $P_{i}$, $1\leq i\leq m$. Also, we show how we deduce from the $\mathcal{P}$-canonical form of an arbitrary compl…

2021-09-30math.RA

Minimal generating sets for matrix monoids

In this paper, we determine minimal generating sets for several well-known monoids of matrices over semirings. In particular, we find minimal generating sets for the monoids consisting of: all $n\times n$ boolean matrices when $n\leq 8$; the $n\times n$ boolean matrices containing the identity matrix (the reflexive boolean matrices) when $n\leq 7$; the $n\times n$ boolean matrices containing a permutation (the Hall matrices) when $n \leq 8$; the upper, and lower, triangular boolean matrices of every dimension; the $2 \times 2$ matrices over the semiring $\mathbb{N} \cup \{-\infty\}$ with addit…

2021-08-10math.RA

四元数矩阵左特征值的计算

Computing Left Eigenvalues of Quaternion Matrices

本文提出基于牛顿法的实用方法，用于计算四元数矩阵的左特征值，通过嵌入实数/复数线性代数内核，实现任意大小矩阵的可重复计算，并检测多重球面分量和非通用现象。

2026-02-02math.RA

计算公共特征向量与同时三角化

Computing Common Eigenvectors and Simultaneous Triangulation

本文提出计算有限方阵集合公共特征向量的高效算法，并据此判定矩阵能否同时三角化，且在可行时构造相应基。

2023-08-17math.RA

保持非负单项矩阵的多项式

Polynomials that preserve nonnegative monomial matrices

本文证明了保持固定阶非负矩阵类的多项式必要条件对非负单项矩阵类是充要的，并提供了计算单项矩阵任意幂次及其多项式的公式。

2024-01-03math.RA

Defining Relations of Minimal Degree of the Trace Algebra of $3 \times 3$ Matrices

The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2. The defining relations between the generators are found for n=2 and any d and for n=3, d=2 only. Starting with the generating set of C(3,d) given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C(3,d) is equal to 7 for any d>2. We have determined all relations of minimal degree. For d=3 we have also…

2007-01-22math.RA

更多相关论文收起更多论文

Polynomial identities for matrices over the Grassmann algebra

We determine minimal Cayley--Hamilton and Capelli identities for matrices over a Grassmann algebra of finite rank. For minimal standard identities, we give lower and upper bounds on the degree. These results improve on upper bounds given by L.\ Márki, J.\ Meyer, J.\ Szigeti, and L.\ van Wyk in a recent paper.

2016-05-10math.RA

多个矩阵的 O(3)-不变量的极小生成集与分离集

Minimal generating and separating sets for O(3)-invariants of several matrices

本文在正交群情形下，针对特征异于2的无限域上的多种矩阵不变量代数，找到了极小分离集，并给出了三个3×3对称矩阵正交不变量代数的极小生成集。

2023-10-23math.ACmath.RA

矩阵的最小次数中心多项式

Central polynomials of minimal degree for matrices

Institute of Mathematics and Informatics Bulgarian Academy of Sciences（保加利亚科学院数学与信息学研究所）

探讨寻找低次中心多项式的方法，证明4×4矩阵代数不存在次数≤12的二元中心多项式，计算副产品是该代数也不存在次数≤12的二元多项式恒等式

2026-07-07math.RA

A simultaneous decomposition of five real quaternion matrices with applications

In this paper, we construct a simultaneous decomposition of five real quaternion matrices in which three of them have the same column numbers, meanwhile three of them have the same row numbers. Using the simultaneous matrix decomposition, we derive the maximal and minimal ranks of some real quaternion matrices expressions. We also show how to choose the variable real quaternion matrices such that the real quaternion matrix expressions achieve their maximal and minimal ranks. As an application, we give a solvability condition and the general solution to the real quaternion matrix equation $BXD+…

2013-06-21math.RA

通过 Jordan-Krylov 基计算矩阵广义特征空间的精确算法

Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Jordan-Krylov Basis

提出一种基于最小零化多项式与 Jordan-Krylov 基的精确算法，用于计算整数或有理数矩阵的广义特征空间，并以 Jordan 链形式输出特征向量分量为特征值的多项式。

2025-09-14cs.SCmath.ACmath.RA

极小Prüfer-Dress环与幂等矩阵的乘积

Minimal Prüfer-Dress rings and products of idempotent matrices

该研究探讨极小Dress环的结构性质，证明部分域上的极小Dress环为赋值或Bézout整环，刻画了$\mathbb{R}(X)$上极小Dress环的元素与理想，并研究其上2×2幂等矩阵乘积问题。

2018-11-22math.ACmath.RA

计算Toeplitz矩阵行列式的一种快速初等算法

A fast elementary algorithm for computing the determinant of toeplitz matrices

Zirve University（Zirve大学）

提出一种基于伴随矩阵幂的初等证明方法，实现Toeplitz矩阵行列式的快速计算，复杂度为O(k^2 log n + k^3)。

2012-05-29cs.NAmath.NAmath.RA

A presentation of the trace algebra of three 3x3 matrices

The trace algebra C_{nd} is generated by all traces of products of d generic n x n matrices. Minimal generating sets of C_{nd} and their defining relations are known for n < 3 and n = 3, d=2. This paper states a minimal generating set and their defining relations for n=d=3. Furthermore the computations yield a description of C_{33} as a free module over the ring generated by a homogeneous system of parameters.

2011-04-05math.ACmath.RA

Separating invariants for 2x2 matrices

A minimal separating set is found for the algebra of matrix invariants of several 2x2 matrices over an infinite field of arbitrary characteristic

2017-11-18math.RAmath.RT