关于连续函数与可微函数的共凸逼近

关于凸逼近,共凸逼近的各种逼近阶的估计在近十多年来已引起了相当的重视和较多的研究,因为保形渐近的思想在实际问题中有着十分重要的意义。相比较而言,共凸逼近的的研究比凸逼近的情况要复杂,因此,不少关于凸逼近已得到解决的问题对于共凸逼近仍没有结果,关于共凸逼近,1984,Atacir,Sermin证明了。     

Mappings on Spaces of Continuous Functions

Let X and Y be locally compact Hausdorff spaces and T : C₀(X) C₀(Y) a ring homomorphism. We completely characterize such homomorphisms and show that if T is R-linear, then T is either C-linear or C-antilinear. In any case T is continuous and there is a continuous map : Y X such that Tf = f o , f C₀(X) (if T is C-linear) or (if T is C-antilinear). Thus, extending a result of Mólnar, we also derive the general form of an isometry T.AMS Subject Classification (2000): primary 46J05, 46E25(deceased) Passed away on 24 May 1999.     

一类插值多项式算子与无界函数逼近

将经典“试探函数组”1,x,x^2应用于扩展乘数法,建立了一个判别线性正算子能否改造为逼近任何无界连续函数的充要条件。利用该条件给出了一类变形的插值多项式算子的收敛性定理,得到了具有一般性的结论。     

具有Lipschitz连续G-导数函数的极小化方法

本文讨论了在无穷维自反Ｂａｎａｃｈ空间上的具有Ｌｉｐｓｃｈｉｔｚ连续Ｇ－导数的函数ｆ（ｘ）的极小化序列,通过微分方法在一定条件下得到一个收敛性定理。     

Determining Modes for Continuous Data Assimilation in 2D Turbulence

We study the number of determining modes necessary for continuous data assimilation in the two-dimensional incompressible Navier–Stokes equations. Our focus is on how the spatial structure of the body forcing affects the rate of continuous data assimilation and the number of determining modes. We treat this problem analytically by proving a convergence result depending on the H ^–1 norm of f and computationally by considering a family of forcing functions with identical Grashof numbers that are supported on different annuli in Fourier space. The rate of continuous data assimilation and the number of determining modes is shown to depend strongly on the length scales present in the forcing.     

Fixed Points,Continuous Selections,and Existence of Solution of Optimization-Related Problems

We propose a definition of a generalized type of Knaster–Kuratowski–Mazurkiewicz (KKM) mappings, called a weak T-KKM mapping, and a corresponding weak KKM property. A new extension of the Fan–Glicksberg fixed-point theorem is established. Sufficient conditions for the existence of a continuous selection, a fixed point of a composition, and a coincidence point are also provided. Then, we use the obtained results to study the existence of solutions to various optimization-related problems. Discussions and detailed examples are included as well to compare our results with existing ones and to explain their advantages in many situations.     

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h‐multigrid and p‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.     

Persistence of centrality in random growing trees

We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For random trees grown according to a preferential attachment model, a uniform attachment model, or a diffusion processes over a regular tree, we prove that a single node persists as the tree centroid after a finite number of steps, with probability 1. Furthermore, this persistence property generalizes to the top K ≥ 1 nodes with respect to the same centrality measure. We also establish necessary and sufficient conditions for the size of an initial seed graph required to ensure persistence of a particular node with probability , as a function of ϵ: In the case of preferential and uniform attachment models, we derive bounds for the size of an initial hub constructed around the special node. In the case of a diffusion process over a regular tree, we derive bounds for the radius of an initial ball centered around the special node. Our necessary and sufficient conditions match up to constant factors for preferential attachment and diffusion tree models.     

{Well-posedness of degenerate differential equations with infinite delay in Holder continuous function spaces

Using operator-valued $\dot{C}^\alpha$-Fourier multiplier results on vector- valued H\"older continuous function spaces, we give a characterization for the $C^\alpha$-well-posedness of the first order degenerate differential equations with infinite delay $(Mu)"(t) = Au(t) + \int_{-\infty}^t a(t-s)Au(s)ds + f(t)$ ($t\in\R$), where $A, M$ are closed operators on a Banach space $X$ such that $D(A)\cap D(M)\neq \{0\}$, $a\in L^1_{\rm{loc}}(\R_+)\cap L^1(\mathbb{R}_+; t^\alpha dt)$.     

Limit cycles for two classes of planar polynomial differential systems with uniform isochronous centers

In this article, we study the maximum number of limit cycles for two classes of planar polynomial differential systems with uniform isochronous centers. Using the first-order averaging method, we analyze how many limit cycles can bifurcate from the period solutions surrounding the centers of the considered systems when they are perturbed inside the class of homogeneous polynomial differential systems of the same degree. We show that the maximum number of limit cycles, $m$ and $m+1$, that can bifurcate from the period solutions surrounding the centers for the two classes of differential systems of degree $2m$ and degree $2m+1$, respectively. Both of the bounds can be reached for all $m$.