Iterative methods based on domain decomposition, with particular reference to problems of machining distortion (Q1083287)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterative methods based on domain decomposition, with particular reference to problems of machining distortion |
scientific article; zbMATH DE number 3976544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative methods based on domain decomposition, with particular reference to problems of machining distortion |
scientific article; zbMATH DE number 3976544 |
Statements
Iterative methods based on domain decomposition, with particular reference to problems of machining distortion (English)
0 references
1987
0 references
We consider some iterative methods for problems of elasticity theory based on the idea of substructuring. Suppose that the given complicated domain can be decomposed into two or more simple subdomains for which solutions are available. In contrast to customary methods of substructuring, we allow subdomains to overlap, or one to be inside another. The given domain can be formed in a rather flexible way as a union, product, or relative complement (difference) of subdomains. We study several iterative schemes of patching solutions for subdomains, to give the solution of the required problem. Convergence is established by presenting the operator of an iterative procedure as a product of two or more projectors. We then apply one of the algorithms for a problem of machining distortion as a result of residual stresses.
0 references
domain decomposition
0 references
iterative methods
0 references
substructuring
0 references
patching solutions for subdomains
0 references
Convergence
0 references
machining distortion
0 references
residual stresses
0 references