Selecting Algorithms for Black Box Matrices

DOI10.1145/2930889.2930894zbMath1365.65125arXiv1607.04499OpenAlexW2505689930MaRDI QIDQ2985829

Wayne Eberly

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.04499

zbMATH Keywords

algorithmpreconditioningcertificatessparse and structured matricesblack box matrix computationsselection of algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Algorithms with automatic result verification (65G20) Preconditioners for iterative methods (65F08)

Related Items (1)

Automating algorithm selection: checking for matrix properties that can simplify computations

This page was built for publication: Selecting Algorithms for Black Box Matrices