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

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

关于二层规划的逼近问题

下层问题以上层决策变量作为参数,而上层是以下层问题的最优值作为响应 的一类最优化问题——二层规划问题。我们给出了由一系列此类二层规划去逼近原二层规划的逼近法,得到了这种逼近的一些有趣的结果.     

有理逼近的一些最新进展

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

二次及三次Hermite-Padé逼近中的几个问题

给出了二次Hermite-Pad啨逼近的对偶性.证明了三次Hermite-Pad啨逼近的局部唯一性,并对其逼近阶进行估计.     

指数函数的二次Padé逼近的构造

本文通过e- x的Padé逼近构造e- x的一般二次Padé逼近.     

高维代数多项式逼近与a.e.逼近的一些结果

自Korovkin的文[1]问世以来,有关线性正算子逼近的各种工作一直是颇受逼近论界关注的研究课题,如[2]～[4]等分别考虑了连续函数,L~p空间及随机函数的正算子逼近.然而在一元逼近中,由积分核引出的卷积与形式卷积型算子却占有极为重要的地位,这不仅因为已经有较多具体的积分核能方便地用于误差估计;特别,还有一些如Timan定理那样     

局部凸空间的余逼近

研究了在局部凸空间中的ｆ－余逼近和强ｆ－余逼近的一些性质．     

B—样条逼近曲线的应用

引进了一种构造曲线的逼近技术，它放松了曲线应包含所有数据点这一严格要求。为了度量一曲线能逼近已给数据多边形的好坏，使用了移动控制点的概念。     

Haar锥逼近的交错定理及其在系数有界逼近中的应用

本文首先推广了Ｐ．Ｐｅｉｓｋｅｒ １９８３年给出的Ｈａａｒ锥的定义及Ｈａａｒ锥一致逼近的交错定量，然后得到了Ｈａａｒ锥根数的一种求法。利用这些结果，讨论了系数有界限逼近的特征问题，特别是给出了系数有界限的代数多项式逼近与广义Ｂｅｒｎｓｔｅｉｎ多项式逼近的使用十分方便的交错定理。     

单隐层神经网络与最佳多项式逼近

研究单隐层神经网络逼近问题．以最佳多项式逼近为度量,用构造性方法估计单隐层神经网络逼近连续函数的速度．所获结果表明:对定义在紧集上的任何连续函数,均可以构造一个单隐层神经网络逼近该函数,并且其逼近速度不超过该函数的最佳多项式逼近的二倍．     

多元矩阵Padé逼近的代数性质

本文证明多元矩阵 Padé逼近与一元矩阵 Padé逼近一样具有函数值变换下的不变性 .     

Maximal Inequalities and Lebesgue's Differentiation Theorem for Best Approximant by Constant over Balls

For fL_p( ⁿ), with 1p<∞, >0 and x ⁿ we denote by T(f)(x) the set of every best constant approximant to f in the ball B(x, ). In this paper we extend the operators T_p to the space L_p−1( ⁿ)+L_∞( ⁿ), where L₀ is the set of every measurable functions finite almost everywhere. Moreover we consider the maximal operators associated to the operators T_p and we prove maximal inequalities for them. As a consequence of these inequalities we obtain a generalization of Lebesgue's Differentiation Theorem.     

Best choice of the pole for the Padé-type approximant of a Stieltjes function

The aim of this paper is to use Eiermann's theorem to define precisely good poles for the Padé-type approximant of a certain class of functions. Stieltjes functions whose measure has a compact support or functions with a finite number of real singularities are the main examples of this study. The case of an approximant with one multiple pole is completely studied. The case of two poles is considered. Some numerical experiments have been done, showing that the results, obtained by majorization, seem optimal.     

Multivariate Two-Point Padé-Type and Two-Point Padé Approximants

In his paper the notions of two-point Padé-type and two-point Padé approximants are generalized for multivariate functions, with a generating denominator polynomial of general form. The multivariate two-point Padé approximant can be expressed as a ratio of two determinants and computed recursively using the E-algorithm. A comparison is made with previous definitions by other authors using particular generating denominator polynomials. The last section contains some convergence results.     

A Rational Approximant for the Digamma Function

Power series representations for special functions are computationally satisfactory only in the vicinity of the expansion point. Thus, it is an obvious idea to use Padé approximants or other rational functions constructed from sequence transformations instead. However, neither Padé approximants nor sequence transformation utilize the information which is avaliable in the case of a special function – all power series coefficients as well as the truncation errors are explicitly known – in an optimal way. Thus, alternative rational approximants, which can profit from additional information of that kind, would be desirable. It is shown that in this way a rational approximant for the digamma function can be constructed which possesses a transformation error given by an explicitly known series expansion.     

An algorithm for computing a Padé approximant with minimal degree denominator

In this paper, a new definition of a reduced Padé approximant and an algorithm for its computation are proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Padé approximant always has nice properties which the classical Padé approximant possesses only in the normal case. The new algorithm allows us to avoid the appearance of Froissart doublets induced by computer roundoff in the non-normal Padé table.     

The modified algorithm for the differential transform method to solution of Genesio systems

In this article, approximate analytical solution of chaotic Genesio system is acquired by the modified differential transform method (MDTM). The differential transform method (DTM) is mentioned in summary. MDTM can be obtained from DTM applied to Laplace, inverse Laplace transform and Padé approximant. The MDTM is used to increase the accuracy and accelerate the convergence rate of truncated series solution getting by the DTM. Results are given with tables and figures.     

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants

Laurent Padé-Chebyshev rational approximants,A _m (z,z ⁻¹)/B _n (z, z ⁻¹), whose Laurent series expansions match that of a given functionf(z,z ⁻¹) up to as high a degree inz, z ⁻¹ as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients off up to degreem+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions betweenf(z,z ⁻¹)B _n (z, z ⁻¹)). The derivation was relatively simple but required knowledge of Chebyshev coefficients off up to degreem+2n. In the present paper, Padé-Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé-Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m, n) Padé-Chebyshev approximant, of degreem in the numerator andn in the denominator, is matched to the Chebyshev series up to terms of degreem+n, based on knowledge of the Chebyshev coefficients up to degreem+2n. Numerical tests are carried out on all four Padé-Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent-Chebyshev series on a variety of functions. In part II of this paper [7] Padé-Chebyshev approximants of Clenshaw-Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory

When constructing multivariate Padé approximants, highly structured linear systems arise in almost all existing definitions [10]. Until now little or no attention has been paid to fast algorithms for the computation of multivariate Padé approximants, with the exception of [17]. In this paper we show that a suitable arrangement of the unknowns and equations, for the multivariate definitions of Padé approximant under consideration, leads to a Toeplitz-block linear system with coefficient matrix of low displacement rank. Moreover, the matrix is very sparse, especially in higher dimensions. In Section 2 we discuss this for the so-called equation lattice definition and in Section 3 for the homogeneous definition of the multivariate Padé approximant. We do not discuss definitions based on multivariate generalizations of continued fractions [12, 25], or approaches that require some symbolic computations [6, 18]. In Section 4 we present an explicit formula for the factorization of the matrix that results from applying the displacement operator to the Toeplitz-block coefficient matrix. We then generalize the well-known fast Gaussian elimination procedure with partial pivoting developed in [14, 19], to deal with a rectangular block structure where the number and size of the blocks vary. We do not aim for a superfast solver because of the higher risk for instability. Instead we show how the developed technique can be combined with an easy interval arithmetic verification step. Numerical results illustrate the technique in Section 5.Research partly funded by FWO-Vlaanderen.