Nearly Optimal Algorithms for Canonical Matrix Forms
From MaRDI portal
Recommendations
Cited in
(40)- A simple algorithm for computing canonical forms
- The rational canonical form of a matrix
- Density of normal elements
- Finding the radical of matrix algebras using Fitting decompositions
- On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
- A new algorithm for the computation of canonical forms of matrices over fields
- Fast parallel algorithms for matrix reduction to normal forms
- On matrix perturbations with minimal leading Jordan structure.
- Efficient decomposition of separable algebras.
- Computing rational forms of integer matrices
- Efficient decomposition of associative algebras over finite fields
- Counting invariant subspaces and decompositions of additive polynomials
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- The shifted number system for fast linear algebra on integer matrices
- Processor efficient parallel matching
- Certified dense linear system solving
- scientific article; zbMATH DE number 1574494 (Why is no real title available?)
- Computing minimal polynomials of matrices
- scientific article; zbMATH DE number 149364 (Why is no real title available?)
- scientific article; zbMATH DE number 1256647 (Why is no real title available?)
- scientific article; zbMATH DE number 1263430 (Why is no real title available?)
- Subquadratic-time factoring of polynomials over finite fields
- Treating the Exceptional Cases of the MeatAxe
- The module isomorphism problem reconsidered.
- Computing the combinatorial canonical form of a layered mixed matrix
- A canonical form for positive definite matrices
- Nearly optimal computations with structured matrices
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach.
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- The Complexity of Diagonalization
- Dynamic normal forms and dynamic characteristic polynomial
- Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
- Complex matrix inversion via real matrix inversions
- Relative densities of formal languages
- The identity problem in the special affine group of \(\mathbb{Z}^2\)
- Termination of triangular polynomial loops
- Computing Krylov iterates in the time of matrix multiplication
- Large element orders and the characteristic of Lie-type simple groups.
- Constructive recognition of classical groups in odd characteristic.
- Efficient computation of a canonical form for a matrix with the generalized P-property
This page was built for publication: Nearly Optimal Algorithms for Canonical Matrix Forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857589)
