The Snap-Back Pivoting Method for Symmetric Banded Indefinite Matrices

نویسندگان

  • Dror Irony
  • Sivan Toledo
چکیده

The four existing stable factorization methods for symmetric indefinite pivoting (row or column exchanges) maintains a band structure in the reduced matrix and the factors, but destroys symmetry completely once an off-diagonal pivot is used. Two-by-two block pivoting maintains symmetry at all times, but quickly destroys the band structure. Gaussian reduction to tridiagonal also maintains symmetry but destroys the band structure. Orthogonal reductions to tridiagonal maintain both symmetry and the band structure, but are too expensive for linear-equation solvers. We propose a new pivoting method, which we call snap-back pivoting. When applied to banded symmetric matrices, it maintains the band structure (like partial pivoting does), it keeps the reduced matrix symmetric (like 2-by-2 pivoting and reductions to tridiagonal) and the factors mostly symmetric (unlike any previous method), and it is fast. In snap-back pivoting, if the next diagonal element is too small, the next pivoting step might be unsymmetric, leading to unsymmetry in the next row and column of the factors. But both the reduced matrix and the factors snap back to symmetry once the next step is completed. THURSDAY, FEBRUARY 17, 2005 4:00 PM Building 2, Room 338 Refreshments at 3:30 PM in Building 2, Room 349. Applied Math Colloquium: http://www-math.mit.edu/amc/spring05 Math Department: http://www-math.mit.edu Massachusetts Institute of Technology Department of Mathematics Cambridge, MA 02139

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Block LDL Factorizations for Symmetric Indefinite Matrices∗

We consider the block LDL factorizations for symmetric indefinite matrices in the form LBL , where L is unit lower triangular and B is block diagonal with each diagonal block having dimension 1 or 2. The stability of this factorization and its application to solving linear systems has been well-studied in the literature. In this paper we give a condition under which the LBL factorization will r...

متن کامل

A SYM-ILDL: Incomplete LDL Factorization of Symmetric Indefinite and Skew-Symmetric Matrices

SYM-ILDL is a numerical software package that computes incomplete LDLT (or ‘ILDL’) factorizations of symmetric indefinite and skew-symmetric matrices. The core of the algorithm is a Crout variant of incomplete LU (ILU), originally introduced and implemented for symmetric matrices by [Li and Saad, Crout versions of ILU factorization with pivoting for sparse symmetric matrices, Transactions on Nu...

متن کامل

Reducing the Amount of Pivoting in Symmetric Indefinite Systems

This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite linear systems can be reduced by considering innovative approaches that are different from pivoting strategies implemented in current linear algebra libraries. First a tiled algorithm where pivoting is performed within a tile is described and then an alternative to pivoting is proposed. The latt...

متن کامل

Compressed threshold pivoting for sparse symmetric indefinite systems

A key technique for controlling numerical stability in sparse direct solvers is threshold partial pivoting. When selecting a pivot, the entire candidate pivot column below the diagonal must be up-to-date and must be scanned. If the factorization is parallelized across a large number of cores, communication latencies can be the dominant computational cost. In this paper, we propose two alternati...

متن کامل

Towards a stable static pivoting strategy for the sequential and parallel solution of sparse symmetric indefinite systems

We consider the direct solution of sparse symmetric indefinite matrices. We develop new pivoting strategies that combine numerical and static pivoting. Furthermore, we propose original approaches that are designed for parallel distributed factorization. We show that our pivoting strategies are numerically robust and that the factorization is significantly faster because of this static/numerical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2006