Rough terrain profiling using digital image correlation

Road profiling is an important aspect of vehicle dynamics simulations especially over rough terrains. The accurate measurement of rough terrains allows for more accurate multi body simulations. Three dimensional road profiles are usually performed by utilising a line scan sensor which measures several points lateral to the road. The sensors range from simple road following wheels to LiDAR sensors. The obtained line scans are longitudinally stitched together using the orientation and position of the sensor to obtain a full three dimensional road profile. The sensor’s position and orientation therefore needs to be accurately determined in order to combine the line scans to create an accurate representation of the terrain. The sensor’s position and orientation is normally measured using an expensive inertial measurement unit or Inertial Navigation System (INS) with high sensitivity, low noise and low drift. This paper proposes a road profiling technique which utilises stereography, based on two inexpensive digital cameras, to obtain three-dimensional measurements of the road. The system negates the use of an expensive INS system to determine orientation and position. The data sets also require subsampling which can be computationally expensive. A simple subsampling routine is presented which takes advantage of the structure of the data sets to significantly speed up the process.     

Multilinear forms and measures of dependence between random variables

Based on an idea of Rosenblatt, the methods of interpolation theory are used to establish moment inequalities and equivalence relations for measures of dependence between two or more families of random variables. A couple of “interpolation” theorems proved here appear to be new.     

待定系数法在三角函数积分计算中的应用

运用复分析方法,首次给出了一类由三角函数、指数函数与幂函数乘积的线性组合产生的函数在某个区间上恒为零的充分必要条件证明,建立了此类函数积分计算的理论基础,结合微分和线性代数思想,系统讨论了待定系数法在一类含有三角函数的积分计算中的应用.     

Error and stability analysis of numerical solution for the time fractional nonlinear Schrödinger equation on scattered data of general‐shaped domains

In present work, a kind of spectral meshless radial point interpolation (SMRPI) technique is applied to the time fractional nonlinear Schrödinger equation in regular and irregular domains. The applied approach is based on erudite combination of meshless methods and spectral collocation techniques. The point interpolation method with the help of radial basis functions is used to construct shape functions which play as basis functions in the frame of SMRPI. It is proved the scheme is unconditionally stable with respect to the time variable in and also convergent by the order of convergence , . In the current work, the thin plate spline are used as the basis functions and to eliminate the nonlinearity, a simple predictor‐corrector (P‐C) scheme is performed. It is shown that the SMRPI solution, as a complex function, is suitable one for the time fractional nonlinear Schrödinger equation. The results of numerical experiments are compared to analytical solutions to confirm the reliable treatment of these stable solutions. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1043–1069, 2017     

A fast numerical method for harmonic equation based on natural boundary integral

Based on the coupling of the natural boundary integral method and the finite elements method, we mainly investigate the numerical solution of Neumann problem of harmonic equation in an exterior elliptic. Using our trigonometric wavelets and Galerkin method, there obtained stiffness matrix is symmetrical and circulant, which lead us to a fast numerical method based on fast Fourier transform. Furthermore, we do not need to compute the entries of the stiffness matrix. On the other hand, we prove that the numerical solution possesses exponential convergence rate. Especially, examples state that our method still has good accuracy for small j when the solution u ₀(θ) is almost singular.     

Small perturbations of polynomial meshes

We show that the property of being a (weakly) admissible mesh for multivariate polynomials is preserved by small perturbations on real and complex Markov compacts. Applications are given to smooth transformations of polynomial meshes and to polynomial interpolation.     

On some aspects of multivariate polynomial interpolation

The purpose of this paper is to present some aspects of multivariate Hermite polynomial interpolation. We do not focus on algebraic considerations, combinatoric and geometric aspects, but on explicitation of formulas for uniform and non-uniform bivariate interpolation and some higher dimensional problems. The concepts of similar and equivalent interpolation schemes are introduced and some differential aspects related to them are also investigated. This revised version was published online in June 2006 with corrections to the Cover Date.     

Approximation Constants in Equidistant Lagrange Interpolation

In this paper we present a new limit relation for the equidistant Lagrange interpolation polynomials to |x|, (0, 1] on the internal [–1, 1]. The result extends a well-known result of D. L. Berman and S. M. Losinskii. Furthermore, we briefly discuss on a possible connection of the limit relation to another prominent constant in best uniform polynomial approximation for |x| - the so-called Bernstein constant.     

Anisotropic norms of dirichlet kernels and some other trigonometric polynomials

In the paper new estimates of anisotropic norms for trigonometric polynomials are obtained. Translated fromMatematischeskie Zametki, Vol. 67, No. 5, pp. 686–701, May, 2000.     

Newton-Thiele's rational interpolants

It is well known that Newton's interpolation polynomial is based on divided differences which produce useful intermediate results and allow one to compute the polynomial recursively. Thiele's interpolating continued fraction is aimed at building a rational function which interpolates the given support points. It is interesting to notice that Newton's interpolation polynomials and Thiele's interpolating continued fractions can be incorporated in tensor‐product‐like manner to yield four kinds of bivariate interpolation schemes. Among them are classical bivariate Newton's interpolation polynomials which are purely linear interpolants, branched continued fractions which are purely nonlinear interpolants and have been studied by Chaffy, Cuyt and Verdonk, Kuchminska, Siemaszko and many other authors, and Thiele-Newton's bivariate interpolating continued fractions which are investigated in another paper by one of the authors. In this paper, emphasis is put on the study of Newton-Thiele's bivariate rational interpolants. By introducing so‐called blending differences which look partially like divided differences and partially like inverse differences, we give a recursive algorithm accompanied with a numerical example. Moreover, we bring out the error estimation and discuss the limiting case. This revised version was published online in June 2006 with corrections to the Cover Date.