一般基下矩阵多项式的张量Bezoutian

给出矩阵多项式在一般基下的张量Bezoutian的定义,推广了标准幂基下的古典张量Bezoutian.讨论了该矩阵的Barnett型分解,缠绕关系和关于可控制/可观测矩阵的表示等重要性质.     

多项式加权一致逼近

了一个典型的ｎｏｎ－ｃａｒａｔｈｅｏｄｏｒｙ区域上的多项加权一致逼近结果，证明方法本身也给出了逼近的具体过程。     

一类Bernstein型算子加权逼近

本文首先给出了一类用递归法定义的Ｂｅｒｎｓｅｉｎ型算子在一致逼近意义下的特征刻划,然后指出在通常的加权范数下,它虹无界的,通过引入的一种新范数,我们给出了该算子加Ｊａｃｏｂｉ权逼近的特征刻划。     

修正的Durrmeye—Bernstein算子线性组合的一致逼近

讨论了修正的Durrmeyer-Bernstein算子线性组合的一致逼近问题,给出了正定理、逆定理和特征刻划。     

矩阵双侧旋转与逼近

首先,引入一些符号.用C~(m×n)表示m×n复矩阵的集合,U~(i×m)={A∈C~(l×m)│A~(II)A=I_m(l≥m)}.I_m表示m阶单位矩阵,A~H表示矩阵A的共轭转置矩阵,tr(A)表示矩阵A的迹,Re[tr     

非线性一致同时逼近

设Ω是紧Ｈａｕｓｄｏｒｆｆ空间,Ｃ（Ω）表示定义在Ω上取值于实数域的所有实连续函数全体组成的空间,在Ｃ（Ω）上定义一致范数则Ｃ（Ω）构成一个Ｂａｎａｃｈ空间．定义其中 ｜｜· ｜｜Ｂ是Ｒｍ中给定的范数． 设Ｇ是Ｃ（Ω）的一个非空子集,ｆ１,…,ｆｍ是Ｃ（Ω）中给定的ｍ个函数．若存在ｆ∈Ｇ,满足那么称这样的ｆ是Ｇ对Ｆ的最佳一致同时逼近,其全体记为ＰＧ（Ｆ）． 近年来．最佳同时逼近问题作为单元最佳逼近问题的推广,受到了广泛的关注．文［１－６］在一般的Ｂａｎａｃｈ空间中研究了各种意义下的最佳同时逼近的特征…     

绝对值函数的一致光滑逼近函数

绝对值函数是一个非光滑函数,研究了绝对值函数的光滑逼近函数.给出了绝对值函数的上方一致光滑逼近函数和下方一致光滑逼近函数,分别研究了其性质,并通过图像展示了逼近效果.     

矩阵有理逼近

本文利用Ｓａｍｅｌｓｏｎ逆变换得到了方阵逆阵的一个新方法，以此建立了Ｔｈｉｅｌｅ型矩阵连分式的展开式，将Ｔｈｉｅｌｅ定理推广到矩阵上去．首次引入了矩阵有理逼近的概念，并讨论和证明了它的特征性和唯一性．最后，给出了逼近式的余项公式．     

On polynomial approximation in the uniform norm by the discrete least squares method

The discrete least squares method is convenient for computing polynomial approximations to functions. We investigate the possibility of using this method to obtain polynomial approximants good in the uniform norm, and find that for a given set ofm nodes, the degreen of the approximating polynomial should be selected so that there is a subset ofn+1 nodes which are close ton+1 Fejér points for the curve. Numerical examples are presented.Sponsored by the United States Army under Contract No. DAAG29-80-C-0041.     

Optimal uniform approximation on angles by entire functions

The paper discusses the best or optimal uniform approximation problem by entire functions on a closed angle Δ. This problem has been studied by M.V. Keldysch in [4], under the assumption that the functions ? subject to approximation are holomorphic in a larger angle containing Δ and there is no restriction on the growth of ? at infinity. In [8], the problem was investigated for a wider class of functions ? continuously complex differentiable on Δ, with sharper estimates on the growth of approximating entire functions, linked with the growth of ? on Δ and the differential properties of ? on the boundary of Δ. In this paper, we improve some of the results on entire approximation on angles, using new approximation ideas partially presented in [9] and [10].     

Best uniform approximation to a class of rational functions

We explicitly determine the best uniform polynomial approximation to a class of rational functions of the form 1/²(x−c)+K(a,b,c,n)/(x−c) on [a,b] represented by their Chebyshev expansion, where a, b, and c are real numbers, n−1 denotes the degree of the best approximating polynomial, and K is a constant determined by a, b, c, and n. Our result is based on the explicit determination of a phase angle η in the representation of the approximation error by a trigonometric function. Moreover, we formulate an ansatz which offers a heuristic strategies to determine the best approximating polynomial to a function represented by its Chebyshev expansion. Combined with the phase angle method, this ansatz can be used to find the best uniform approximation to some more functions.     

The degree of coconvex polynomial approximation

Let change its convexity finitely many times in the interval, say times, at . We estimate the degree of approximation of by polynomials of degree , which change convexity exactly at the points . We show that provided is sufficiently large, depending on the location of the points , the rate of approximation is estimated by the third Ditzian-Totik modulus of smoothness of multiplied by a constant , which depends only on .

     

A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

A non-linear structure preserving matrix method for the computation of a structured low rank approximation of the Sylvester resultant matrix S(f,g) of two inexact polynomials f=f(y) and g=g(y) is considered in this paper. It is shown that considerably improved results are obtained when f(y) and g(y) are processed prior to the computation of , and that these preprocessing operations introduce two parameters. These parameters can either be held constant during the computation of , which leads to a linear structure preserving matrix method, or they can be incremented during the computation of , which leads to a non-linear structure preserving matrix method. It is shown that the non-linear method yields a better structured low rank approximation of S(f,g) and that the assignment of f(y) and g(y) is important because may be a good structured low rank approximation of S(f,g), but may be a poor structured low rank approximation of S(g,f) because its numerical rank is not defined. Examples that illustrate the differences between the linear and non-linear structure preserving matrix methods, and the importance of the assignment of f(y) and g(y), are shown.     

关于Bernstein算子的收敛速度

本文对一类函数建立了Bernstein算子的一致逼近定理,而且给出了其逆定理的一个简短证明。     

Parameter error estimate of near alternation approximation

In practical computation of the discrete best uniform approximation, we usually only get near best (i.e., with the -near alteration property) approximation. We need to estimate the error between the (unknown) best approximation and the achieved approximation. In this paper we estimate the parameter error by means of the generalized strong unicity constants.Visiting scholar from Department of Mathematics, Shanghai University of Science and Technology, Shanghai, P.R. China 201800.     

The Chebyshev approximation of a rectangular matrix by matrices of smaller rank as the limit of lp-apprpoximation

In this paper we investigate a connection between l_p-approximation and the Chebyshev approximation of a rectangular matrix by matrices of smaller rank. We consider also the stationary points of problems (4) and (5) which are connected with these approximations.     

Rational approximation with sign-sensitive weight

For metrics of sign-sensitive weight, a generalization of the Jackson theorem and an analog of the Dolzhenko theorem on the estimate of the variation of a function in terms of its least rational deviations are obtained. In the same metric, two-sided estimates for rational deviations of the function signx are given.Translated fromMatematickeskie Zametki, Vol. 60, No. 5, pp. 715–725, November, 1996.