Computer Science – Numerical Analysis
Scientific paper
2004-07-09
Computer Science
Numerical Analysis
Added ref to Chen & Toledo in Section 9 Added description of how to form RHS; added ref to Wang and Sarin
Scientific paper
We consider linear systems arising from the use of the finite element method for solving scalar 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 support number bounds, which control the number of iterations in the preconditioned iterative solver, depend on mesh quality measures but not on the problem size or shape of the domain.
Boman Erik
Hendrickson Bruce
Vavasis Stephen
No associations
LandOfFree
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-164139