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

DOI10.1016/J.JSC.2018.06.007MaRDI QIDQ2422701zbMATH OpenOpenAlexFDO

Authors Wayne Eberly

Publication date 20 June 2019

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2018.06.007

zbMATH Keywords

algorithm selectioncomputations over finite fieldsdetection and certification of matrix propertiessparse and structured matrix computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Recommendations

• Selecting algorithms for black box matrices, checking for matrix properties that can simplify computations
• Automatic generation of fast algorithms for matrix–vector multiplication
• Simple sparse matrix multiplication algorithm
• scientific article; zbMATH DE number 749517
• Publication:4732027

Cites work

• scientific article; zbMATH DE number 1574494 (Why is no real title available?)
• scientific article; zbMATH DE number 1682655 (Why is no real title available?)
• scientific article; zbMATH DE number 3635490 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• Computing the Minimum Fill-In is NP-Complete
• Displacement ranks of matrices and linear equations
• Efficient matrix preconditioners for black box linear algebra
• Essentially optimal interactive certificates in linear algebra
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• Generalized Nested Dissection
• Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
• Linear independence oracles and applications to rectangular and low rank linear systems
• Nested Dissection of a Regular Finite Element Mesh
• Quadratic-time certificates in linear algebra
• Selecting algorithms for black box matrices, checking for matrix properties that can simplify computations
• Solving sparse linear equations over finite fields

Cited in

(2)

• Discovering faster matrix multiplication algorithms with reinforcement learning
• Selecting algorithms for black box matrices, checking for matrix properties that can simplify computations

Describes a project that uses

Uses Software

• CSparse

This page was built for publication: Automating algorithm selection: checking for matrix properties that can simplify computations

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