线性矩阵方程的埃尔米特广义反汉密尔顿半正定解

利用埃尔米特广义反汉密尔顿半正定矩阵的表示定理,作者建立了线性矩阵方程在埃尔米特广义反汉密尔顿半正定矩阵集合中可解的充分必要条件,得到了解的一般表达式.对于逆特征值问题,也得到了可解的充分必要条件.对于任意一个 n 阶复矩阵,得到了相关最佳逼近问题解的表达式.     

球面带形平移网络逼近的Jackson定理

研究了球面带型平移网络逼近阶用球面调和多项式的最佳逼近及光滑模的刻画问题．借助于球调和多项式的最佳逼近多项式和Riesz平均构造出了单位球面Sq上的带形平移网络,并建立了球面带形平移网络对Lp(Sq)中函数一致逼近的Jackson型定理．所得结果表明球面带形平移网络可以达到球调和多项式的逼近阶．     

用变阶唯一可解函数逼近的两个极限定理

本文用变阶唯一可解函数作为逼近函数,研究了单边逼近对于被逼近函数、逼近域和权函数的相依性,以及有偏逼近与单边逼近的联系。     

关于Timan定理的一点注记

本文研究了连续函数的最佳逼近多项式的点态逼近性质.通过一个具体函数的连续模估计,得到最佳逼近多项式的点态逼近阶估计,并且存在连续函数使得最佳逼近多项式能够满足Timan定理.     

多元Bernstein-Durrmeyer型多项式及其逼近特征

作为Bernstein-Durrmeyer多项式的推广,定义单纯形上的Bernstein-Durrmeyer型多项式.以最佳多项式逼近为度量,给出Bernstein-Durrmeyer型多项式Lp逼近阶的估计,并且以一个逆向不等式的形式建立其Lp逼近的逆定理,从而用最佳多项式逼近刻画该多项式Lp逼近的特征.所获结果包含了多元Bernstein-Durrmeyer多项式的相应结果.     

线性流形上反埃尔米特广义汉密尔顿矩阵的最小二乘问题与最佳逼近问题

利用反埃尔米特广义汉密尔顿矩阵的表示定理,得到了线性流形上反埃尔米特广义汉密尔顿矩阵反问题的最小二乘解的一般表达式,建立了线性矩阵方程在线性流形上可解的充分必要条件．对于任意给定的n阶复矩阵,证明了相关最佳逼近问题解的存在性与惟一性,并推得了最佳逼近解的表达式．     

最坏框架与平均框架下区间[1,1]上带Jacobi权的函数逼近

本文研究最坏框架和平均框架下区间[1,1]上带Jocobi权(1 x)α(1+x)β,α,β1/2的函数逼近问题.在最坏框架下,本文得到加权Sobolev空间BWr p,α,β在Lq,α,β(1 q∞)空间尺度下的Kolmogorov n-宽度和线性n-宽度的渐近最优阶,其中Lq,α,β(1 q∞)表示区间[1,1]上带Jacobi权的加权Lq空间.在平均框架下,本文研究具有Gauss测度的加权Sobolev空间Wr2,α,β被多项式子空间和Fourier部分和算子在Lq,α,β(1 q∞)空间尺度下的最佳逼近问题,得到平均误差估计的渐近阶.我们发现,在平均框架下,多项式子空间和Fourier部分和算子在Lq,α,β(1 q2+22 max{α,β}+1)空间尺度下是渐近最优的线性子空间和渐近最优的线性算子.     

单纯形上的Stancu多项式与最佳多项式逼近

作为Bernstein多项式的推广,本文定义单纯形上的多元Stancu多项式.以最佳多项式逼近为度量,建立Stancu多项式对连续函数的逼近定理与逼近阶估计,给出Stancu多项式的一个逼近逆定理,从而用最佳多项式逼近刻划Stancu多项式的逼近特征.     

带有粘性项Burgers方程解的适定性

这里v>0是粘性系数,c(x,t)是气体速度.这是一个非线性抛物方程的初边值问题.从Galerkin逼近出发,首先根据Caratheodory映象得出Galerkin逼近解c_m(x,t)∈L~∞(Z,L~2(I))∩L~2(Z,H_0~1(I));其次利用实数阶CooeB空间的性质得出相应的Galer-     

│x│的有理插值的若干注记

本文中我们构造了一个结点组,基于它定义的有理插值函数,对于任意给定的自然数k,对|x|的逼近能达到精确阶O(1/(n^klogn)).更重要的是,这样的构造揭示了一个本质:当结点向(|x|的唯一奇异点)零点集中时,|x|的有理插值逼近阶也随之更佳,这或许为将来本质性的自然结点组的构造提供了一种思路.     

GENERALIZED SIMULTANEOUS CHEBYSHEV APPROXIMATION

In this note,we develop,without assuming the Haar condition,a generalized simultaneousChebyshev approximation theory which is similar to the classical Chebyshev theory and con-rains it as a special case.Our results also contain those in[1]and[3]as a special case,and thetwo conjectures proposed by C.B.Dunham in[2]are proved to be true in the case of simulta-neous approximation.     

