2009
DOI: 10.1137/060675940
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial Preconditioners for Scalar Elliptic Finite-Element Problems

Abstract: Abstract. We present a new preconditioner for linear systems arising from finite-element discretizations of scalar elliptic partial differential equations (PDE's). The solver splits the collection {Ke} of element matrices into a subset of matrices that are approximable by diagonally dominant matrices and a subset of matrices that are not approximable. The approximable Ke's are approximated by diagonally dominant matrices Le's that are assembled to form a global diagonally dominant matrix L. A combinatorial gra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 40 publications
0
1
0
Order By: Relevance
“…In a third development, Avron et al [2] have shown how to get an approximation to element stiffness matrices that is optimal up to a constant factor. In other words, for an element stiffness matrix K t they find a diagonally dominant matrixK t such κ(K t ,K t ) ≤ c 1 κ(K t , K ′ t ), where K ′ t is any other symmetric diagonally dominant matrix of the correct size and c 1 depends only on p, d. Thus, their preconditioner could lead to a faster algorithm than ours since ours is not optimal in this sense.…”
Section: Notes Added In Revisionmentioning
confidence: 99%
“…In a third development, Avron et al [2] have shown how to get an approximation to element stiffness matrices that is optimal up to a constant factor. In other words, for an element stiffness matrix K t they find a diagonally dominant matrixK t such κ(K t ,K t ) ≤ c 1 κ(K t , K ′ t ), where K ′ t is any other symmetric diagonally dominant matrix of the correct size and c 1 depends only on p, d. Thus, their preconditioner could lead to a faster algorithm than ours since ours is not optimal in this sense.…”
Section: Notes Added In Revisionmentioning
confidence: 99%