اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHelmholtz Decomposition and Boundary Element Method applied to Dynamic Linear Elastic Problems
235
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 longitudinal 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.
قيم البحث
اقرأ أيضاً
As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up t
he design space for new algorithms. Drawing from the knowledge of systems design, we derive a layout algorithm that remedies several drawbacks of the original spring layout. This new algorithm relies on the balancing of two antagonistic forces. We thus call it {em arf} for attractive and repulsive forces. It is, as we claim, particularly suited for a dynamic layout of smaller networks ($n < 10^3$). We back this claim with several application examples from on going complex systems research.
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 eleme
nt 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 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).
We introduce a new efficient algorithm for Helmholtz problems in perforated domains with the design of the scheme allowing for possibly large wavenumbers. Our method is based upon the Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) as p
roposed recently in [14]. For a regular coarse mesh with mesh size H, we establish O(H) convergence of this algorithm under the resolution assumption, and with the level parameter being sufficiently large. The performance of the algorithm is demonstrated by extensive 2-dimensional numerical tests including those motivated by photonic crystals.
The spectral renormalization method was introduced in 2005 as an effective way to compute ground states of nonlinear Schrodinger and Gross-Pitaevskii type equations. In this paper, we introduce an orthogonal spectral renormalization (OSR) method to c
ompute ground and excited states (and their respective eigenvalues) of linear and nonlinear eigenvalue problems. The implementation of the algorithm follows four simple steps: (i) reformulate the underlying eigenvalue problem as a fixed point equation, (ii) introduce a renormalization factor that controls the convergence properties of the iteration, (iii) perform a Gram-Schmidt orthogonalization process in order to prevent the iteration from converging to an unwanted mode; and (iv) compute the solution sought using a fixed-point iteration. The advantages of the OSR scheme over other known methods (such as Newtons and self-consistency) are: (i) it allows the flexibility to choose large varieties of initial guesses without diverging, (ii) easy to implement especially at higher dimensions and (iii) it can easily handle problems with complex and random potentials. The OSR method is implemented on benchmark Hermitian linear and nonlinear eigenvalue problems as well as linear and nonlinear non-Hermitian $mathcal{PT}$-symmetric models.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