近严格凸与最佳逼近

本文研究近严格凸与最佳逼近的关系．证明了Ｂａｎａｃｈ空间Ｘ是近严格凸的当且仅当Ｘ的每个子空间是紧－半－切比晓夫空间．     

赋β-范空间中的最佳逼近问题

This paper deals with the problems of best approximation in β-normed spaces.With the tool of conjugate cone introduced in [1] and via the Hahn-Banach extension theorem of β-subseminorm in [2],the characteristics that an element in a closed subspace is the best approximation are given in Section 2.It is obtained in Section 3 that all convex sets or subspaces of a β-normed space are semi-Chebyshev if and only if the space is itself strictly convex.The fact that every finite dimensional subspace of a strictly convex β-normed space must be Chebyshev is proved at last.     

Biased rational chebyshev approximation

Chebyshev approximation on an interval [, ] by ordinary rational functions when positive deviations (errors) are magnified by a bias factor is considered. This problem is related to one-sided Chebyshev approximation for large bias factors. Best approximations are characterized by alternation. Non-degenerate best approximations can be determined by the Remez algorithm. A variant of the Fraser-Hart-Remez algorithm is implemented.     

赋$\beta$-范空间中的最佳逼近问题

本文讨论赋$\beta$-范空间中的最佳逼近问题.以[1]引进的共轭锥为工具,借助[2]中关于$\beta$-次半范的Hahn-Banach延拓定理,第二节给出赋$\beta$-范空间的闭子空间中最佳逼近元的特征,第三节得到赋$\beta$-范空间中任何凸子集或子空间均为半Chebyshev集的充要条件是空间本身严格凸,文章最后证明了严格凸的赋$\beta$-范空间中任何有限维子空间都是Chebyshev集.     

Least squares and Chebyshev fitting for parameter estimation in ODEs

We discuss the problem of determining parameters in mathematical models described by ordinary differential equations. This problem is normally treated by least squares fitting. Here some results from nonlinear mean square approximation theory are outlined which highlight the problems associated with nonuniqueness of global and local minima in this fitting procedure. Alternatively, for Chebyshev fitting and for the case of a single differential equation, we extend and apply the theory of [17, 18] which ensures a unique global best approximation. The theory is applied to two numerical examples which show how typical difficulties associated with mean square fitting can be avoided in Chebyshev fitting.This paper is presented as an outcome of the LMS Durham Symposium convened by Professor C.T.H. Baker on 4th-14th July 1992 with support from the SERC under Grant reference number GR/H03964.     

On the Chebyshev spectral continuous time approximation for constant and periodic delay differential equations

In this paper, the approximation technique proposed in Breda et al. (2005) [1] for converting a linear system of constant-coefficient delay differential equations (DDEs) into a system of ordinary differential equations (ODEs) using pseudospectral differencing is extended to linear and nonlinear systems of DDEs with time-periodic coefficients. The Chebyshev spectral continuous time approximation (ChSCTA) technique is used to study the stability of first and second-order constant coefficient DDEs, a delayed system with a cubic nonlinearity and parametric sinusoidal excitation, the delayed Mathieu’s equation, and delayed systems with two fixed delays. In all the examples, the stability and time response obtained from ChSCTA show good agreement with either analytical results, or the results obtained before by other reliable approximation methods. The “spectral accuracy” convergence behavior of Chebyshev spectral collocation shown in Trefethen (2000) [2] which the proposed technique possesses is compared to the convergence properties of finite difference-based continuous time approximation for constant-coefficient DDEs proposed recently in Sun (2009) [3] and Sun and Song (2009) [4].     

基于修正的第二类Chebyshev结点的Newman型有理插值函数对|x|的逼近

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary sets of symmetric nodes in [-1,1] and gave the general estimation of the approximation error.By their methods,one could establish the exact order of approximation for some special nodes.In the present note we consider the sets of interpolation nodes obtained by adjusting the Chebyshev roots of the second kind on the interval [0,1] and then extending this set to [-1,1] in a symmetric way.We show that in this case the exact order of approximation is O（ 1 n 2 ）.     

Estimates of the Best Approximation of Polynomials by Simple Partial Fractions

An asymptotics of the error of interpolation of real constants at Chebyshev nodes is obtained. Some well-known estimates of the best approximation by simple partial fractions (logarithmic derivatives of algebraic polynomials) of real constants in the closed interval [?1, 1] and complex constants in the unit disk are refined. As a consequence, new estimates of the best approximation of real polynomials on closed intervals of the real axis and of complex polynomials on arbitrary compact sets are obtained.

     

Chebyshev Approximation by A + B* log (1 + CX). II

The set of all first degree polynomials must be added to theset of approximations of the form a + b log (1 + cx) in orderthat a best Chebyshev approximation exist to all continuousfunctions on [0, ]. Best approximations in this augmented familyof approximations are characterized by alternation of theirerror curve and are unique. The Chebyshev operator is continuousat f if f is an approximant or f has a non-constant best approximation.