Loading...
Please wait, while we are loading the content...
Null Space Algorithm and Spanning Trees in Solving Darcy's Equation
| Content Provider | Semantic Scholar |
|---|---|
| Author | Arioli, Mario Manzini, Gianmarco |
| Copyright Year | 2003 |
| 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 is based on the combination of a LU factorization 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 LU factorization without fill-in and on a suitable stopping criterion for the iterative solver. We experimentally investigate its performance on a realistic set of selected application problems. |
| Starting Page | 839 |
| Ending Page | 848 |
| Page Count | 10 |
| File Format | PDF HTM / HTML |
| DOI | 10.1023/B:BITN.0000014568.20710.77 |
| Volume Number | 43 |
| Alternate Webpage(s) | https://doi.org/10.1023/B%3ABITN.0000014568.20710.77 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
