Randomized acceleration of fundamental matrix computations

DOI10.1007/3-540-45841-7_17MaRDI QIDQ4736841zbMATH OpenFDO

Authors Victor Y. Pan

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850215.htm

zbMATH Keywords

bit-operation complexityblock Wiedemann algorithmcharacteristic polynomialFrobenius invariant factorsMatrix determinantminimum polynomialrandomized algorithmsSmith invariant factors

Mathematics Subject Classification ID

Matrices of integers (15B36) Numerical linear algebra (65Fxx) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 2187725
• Randomization and the parallel solution of linear algebra problems
• Improved algorithms for computing determinants and resultants
• On the complexity of computing determinants
• Faster algorithms for the characteristic polynomial

Cited in

(9)

• Improved algorithms for computing determinants and resultants
• Randomization and the parallel solution of linear algebra problems
• The shifted number system for fast linear algebra on integer matrices
• Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
• Advancing matrix computations with randomized preprocessing
• Using randomization to make recursive matrix algorithms practical
• Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
• scientific article; zbMATH DE number 2187725 (Why is no real title available?)
• Matrix computations and polynomial root-finding with preprocessing

This page was built for publication: Randomized acceleration of fundamental matrix computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736841)