首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 93 毫秒
1.
The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.  相似文献   

2.
The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.  相似文献   

3.
The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical ...  相似文献   

4.
In this paper, we prove strong convergence theorems for approximation of a fixed point of a left Bregman strongly relatively nonexpansive mapping which is also a solution to a finite system of equilibrium problems in the framework of reflexive real Banach spaces. We also discuss the approximation of a common fixed point of a family of left Bregman strongly nonexpansive mappings which is also solution to a finite system of equilibrium problems in reflexive real Banach spaces. Our results complement many known recent results in the literature.  相似文献   

5.
The core problem of dynamical systems is to study the asymptotic behaviors of orbits and their topological structures. It is well known that the orbits with certain recurrence and generating ergodic (or invariant) measures are important, such orbits form a full measure set for all invariant measures of the system, its closure is called the measure center of the system. To investigate this set, Zhou introduced the notions of weakly almost periodic point and quasi-weakly almost periodic point in 1990s, and presented some open problems on complexity of discrete dynamical systems in 2004. One of the open problems is as follows: for a quasi-weakly almost periodic point but not weakly almost periodic, is there an invariant measure generated by its orbit such that the support of this measure is equal to its minimal center of attraction (a closed invariant set which attracts its orbit statistically for every point and has no proper subset with this property)? Up to now, the problem remains open. In this paper, we construct two points in the one-sided shift system of two symbols, each of them generates a sub-shift system. One gives a positive answer to the question above, the other answers in the negative. Thus we solve the open problem completely. More important, the two examples show that a proper quasi-weakly almost periodic orbit behaves very differently with weakly almost periodic orbit.  相似文献   

6.
We study the quasisymmetric geometry of the Julia sets of McMullen maps f_λ(z) = z~m+ λ/z~?,where λ∈ C \ {0} and ? and m are positive integers satisfying 1/? + 1/m 1. If the free critical points of f_λ are escaped to the infinity, we prove that the Julia set J_λ of f_λ is quasisymmetrically equivalent to either a standard Cantor set, a standard Cantor set of circles or a round Sierpiński carpet(which is also standard in some sense).If the free critical points are not escaped, we give a sufficient condition on λ such that J_λ is a Sierpiński carpet and prove that most of them are quasisymmetrically equivalent to some round carpets. In particular, there exist infinitely renormalizable rational maps whose Julia sets are quasisymmetrically equivalent to the round carpets.  相似文献   

7.
渐近φ半压缩映象新的带误差的IshiKawa迭代逼近   总被引:4,自引:0,他引:4  
Let E be a real Banach space and T be an asymptotically φ-hemicontractive mapping. By properties of a new analytical method, under general cases, the strong convergence of the set sequences {On} of the new Ishikawa iteration approximation with errors to the fixed point of mapping is proved. The paper generalizes and improves the corresponding results in {1},[3-8].  相似文献   

8.
In this paper we study the approximation on set of full measure for functions in Sobolev spacesL_m~1 (R~n) (m∈N) by Bochner-Riesz means of conjugale Fourier integrals below the critical index. Atheorem concerning the precise approximation orders with relation to the number m of space L_m~1 (R~n) andthe index of Bochner-Riesz means is obtained.  相似文献   

9.
申又枨 《数学学报》1936,1(1):154-173
<正> 1. INTRODUCTION. It is the purpose of this paper to presentsome results,on the problem of interpolation and approximation toa functiou f(z),analytic on a closed limited point set E in thecomplex z-plane whose complement K is connected and regular inthe sense that Green's fumction for K exists,by rational functionsf_n(z) of respective degrees n,n=1,2,…of the form  相似文献   

10.
Structure of the spectrum of infinite dimensional Hamiltonian operators   总被引:3,自引:0,他引:3  
This paper deals with the structure of the spectrum of infinite dimensional Hamiltonian operators.It is shown that the spectrum,the union of the point spectrum and residual spectrum,and the continuous spectrum are all symmetric with respect to the imaginary axis of the complex plane. Moreover,it is proved that the residual spectrum does not contain any pair of points symmetric with respect to the imaginary axis;and a complete characterization of the residual spectrum in terms of the point spectrum is then given.As applications of these structure results,we obtain several necessary and sufficient conditions for the residual spectrum of a class of infinite dimensional Hamiltonian operators to be empty.  相似文献   

11.
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a linear number of Steiner points added to each point set. Moreover, the compatible triangulations constructed by these methods are regular triangulations.  相似文献   

12.
We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact manifold, a manifold Delaunay complex is produced for a perturbed point set provided the transition functions are bi-Lipschitz with a constant close to 1, and the original sample points meet a local density requirement; no smoothness assumptions are required. If the transition functions are smooth, the output is a triangulation of the manifold. The output complex is naturally endowed with a piecewise-flat metric which, when the original manifold is Riemannian, is a close approximation of the original Riemannian metric. In this case the output complex is also a Delaunay triangulation of its vertices with respect to this piecewise-flat metric.  相似文献   

13.
Given a set of n labeled points on Sd, how many combinatorially different geometric triangulations for this point set are there? We show that the logarithm of this number is at most some positive constant times nd/2+1. Evidence is provided that for even dimensions d the bound can be improved to some constant times nd/2.  相似文献   

14.
We consider triangulations of surfaces with boundary and marked points. These triangulations are classified with respect to flip equivalence. The results obtained are applied to the homotopy classification of functions without critical points on 2-manifolds. It is shown that the set of such functions satisfies the one-parametric h-principle.  相似文献   

15.
A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It was proved in an earlier paper Finbow et al. (2004) [3] that there are no 5-connected planar well-covered triangulations, and in Finbow et al. (submitted for publication) [4] that there are exactly four 4-connected well-covered triangulations containing two adjacent vertices of degree 4. It is the aim of the present paper to complete the characterization of 4-connected well-covered triangulations by showing that each such graph contains two adjacent vertices of degree 4.  相似文献   

16.
17.
We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identical edge in the other triangulation or to an edge that crosses it. This theorem also holds for the triangles of the triangulations and in general independence systems. As an application, we give some lower bounds for the minimum-weight triangulation which can be computed in polynomial time by matching and network-flow techniques. We exhibit an easy-to-recognize class of point sets for which the minimum-weight triangulation coincides with the greedy triangulation.  相似文献   

18.
Data Dependent Triangulations for Piecewise Linear Interpolation   总被引:6,自引:0,他引:6  
Given a set of data points in R2 and corresponding data values,it is clear that the quality of a piecewise linear interpolationover triangles depends on the specific triangulation of thedata points. While conventional triangulation methods dependonly on the distribution of the data points in R2 in this paperwe suggest that the triangulation should depend on the datavalues as well. Several data dependent criteria for definingthe triangulation are discussed and efficient algorithms forcomputing these triangulations are presented. It is shown fora variety of test cases that data dependent triangulations canimprove significantly the quality of approximation and thatlong and thin triangles, which are traditionally avoided, aresometimes very suitable.  相似文献   

19.
The aim of this paper is to construct rational approximants for multivariate functions given by their expansion in an orthogonal polynomial system. This will be done by generalizing the concept of multivariate Padé approximation. After defining the multivariate Frobenius–Padé approximants, we will be interested in the two following problems: the first one is to develop recursive algorithms for the computation of the value of a sequence of approximants at a given point. The second one is to compute the coefficients of the numerator and denominator of the approximants by solving a linear system. For some particular cases we will obtain a displacement rank structure for the matrix of the system we have to solve. The case of a Tchebyshev expansion is considered in more detail.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号