Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods

Abstract

We consider the solution of sparse linear systems using direct methods via LU factorization. Unless the matrix is positive definite, numerical pivoting is usually needed to ensure stability, which is costly to implement especially in the sparse case. The Random Butterfly Transformations (RBT) technique provides an alternative to pivoting and is easily parallelizable. The RBT transforms the original matrix into another one that can be factorized without pivoting with probability one. This approach has been successful for dense matrices; in this work, we investigate the sparse case. In particular, we address the issue of fill-in in the transformed system.

Dates and versions

hal-01205703 , version 1 (26-09-2015)

Identifiers

Cite

Marc Baboulin, Xiaoye S. Li, Rouet François-Henry. Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods. High Performance Computing for Computational Science (VECPAR 2014), Jun 2014, EUGENE (OR), United States. ⟨10.1007/978-3-319-17353-5_12⟩. ⟨hal-01205703⟩
78 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More