加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

二元矩阵值分叉连分式插值的矩阵算法

本文给出了一个计算二元矩阵分叉连分式插值的系数算法以及与此算法等价的矩阵算法,这种算法是用矩阵广义逆意义下定义的矩阵行、列初等变换而给出的．     

Measurement of rail cross-section with solid-state sensor arrays

The application of light sectioning to the accurate measurement of a rail cross-section, from a train moving at high speed, is described. The intensity distribution through the thickness of the illuminating light sheet is deliberately graded, allowing the shape of the object to be recovered more accurately by interpolation of the sampled image. Rail profiles are extracted with a definition approximately ten-times better than that of the sampled image.     

Fast evaluation of Helmholtz potential on graphics processing units (GPUs)

This paper presents a parallel algorithm implemented on graphics processing units (GPUs) for rapidly evaluating spatial convolutions between the Helmholtz potential and a large-scale source distribution. The algorithm implements a non-uniform grid interpolation method (NGIM), which uses amplitude and phase compensation and spatial interpolation from a sparse grid to compute the field outside a source domain. NGIM reduces the computational time cost of the direct field evaluation at N observers due to N co-located sources from O(N²) to O(N) in the static and low-frequency regimes, to O(N log N) in the high-frequency regime, and between these costs in the mixed-frequency regime. Memory requirements scale as O(N) in all frequency regimes. Several important differences between CPU and GPU implementations of the NGIM are required to result in optimal performance on respective platforms. In particular, in the CPU implementations all operations, where possible, are pre-computed and stored in memory in a preprocessing stage. This reduces the computational time but significantly increases the memory consumption. In the GPU implementations, where handling memory often is a critical bottle neck, several special memory handling techniques are used to accelerate the computations. A significant latency of the GPU global memory access is hidden by implementing coalesced reading, which requires arranging many array elements in contiguous parts of memory. Contrary to the CPU version, most of the steps in the GPU implementations are executed on-fly and only necessary arrays are kept in memory. This results in significantly reduced memory consumption, increased problem size N that can be handled, and reduced computational time on GPUs. The obtained GPU–CPU speed-up ratios are from 150 to 400 depending on the required accuracy and problem size. The presented method and its CPU and GPU implementations can find important applications in various fields of physics and engineering.     

基于广义逆矩阵的Bézier曲线近似合并

Bézier曲线近似合并算法在几何数据压缩方面有着重要的应用.研究了两条相邻Bézier曲线近似合并的问题,用矩阵的形式给出了相邻Bézier曲线可精确合并的条件,并在此基础上通过广义逆矩阵的方法求解合并逼近后的Bézier曲线.同时,对保端点插值条件的近似合并也给出了结果.最后用实例说明了算法的有效性,得到了很好的逼近效果.     

On an Embedding Criterion for Interpolation Spaces and Application to Indefinite Spectral Problems

An embedding criterion for interpolation spaces is formulated and applied to the study of the Riesz basis property in the L _2,g space of eigenfunctions of an indefinite Sturm–Liouville problem u=gu on the interval (-1,1) with the Dirichlet boundary conditions, provided that the function g(x) changes sign at the origin. In particular, the basis property criterion is established for an odd g(x). Some connections with stability in interpolation scales are discussed.     

A Generalization of the Hilbert Basis Theorem

A generalization of the Hilbert basis theorem in the geometric setting is proposed. It asserts that, for any well-describable (in a certain sense) family of polynomials, there exists a number C such that if P is an everywhere dense (in a certain sense) subfamily of this family, a is an arbitrary point, and the first C polynomials in any sequence from P vanish at the point a, then all polynomials from P vanish at a.     

论光滑粒子流体动力学(SPH)方法

“光滑粒子流体动力学(SPH-SmoothedParticleHydrodynamics)”是近20多年来发展起来的一种新的纯Lagrange方法.SPH是一种质点方法,有点类似质点网格法,但根本的不同点在于SPH方法中计算空间导数时不需要使用任何网格,而被插值公式中的解析微分式子所替代,从而避免了高维拉氏差分网格法中网格缠结和扭曲等最令人头痛的问题.这种方法另一个突出的优点是表现在对缺乏对称性和内含真空的三维系统的计算特别有效.因为利用网格建立的所有传统的差分方法,随着网格数目的增加,到了三维情形变得难以招架,真空区域的网格剖分造成内存储量的大量浪费又实在令人可惜,而SPH恰能克服上述的缺点.本论文重点介绍了该方法的理论基础和SPH执行过程等有关问题.     

矩形域上散乱数据多元最优插值的误差估计及其超收敛性（Ⅰ）──带连续边界条件

本文我们讨论了矩形域上带连续边界条件的一类多元散乱数据最优插值。给出了某些情形插值的误差估计，误差估计表明在某些点上还具有超收敛性。     

Effect of the stagnation temperature on supersonic flow parameters: Application for air in nozzles

When the stagnation temperature of a perfect gas increases, the specific heats and their ratio do not remain constant any more and start to vary with this temperature. The gas remains perfect and its state equation always remains valid, except it will be called a calorically imperfect gas. The aim of this research is to develop the relations of the necessary thermodynamics and geometrical ratios and to study the supersonic flow at high temperature (lower than the threshold of dissociation). The results are found by the resolution of nonlinear algebraic equations and integration of complex analytical functions where the exact calculation is impossible. The dichotomy method is used to solve the nonlinear equation, and the Simpson algorithm is used for the numerical integration of the found integrals. A condensation of the nodes is used, since the functions to be integrated have a high gradient at the extremity of the interval of integration. A comparison is made with a calorifcally perfect gas to determine the error of this. An application is made for air in a supersonic nozzle. The text was submitted by the authors in English.