On best simultaneous approximation in quotient spaces

We assume that X is a normed linear space, W and M are subspaces of X. We develop a theory of best simultaneous approximation in quotient spaces and introduce equivalent assertions between the subspaces W and W ＋ M and the quotient space W/M.     

复赋范空间中复RS集的最佳同时逼近

研究了复赋范空间中具限制系数的广义多项式集G对无穷序列的最佳同时逼近问题,得到了特征定理;当G是复RS集时还得到了惟一性定理．     

Banach空间中同时逼近问题的适定性

研究一般Banach空间X中同时逼近问题的适定性.对严格凸的KadecBanach空间X中的相对有界弱紧闭子集G,建立了关于最佳同时逼近问题适定Bair纲结果.进一步,当X是一致凸空间时,证明了E(G)中使其最佳同时逼近问题不适定的序列在E(G)中是一个σ-多孔集.另外,还研究了关于最佳同时逼近元具有分歧域的集合G的几乎性.     

空间中同时逼近问题的适定性

研究一般Banach空间X 中同时逼近问题的适定性. 对严格凸的Kadec 空间X中的相对有界弱紧闭子集G,建立了关于最佳同时逼近问题适定Bair纲结果. 进一步, 当X是一致凸空间时, 证明了E(G)中使其最佳同时逼近问题不适定的序列在E(G)中是一个δ -多孔集. 另外, 还研究了关于最佳同时逼近元具有分歧域的集合G的几乎性.     

关于有效点集的闭性和连通性

本文的主要结果是，假设Ａ是局部凸空间里的紧的Ｆ一集，则Ａ的有效点集Ｅ（Ａ｜Ｃ）是闭集。需要提及的是，此结果中关于Ａ并没有作任何凸性的假设，如果对它再附加某种凸性假设条件时，则本文进一步证明了有效点集Ｅ（Ａ｜Ｃ）不但是闭集，而且还是连通集。     

非线性一致同时逼近

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

节点具有双重需求的车辆路径问题及其性质

在原有同时收发车辆路径问题定义的基础上,将节点需求与车辆容量的关系拓展到允许节点需求大于车辆容量的情形.接着对集送货需求可拆分车辆路径问题和同时收发车辆路径问题的可简化性进行了研究.给出了两类问题可简化的定义,并得到了当距离满足三角不等式,车辆容量为1时集送货需求可拆分车辆路径问题可简化并与同时收发车辆路径问题等价,而当容量大于等于2时两类问题都不可以简化的结论.同时也对两类问题当车辆容量等于1时,以及大于等于3时的计算复杂性给出了证明.最后通过一个实例说明了集送货需求可拆分车辆路径问题与同时收发车辆路径问题在最优解的结构性质方面存在着明显差异.     

连续树映射的ω极限集与非游荡集

本文研究树上连续自映射f的ω极限集∧,非游荡集Ω的若干拓扑结构,主要证明了不在周期点集闭包中的ω极限点都有无限轨迹;Ω-     

连续树映射的ω极限集与非游荡集

本文研究树上连续自映射ｆ的ω极限集Λ,非游荡集Ω的若干拓扑结构,主要证明了：不在周期点集闭包中的ω极限点都有无限轨迹;Ω－Ｐ,Ω－Γ为可数集,Λ－Γ,Ｐ－Γ或为空集或可数无限,其中Γ为ｆ的γ极限集．     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

On the weakening of the convergence of Newton’s method using recurrent functions

