Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems

DOI10.1137/040615614zbMath1111.65042OpenAlexW1976437885MaRDI QIDQ5470428

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

numerical examplespreconditioningsymmetric indefinite matrixincomplete factorizationmaximum weight matchingtridiagonal pivoting

Mathematics Subject Classification ID

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

Related Items (10)

A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners ⋮ 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 ⋮ Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ Large-scale Sparse Inverse Covariance Matrix Estimation ⋮ A high performance level-block approximate LU factorization preconditioner algorithm ⋮ A scaling algorithm for polynomial constraint satisfaction problems ⋮ JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices ⋮ A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers

Uses Software

• Ipopt

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