Application of a generic domain-decomposition strategy to solve shell-like problems through 3D BE models.

Abstract

Efficient integration algorithms and solvers specially devised for boundary-element procedures have been established over the last two decades. A good deal of quadrature techniques for singular and quasisingular boundary-element integrals have been developed and reliable Krylov solvers have proven to be advantageous when compared to direct ones, also in case of non-Hermitian matrices. The former has implied in CPU-time reduction during the assembling of the system of equations and the latter in its faster solution. Here, a triangular polar co-ordinate transformation and the Telles co-ordinate transformation are employed separately and combined to develop the matrix-assembly routines (integration routines). In addition, the Jacobi-preconditioned Biconjugate Gradient solver (J-BiCG) is used along with a generic substructuring boundary element algorithm. Thus, solution CPU time and computer memory can be considerably reduced. Discontinuous boundary elements are also included to simplify the coupling of the BE models (substructures). Numerical experiments involving 3D thin-walled domains (shell-like structural elements) are carried out to show the performance of the computer code with respect to accuracy and efficiency of the system solution. Precision, CPU-time and potential applications of the BE code developed are commented upon.