Nearly Optimal Algorithms for Canonical Matrix Forms
DOI10.1137/S0097539793252687zbMATH Open0839.65043MaRDI QIDQ4857589FDOQ4857589
Authors: Mark Giesbrecht 
Publication date: 2 June 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
complexitymatrix multiplicationFrobenius canonical formmatrix poweringrational Jordan formprocessor-efficient parallel algorithmsevaluating polynomials at matricesLas-Vegas-type probabilistic algorithm
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21)
Cited In (32)
- The rational canonical form of a matrix
- A canonical form for positive definite matrices
- Counting invariant subspaces and decompositions of additive polynomials
- Constructive recognition of classical groups in odd characteristic.
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- Large element orders and the characteristic of Lie-type simple groups.
- Density of normal elements
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach.
- On matrix perturbations with minimal leading Jordan structure.
- Efficient decomposition of associative algebras over finite fields
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Processor efficient parallel matching
- Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
- Efficient computation of a canonical form for a matrix with the generalized P-property
- The Complexity of Diagonalization
- The module isomorphism problem reconsidered.
- The shifted number system for fast linear algebra on integer matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the radical of matrix algebras using Fitting decompositions
- Certified dense linear system solving
- Efficient decomposition of separable algebras.
- Complex matrix inversion via real matrix inversions
- Dynamic normal forms and dynamic characteristic polynomial
- Computing rational forms of integer matrices
- Subquadratic-time factoring of polynomials over finite fields
- A simple algorithm for computing canonical forms
- Nearly optimal computations with structured matrices
- On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
- Treating the Exceptional Cases of the MeatAxe
- Computing minimal polynomials of matrices
- Computing the combinatorial canonical form of a layered mixed matrix
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)
