<journal article>
Finite element matrices in congruent subdomains and their effective use for large-scale computations

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
Rights
Related DOI
Related DOI
Related DOI
Related URI
Related URI
Related HDL
Relation
Abstract The structure of finite element matrices in congruent subdomains is studied. When a domain has a form of symmetries and/or periodicities, it is decomposed into a union of congruent subdomains, each of... which is an image of a reference subdomain by an affine transformation with an orthogonal matrix whose components consist of -1, 0, and 1. Stiffness matrices in subdomains are expressed by one in the reference subdomain with renumbering indices and changing signs corresponding to the orthogonal matrices. The memory requirements for a finite element solver are reduced by the domain decomposition, which is useful in large-scale computations. Reducing rates of memory requirements to store matrices are reported with examples of domains. Both applicability and limitations of the algorithm are discussed with an application to the Earth's mantle convection problem.show more

Hide fulltext details.

pdf 2003-6 pdf 651 KB 303 Preprint

Details

Record ID
Peer-Reviewed
Subject Terms
ISSN
DOI
NCID
Notes
Type
Created Date 2009.04.22
Modified Date 2024.01.10