Null space algorithm and spanning trees in solving Darcy's equation

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/29773
Record Status	Checked
Record Id	29773
Title	Null space algorithm and spanning trees in solving Darcy's equation
Contributors	M Arioli, G Manzini
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
Keywords
Funding Information
Related Research Object(s):	40511
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2002-026. 2002.		raltr-2002026.pdf	2002