Preconditioners for singular black box matrices

DOI10.1145/1073884.1073930MaRDI QIDQ5262782zbMATH OpenOpenAlexFDO

Authors William J. Turner

Publication date 16 July 2015

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

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

zbMATH Keywords

black box linear algebrarank preconditionersingular linear systemswitching networkToeplitz matrixWiedemann method

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient matrix preconditioners for black box linear algebra
• Optimal rank matrix algebras preconditioners
• Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields
• A black box at the end of the rainbow: searching for the perfect preconditioner
• Additive preconditioning for matrix computations

Cited in

(2)

• Efficient matrix preconditioners for black box linear algebra
• Black box methods for least squares problems

This page was built for publication: Preconditioners for singular black box matrices

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