An adaptive finite element DtN method for the elastic wave scattering by biperiodic structures

Consider the scattering of a time-harmonic elastic plane wave by a bi-periodic rigid surface. The displacement of elastic wave motion is modeled by the three-dimensional Navier equation in an unbounded domain above the surface. Based on the Dirichlet-to-Neumann (DtN) operator, which is given as an infinite series, an exact transparent boundary condition is introduced and the scattering problem is formulated equivalently into a boundary value problem in a bounded domain. An a posteriori error estimate based adaptive finite element DtN method is proposed to solve the discrete variational problem where the DtN operator is truncated into a finite number of terms. The a posteriori error estimate takes account of the finite element approximation error and the truncation error of the DtN operator which is shown to decay exponentially with respect to the truncation parameter. Numerical experiments are presented to illustrate the effectiveness of the proposed method.

Uniform error estimates for nonequispaced fast Fourier transforms

In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. So far, various window functions have been used and new window functions have recently been proposed. We present novel error estimates for NFFT with compactly supported, continuous window functions and derive rules for convenient choice from the parameters involved in NFFT. The error constant of a window function depends mainly on the oversampling factor and the truncation parameter.

Continuous window functions for NFFT

In this paper, we study the error behavior of the nonequispaced fast Fourier transform (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. Here, we consider the continuous Kaiser–Bessel, continuous exp-type, sinh-type, and continuous cosh-type window functions with the same support and same shape parameter. We present novel explicit error estimates for NFFT with such a window function and derive rules for the optimal choice of the parameters involved in NFFT. The error constant of a window function depends mainly on the oversampling factor and the truncation parameter. For the considered continuous window functions, the error constants have an exponential decay with respect to the truncation parameter.

Intensity Distribution of Partially Coherent Array Finite Airy Beams Propagating in Atmospheric Turbulence

Based on the extended Huygens–Fresnel integral and the Rytov phase structure function, the closed-form expression of a partially coherent array finite Airy beams (PCAFABs) cutting through the Kolmogorov atmospheric turbulence is derived in the space domain under the paraxial approximation. The characteristics of the PCAFABs evoluting in the atmospheric environment are investigated in detail on the basis of the derived wave propagation formulae. We mainly illustrate the intensity profile of this beam changed with the truncation parameter, coherence length, and turbulence factor at several cross sections of the atmospheric space by means of numerical figures. It is convinced that the present concept and derived conclusions will provide useful exploration for learning the optical properties of the PCAFABs transmitting in the atmospheric turbulence, especially for free-space optical communication area.

The Size‐Power Tradeoff in HAR Inference

Heteroskedasticity‐ and autocorrelation‐robust (HAR) inference in time series regression typically involves kernel estimation of the long‐run variance. Conventional wisdom holds that, for a given kernel, the choice of truncation parameter trades off a test's null rejection rate and power, and that this tradeoff differs across kernels. We formalize this intuition: using higher‐order expansions, we provide a unified size‐power frontier for both kernel and weighted orthonormal series tests using nonstandard “fixed‐ b” critical values. We also provide a frontier for the subset of these tests for which the fixed‐ b distribution is t or F. These frontiers are respectively achieved by the QS kernel and equal‐weighted periodogram. The frontiers have simple closed‐form expressions, which show that the price paid for restricting attention to tests with t and F critical values is small. The frontiers are derived for the Gaussian multivariate location model, but simulations suggest the qualitative findings extend to stochastic regressors.

An Exact Realization of a Modified Hilbert Transformation for Space-Time Methods for Parabolic Evolution Equations

We present different possibilities of realizing a modified Hilbert type transformation as it is used for Galerkin–Bubnov discretizations of space-time variational formulations for parabolic evolution equations in anisotropic Sobolev spaces of spatial order 1 and temporal order \frac{1}{2}. First, we investigate the series expansion of the definition of the modified Hilbert transformation, where the truncation parameter has to be adapted to the mesh size. Second, we introduce a new series expansion based on the Legendre chi function to calculate the corresponding matrices for piecewise polynomial functions. With this new procedure, the matrix entries for a space-time finite element method for parabolic evolution equations are computable to machine precision independently of the mesh size. Numerical results conclude this work.

DEBLURRING STUDY OF DMSP/OLS NIGHTTIME LIGHT DATA BY RTSVD

DMSP/OLS, as the earliest Nighttime light remote sensing data, has great application value and can greatly improve the data quality by solving the blurring problem existing in the data. The blur reason is analyzed, and a new algorithm of regularization truncated singular value decomposition (RTSVD) combining with Pct image luminescence frequency filtering is proposed, which can effectively eliminate the blurring phenomenon and retain the real information of the image. Firstly, considering that the luminescence frequency of the light source pixel must be higher than that of the non-light source pixel, the luminescence frequency of the pixel in the Pct image is used to exclude the non-light source pixel in the average light image, and then the truncation parameter of the regularized truncation singular value decomposition (RTSVD) is obtained by using the L curve, so as to decompose and recombine the image. The experiments show that the regularized truncation singular value decomposition method combined with Pct image luminescence frequency filtering can remove the blurring phenomenon on the basis of preserving the image information.

An Adaptive CIP-FEM for the Polygonal-Line Grating Problem

This paper is concerned with the diffraction by a polygonal-line grating. We develop a continuous interior penalty finite element method based on the truncation of the nonlocal boundary operators for solving the problem. An a posteriori error estimate is derived for the method. The truncation parameter is determined through the truncation error of the a posteriori error estimate. Numerical experiments are also presented to show the efficiency and robustness of the proposed adaptive algorithm.