曲面上离散点集的光滑插值

本文主要解决了如下问题：给定Ｒ３凸曲面上的任意个离散点｛Ｐｉ｝Ｎｉ＝１及其对应的函数值｛ｆｉ｝Ｎｉ＝１，要求构造曲面上的插值函数ｆ（ｘ），使得ｆ（Ｐｉ）＝ｆｉ，（ｉ＝１，２，…，Ｎ）．本文方法推广了球面上离散点集的Ｍｕｌｔｉｑｕａｄｒｉｃ插值方法，并且对分区域插值方法也给予了讨论．     

分形插值曲面理论及其应用*

本文叙述了分形曲面的生成原理,给出了分形插值曲面的计算公式,证明了分形插值曲面迭代函数系唯一性定理,导出了分形插值曲面的维数定理,并应用实际数据进行了分形插值曲面的实例研究。     

3-空间曲面上的一个重要向量场及相关结果

设 ｆ：Ｍ２（Ｃ）→ Ｎ３（ｃ）是 ２－维黎曼流形 Ｍ２到 ３维空间形式 Ｎ３（Ｃ）的等距浸入．找到一个由Ｍ２的第二基本形式确定的向量场 δ ，使得高斯曲率 Ｋ表为其散度 Ｋ＝ ｄｉｖ（δ）．在 Ｎ３（ｃ）＝ Ｅ３的情形，证明了ｆ可保持反定向高斯映射共形形变的充要条件是δ为闭向量场．对于可保持反定向高斯映射共形形变的曲面，本文给出了其形变象的表示公式     

矩形域上分形插值研究

该文给出了矩形域上分形插值数学模型, 分形插值曲面的计算公式, 证明了分形插值曲面迭代函数系唯一性定理, 导出了分形插值曲面的维数定理,并应用实际数据进行了分形插值曲面的实例研究. 为工程中长期寻求的粗糙表面模拟提供了理论基础和实用方法.     

关于3维欧氏空间中一族嵌入极小曲面的一个注记

本文证明了在 Ｄ． Ｈｏｆｆｍａｎ和 Ｗ．Ｈ． Ｍｅｅｋｓ， Ⅲ［４］给出的 ３维欧氏空间的一族嵌入极小曲面中，每一个曲面与其自身的和曲面是平凡的极小核心．     

复杂外形设计中的C^1,C^2样条插值曲面

根据几种复杂外形设计的特点，木文构造了三角形域上Ｓ１２样条插值曲面，三角形域上的Ｃ２超限插值曲面，矩形参数域上Ｃ２超限插值曲面和任意四边形域上双三次Ｃ１，Ｃ２样条插值曲面，给出了一类有效的边界条件确定方法．同时，算法皆已应用到人体外形描述和飞机外形设计中．     

在某些正则区域上的多元B形式曲面

本文首先通过在多面体区域上抬高维数的技巧给出了多元Ｂ形式中曲面的一般性定义．由此我们构造了平行四边形域上、正六边形域上和正八边形成上Ｂ形式的同次曲面格式，并给出了其基函数的递推公式和求导公式．同时我们也给出了正六边形域上插值角点的Ｂ形式同次曲面的表示式．     

第1边界条件下的n次插值曲面

提出了第1边界条件下n次插值曲面的概念,利用Lingo建模语言设计了第1边界条件下n次插值曲面的Lingo程序,并通过Excel软件得到了第1边界条件下n次插值曲面的具体表达式,运用第1边界条件下n次插值曲面,可以得到二维离散型随机变量的幂指插值形式分布律,通过一个实例给出了二维离散型总体的极大似然估计量的求法.     

几种基于散乱数据拟合的局部插值方法

本文首先针对散乱数据拟合的Shepard方法,结合截断多项式、B样条基函数和指数函数来构造其权函数,使新的权函数具有更高的光滑度和更好的衰减性,并且其光滑性和衰减性可以根据实际需要自由调节,从而提高了曲面的拟合质量．同时还给出一种类似的局部插值方法．另外,本文还基于多重二次插值,结合多元样条的思想,给出了两个局部插值算法．该算法较好地继承了多重二次插值曲面的性质,从而保证了拟合曲面具有好地光顺性和拟合精度．曲面整体也具有较高的光滑性．     

THE CLOSED CURVES ON POSITIVE-TYPE HYPERSURFACES AND THE PERIODS OF NONLINEAR OSCILLATIONS

本文在Ｒｎ＋１中定义了一类超曲面并讨论了其上闭测地线长度的下界以及Ｈａｍｉｌｔｏｎ系统的周期解的最小周期，这类超曲面比星形超曲面广泛，因而本文结论包含了文献〔１〕、〔２〕、〔３〕中的相应结论     

Closed fractal interpolation surfaces

Based on the construction of bivariate fractal interpolation surfaces, we introduce closed spherical fractal interpolation surfaces. The interpolation takes place in spherical coordinates and with the transformation to Cartesian coordinates a closed surface arises. We give conditions for this construction to be valid and state some useful relations about the Hausdorff and the Box counting dimension of the closed surface.     

Using 3D Animation Techniques to Help with the Experimental Design and Analysis Phase of a Visual Interactive Simulation Project

This paper describes an interactive 3D animation approach that may help with the investigation, understanding and interpretation of results for a Visual Interactive Simulation (VIS) project. The method uses a graphics algorithm to draw on a computer screen ‘3D contour maps’ which show the response of a simulation model to changes in its input parameters. A previous paper showed that it is possible for a neural network to learn the response of a simulation. This paper shows that the speed of response of a neural network can be exploited so that 3D animation sequences of the simulation's results can be produced. It is possible to rotate the ‘3D contour map’, zoom, pan, or generally view the projection from different perspectives. Two example problems are described. The paper suggests that this approach can further improve the quality of VIS by being able to give comprehensive graphic 3D sensitivity analyses to the original problem under investigation.     

