Iterative techniques for the solution of the algebraic equations associated with the direct boundary element analysis (BEA) method are discussed. Continuum structural response analysis problems are considered, employing single‐ and multi‐zone boundary element models with and without zone condensation. The impact on convergence rate and computer resource requirements associated with the sparse and blocked matrices, resulting in multi‐zone BEA, is studied. Both conjugate gradient and generalized minimum residual preconditioned iterative solvers are applied for these problems and the performance of these algorithms is reported. Included is a quantification of the impact of the preconditioning utilized to render the boundary element matrices solvable by the respective iterative methods in a time competitive with direct methods. To characterize the potential of these iterative techniques, we discuss accuracy, storage and timing statistics in comparison with analogous information from direct, sparse blocked matrix factorization procedures. Matrix populations that experience block fill‐in during the direct decomposition process are included. With different degrees of preconditioning, iterative equation solving is shown to be competitive with direct methods for the problems considered.
|Original language||English (US)|
|Number of pages||26|
|Journal||International Journal for Numerical Methods in Engineering|
|State||Published - Jun 1991|
ASJC Scopus subject areas
- Numerical Analysis
- Applied Mathematics