Finite element matrices in congruent subdomains and their effective use for large-scale computations
Year: 2005
Type: article
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. Copyright © 2005 John Wiley & Sons, Ltd.
DOI: 10.1002/nme.1248
Authors: Atsushi Suzuki, Masahisa Tabata
Institution: Kyushu University
Language: English
Subfield: Computational Mechanics
Field: Engineering
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2056676972
