TY - JOUR
T1 - Fast direct solution of 3-D scattering problems via nonuniform grid-based matrix compression
AU - Brick, Yaniv
AU - Boag, Amir
N1 - Funding Information: manuscript received december 10, 2010; accepted august 2, 2011. This research was supported in part by The Israel science Foundation under Grant 745/07. The authors are with the school of Electrical Engineering, Tel aviv University, Tel aviv, Israel ([email protected]). digital object Identifier 10.1109/TUFFc.2011.2098
PY - 2011/11/1
Y1 - 2011/11/1
N2 - A fast non-iterative algorithm for the solution of large 3-D acoustic scattering problems is presented. The proposed approach can be used in conjunction with the conventional boundary element discretization of the integral equations of acoustic scattering. The algorithm involves domain decomposition and uses the nonuniform grid (NG) approach for the initial compression of the interactions between each subdomain and the rest of the scatterer. These interactions, represented by the off-diagonal blocks of the boundary element method matrix, are then further compressed while constructing sets of interacting and local basis and testing functions. The compressed matrix is obtained by eliminating the local degrees of freedom through the Schur's complement-based technique procedure applied to the diagonal blocks. In the solution process, the interacting unknowns are first determined by solving the compressed system equations. Subsequently, the local degrees of freedom are determined for each subdomain. The proposed technique effectively reduces the oversampling typically needed when using low-order discretization techniques and provides significant computational savings.
AB - A fast non-iterative algorithm for the solution of large 3-D acoustic scattering problems is presented. The proposed approach can be used in conjunction with the conventional boundary element discretization of the integral equations of acoustic scattering. The algorithm involves domain decomposition and uses the nonuniform grid (NG) approach for the initial compression of the interactions between each subdomain and the rest of the scatterer. These interactions, represented by the off-diagonal blocks of the boundary element method matrix, are then further compressed while constructing sets of interacting and local basis and testing functions. The compressed matrix is obtained by eliminating the local degrees of freedom through the Schur's complement-based technique procedure applied to the diagonal blocks. In the solution process, the interacting unknowns are first determined by solving the compressed system equations. Subsequently, the local degrees of freedom are determined for each subdomain. The proposed technique effectively reduces the oversampling typically needed when using low-order discretization techniques and provides significant computational savings.
UR - http://www.scopus.com/inward/record.url?scp=81355149450&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/TUFFC.2011.2098
DO - https://doi.org/10.1109/TUFFC.2011.2098
M3 - Article
SN - 0885-3010
VL - 58
SP - 2405
EP - 2417
JO - IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
JF - IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
IS - 11
M1 - 6071059
ER -