2004
DOI: 10.1007/978-3-540-24687-9_13
|View full text |Cite
|
Sign up to set email alerts
|

Efficiency Study of the “Black-Box” Component Decomposition Preconditioning for Discrete Stress Analysis Problems

Abstract: Abstract. Efficiency of the preconditioning methodology for an iterative solution of discrete stress analysis problems is studied in this article. The preconditioning strategy is based on space decomposition and subspace correction framework. The principle idea is to decompose a global discrete system into a sequence of scalar subproblems, corresponding to the different Cartesian coordinates of the displacement vector. The scalar subproblems can be treated by a host of direct and iterative techniques, however … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2009
2009

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Replacing the direct solver by an iterative Krylov method [21] preconditioned by the algebraic multigrid (AMG) [23] can be an alternative. However, our experience in the context of FE modelling of linear elasticity problems is that real benefits of an iterative solver become obvious when discrete problem size exceeds 10 4 degrees of freedom [15]. Thus, direct solution methods seem to be optimal in this context.…”
Section: Discussionmentioning
confidence: 99%
“…Replacing the direct solver by an iterative Krylov method [21] preconditioned by the algebraic multigrid (AMG) [23] can be an alternative. However, our experience in the context of FE modelling of linear elasticity problems is that real benefits of an iterative solver become obvious when discrete problem size exceeds 10 4 degrees of freedom [15]. Thus, direct solution methods seem to be optimal in this context.…”
Section: Discussionmentioning
confidence: 99%
“…For the example tested here, relatively high iteration counts can be attributed to a stretched domain. It is known that multigrid gradually loses its effectiveness when the domain/grid dimension in one or more coordinate directions is much larger than in the remaining directions (see [46]). † † One possible way of alleviating this problem is to limit the number of coarse levels, so that on the coarsest level the size of the system is greater than 1 (in our experiments, we coarsen to a single point).…”
Section: ])mentioning
confidence: 99%