Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems

Authors:
Iain S. Duff;Stéphane Pralet
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2005

Citing 0
Cited 11

A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

ACM Transactions on Mathematical Software (TOMS)
Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization

Computational Optimization and Applications
A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods

ACM Transactions on Mathematical Software (TOMS)
The design and use of a sparse direct solver for skew symmetric matrices

Journal of Computational and Applied Mathematics
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems

ACM Transactions on Mathematical Software (TOMS)
Scaling and pivoting in an out-of-core sparse direct solver

ACM Transactions on Mathematical Software (TOMS)
On a new 3D primal-mixed finite element approach for thermal stress analysis of multi-layered geometrically multiscale structures

Finite Elements in Analysis and Design
On the Block Triangular Form of Symmetric Matrices

SIAM Review
Finite-Element Preconditioning of G-NI Spectral Methods

SIAM Journal on Scientific Computing
The university of Florida sparse matrix collection

ACM Transactions on Mathematical Software (TOMS)
Pivoting strategies for tough sparse indefinite systems

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.03

Visualization

Abstract

We consider ways of implementing preordering and scaling for symmetric systems and show the effect of using this technique with a multifrontal code for sparse symmetric indefinite systems. After having presented a new method for scaling, we propose a way of using an approximation to a symmetric weighted matching to predefine $1 \times 1$ and $2 \times 2$ pivots prior to the ordering and analysis phase. We also present new classes of orderings called "(relaxed) constrained orderings" that mix structural and numerical criteria.