Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems

DOI10.1137/040615614MaRDI QIDQ5470428zbMATH OpenOpenAlexFDO

Authors Michael Hagemann, Olaf Schenk

Publication date 30 May 2006

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ae16c1087e9a917bc062d0e70f2fce88a11c8fb4

zbMATH Keywords

incomplete factorizationmaximum weight matchingnumerical examplespreconditioningsymmetric indefinite matrixtridiagonal pivoting

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Recommendations

• An algorithm for symmetric indefinite linear systems
• Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
• Preconditioning highly indefinite and nonsymmetric matrices
• Preconditioners for nonsymmetric indefinite linear systems
• Numerically aware orderings for sparse symmetric indefinite linear systems

Cited in

(12)

• Matching coefficients for improved staggered bilinears
• A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
• A high performance level-block approximate LU factorization preconditioner algorithm
• Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
• A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
• Linear-time approximation for maximum weight matching
• Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. II. Interior eigenvalues
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
• Large-scale sparse inverse covariance matrix estimation
• Sparse linear least-squares problems
• JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
• A scaling algorithm for polynomial constraint satisfaction problems

Describes a project that uses

Uses Software

• Ipopt

This page was built for publication: Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470428)