No label defined (Q4940820)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1406967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1406967 |
Statements
27 February 2000
0 references
block matrix
0 references
penta-diagonalization
0 references
preconditioning
0 references
boundary element matrix
0 references
Lamé equations
0 references
mass matrix
0 references
Fourier series
0 references
fast Fourier transform
0 references
Cholesky decomposition
0 references
0.9121557
0 references
0.9029184
0 references
0.9009241
0 references
0.89669216
0 references
0.8894329
0 references
The subject is the boundary element matrix that arises if one discretizes a particular class of three-dimensional Dirichlet elasticity problems. The domains considered are bodies of revolution of a two-dimensional (positive) \(x,y\)-graph around \(x\)-axis, the boundary of which has a cylindric representation in the parameter domain. The Lamé equations of elasticity are discretized using a boundary element method in which the parametric domain is subdivided into rectangles of a fixed size. This leads to a mass matrix for the method that can be analysed, as was done already for the two-dimensional case, using Fourier series expansions for test- and trial functions. After a lengthy technical development, the author establishes the block structure of the matrix, where the blocks consist of subblocks that can be penta-diagonalized using a standard discrete Fourier basis. This all implies that the system of equations for determining of the boundary element solution can be solved in three steps: (1) a fast Fourier transform; (2) a direct solution step based on a Cholesky decomposition that takes into account the sparse band structure, and (3) a fast Fourier inverse transform. If the rectangles used in the discretization have dimensions \(h\) by \(Ch\), the total costs are of order \(h^{-3}\). Finally, for more general three-dimensional domains, approximation of the domains by bodies of revolution is expected to provide a good preconditioner for CG-like methods.
0 references