𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A component decomposition preconditioning for 3D stress analysis problems

✍ Scribed by M. D. Mihajlović; S. Mijalković


Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
226 KB
Volume
9
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A preconditioning methodology for an iterative solution of discrete stress analysis problems based on a space decomposition and subspace correction framework is analysed in this paper. The principle idea of our approach is a decomposition of a global discrete system into the series of subproblems each of which correspond to the different Cartesian co‐ordinates of the solution (displacement) vector. This enables us to treat the matrix subproblems in a segregated way. A host of well‐established scalar solvers can be employed for the solution of subproblems. In this paper we constrain ourselves to an approximate solution using the scalar algebraic multigrid (AMG) solver, while the subspace correction is performed either in block diagonal (Jacobi) or block lower triangular (Gauss–Seidel) fashion. The preconditioning methodology is justified theoretically for the case of the block‐diagonal preconditioner using Korn's inequality for estimating the ratio between the extremal eigenvalues of a preconditioned matrix. The effectiveness of the AMG‐based preconditioner is tested on stress analysis 3D model problems that arise in microfabrication technology. The numerical results, which are in accordance with theoretical predictions, clearly demonstrate the superiority of a component decomposition AMG preconditioner over the standard ILU preconditioner, even for the problems with a relatively small number of degrees of freedom. Copyright © 2002 John Wiley & Sons, Ltd.


📜 SIMILAR VOLUMES


Multilevel matrix decomposition algorith
✍ Juan M. Rius; Josep Parrón; Eduard Úbeda; Juan R. Mosig 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 2 views

equations, some stationary characteristics are evaluated for different phase-shifted DFB structures in the above-threshold regime, where the corrections due to spatial hole burning must be taken into account. Results show that, while presenting smaller selectivity in the near-threshold regime, the 3

An algebraic domain decomposition algori
✍ R. S. Chen; Edward K. N. Yung; C. H. Chan; D. X. Wang; J. M. Jin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract This Letter, proposes an algebraic domain decomposition algorithm (ADDA) to solve large sparse linear systems derived from the vector finite‐element method (FEM) for 3D electromagnetic field problems. The proposed method segments the problem into several smaller pieces, solves each subp