Search from over 60,000 research works

Advanced Search

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

[thumbnail of Open Access]
Preview
Available under license: Creative Commons Attribution
[thumbnail of Rees_Scott_final.pdf]
Rees_Scott_final.pdf - Accepted Version (375kB)
Restricted to Repository staff only
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Rees, T. and Scott, J. orcid id iconORCID: 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 doi: 10.1002/nla.2103

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.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/70343
Item Type Article
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Publisher John Wiley and Sons
Download/View statistics View download statistics for this item

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar