首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
For a Tychonoff space X  , we denote by Cp(X)Cp(X) and Cc(X)Cc(X) the space of continuous real-valued functions on X equipped with the topology of pointwise convergence and the compact-open topology respectively. Providing a characterization of the Lindelöf Σ-property of X   in terms of Cp(X)Cp(X), we extend Okunev?s results by showing that if there exists a surjection from Cp(X)Cp(X) onto Cp(Y)Cp(Y) (resp. from Lp(X)Lp(X) onto Lp(Y)Lp(Y)) that takes bounded sequences to bounded sequences, then υY is a Lindelöf Σ-space (respectively K-analytic) if υX has this property. In the second part, applying Christensen?s theorem, we extend Pelant?s result by proving that if X is a separable completely metrizable space and Y   is first countable, and there is a quotient linear map from Cc(X)Cc(X) onto Cc(Y)Cc(Y), then Y   is a separable completely metrizable space. We study also a non-separable case, and consider a different approach to the result of J. Baars, J. de Groot, J. Pelant and V. Valov, which is based on the combination of two facts: Complete metrizability is preserved by ?p?p-equivalence in the class of metric spaces (J. Baars, J. de Groot, J. Pelant). If X   is completely metrizable and ?p?p-equivalent to a first-countable Y, then Y is metrizable (V. Valov). Some additional results are presented.  相似文献   

2.
In this paper, the wrap-around L2L2-discrepancy (WD) of asymmetrical design is represented as a quadratic form, thus the problem of constructing a uniform design becomes a quadratic integer programming problem. By the theory of optimization, some theoretic properties are obtained. Algorithms for constructing uniform designs are then studied. When the number of runs nn is smaller than the number of all level-combinations mm, the construction problem can be transferred to a zero–one quadratic integer programming problem, and an efficient algorithm based on the simulated annealing is proposed. When n≥mnm, another algorithm is proposed. Empirical study shows that when nn is large, the proposed algorithms can generate designs with lower WD compared to many existing methods. Moreover, these algorithms are suitable for constructing both symmetrical and asymmetrical designs.  相似文献   

3.
In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)(n,δ)-width and pp-average linear nn-width of diagonal matrix MM are determined.  相似文献   

4.
5.
6.
7.
8.
9.
10.
11.
Let T:D⊂X→XT:DXX be an iteration function in a complete metric space XX. In this paper we present some new general complete convergence theorems for the Picard iteration xn+1=Txnxn+1=Txn with order of convergence at least r≥1r1. Each of these theorems contains a priori and a posteriori error estimates as well as some other estimates. A central role in the new theory is played by the notions of a function of initial conditions   of TT and a convergence function   of TT. We study the convergence of the Picard iteration associated to TT with respect to a function of initial conditions E:D→XE:DX. The initial conditions in our convergence results utilize only information at the starting point x0x0. More precisely, the initial conditions are given in the form E(x0)∈JE(x0)J, where JJ is an interval on R+R+ containing 0. The new convergence theory is applied to the Newton iteration in Banach spaces. We establish three complete ωω-versions of the famous semilocal Newton–Kantorovich theorem as well as a complete version of the famous semilocal αα-theorem of Smale for analytic functions.  相似文献   

12.
13.
14.
Let G be a countable discrete group with an orthogonal representation α on a real Hilbert space H  . We prove LpLp Poincaré inequalities for the group measure space L(ΩH,γ)?GL(ΩH,γ)?G, where both the group action and the Gaussian measure space (ΩH,γ)(ΩH,γ) are associated with the representation α  . The idea of proof comes from Pisier?s method on the boundedness of Riesz transform and Lust-Piquard?s work on spin systems. Then we deduce a transportation type inequality from the LpLp Poincaré inequalities in the general noncommutative setting. This inequality is sharp up to a constant (in the Gaussian setting). Several applications are given, including Wiener/Rademacher chaos estimation and new examples of Rieffel?s compact quantum metric spaces.  相似文献   

15.
16.
17.
Let K   be a hypergroup with a Haar measure. The purpose of the present paper is to initiate a systematic approach to the study of the class of invariant complemented subspaces of L(K)L(K) and C0(K)C0(K), the class of left translation invariant w?w?-subalgebras of L(K)L(K) and finally the class of non-zero left translation invariant C?C?-subalgebras of C0(K)C0(K) in the hypergroup context with the goal of finding some relations between these function spaces. Among other results, we construct two correspondences: one, between closed Weil subhypergroups and certain left translation invariant w?w?-subalgebras of L(K)L(K), and another, between compact subhypergroups and a specific subclass of the class of left translation invariant C?C?-subalgebras of C0(K)C0(K). By the help of these two characterizations, we extract some results about invariant complemented subspaces of L(K)L(K) and C0(K)C0(K).  相似文献   

18.
We consider renewal shot noise processes with response functions which are eventually nondecreasing and regularly varying at infinity. We prove weak convergence of renewal shot noise processes, properly normalized and centered, in the space D[0,∞)D[0,) under the J1J1 or M1M1 topology. The limiting processes are either spectrally nonpositive stable Lévy processes, including the Brownian motion, or inverse stable subordinators (when the response function is slowly varying), or fractionally integrated stable processes or fractionally integrated inverse stable subordinators (when the index of regular variation is positive). The proof exploits fine properties of renewal processes, distributional properties of stable Lévy processes and the continuous mapping theorem.  相似文献   

19.
20.
We utilize the classical hypercircle method and the lowest-order Raviart–Thomas H(div)H(div) element to obtain a posteriori error estimates of the P1P1 finite element solutions for 2D Poisson's equation. A few other estimation methods are also discussed for comparison. We give some theoretical and numerical results to see the effectiveness of the methods.  相似文献   

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

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