A comparative study of null-space factorizations for sparse symmetric saddle point systemsRees, T. and Scott, J. ORCID: https://orcid.org/0000-0003-2130-1091 (2018) A comparative study of null-space factorizations for sparse symmetric saddle point systems. Numerical Linear Algebra with Applications, 25 (1). e2103. ISSN 1099-1506
It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing. To link to this item DOI: 10.1002/nla.2103 Abstract/SummaryNull-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.
Download Statistics DownloadsDownloads per month over past year Altmetric Deposit Details University Staff: Request a correction | Centaur Editors: Update this record |