Pivoting Strategy for Fast LU decomposition of Sparse Block Matrices

článek ve sborníku ve WoS nebo Scopus

angličtina

Solving large linear systems is a fundamental task in many interesting problems, including finite element methods (FEM) or (non-)linear least squares (NLS), among others. Furthermore, the problems of interest here are sparse: not all the vertices in a typical FEM mesh are connected, or similarly not all vertices in a graphical inference model are linked by observations, as is the case in e.g. simultaneous localization and mapping (SLAM) in robotics or bundle adjustment (BA) in computer vision. The two places where most of the time is spent in solving such problems are usually the sparse matrix assembly and solving the underlying linearized system. An interesting property of the above-mentioned problems is their block structure. It is given by the variables existing in a multi-dimensional space such as 2D, 3D or even se(3) and hence their respective derivatives being dense blocks of the corresponding dimension. In our previous work, we demonstrated the benefits of explicitly representing those blocks in the sparse matrix, namely reduced assembly time and increased efficiency of arithmetic operations. In this paper, we propose a novel implementation of sparse block LU decomposition and demonstrate its benefits on standard datasets. While not difficult to implement, the enabling feature is the pivoting strategy that makes the method numerically stable. The proposed algorithm is on average three times faster (over 50x faster in the best case), causes less fill-in and produces decompositions of comparable and often better precision than the conventional methods.

LU decomposition, sparse matrix, block matrix, register blocking, direct methods.

POLOK, L.; SMRŽ, P.

23. 4. 2017

Association for Computing Machinery

Virginia Beach, VA

978-1-5108-3822-2

Proceedings of the 25th High Performance Computing Symposium

1

12

12

https://doi.org/10.22360/SpringSim.2017.HPC.049

scs17paper.pdf