On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs
SIAM Journal on Matrix Analysis and Applications
| Hi-index | 0.00 |
Although the asymptotic complexity of direct methods for the solution of large sparse finite element systems arising from second-order elliptic partial differential operators is far from being optimal, these methods are often preferred over modern iterative methods. This is mainly due to their robustness. In this article it is shown that an approximate $LU$ decomposition exists which can be computed in the algebra of hierarchical matrices with almost linear complexity and with the same robustness as the classical $LU$ decomposition. Low-precision approximations may be used for preconditioning iterative solvers. As a byproduct we prove that Schur complements of stiffness matrices can be approximated with almost linear complexity.