Randomized acceleration of fundamental matrix computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 215-226

  Pan, Victor Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Bit operation complexity; Block Wiedemann algorithm; Characteristic polynomial; Frobenius invariant factors; Matrix determinant; Minimum polynomial; Randomized algorithms; Smith invariant factors

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; POLYNOMIALS;

BIT-OPERATIONS; CHARACTERISTIC POLYNOMIALS; INVARIANT FACTORS; MATRIX DETERMINANT; RANDOMIZED ALGORITHMS;

MATRIX ALGEBRA;

EID: 84937390674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_17     Document Type: Conference Paper

References (23)

1. J. Abbott, M. Bronstein, T. Mulders, Fast Deterministic Computations of the Determinants of Dense Matrices, Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC’99), 197-204, ACM Press, New York, 1999.
2. D. Coppersmith, Solving Homogeneous Linear Equations over GF(2) via Block Wiedemann Algorithm, Math. Comput., 62, 205, 333-350, 1994.
3. L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, G. Vil-lard, Efficient Matrix Preconditioners for Black Box Linear Algebra, Linear Algebra and Its Applications, in press.
4. J. D. Dixon, Exact Solution of Linear Equations Using p-adic Expansions, Numerische Math., 40, 137-141, 1982.
5. W. Eberly, M. Giesbrecht, G. Villard, On Computing the Determinant and Smith Form of an Integer Matrix, Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS’ 2000), 675-685, IEEE Computer Society Press, Los Alamitos, California, 2000.
6. M. Giesbrecht, Fast Algorithms for Rational Forms for Integer Matrices, Proc. of International Symp. on Symbolic and Algebraic Computation (IS-SAC’94), 305-311, ACM Press, New York, 1994.
7. M. Giesbrecht, Fast Computation of the Smith Normal Forms of an Integer Matrix, Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC’95), 110-118, ACM Press, New York, 1995.
8. M. Giesbrecht, Fast Computation of the Smith Form of a Sparse Integer Matrix, Computational Complexity, 10, 41-69, 2001.
9. G. H. Golub, C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, Maryland, 1996(3rd edition).
10. X. Huang, V. Y. Pan, Fast Rectangular Matrix Multiplication and Applications, Journal of Complexity, 14, 257-299, 1998.
11. E. Kaltofen, On Computing Determinants of Matrices Without Divisions, Proc. Intern. Symposium on Symbolic and Algebraic Computation (IS-SAC’92), 342-349, ACM Press, New York, 1992.
12. E. Kaltofen, Analysis of Coppersmith’s Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems, Math. Comput., 62, 210, 777-806, 1995.
13. E. Kaltofen, G. Villard, On the Complexity of Computing Determinant, manuscript, August 2001, presented at 2001 AMS/IMS/SIAM Summer Research Conference on Fast Algorithms in Math., Computer Science and Engineering, S. Hadley, Mass., August 2001.
14. V. Y. Pan, Complexity of Parallel Matrix Computations, Theoretical Computer Science, 54, 65-85, 1987.
15. V. Y. Pan, Computing the Determinant and the Characteristic Polynomials of a Matrix via Solving Linear System of Equations, Information Processing Letters, 28, 71-75, 1988.
16. V. Y. Pan, Parametrization of Newton’s Iteration for Computations with Structured Matrices and Applications, Computers & Mathematics (with Applications), 24, 3, 61–75, 1992.
17. V. Y. Pan, Parallel Complexity of Computations with General and Toeplitz-like Matrices Filled with Integers and Extensions, SIAM Journal on Computing, 30, 1080–1125, 2000.
18. V. Y. Pan, Structured Matrices and Polynomials: Unified Superfast Algorithms, Birkhäuser/Springer, Boston/New York, 2001.
19. V. Y. Pan, Univariate Polynomials: Nearly Optimal Algorithms for Polynomial Factorization and Rootfinding, Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC’01), 253-266, ACM Press, New York, 2001.
20. V. Y. Pan, Y. Yu, Certification of Numerical Computation of the Sign of the Determinant of a Matrix, Algorithmica, 30, 708-724, 2001.
21. A. Storjohann, Near Optimal ALgorithms for Computing Smith Normal Forms of Integer Matrices, Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC’96), 267-274, ACM Press, New York, 1996.
22. A. Storjohann, An O(n3) Algorithm for Frobenius Normal Form, Proc. International Symposium on Symbolic and Algebraic Computation (IS-SAC’98), 101-104, ACM Press, New York, 1998.
23. G. Villard, Computing the Frobenius Normal Form of a Sparse Matrix, Proc. 3rd Intern. Workshop on Computer Algebra in Scientific Computing, 395-407, Springer, 2000.