Preconditioning Highly Indefinite and Nonsymmetric Matrices

Authors:
Michele Benzi;John C. Haws;Miroslav Tuma
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2000

Citing 0
Cited 20

Analysis and comparison of two general sparse solvers for distributed memory computers

ACM Transactions on Mathematical Software (TOMS)
Preconditioning techniques for large linear systems: a survey

Journal of Computational Physics
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

ACM Transactions on Mathematical Software (TOMS)
Fast computational methods for locating fold points for the power flow equations

Journal of Computational and Applied Mathematics - Special Issue: Proceedings of the 10th international congress on computational and applied mathematics (ICCAM-2002)
A domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by discontinuous Galerkin methods

Journal of Computational Physics
A scaling algorithm for polynomial constraint satisfaction problems

Journal of Global Optimization
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)
A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices

Computers & Mathematics with Applications
PSPIKE: A Parallel Hybrid Sparse Linear System Solver

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A preconditioned Krylov technique for global hydrodynamic stability analysis of large-scale compressible flows

Journal of Computational Physics
Parallel algorithms for solving linear systems with sparse triangular matrices

Computing
Preconditioning Helmholtz linear systems

Applied Numerical Mathematics
Heuristics for a matrix symmetrization problem

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
A tearing-based hybrid parallel sparse linear system solver

Journal of Computational and Applied Mathematics
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers

SIAM Journal on Scientific Computing
A domain-decomposing parallel sparse linear system solver

Journal of Computational and Applied Mathematics
Improved Balanced Incomplete Factorization

SIAM Journal on Matrix Analysis and Applications
Maximum-weighted matching strategies and the application to symmetric indefinite systems

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
An auction-based weighted matching implementation on massively parallel architectures

Parallel Computing
On scalability behaviour of Monte Carlo sparse approximate inverse for matrix computations

ScalA '13 Proceedings of the Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

Standard preconditioners, like incomplete factorizations, perform well when the coefficient matrix is diagonally dominant, but often fail on general sparse matrices. We experiment with nonsymmetric permutations and scalings aimed at placing large entries on the diagonal in the context of preconditioning for general sparse matrices. The permutations and scalings are those developed by Olschowka and Neumaier [Linear Algebra Appl., 240 (1996), pp. 131--151] and by Duff and Koster [SIAM J. Matrix Anal. Appl., 20 (1999), pp. 889--901; Tech. report Ral-Tr-99-030, Rutherford Appleton Laboratory, Chilton, UK, 1999]. We target highly indefinite, nonsymmetric problems that cause difficulties for preconditioned iterative solvers. Our numerical experiments indicate that the reliability and performance of preconditioned iterative solvers are greatly enhanced by such preprocessing.