| An O(n3) algorithm for the Frobenius normal form |
| Full text |
Pdf
(206 KB)
|
| Source
|
International Conference on Symbolic and Algebraic Computation
archive
Proceedings of the 1998 international symposium on Symbolic and algebraic computation
table of contents
Rostock, Germany
Pages: 101 - 105
Year of Publication: 1998
ISBN:1-58113-002-3
|
|
Author
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 18, Downloads (12 Months): 120, Citation Count: 8
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
AUGOT, D., AND CAMION, P. Frobenius form and cyclic vectors. C.-R.-Acad.-Sci.-Paris-Ser.-I-Math. 318, 2 (1994), 183-188.
|
| |
2
|
BAUR, W., AND STRASSEN, V. The complexity of partial derivatives. Theoretical Computer Science 22, 3 (1983), 317--330.
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
LUNEBURG, H. On Rational Normal Form of Endomorphisms: a Primer to Constructive Algebra. Wissenschaftsverlag, Mannheim, 1987.
|
| |
7
|
NEWMAN, M. Integral Matrices. Academic Press, 1972.
|
| |
8
|
OZELLO, P. Calcul Exact Des Formes De Jordan et de Frobenius d'une Matrice. PhD thesis, Universit~ Scientifique Technologique et Medicale de Grenoble, 1987.
|
| |
9
|
|
| |
10
|
STORJoHANN, A. Computing Hermite and Smith normal forms of triangular integer matrices. Linear Algebra and its Applications (1998). To appear.
|
|