اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast Multipole Boundary Element Method for Three Dimensional Electromagnetic Scattering Problem
328
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We developed a fast numerical algorithm for solving the three dimensional vectorial Helmholtz equation that arises in electromagnetic scattering problems. The algorithm is based on electric field integral equations and is essentially a boundary element method. Nystroms quadrature rule with a triangular grid is employed to linearize the integral equations, which are then solved by using a right-preconditioned iterative method. We apply the fast multipole technique to accelerate the matrix-vector multiplications in the iterations. We demonstrate the broad applications and accuracy of this method with practical examples including dielectric, plasmonic and metallic objects. We then apply the method to investigate the plasmonic properties of a silver torus and a silver split-ring resonator under the incidence of an electromagnetic plane wave. We show the silver torus can be used as a trapping tool to bind small dielectric or metallic particles.
قيم البحث
اقرأ أيضاً
We outline the construction of compatible B-splines on 3D surfaces that satisfy the continuity requirements for electromagnetic scattering analysis with the boundary element method (method of moments). Our approach makes use of Non-Uniform Rational B
-splines to represent model geometry and compatible B-splines to approximate the surface current, and adopts the isogeometric concept in which the basis for analysis is taken directly from CAD (geometry) data. The approach allows for high-order approximations and crucially provides a direct link with CAD data structures that allows for efficient design workflows. After outlining the construction of div- and curl-conforming B-splines defined over 3D surfaces we describe their use with the electric and magnetic field integral equations using a Galerkin formulation. We use Bezier extraction to accelerate the computation of NURBS and B-spline terms and employ H-matrices to provide accelerated computations and memory reduction for the dense matrices that result from the boundary integral discretization. The method is verified using the well known Mie scattering problem posed over a perfectly electrically conducting sphere and the classic NASA almond problem. Finally, we demonstrate the ability of the approach to handle models with complex geometry directly from CAD without mesh generation.
We present a generic technique, automated by computer-algebra systems and available as open-source software cite{scuff-em}, for efficient numerical evaluation of a large family of singular and nonsingular 4-dimensional integrals over triangle-product
domains, such as those arising in the boundary-element method (BEM) of computational electromagnetism. To date, practical implementation of BEM solvers has often required the aggregation of multiple disparate integral-evaluation schemes to treat all of the distinct types of integrals needed for a given BEM formulation; in contrast, our technique allows many different types of integrals to be handled by the emph{same} algorithm and the same code implementation. Our method is a significant generalization of the Taylor--Duffy approach cite{Taylor2003,Duffy1982}, which was originally presented for just a single type of integrand; in addition to generalizing this technique to a broad class of integrands, we also achieve a significant improvement in its efficiency by showing how the emph{dimension} of the final numerical integral may often be reduced by one. In particular, if $n$ is the number of common vertices between the two triangles, in many cases we can reduce the dimension of the integral from $4-n$ to $3-n$, obtaining a closed-form analytical result for $n=3$ (the common-triangle case).
Tucker decomposition is proposed to reduce the memory requirement of the far-fields in the fast multipole method (FMM)-accelerated surface integral equation simulators. It is particularly used to compress the far-fields of FMM groups, which are store
d in three-dimensional (3-D) arrays (or tensors). The compressed tensors are then used to perform fast tensor-vector multiplications during the aggregation and disaggregation stages of the FMM. For many practical scenarios, the proposed Tucker decomposition yields a significant reduction in the far-fields memory requirement while dramatically accelerating the aggregation and disaggregation stages. For the electromagnetic scattering analysis of a 30{lambda}-diameter sphere, it reduces the memory requirement of the far-fields more than 87% while it expedites the aggregation and disaggregation stages by a factor of 15.8 and 15.2, respectively, where {lambda} is the wavelength in free space.
The displacement field for three dimensional dynamic elasticity problems in the frequency domain can be decomposed into a sum of a longitudinal and a transversal part known as a Helmholtz decomposition. The Cartesian components of both the longitudin
al and transverse fields satisfy scalar Helmholtz equations that can be solved using a desingularized boundary element method (BEM) framework. The curl free longitudinal and divergence free transversal conditions can also be cast as additional scalar Helmholtz equations. When compared to other BEM implementations, the current framework leads to smaller matrix dimensions and a simpler conceptual approach. The numerical implementation of this approach is benchmarked against the 3D elastic wave field generated by a rigid vibrating sphere embedded in an infinite linear elastic medium for which the analytical solution has been derived. Examples of focussed 3D elastic waves generated by a vibrating bowl-shaped rigid object with convex and concave surfaces are also considered. In the static zero frequency limit, the Helmholtz decomposition becomes non-unique, and both the longitudinal and transverse components contain divergent terms that are proportional to the inverse square of the frequency. However, these divergences are equal and opposite so that their sum, that is the displacement field that reflects the physics of the problem, remains finite in the zero frequency limit.
We deal with the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) preconditioner for elliptic problems discretized by the virtual element method (VEM). We extend the result of [22] to the three dimensional case. We prove polylogarithm
ic condition number bounds, independent of the number of subdomains, the mesh size, and jumps in the diffusion coefficients. Numerical experiments validate the theory
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
