SearcharxivSearch

arXiv subjects

Elena Medvedeva

Publications and source records attributed to Elena Medvedeva.

2 recordsLinked to original sources

Wave scattering by a transversal defect in a discrete waveguide

We study wave scattering by a finite transversal strip in a discrete square-lattice waveguide with Dirichlet boundary conditions imposed on the strip and the waveguide walls. The setting is motivated as a discrete analogue of the classical continuous waveguide problem with a screen. The corresponding Wiener--Hopf formulation leads to an equation with a $4 \times 4$ matrix kernel, which reduces to a $2 \times 2$ matrix kernel under some symmetry assumptions. The factorisation prospects of this kernel are discussed, but this route is not followed. Instead, an exact analytical solution is obtained using the pole removal technique. This contrasts with the continuous case, where only approximate solutions are currently available. The reflection and transmission coefficients resulting from an incident duct mode are computed with an accuracy up to $10^{-13}$, showing consistency with theoretical predictions from continuous waveguide theory. In particular, full reflection and zero transmission are recovered as the frequency approaches the cut-off value for the incident mode. Finally, the solution is validated against a numerical computation of the diffraction problem via the Boundary Algebraic Equations method with a tailored lattice Green's function.

math-ph

Diffraction by a set of collinear cracks on a square lattice: an iterative Wiener-Hopf method

The diffraction of a time-harmonic plane wave on collinear finite defects in a square lattice is studied. This problem is reduced to a matrix Wiener-Hopf equation. This work adapts the recently developed iterative Wiener-Hopf method to this situation. The method was motivated by wave scattering in continuous media but it is shown here that it can also be employed in a discrete lattice setting. The numerical results are validated against a different method using discrete Green's functions. Unlike the latter approach, the complexity of the present algorithm is shown to be virtually independent of the length of the cracks.

math-ph