HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01205703
Contributor : Marc Baboulin Connect in order to contact the contributor
Submitted on : Saturday, September 26, 2015 - 6:22:44 PM
Last modification on : Thursday, July 8, 2021 - 3:49:16 AM

Links full text

Identifiers

Citation

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⟩

Share

Metrics

Record views

80