网格模型PDE曲面重建中的边界曲线构造

利用偏微分方程(PDE)进行曲面拟合是计算机图形学研究领域中的常用方法,该类方法通过选取适当的边界条件来构造PDE,用PDE的解来表示几何曲面.基于网格简化方法和离散曲面测地线计算等技术,提出一种从网格模型提取PDE曲面片边界条件曲线的方法.首先,对复杂模型进行简化并分片处理;通过计算离散曲面的测地线为每个分片定义相应的PDE边界条件曲线,进而构造复杂模型的PDE拟合表面.最后,通过细分方法建立原模型的多分辨率表示.实验表明,该方法可以对具有不同几何复杂度的网格模型进行处理,产生具有细分连通性的多分辨网格模型.     

Ne同位素替代下Ne-HF碰撞截面的理论计算

采用Huxley势函数拟合QCISD(T)/ aug-cc-pVTZ计算的相互作用势能面,通过精确度较高的密耦近似方法计算了E=100 meV时,氖原子的三种同位素 ¹⁶Ne, ²⁰Ne, ³⁴Ne与HF分子碰撞系统的微分截面和分波截面.探讨了Ne的同位素替代引起的Ne-HF碰撞激发 截面的变化规律.     

On laplace continued fraction for the normal integral

The Laplace continued fraction is derived through a power series. It provides both upper bounds and lower bounds of the normal tail probability % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x), it is simple, it converges for x>0, and it is by far the best approximation for x3. The Laplace continued fraction is rederived as an extreme case of admissible bounds of the Mills' ratio, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x)/(x), in the family of ratios of two polynomials subject to a monotone decreasing absolute error. However, it is not optimal at any finite x. Convergence at the origin and local optimality of a subclass of admissible bounds are investigated. A modified continued fraction is proposed. It is the sharpest tail bound of the Mills' ratio, it has a satisfactory convergence rate for x1 and it is recommended for the entire range of x if a maximum absolute error of 10^-4 is required.The efforts of the author were supported by the NSERC of Canada.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

关于Fejer点上的一种复有理型插值的一致逼近阶

设D是一个Jordan,Г为其边界，并设Г满足Aльпер条件。本文得到了一种基于Fejer点的有理型插值算子对于f(z)∈C（Г）的一致逼近阶。     

有理逼近的一些最新进展

作为非线性逼近的一个重要特殊情形，有理函数逼近（即有理逼近）无论在实践中还是在应用中有都有重要的意义，有理逼近日益成为逼近论的一个重要和具有很强生命力的课题。近年来，在这一方面的研究成果不断涌现，其中许多都是非常有意义的。本文将对此作一个总结，特别对其中涉及我们自己的工作作一个回顾。     

等距算子的延拓、逼近及相关问题

本文介绍了等距算子从单位球面、从区域及从保距离1等条件下的各种等距廷拓问题；并介绍了(线性与非线性算子)等距算子的弱扰动、强扰动及渐近等距算子等问题．文中从历史到现状，概括了重要的研究结果，并指出了一些尚未解决的遗留问题．     

Construction of best Bregman approximations in reflexive Banach spaces

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

     

Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects

In this article algorithms are developed for nonlinear -term Courant element approximation of functions in ( ) on bounded polygonal domains in . Redundant collections of Courant elements, which are generated by multilevel nested triangulations allowing arbitrarily sharp angles, are investigated. Scalable algorithms are derived for nonlinear approximation which both capture the rate of the best approximation and provide the basis for numerical implementation. Simple thresholding criteria enable approximation of a target function to optimally high asymptotic rates which are determined and automatically achieved by the inherent smoothness of . The algorithms provide direct approximation estimates and permit utilization of the general Jackson-Bernstein machinery to characterize -term Courant element approximation in terms of a scale of smoothness spaces (-spaces) which govern the approximation rates.

     

单调全局最优化问题的凸化外逼近算法

单调优化是指目标函数与约束函数均为单调函数的全局优化问题．本文提出一种新的凸化变换方法把单调函数化为凸函数，进而把单调优化问题化为等价的凸极大或凹极小问题，然后采用Hoffman的外逼近方法来求得问题的全局最优解．我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较，通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法．