Computing the Frobenius Normal Form of a Sparse Matrix-Reference-Cited by-同舟云学术

Computing the Frobenius Normal Form of a Sparse Matrix

Published:2000 Issue: Volume: Page:395-407
ISSN:
Container-title:Computer Algebra in Scientific Computing
language:
Short-container-title:

Author:

Villard Gilles

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-57201-2_30.pdf

Reference22 articles.

1. D. Bini and V. Pan. Polynomial and matrix computations. Birkhäuser, 1994.

2. D.G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28(7):693–701, 1991.

3. W. Eberly. Asymptotically Efficient Algorithms for the Frobenius Form. Technical report, Department of Computer Science, University of Calgary, Canada, TR2000/649/01, may 2000.

4. W. Eberly. Black Box Frobenius Decompositions over Small Fields. In Proc. International Symposium on Symbolic and Algebraic Computation, St Andrews, Scotland, ACM Press, august 2000.

5. W. Eberly, M. Giesbrecht, and G. Villard. Computing the determinant and Smith form of an integer matrix. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. From Additive Flowers to Additive Automata Networks;Automata and Complexity;2022

3. Selecting Algorithms for Black Box Matrices;Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation;2016-07-20

4. Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix;Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation;2016-07-20

5. Symbolic Computation and Complexity Theory Transcript of My Talk;Computer Mathematics;2014