The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/40511
Record Status Checked
Record Id 40511
Title Null space algorithm and spanning trees in solving Darcy's equation
Abstract A Null Space algorithm is considered to solve the augmented system produced by the mixed finite element approximation of Darcy's Law. The method based on the combination of a Gaussian factorisation technique for sparse matrices with an iterative Krylov solver. The computational efficiency of the method relies on the use of spanning trees to compute the Gaussian factorization without fill-in and on a suitable stopping criterion for the iterative solver. We experimentally investigate its performance ona realistic set of selected application problems.
Organisation CCLRC , CSE , CSE-NAG
Funding Information
Related Research Object(s): 29773
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Journal Article BIT Numer Math 43 (2003): 839-848. doi:10.1023/B:BITN.0000014568.20710.77 2003