For sparse matrices up to size 8 × 8, we determine optimal choices for pivot selection in Gaussian elimination. It turns out that they are slightly better than the pivots chosen by a popular pivot selection strategy, so there is some room for improvement. We then create a pivot selection strategy using machine learning and find that it indeed leads to a small improvement compared to the classical strategy.
CITATION STYLE
Kauers, M., & Moosbauer, J. (2020). Good Pivots for Small Sparse Matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12291 LNCS, pp. 358–367). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-60026-6_20
Mendeley helps you to discover research relevant for your work.