A comparative study of null‐space factorizations for sparse symmetric saddle point systems
Open Access
- 6 June 2017
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 25 (1)
Abstract
Summary: Null‐space methods for solving saddle point systems of equations have long been used to transform an indefinite system into a symmetric positive definite one of smaller dimension. A number of independent works in the literature have identified that we can interpret a null‐space method as a matrix factorization. We review these findings, highlight links between them, and bring them into a unified framework. We also investigate the suitability of using null‐space factorizations to derive sparse direct methods and present numerical results for both practical and academic problems.Keywords
Funding Information
- Engineering and Physical Sciences Research Council (EP/I013067/1)
This publication has 32 references indexed in Scilit:
- PDE-constrained multispectral imaging of tissue chromophores with the equation of radiative transferBiomedical Optics Express, 2010
- Preconditioning discretizations of systems of partial differential equationsNumerical Linear Algebra with Applications, 2010
- Design of a Multicore Sparse Cholesky Factorization Using DAGsSIAM Journal on Scientific Computing, 2010
- Solution of indefinite linear systems using an LQ decomposition for the linear constraintsLinear Algebra and its Applications, 2009
- Algorithm 887ACM Transactions on Mathematical Software, 2008
- Numerically stable LDLT-factorization of F-type saddle point matricesIMA Journal of Numerical Analysis, 2008
- Numerical solution of saddle point problemsActa Numerica, 2005
- MA57---a code for the solution of sparse symmetric definite and indefinite systemsACM Transactions on Mathematical Software, 2004
- A null space algorithm for mixed finite‐element approximations of Darcy's equationCommunications in Numerical Methods in Engineering, 2002
- Newton Methods for Large-Scale Linear Equality-Constrained MinimizationSIAM Journal on Matrix Analysis and Applications, 1993