The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 24 NO.5 / (1995))
Nearly Optimal Algorithms for Canonical Matrix Forms
Mark Giesbrecht,
Pages. 948-969
Abstract
Contents 1. Introduction
2. Finding a modular cyclic decomposition
3. Computing the invariant factors of $T$ on $V$
4. Purifying the modular decomposition
5. Computing the Frobenius form
6. A processor-efficient parallel algorithm
7. Fast evaluation of matrix functions
8. Computing the rational Jordan form
Key words Frobenius form, Jordan form, evaluating polynomials at matrices, matrix powering, matrix multiplication, processor-efficient parallel algorithms.
Mathmatical Subject Classification 15-04, 15A21, 65Y05, 65Y20