Detection of edges from spectral data: New results

We are concerned with the problem of recovering edges of piecewise smooth functions with finitely many jump discontinuities. In a series of papers, Gelb and Tadmor presented computationally simple methods for this task that are based on the conjugate Fourier series with different concentration kernels. In this article we present experimental results comparing conjugate series based methods with a new approach based on polynomial filters and suitable approximations. This new approach proves to be more accurate and stable.     

压电晶体位移特性曲线干涉自动测量方法

本文提出了压电晶体(PZT)位移物曲线自动干涉测量方法,该方法利用干涉仪把PZT的微位移量转化成干涉条纹相位变化量,通过快速傅里叶变换(FFT)方法自动复原干涉条纹中包含的相位的变化量,从而高精度地检测出PZT的位移特性曲线.根据该方法,利用CCD摄象机、图象板和干涉仪组合成一套光、机、电一体化的微位移自动测试系统,实际测量了我们研制的PZT随电压变化的位移特性曲线.实验表明,该方法原理实现简单,且能实现高精度、自动、实时和动态测量.     

An automatic integration procedure for infinite range integrals involving oscillatory kernels

Let the real functionsK(x) andL(x) be such thatM(x)=K(x)+iL(x)=e^ix g(x), whereg(x) is infinitely differentiable for all largex and is non-oscillatory at infinity. We develop an efficient automatic quadrature procedure for numerically computing the integrals _a K(t)f(t) and _a L(t)f(t)dt, where the functionf(t) is smooth and nonoscillatory at infinity. One such example for which we also provide numerical results is that for whichK(x)=J (x) andL(x)=Y (x), whereJ (x) andY (x) are the Bessel functions of order . The procedure involves the use of an automatic scheme for Fourier integrals and the modified W-transformation which is used for computing oscillatory infinite integrals.     

Effect of Fourier transform on the streaming in quantum lattice gas algorithms

All our previous quantum lattice gas algorithms for nonlinear physics have approximated the kinetic energy operator by streaming sequences to neighboring lattice sites. Here, the kinetic energy can be treated to all orders by Fourier transforming the kinetic energy operator with interlaced Dirac-based unitary collision operators. Benchmarking against exact solutions for the 1D nonlinear Schrodinger equation shows an extended range of parameters (soliton speeds and amplitudes) over the Dirac-based near-lattice-site streaming quantum algorithm.     

Fast inversion of matrices arising in image processing

In recent years, new nonlinear partial differential equation (PDE) based approaches have become popular for solving image processing problems. Although the outcome of these methods is often very promising, their actual realization is in general computationally intensive. Therefore, accurate and efficient schemes are needed. The aim of this paper is twofold. First, we will show that the three dimensional alignment problem of a histological data set of the human brain may be phrased in terms of a nonlinear PDE. Second, we will devise a fast direct solution technique for the associated structured large systems of linear equations. In addition, the potential of the derived method is demonstrated on real-life data. This revised version was published online in June 2006 with corrections to the Cover Date.     

A fourth‐order Hermitian box‐scheme with fast solver for the Poisson problem in a cube

We present a fourth‐order Hermitian box‐scheme (HB‐scheme) for the Poisson problem in a cube. A single‐nonstaggered regular grid is used supporting the discrete unknowns u and . The scheme is fourth‐order accurate for u and in norm. The fast numerical resolution uses a matrix capacitance method, resulting in a computational complexity of . Numerical results are reported on several examples including nonseparable problems. The present scheme is the extension to the three‐dimensional case of the HB‐scheme presented in Abbas and Croisille [J Sci Comp 49 (2011), 239–267]. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 609–629, 2015     

动态光谱频域提取的FFT变换精度分析

近红外光谱无创血液成分检测因其测量方法的优越性,已经成为生物医学领域的研究热点之一。但除血氧饱和度外,目前还没有进入临床应用成果的报道,其关键在于个体差异和测量条件对检测精度的影响。文章先介绍一种可以消除个体差异的新的检测方法——动态光谱法,再从其原理出发,推导出基于傅里叶变换的动态光谱频域提取法。同时,文章通过实验,研究了采样率,采样周期个数,非同步采样对(快速傅里叶变换(FFT)精度的影响。分析结果表明：选择合适的采样率,采样信号周期个数、并利用现有的加窗和插值算法能够大幅度提高动态光谱数据的精度。     

Harmonic analysis for graph refinements and the continuous graph FFT

The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.     

A kernel-free boundary integral method for elliptic boundary value problems

This paper presents a class of kernel-free boundary integral (KFBI) methods for general elliptic boundary value problems (BVPs). The boundary integral equations reformulated from the BVPs are solved iteratively with the GMRES method. During the iteration, the boundary and volume integrals involving Green’s functions are approximated by structured grid-based numerical solutions, which avoids the need to know the analytical expressions of Green’s functions. The KFBI method assumes that the larger regular domain, which embeds the original complex domain, can be easily partitioned into a hierarchy of structured grids so that fast elliptic solvers such as the fast Fourier transform (FFT) based Poisson/Helmholtz solvers or those based on geometric multigrid iterations are applicable. The structured grid-based solutions are obtained with standard finite difference method (FDM) or finite element method (FEM), where the right hand side of the resulting linear system is appropriately modified at irregular grid nodes to recover the formal accuracy of the underlying numerical scheme. Numerical results demonstrating the efficiency and accuracy of the KFBI methods are presented. It is observed that the number of GMRES iterations used by the method for solving isotropic and moderately anisotropic BVPs is independent of the sizes of the grids that are employed to approximate the boundary and volume integrals. With the standard second-order FEMs and FDMs, the KFBI method shows a second-order convergence rate in accuracy for all of the tested Dirichlet/Neumann BVPs when the anisotropy of the diffusion tensor is not too strong.