An Improved Linearity-Preserving Cell-Centered Scheme for Nonlinear Diffusion Problems on General Meshes

In this paper, we suggest a new vertex interpolation algorithm to improve an existing cell-centered finite volume scheme for nonlinear diffusion problems on general meshes. The new vertex interpolation algorithm is derived by applying a special limit procedure to the well-known MPFA-O method. Since the MPFA-O method for 3D cases has been addressed in some studies, the new vertex interpolation algorithm can be extended to 3D cases naturally. More interesting is that the solvability of the corresponding local system is proved under some assumptions. Additionally, we modify the edge flux approximation by an edge-based discretization of diffusion coefficient, and thus the improved scheme is free of the so-called numerical heat-barrier issue suffered by many existing cell-centered or hybrid schemes. The final scheme allows arbitrary continuous or discontinuous diffusion coefficients and can be applicable to arbitrary star-shaped polygonal meshes. A second-order convergence rate for the approximate solution and a first-order accuracy for the flux are observed in numerical experiments. In the comparative experiments with some existing vertex interpolation algorithms, the new algorithm shows obvious improvement on highly distorted meshes.     

Fast surface reconstruction and hole filling using positive definite radial basis functions

Surface reconstruction from large unorganized data sets is very challenging, especially if the data present undesired holes. This is usually the case when the data come from laser scanner 3D acquisitions or if they represent damaged objects to be restored. An attractive field of research focuses on situations in which these holes are too geometrically and topologically complex to fill using triangulation algorithms. In this work a local approach to surface reconstruction from point-clouds based on positive definite Radial Basis Functions (RBF) is presented that progressively fills the holes by expanding the neighbouring information. The method is based on the algorithm introduced in [7] which has been successfully tested for the smooth multivariate interpolation of large scattered data sets. The local nature of the algorithm allows for real time handling of large amounts of data, since the computation is limited to suitable small areas, thus avoiding the critical efficiency problem involved in RBF multivariate interpolation. Several tests on simulated and real data sets demonstrate the efficiency and the quality of the reconstructions obtained using the proposed algorithm. AMS subject classification 65D17, 65D05, 65Y20     

A generalised Q.D. algorithm

A generalised Q.D. algorithm for rational interpolation is presented. The algorithm reduces essentially to the Q.D. algorithm for Pade´approximation if the interpolation points are confluent.     

求解三维高次拉格朗日有限元方程的代数多重网格法

本文针对带有间断系数的三维椭圆问题，讨论任意四面体剖分下的二次拉格朗日有限元方程的代数多重网格法．通过分析线性和高次有限元空间之间的关系，我们给出了一种新的网格粗化算法和构造提升算子的代数途径．进一步，我们还对新的代数多重网格法给出了收敛性分析．数值实验表明这种代数多重网格法对求解二次拉格朗日有限元方程是健壮和有效的。     

非协调区域分解Lagrange乘子法的超收敛

本文讨论分析非协调区域分解Ｌａｇｒａｎｇｅ乘子法对二阶椭圆型方程Ｄｉｒｉｃｈｌｅｔ问题的有限元超收敛现象。文中通过利用积分恒等式，适宜地引进Ｌ２投影过渡以及高次插值后处理等技巧，经过一系列误差分析及估计，得到了高出半阶的超收敛结果，实现了非协调区域分解法与高精度算法的结合。     

轴对称弹性动力学问题的重构核插值法

重构核插值法是近年来提出的一种新型无网格方法.该方法的形函数具有点插值性和高阶光滑性,不仅能够直接施加本质边界条件,而且能保证较高的计算精度.为了更有效地求解三维轴对称弹性动力学问题,对重构核插值法(reproducing kernel interpolation method, RKIM)应用于此类问题进行了研究,并发展了相应的数值模拟方法.由于几何形状和边界条件的轴对称性,计算时只需要横截面上离散节点的信息,因而前处理变得简单.采用Newmark-β法进行了时域积分.数值算例表明,轴对称弹性动力学分析的重构核插值法既有无网格方法的优势,又有较高的计算精度.     

Curvature-Based Real-Time NURBS Surface Interpolator with Look-Ahead ACC/DEC Control

Real-time parametric surface interpolation is very useful in high-performance machining. A curvature-based NURBS surface interpolator with look-ahead acceleration/deceleration (ACC/DEC) control has been developed. The cutter contact (CC) paths are planned through iso-parametric line method. The CC feedrate profile is optimized using global flexible control strategy and local adaptive ACC/DEC optimization strategy according to the look-ahead algorithm. The real-time surface interpolation algorithm was programmed on Windows XP platform. The stability and efficiency of the proposed interpolation method were verified by a NURBS curve and a NURBS surface. It is shown that the proposed parametric interpolation algorithm can satisfy the high speed and high precision requirements of high-speed CNC systems.     

Hilbert spaces of analytic functions,inverse scattering and operator models.II

This is the second and final part of a paper which appeared in a preceding issue of this journal. Herein the methods developed in the earlier sections of this paper are used first, in conjunction with some ideas of Krein, to develop models for simple, closed symmetric [resp. isometric]operators with finite and equal deficiency indices. A number of other related issues and applications are then discussed briefly. These include entropy inequalities, interpolation, parametrization ofJ inner matrices, the Schur algorithm and canonical equations. Finally, a list of misprints for Part I is incorporated at the end.