Nearly Optimal Algorithms for Canonical Matrix Forms
From MaRDI portal
Publication:4857589
DOI10.1137/S0097539793252687zbMath0839.65043MaRDI QIDQ4857589
Publication date: 2 June 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
complexitymatrix multiplicationFrobenius canonical formmatrix poweringrational Jordan formprocessor-efficient parallel algorithmsevaluating polynomials at matricesLas-Vegas-type probabilistic algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Canonical forms, reductions, classification (15A21)
Related Items (22)
Treating the Exceptional Cases of the MeatAxe ⋮ The shifted number system for fast linear algebra on integer matrices ⋮ Certified dense linear system solving ⋮ On the computation of minimal polynomials, cyclic vectors, and Frobenius forms ⋮ The Complexity of Diagonalization ⋮ Dynamic normal forms and dynamic characteristic polynomial ⋮ On matrix perturbations with minimal leading Jordan structure. ⋮ The module isomorphism problem reconsidered. ⋮ Efficient decomposition of separable algebras. ⋮ Efficient decomposition of associative algebras over finite fields ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Processor efficient parallel matching ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach. ⋮ Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\) ⋮ Large element orders and the characteristic of Lie-type simple groups. ⋮ Constructive recognition of classical groups in odd characteristic. ⋮ Density of normal elements ⋮ Computing Minimal Polynomials of Matrices ⋮ Finding the radical of matrix algebras using Fitting decompositions ⋮ Computing rational forms of integer matrices
This page was built for publication: Nearly Optimal Algorithms for Canonical Matrix Forms
