Finite element matrices in congruent subdomains and their effective use for large-scale computations
スポンサーリンク
概要
- 論文の詳細を見る
Kyushu University 21st Century COE Program Development of Dynamic Mathematics with High Functionality九州大学21世紀COEプログラム「機能数理学の構築と展開」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.
- Faculty of Mathematics, Kyushu Universityの論文
- 2005-01-11
Faculty of Mathematics, Kyushu University | 論文
- Generalisation of Mack's formula for claims reserving with arbitrary exponents for the variance assumption
- EDITORIAL (Czech Japanese Seminar in Applied Mathematics 2010 : Praha/Telc, September 2010)
- Symbolic-numeric hybrid optimization for plant/controller integrated design in H∞ loop-shaping design
- Weierstrass representation for semi-discrete minimal surfaces, and comparison of various discretized catenoids
- A note on the quasi-additive bound for Boolean functions