首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
有理逼近的一些最新进展   总被引:5,自引:1,他引:5  
周颂平  虞旦盛 《数学进展》2003,32(2):141-156
作为非线性逼近的一个重要特殊情形,有理函数逼近(即有理逼近)无论在实践中还是在应用中有都有重要的意义,有理逼近日益成为逼近论的一个重要和具有很强生命力的课题。近年来,在这一方面的研究成果不断涌现,其中许多都是非常有意义的。本文将对此作一个总结,特别对其中涉及我们自己的工作作一个回顾。  相似文献   

2.
矩阵有理逼近   总被引:8,自引:0,他引:8  
本文利用Samelson逆变换得到了方阵逆阵的一个新方法,以此建立了Thiele型矩阵连分式的展开式,将Thiele定理推广到矩阵上去.首次引入了矩阵有理逼近的概念,并讨论和证明了它的特征性和唯一性.最后,给出了逼近式的余项公式.  相似文献   

3.
Starovoitov  A. P. 《Mathematical Notes》2003,74(3-4):422-424
We show that for any nonincreasing number sequence {a n} n= 0 converging to zero, there exists a continuous 2-periodic function g such that the sequence of its best uniform trigonometric rational approximations {R n (g,C 2)} n= 0 and the sequence {a n} n= 0 have the same order of decay.  相似文献   

4.
LetEbe a subspace ofC(X) and letR(E)=g/h : ghEh>0}. We make a simple, yet intriguing observation: if zero is a best approximation toffromE, then zero is a best approximation toffromR(E). We also prove that if {En} is dense inC(X) then for almost allf(in the sense of category)[formula]That extends the results of P. Borwein and S. Zhou who proved it for the case whenEnis the space of algebraic or trigonometric polynomials of degreen.  相似文献   

5.
The author constructs rational operators for the weighted uniform approximation of functions with endpoints singularities by algebraic weights in [?1,1]. New direct and converse results not possible by polynomials are proved.  相似文献   

6.
In this paper, we give some result on the simultaneous proximinal subset and simultaneous Chebyshev in the uniformly convex Banach space. Also we give relation between fixed point theory and simultaneous proximity.  相似文献   

7.
We present a survey of new results related to the investigation of the rate of convergence of Fourier sums on the classes of functions defined by convolutions whose kernels have monotone Fourier coefficients.  相似文献   

8.
设R(p)∈R[a,b]是函数f的最佳有理Lp(1≤p<∞)逼近,E(p)=‖f-R(p)‖p。本文证明了E(p)/(b-a)1/p是p单调增加且有界的函数。当f∈L时,f的最佳有理L逼近必存在。  相似文献   

9.
Approximation by weighted rationals of the form wnrn, where rn=pn/qn, pn and qn are polynomials of degree at most [αn] and [βn], respectively, and w is an admissible weight, is investigated on compact subsets of the real line for a general class of weights and given α0, β0, with α+β>0. Conditions that characterize the largest sets on which such approximation is possible are given. We apply the general theorems to Laguerre and Freud weights.  相似文献   

10.
A method is developed for constructing a convenient basis ofrational wedge functions for collocation on convex polygon boundaries.  相似文献   

11.
The problem of finding a best approximation by a rational functionto discrete data, using the l1 norm, is considered. An algorithmis developed which is frequently convergent in a finite numberof steps, and failing this usually has a second-order convergencerate. Details are given of the application of the algorithmto a number of rational approximation problems.  相似文献   

12.
Subsequent to our recent work on Fourier spectrum characterization of Hardy spaces \(H^p({\mathbb {R}})\) for the index range \(1\le p\le \infty ,\) in this paper we prove further results on rational Approximation, integral representation and Fourier spectrum characterization of functions for the Hardy spaces \(H^p({\mathbb {R}}), 0 < p\le \infty ,\) with particular interest in the index range \( 0< p \le 1.\) We show that the set of rational functions in \( H^p({\mathbb {C}}_{+1}) \) with the single pole \(-i\) is dense in \( H^p({\mathbb {C}}_{+1}) \) for \(0<p<\infty .\) Secondly, for \(0<p<1\), through rational function approximation we show that any function f in \(L^p({\mathbb {R}})\) can be decomposed into a sum \(g+h\), where g and h are, in the \(L^p({\mathbb {R}})\) convergence sense, the non-tangential boundary limits of functions in, respectively, \( H^p({\mathbb {C}}_{+1})\) and \(H^{p}({\mathbb {C}}_{-1}),\) where \(H^p({\mathbb {C}}_k)\ (k=\pm 1) \) are the Hardy spaces in the half plane \( {\mathbb {C}}_k=\{z=x+iy: ky>0\}\). We give Laplace integral representation formulas for functions in the Hardy spaces \(H^p,\) \(0<p\le 2.\) Besides one in the integral representation formula we give an alternative version of Fourier spectrum characterization for functions in the boundary Hardy spaces \(H^p\) for \(0<p\le 1\).  相似文献   

13.
14.
本文利用摄动的思想,以摄动有理曲线(曲面)的系数的无穷模作为优化目标,给出了用多项式曲线(曲面)逼近有理曲线(曲面)的一种新方法.同以前的各种方法相比,该方法不仅收敛而且具有更快的收敛速度,并且可以与细分技术相结合,得到有理曲线与曲面的整体光滑、分片多项式的逼近.  相似文献   

15.
The speeds of convergence of best rational approximations, best polynomial approximations, and the modulus of continuity on the unit disc are compared. We show that, in a Baire category sense, it is expected that subsequences of these approximants will converge at the same rate. Similar problems on the interval [−1, 1] are also examined. A problem raised by P. Turán (J. Approx. Theory29, 1980, 23-89) concerning rational approximation to non-analytically continuable ƒ on the unit circle is negated as an application.  相似文献   

16.
一类连分数的有理逼近   总被引:2,自引:0,他引:2  
设f(n)是非负函数,k,b,s_i,t_i(i=1,2,…)是正常数,研究形如[a_0,a_1,a_2…]=[■]_m~∞=0和[■]_n~∞=1的连分数有理逼近的下界.  相似文献   

17.
In this paper, the author introduces certain modided integral rational interpolations which are generallzation of T. Herman and P.Vertesi‘s rational interpolation operators and study their degre of approximation in L^pw with w(x)=(1-x^2)^(-1/2) spaces.  相似文献   

18.
Let E be a compact set in the extended complex plane C and let f be holomorphic on E. Denote by ρn the distance from f to the class of all rational functions of order at most n, measured with respect to the uniform norm on E. We obtain results characterizing the relationship between estimates of lim infn→∞ ρ1/nn and lim supn→∞ ρ1/nn.  相似文献   

19.
   Abstract. We study the approximation complexity of certain kinetic variants of the Traveling Salesman Problem (TSP) where we consider instances in which each point moves with a fixed constant speed in a fixed direction. We prove the following results: • If the points all move with the same velocity, then there is a polynomial time approximation scheme for the Kinetic TSP. • The Kinetic TSP cannot be approximated better than by a factor of 2 by a polynomial time algorithm unless P = NP, even if there are only two moving points in the instance. • The Kinetic TSP cannot be approximated better than by a factor of
by a polynomial time algorithm unless P = NP, even if the maximum velocity is bounded. n denotes the size of the input instance. The last result is especially surprising in the light of existing polynomial time approximation schemes for the static version of the problem.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号