We use Newton’s method to approximate a locally unique solution of an equation in a Banach space setting. We introduce recurrent functions to provide a weaker semilocal convergence analysis for Newton’s method than before [J. Appell, E. De Pascale, J.V. Lysenko, P.P. Zabrejko, New results on Newton–Kantorovich approximations with applications to nonlinear integral equations, Numer. Funct. Anal. Optim. 18 (1997) 1–17; I.K. Argyros, The theory and application of abstract polynomial equations, in: Mathematics Series, St. Lucie/CRC/Lewis Publ., Boca Raton, Florida, USA, 1998; I.K. Argyros, Concerning the “terra incognita” between convergence regions of two Newton methods, Nonlinear Anal. 62 (2005) 179–194; I.K. Argyros, Convergence and Applications of Newton-Type Iterations, Springer-Verlag Publ., New York, 2008; S. Chandrasekhar, Radiative Transfer, Dover Publ., New York, 1960; F. Cianciaruso, E. De Pascale, Newton–Kantorovich approximations when the derivative is Hölderian: Old and new results, Numer. Funct. Anal. Optim. 24 (2003) 713–723; N.T. Demidovich, P.P. Zabrejko, Ju.V. Lysenko, Some remarks on the Newton–Kantorovich method for nonlinear equations with Hölder continuous linearizations, Izv. Akad. Nauk Belorus 3 (1993) 22–26. (in Russian); E. De Pascale, P.P. Zabrejko, Convergence of the Newton–Kantorovich method under Vertgeim conditions: A new improvement, Z. Anal. Anwendvugen 17 (1998) 271–280; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; J.V. Lysenko, Conditions for the convergence of the Newton–Kantorovich method for nonlinear equations with Hölder linearizations, Dokl. Akad. Nauk BSSR 38 (1994) 20–24. (in Russian); B.A. Vertgeim, On conditions for the applicability of Newton’s method, (Russian), Dokl. Akad. Nauk., SSSR 110 (1956) 719–722; B.A. Vertgeim, On some methods for the approximate solution of nonlinear functional equations in Banach spaces, Uspekhi Mat. Nauk 12 (1957) 166–169. (in Russian); English transl.:; Amer. Math. Soc. Transl. 16 (1960) 378–382] provided that the Fréchet-derivative of the operator involved is p$p$-Hölder continuous (p∈(0,1]$p\in (0,1]$).     

Zero-dimensional subschemes of ruled varieties

Here we study zero-dimensional subschemes of ruled varieties, mainly Hirzebruch surfaces and rational normal scrolls, by applying the Horace method and the Terracini method This research is part of the T.A.S.C.A. project of I.N.d.A.M., supported by P.A.T. (Trento) and M.I.U.R. (Italy)     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Least distance methods for the scheme of polytopes

Methods are described and APL-codes are supplied to find vertices, edges, other faces and facets of polytopes given by point sets. The basic subroutine is a simplicial decomposition version of least distance, i.e. quadratic, programming. Computational experience indicates high efficiency.     

Structure and Properties of Nanocrystalline Oxide Powders

The crystalline and porous structure of superfine powders and fibers made of alumina and zirconia doped with yttria is investigated. The particle sizes were determined by the methods of coherent dispersion and scanning transmission electron microscopy. Based on data on the sizes of crystallites of the metal oxides, which were obtained by different methods, it is found that crystalline transformations of the oxides lead to dispersion of the materials. The structural transformations of the superfine oxides are accompanied by changes in crystallite sizes and in the character and size of pores. The laws established allow one to purposefully control the process of producing nanostructured oxide powders and fibers, which can be utilized as active fillers for composite materials based on various matrices. __________ Translated from Mekhanika Kompozitnykh Materialov, Vol. 41, No. 6, pp. 831–840, November–December, 2005.     

Dendrites and light mappings

It is shown that a metric continuum is a dendrite if and only if for every compact space (continuum) and for every light confluent mapping such that there is a copy of in for which the restriction is a homeomorphism. As a corollary it follows that only dendrites have the lifting property with respect to light confluent mappings. Other classes of mappings are also discussed. This is a continuation of a previous study by the authors (2000), where open mappings were considered.

     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

Finding Optimal Targets for Change Agents: A Computer Simulation of Innovation Diffusion

We introduce a diffusion of innovation model based on a network threshold approach. Realistic network and threshold data were gathered regarding the diffusion of new software tools within part of a large organization. Novel model features are a second threshold for innovation rejection and a memory that allows actors to take trends into account. Computer simulations produce expected outcomes, such as the S-shaped diffusion curve, but also diffusion breakdown and oscillations. We define and compute the quality of change agent targets in terms of the impact targeted actors have on the diffusion process. Our simulations reveal considerable variance in the quality of actors as change agent targets. Certain actors can be singled out as especially important to the diffusion process. Small changes in the distribution of thresholds and changes in some parameters, such as the sensitivity for trends, lead to significant changes in the target quality measure. To illustrate these interdependencies we outline how the impact of an actor targeted by a change agent spreads through the network. We thus can explain why a good change agent target does not necessarily need to be an opinion leader. Simulations comparing the effectiveness of randomly selected targets versus a group of good change agent targets indicate that the selection of good targets can accelerate innovation diffusion.