HackerPapers

arXiv:2006.01623cs.SC

Good pivots for small sparse matrices

Manuel Kauers, Jakob Moosbauer

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

For sparse matrices up to size $8 \times 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.

arXiv comments
11 pages
Journal reference
DOI
doi:10.1007/978-3-030-60026-6_20
Subjects
cs.SCSymbolic Computation cs.LGMachine Learning

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2022 to Oct 2022.

Comments linking this paper, per year.

Discussed in comments1 thread

    • The authors were already working on other small-matrix optimizations. They have a 2020 preprint about choosing good pivots for up to 8x8 matrices. https://arxiv.org/abs/2006.01623

      mattkrauseView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.