Solving elliptic finite element systems in near-linear time with support preconditioners.
- Cornell University, Ithica, NY
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric diagonally dominant matrices. Our framework for defining matrix approximation is support theory. Significant graph theoretic work has already been developed in the support framework for preconditioners in the diagonally dominant case, and in particular it is known that such systems can be solved with iterative methods in nearly linear time. Thus, our approximation result implies that these graph theoretic techniques can also solve a class of finite element problems in nearly linear time. We show that the quality of our approximation, which controls the number of iterations in the preconditioned iterative solver, depends primarily on a mesh quality measure but not on the problem size or shape of the domain.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 951697
- Report Number(s):
- SAND2005-0668J; TRN: US200913%%11
- Journal Information:
- Proposed for publication in the SIAM Journal on Matrix Analysis., Journal Name: Proposed for publication in the SIAM Journal on Matrix Analysis.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers
Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers