اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSommerfeld--type integrals for discrete diffraction problems
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Three problems for a discrete analogue of the Helmholtz equation are studied analytically using the plane wave decomposition and the Sommerfeld integral approach. They are: 1) the problem with a point source on an entire plane; 2) the problem of diffraction by a Dirichlet half-line; 3) the problem of diffraction by a Dirichlet right angle. It is shown that total field can be represented as an integral of an algebraic function over a contour drawn on some manifold. The latter is a torus. As the result, the explicit solutions are obtained in terms of recursive relations (for the Greens function), algebraic functions (for the half-line problem), or elliptic functions (for the right angle problem).
قيم البحث
اقرأ أيضاً
The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make the const
rained problems solvable, but also make it easy to use the existing iterative methods and preconditioning techniques to solving large-scale discrete constrained problems.
Problems with localized nonhomogeneous material properties arise frequently in many applications and are a well-known source of difficulty in numerical simulations. In certain applications (including additive manufacturing), the physics of the proble
m may be considerably more complicated in relatively small portions of the domain, requiring a significantly finer local mesh compared to elsewhere in the domain. This can make the use of a uniform mesh numerically unfeasible. While nonuniform meshes can be employed, they may be challenging to generate (particularly for regions with complex boundaries) and more difficult to precondition. The problem becomes even more prohibitive when the region requiring a finer-level mesh changes in time, requiring the introduction of refinement and derefinement techniques. To address the aforementioned challenges, we employ a technique related to the Fat boundary method as a possible alternative. We analyze the proposed methodology, from a mathematical point of view and validate our findings on two-dimensional numerical tests.
Numerical approximation of a general class of nonlinear unidirectional wave equations with a convolution-type nonlocality in space is considered. A semi-discrete numerical method based on both a uniform space discretization and the discrete convoluti
on operator is introduced to solve the Cauchy problem. The method is proved to be uniformly convergent as the mesh size goes to zero. The order of convergence for the discretization error is linear or quadratic depending on the smoothness of the convolution kernel. The discrete problem defined on the whole spatial domain is then truncated to a finite domain. Restricting the problem to a finite domain introduces a localization error and it is proved that this localization error stays below a given threshold if the finite domain is large enough. For two particular kernel functions, the numerical examples concerning solitary wave solutions illustrate the expected accuracy of the method. Our class of nonlocal wave equations includes the Benjamin-Bona-Mahony equation as a special case and the present work is inspired by the previous work of Bona, Pritchard and Scott on numerical solution of the Benjamin-Bona-Mahony equation.
A thick-restart Lanczos type algorithm is proposed for Hermitian $J$-symmetric matrices. Since Hermitian $J$-symmetric matrices possess doubly degenerate spectra or doubly multiple eigenvalues with a simple relation between the degenerate eigenvector
s, we can improve the convergence of the Lanczos algorithm by restricting the search space of the Krylov subspace to that spanned by one of each pair of the degenerate eigenvector pairs. We show that the Lanczos iteration is compatible with the $J$-symmetry, so that the subspace can be split into two subspaces that are orthogonal to each other. The proposed algorithm searches for eigenvectors in one of the two subspaces without the multiplicity. The other eigenvectors paired to them can be easily reconstructed with the simple relation from the $J$-symmetry. We test our algorithm on randomly generated small dense matrices and a sparse large matrix originating from a quantum field theory.
In this paper, we exploit the gradient flow structure of continuous-time formulations of Bayesian inference in terms of their numerical time-stepping. We focus on two particular examples, namely, the continuous-time ensemble Kalman-Bucy filter and a
particle discretisation of the Fokker-Planck equation associated to Brownian dynamics. Both formulations can lead to stiff differential equations which require special numerical methods for their efficient numerical implementation. We compare discrete gradient methods to alternative semi-implicit and other iterative implementations of the underlying Bayesian inference problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
