Good Pivots for Small Sparse Matrices

Manuel Kauers; Jakob Moosbauer

Good Pivots for Small Sparse Matrices

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

For sparse matrices up to size 8x8, we determine optimal choices for pivot selection in Gaussian elimination. It turns out that theyare 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.

Original language	English
Title of host publication	Computer Algebra in Scientific Computing
Number of pages	11
Publication status	Published - Sept 2020

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101013 Mathematical logic
102031 Theoretical computer science

JKU Focus areas

Digital Transformation

Cite this

@inproceedings{15c28c1208a24a7e88b719fd96e7801c,

title = "Good Pivots for Small Sparse Matrices",

abstract = "For sparse matrices up to size 8x8, we determine optimal choices for pivot selection in Gaussian elimination. It turns out that theyare 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.",

author = "Manuel Kauers and Jakob Moosbauer",

year = "2020",

month = sep,

language = "English",

booktitle = "Computer Algebra in Scientific Computing",

}

TY - GEN

T1 - Good Pivots for Small Sparse Matrices

AU - Kauers, Manuel

AU - Moosbauer, Jakob

PY - 2020/9

Y1 - 2020/9

N2 - For sparse matrices up to size 8x8, we determine optimal choices for pivot selection in Gaussian elimination. It turns out that theyare 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.

AB - For sparse matrices up to size 8x8, we determine optimal choices for pivot selection in Gaussian elimination. It turns out that theyare 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.

M3 - Conference proceedings

BT - Computer Algebra in Scientific Computing

ER -