A Rational Basis for Function Approximation

A method is developed for constructing a convenient basis ofrational wedge functions for collocation on convex polygon boundaries.     

多元周期函数的一类逼近及逼近阶估计

本文讨论了多元周期函数的一类逼近,得到一个稠密性的充要条件并构造出适当的逼近函数,给出了逼近阶的精确估计．     

极大值函数的一类光滑逼近函数的性质研究

针对极大值函数的一类光滑逼近——凝聚函数,对其作进一步研究.指出凝聚函数的一阶导数对光滑参数取极限时恰好得到极大值函数的一个次梯度,从而凝聚函数不仅可以一致逼近极大值函数,而且该函数富含极大值函数的一阶信息,可很好的刻画极大值函数的一阶特征.进一步,对光滑逼近函数的光滑参数做简单分析,得到的结果揭示了光滑参数的变动对凝聚函数的影响.并分别以正值函数及绝对值函数为例,对所得到的结果给出几何说明.     

Pole-Based Approximation of the Fermi-Dirac Function

Two approaches for the efficient rational approximation of the Fermi-Dirac function are discussed： one uses the contour integral representation and conformal real〉 ping, and the other is based on a version of the multipole representation of the Fermi-Dirac function that uses only simple poles. Both representations have logarithmic computational complexity. They are of great interest for electronic structure calculations.     

Saddlepoint Approximation for the Distribution Function Near the Mean

We repair numerical difficulties in applying saddlepoint tail probability approximations when the ordinate at which the approximation is evaluated is near the mean of the distribution approximated. These modifications apply to double saddlepoint approximations to conditional distributions as well.     

二元函数空间上线性算子的逼近定理

本文利用Gonska方法,研究二元函数空间上线性算子的逼近性质,建立Korovkin型量化定理及其逆定理.     

Reconstruction of Function Fields

For k an algebraic closure of the finite field , ℓ prime distinct from p and X a surface over k, we prove that the field of rational functions k(X) can be recovered from the maximal pro-ℓ-quotient of its absolute Galois group – in fact already from the second central descending series quotient of . Submitted: July 2004, Revision: October 2005, Final revision: February 2008, Accepted: February 2008     

威布尔更新函数的一个精确近似式

威布尔分布的更新函数有许多应用,如产品质保政策分析、维修决策优化和备件需求预测。威布尔更新函数没有解析表达式,这给求解各种涉及更新函数的优化问题带来不便。已有的威布尔更新函数近似式有一个共同的问题:其精度随威布尔形状参数的增大而减小。为克服这个问题,本文提出一个新的近似式,对于大的威布尔形状参数(>3.65),其相对误差比已有近似式的相对误差小得多。一个维修政策优化的数例例证其精确性和有用性。     

一类利用函数偶的联合最佳逼近

In this note, the author discusses the problem of best simultaneous approximation by function pairs. The existence and characterization theorems of the best simultaneous approximation in L₁ and L_∞ norms are obtained respectively, and some rezults of [ 1 ] are the special case of the theorems of the paper.     

About Approximation Numbers in Function Spaces

Sharp estimates for the approximation numbers of embeddings between the function spacesB^s_pqandF^s_pqon domains are given in a case not thoroughly studied by Edmunds and Triebel. Corresponding sharp estimates are also obtained for the counterparts of that case in the weighted function space setting.     

关于随机函数的Weierstrass逼近定理

定义了随机系数多项式的概念之后,将函数的Weierstrass逼近定理推广到了随机函数上.     

模糊系统的函数逼近特性研究

模糊系统的函数逼近理论是模糊系统理论的一个重要支柱。自从Ｗａｎｇ（１９９２）首先基于一类特殊系统,提出这一理论以来,很多学者作了进一步的研究。本文提出了一类较为一般的模糊系统,圾限覆盖定理,对这一理论,提出了一种新的并且简单护理一,通过对一般模糊系统的分析研究,指出了模糊系统在函数逼近方面的本质特性及局限性。     

Muntz Rational Approximation for Special Function Classes in Orlicz Spaces

Using the method of construction,with the help of inequalities,we research the Muntz rational approximation of two kinds of special function classes,and give the corresponding estimates of approximation rates of these classes under widely conditions.Because of the Orlicz Spaces is bigger than continuous function space and the Lp space,so the results of this paper has a certain expansion significance.     

求解Bratu型方程的径向基函数逼近法

基于径向基函数可以逼近几乎所有函数的强大逼近功能,借鉴弹塑性静力学的处理方法,提出位移、速度、加速度联合插值的径向基函数表达式,结合MATLAB数值软件进行计算机编程,成功求解了Bratu型强非线性方程,并给出相应的相对误差.通过分析几种典型的算例,并将计算结果与一些现有的数值分析法得到的数值解进行对比,表明了该方法的可行性和精确性,为求解强非线性Bratu型方程提供了一种新思路.     

A Kind of Best Approximation Using Function Pairs

This paper discusses the minimization problem: For a Given n-dimensional subspace K and a function f of C(X), find a function pair (p_1,p_2)\in K x K, p_1 \geq f \geq p_2 such that $||p_1-p_2||=[\mathop {\mathop {\inf }\limits_{({q_1},{q_2}) \in K \times K} }\limits_{{p_1} \ge f \ge {q_2}} ||{q_1} - {q_2}||\]$ We call such a pair(p_1, p_2) (if any) a best approximation pair to f from K. This paper has proved a characterization theorem for best L_1 approximation pairs which says that (p_1,p_2) is a best L_1 approximation pair if and only if p_1 and p_2 are respectively an upper sided and a lower sided best L_1 approximation to f. With the provisos that K is a Haar subspace and thet 1\in K it turns out that the above conclusion of the characterization theorem for best L_\infty approximation pairs is also true. However we have further established, without the provisos at all, a “complete” characterization theorem for best L_\infty approximation pairs. Furthermore, sufficient conditions for uniqueness of best L_\infty approximation pairs are also given.     

关于二元函数的三角插值逼近

本文以两组不同的节点构造了一个组合型的二元三角插值多项式算子Lmn(f;x,y),并且研究了二元连续周期函数对这个算子的收敛性及收敛阶的估计等问题。     

A Rational Basis for Function Approximation: II. Curved Sides

Geometric arguments provide a basis for piecewise rational approximationover collections of regions of the type used in finite-elementstudies. The approximation is continous over the collectionof regions and the rational basis functions provide a basisfor linear functions over each element. Conic sides are analysed,and an alternative to isoparametric co-ordinates is described.     

Approximation by Partial Sums of Fourier Series and the Best Approximation of Certain Function Classes

Continuing investigations of S. A. Telyakovskii, S. B. Stechkin, A. I. Stepanets and R. M. Trigub, the author studies two questions about approximation of the class of periodic functions with a bounded -derivative by polynomials in the spaces C and L.First, the asymptotics of approximation by partial sums of Fourier series has been found without limitations for the decreasing order of . Second, the exact decreasing order of the best approximation of the class has been found. New examples are also given.     

Best Fourier Approximation and Application in Efficient Blurred Signal Reconstruction

We expand upon the known results on sharp linear Fourier methods of approximation where the approximation is the best in terms of both rate and constant among all polynomial procedures of approximation. So far these results have been studied due to their mathematical beauty rather than their practical importance. In this paper we show that they are the core mathematics underlying best statistical methods of solving noisy ill-posed problems. In particular, we suggest a procedure for recovery of noisy blurred signals based on samples of small sizes where a traditional statistics concludes that the complexity of such a setting makes the problem not worthy of a further study. Thus, we present a problem where a combination of the classical approximation theory and statistics leads to interesting practical results.