Delve into the future of research at MiS with our preprint repository. Our scientists are making groundbreaking discoveries and sharing their latest findings before they are published. Explore repository to stay up-to-date on the newest developments and breakthroughs.
MiS Preprint
8/2005
Why approximate $LU$ decompositions of finite element discretizations of elliptic operators can be computed with almost linear complexity
Mario Bebendorf
Abstract
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 and that it can be computed in the algebra of hierarchical matrices with almost linear complexity and with the same robustness as the classical $LU$ decomposition.
