Electronic Resource
New York, NY [u.a.]
:
Wiley-Blackwell
Numerical Linear Algebra with Applications
3 (1996), S. 221-237
ISSN:
1070-5325
Keywords:
sparse matrix
;
iterative methods
;
preconditioning
;
graph partitioning
;
domain decomposition
;
Engineering
;
Engineering General
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
Notes:
Domain decomposition methods for finite element problems using a partition based on the underlying finite element mesh have been extensively studied. In this paper, we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices. The subproblems are created with an overlapping partition of the graph corresponding to the sparsity structure of the matrix. These algebraic domain decomposition methods are especially useful for unstructured mesh problems. We also discuss some difficulties encountered in the algebraic extension, particularly the issues related to the coarse solver.
Additional Material:
4 Ill.
Type of Medium:
Electronic Resource
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
