A comparative study of null‐space factorizations for sparse symmetric saddle point systems

DOI10.1002/nla.2103zbMath1424.65060OpenAlexW2623278176WikidataQ114235434 ScholiaQ114235434MaRDI QIDQ4637390

Jennifer Scott, Tyrone Rees

Publication date: 18 April 2018

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2103

zbMATH Keywords

symmetric indefinite matricessaddle point systemssparse direct methodsnull-space method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

HyKKT: a hybrid direct-iterative method for solving KKT linear systems, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, Preconditioners for Krylov subspace methods: An overview, Domain-decomposition least-squares Petrov-Galerkin (DD-LSPG) nonlinear model reduction, Iterative Solution of Saddle-Point Systems from Radial Basis Function (RBF) Interpolation

Uses Software

• HSL
• MA57
• Matlab
• SuiteSparse
• CUTEst
• LUSOL