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

DOI10.1023/B:BITN.0000014568.20710.77zbMath1046.65017OpenAlexW2078286454MaRDI QIDQ1431636

Gianmarco Manzini, Mario Arioli

Publication date: 11 June 2004

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:bitn.0000014568.20710.77

zbMATH Keywords

numerical examplesDarcy's lawmixed finite elementssparse matricesaugmented systems\(LU\) factorizationiterative Krylov solvernull space algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix ⋮ A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ Splitting extrapolation algorithms for solving the boundary integral equations of anisotropic Darcy's equation on polygons by mechanical quadrature methods ⋮ Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic

Uses Software

• Triangle