Accessibility navigation


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

Rees, T. and Scott, J. (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

[img]
Preview
Text (Open Access) - Published Version
· Available under License Creative Commons Attribution.
· Please see our End User Agreement before downloading.

1MB
[img] Text - Accepted Version
· Restricted to Repository staff only

375kB

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/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.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
ID Code:70343
Publisher:John Wiley and Sons

Downloads

Downloads per month over past year

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

Page navigation