Reliable Krylov-based algorithms for matrix null space and rank

DOI10.1145/1005285.1005305MaRDI QIDQ4657312zbMATH OpenOpenAlexFDO

Authors Wayne Eberly

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005305

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• The numerical rank of Krylov matrices
• Efficient recursive least squares solver for rank-deficient matrices
• scientific article; zbMATH DE number 1350351
• scientific article; zbMATH DE number 1070443
• Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
• Rank and null space calculations using matrix decomposition without column interchanges
• Krylov methods for low-rank regularization
• Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
• The rational Krylov algorithm for nonlinear matrix eigenvalue problems
• scientific article; zbMATH DE number 16954

Cited in

(10)

• The numerical rank of Krylov matrices
• scientific article; zbMATH DE number 1676636 (Why is no real title available?)
• Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
• A block Wiedemann rank algorithm
• Algorithm 933
• scientific article; zbMATH DE number 1253981 (Why is no real title available?)
• scientific article; zbMATH DE number 2151185 (Why is no real title available?)
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• A reliable block Lanczos algorithm over small finite fields
• Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields

This page was built for publication: Reliable Krylov-based algorithms for matrix null space and rank

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