Memory and operations count scaling of coupled finite‐element and boundary‐element systems of equations

Publisher Website
Google Scholar
Abstract
Memory and operations count scaling for the solution of coupled finite‐element and boundary‐element systems of equations is considered. Three algebraic approaches for solving the hybrid set of equations are studied using both direct and iterative matrix methods. Results show that once the matrix solution technique is chosen, a single hybrid algebra emerges as a clear favourite. Interestingly, the most computationally attractive hybrid algebra under assumptions of direct solution becomes the least desirable approach when iterative methods are applied. The analysis has been carried out using a range of mesh‐dependent parameters which have been empirically derived through practical experience; however, the scaling expressions presented are valid for any mesh once these critical parameters have been determined.

This publication has 12 references indexed in Scilit: