Parallel support graph preconditioners
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Power grid analysis with hierarchical support graphs
Proceedings of the International Conference on Computer-Aided Design
Faster approximate multicommodity flow using quadratically coupled flows
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the 49th Annual Design Automation Conference
A fast solver for a class of linear systems
Communications of the ACM
A matrix hyperbolic cosine algorithm and applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Size competitive meshing without large angles
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Proceedings of the International Conference on Computer-Aided Design
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.02 |
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.