اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدModelling Arbitrary Complex Dielectric Properties -- an automated implementation for gprMax
68
0
0.0
(
0
)
نشر من قبل
Sylwia Majchrowska Ms.
تاريخ النشر
2021
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
There is a need to accurately simulate materials with complex electromagnetic properties when modelling Ground Penetrating Radar (GPR), as many objects encountered with GPR contain water, e.g. soils, curing concrete, and water-filled pipes. One of widely-used open-source software that simulates electromagnetic wave propagation is gprMax. It uses Yees algorithm to solve Maxwells equations with the Finite-Difference Time-Domain (FDTD) method. A significant drawback of the FDTD method is the limited ability to model materials with dispersive properties, currently narrowed to specific set of relaxation mechanisms, namely multi-Debye, Drude and Lorentz media. Consequently, modelling any arbitrary complex material should be done by approximating it as a combination of these functions. This paper describes work carried out as part of the Google Summer of Code (GSoC) programme 2021 to develop a new module within gprMax that can be used to simulate complex dispersive materials using multi-Debye expansions in an automatic manner. The module is capable of modelling Havriliak-Negami, Cole-Cole, Cole-Davidson, Jonscher, Complex-Refractive Index Models, and indeed any arbitrary dispersive material with real and imaginary permittivity specified by the user.
قيم البحث
اقرأ أيضاً
A new shock-tracking technique that avoids re-meshing the computational grid around the moving shock-front was recently proposed by the authors [1]. This paper describes further algorithmic improvements which make the extrapolated Discontinuity Track
ing Technique (eDIT) capable of dealing with complex shock-topologies featuring shock-shock and shock-wall interactions. Various test-cases are included to describe the key features of the methodology and prove its order-of-convergence properties.
In this paper, we study a multi-scale deep neural network (MscaleDNN) as a meshless numerical method for computing oscillatory Stokes flows in complex domains. The MscaleDNN employs a multi-scale structure in the design of its DNN using radial scalin
gs to convert the approximation of high frequency components of the highly oscillatory Stokes solution to one of lower frequencies. The MscaleDNN solution to the Stokes problem is obtained by minimizing a loss function in terms of L2 normof the residual of the Stokes equation. Three forms of loss functions are investigated based on vorticity-velocity-pressure, velocity-stress-pressure, and velocity-gradient of velocity-pressure formulations of the Stokes equation. We first conduct a systematic study of the MscaleDNN methods with various loss functions on the Kovasznay flow in comparison with normal fully connected DNNs. Then, Stokes flows with highly oscillatory solutions in a 2-D domain with six randomly placed holes are simulated by the MscaleDNN. The results show that MscaleDNN has faster convergence and consistent error decays in the simulation of Kovasznay flow for all four tested loss functions. More importantly, the MscaleDNN is capable of learning highly oscillatory solutions when the normal DNNs fail to converge.
Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and area proje
ctions. If the system is discretized onto a regular array, Fast Fourier techniques can speed up the resulting calculations but if high spatial resolution is required the initial step of discretization can limit performance; at other times the discretized methods result in unacceptable artifacts in the resulting transform. An alternative approach is to calculate the full Fourier integral transform of a polygonal area as a sum over the vertices, which has previously been derived in the literature using the divergence theorem to reduce the problem from a 3-dimensional to line integrals over the perimeter of the polygon surface elements, and converted to a sum over the straight segments of that contour. We demonstrate a software implementation of this algorithm and show that it can provide accurate approximations of the Fourier transform of real shapes with faster convergence than a block-based (voxel) discretization.
In this work we present an adaptive boundary element method for computing the electromagnetic response of wave interactions in hyperbolic metamaterials. One unique feature of hyperbolic metamaterial is the strongly directional wave in its propagating
cone, which induces sharp transition for the solution of the integral equation across the cone boundary when wave starts to decay or grow exponentially. In order to avoid a global refined mesh over the whole boundary, we employ a two-level a posteriori error estimator and an adaptive mesh refinement procedure to resolve the singularity locally for the solution of the integral equation. Such an adaptive procedure allows for the reduction of the degree of freedom significantly for the integral equation solver while achieving desired accuracy for the solution. In addition, to resolve the fast transition of the fundamental solution and its derivatives accurately across the propagation cone boundary, adaptive numerical quadrature rules are applied to evaluate the integrals for the stiff matrices. Finally, in order to formulate the integral equations over the boundary, we also derive the limits of layer potentials and their derivatives in the hyperbolic media when the target points approach the boundary.
Image registration has played an important role in image processing problems, especially in medical imaging applications. It is well known that when the deformation is large, many variational models cannot ensure diffeomorphism. In this paper, we pro
pose a new registration model based on an optimal control relaxation constraint for large deformation images, which can theoretically guarantee that the registration mapping is diffeomorphic. We present an analysis of optimal control relaxation for indirectly seeking the diffeomorphic transformation of Jacobian determinant equation and its registration applications, including the construction of diffeomorphic transformation as a special space. We also provide an existence result for the control increment optimization problem in the proposed diffeomorphic image registration model with an optimal control relaxation. Furthermore, a fast iterative scheme based on the augmented Lagrangian multipliers method (ALMM) is analyzed to solve the control increment optimization problem, and a convergence analysis is followed. Finally, a grid unfolding indicator is given, and a robust solving algorithm for using the deformation correction and backtrack strategy is proposed to guarantee that the solution is diffeomorphic. Numerical experiments show that the registration model we proposed can not only get a diffeomorphic mapping when the deformation is large, but also achieves the state-of-the-art performance in quantitative evaluations in comparing with other classical models.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
