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
Reports (Research Report) Year : 2014

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.
Fichier principal
Vignette du fichier
RR-8481.pdf (475.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00950612 , version 1 (25-02-2014)

Identifiers

  • HAL Id : hal-00950612 , version 1

Cite

Marc Baboulin, Xiaoye S. Li, François-Henry Rouet. Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods. [Research Report] RR-8481, Inria. 2014. ⟨hal-00950612⟩
449 View
298 Download

Share

Gmail Facebook X LinkedIn More