.png){kind=icon}
.png){kind=icon}
Return
Constructing efficient substructure-based preconditioners for BEM systems of equations
.png){kind=icon}
OA
AI
DOI：10.1016/j.enganabound.2010.09.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, a generic substructuring algorithm is employed to construct global block-diagonal preconditioners for BEM systems of equations. In this strategy, the allowable fill-in positions are those on-diagonal block matrices corresponding to each BE subregion. As these subsystems are independently assembled, the preconditioner for a particular BE model, after the LU decomposition of all subsystem matrices, is easily formed. So as to highlight the efficiency of the preconditioning proposed, the Bi-CG solver, which presents a quite erratic convergence behavior, is considered. In the particular applications of this paper, 3D representative volume elements (RVEs) of carbon-nanotube (CNT) composites are analyzed. The models contain up to several tens of thousands of degrees of freedom. The efficiency and relevance of the preconditioning technique is also discussed in the context of developing general (parallel) BE codes. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
3D boundary-element models
Subregion-by-subregion algorithm
Krylov solvers
Substructure-based block-diagonal preconditioners
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.8K
Citations:
9.4K