首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Letf be a real-valued function sequence {f k } that converges to on a deleted neighborhoodD of . If there is a subsequence {f k(j) } and a number sequencex such that lim j x j = and either lim j f k(j) (x j )>lim sup x (x) or lim j f k(j) (x j ) x (x), thenf is said to display theGibbs phenomenon at . IfA is a (real) summability matrix, thenAf is a function sequence given by(Af) n (x)= k=0 a n,k f k (x). IfAf displays the Gibbs phenomenon wheneverf does, thenA is said to beGP-preserving. By replacingf k (x) withf k (x j )F k,j , the Gibbs phenomenon is viewed as a property of the matrixF, andGP-preserving matrices are determined by properties of the matrix productAF. The general results give explicit conditions on the entries {a n,k } that are necessary and/or sufficient forA to beGP-preserving. For example: if(x)0 thenF displaysGP iff lim k,j F k,j 0, and ifA isGP-preserving then lim n,k A n,k 0. IfA is a triangular matrix that is stronger than convergence, thenA is notGP-preserving. The general results are used to study the preservation of the Gibbs phenomenon by matrix methods of Nörlund, Hausdorff, and others.  相似文献   

2.
Let the set of generalized polynomials having bounded coefficients beK={p= jgj. j j j,j=1, 2, ...,n}, whereg 1,g 2, ...,g n are linearly independent continuous functions defined on the interval [a, b], j, j are extended real numbers satisfying j<+, j>-, and j j. Assume thatf is a continuous function defined on a compact setX [a, b]. This paper gives the characterization theorem forp being the best uniform approximation tof fromK, and points out that the characterization theorem can be applied in calculating the approximate solution of best approximation tof fromK.  相似文献   

3.
It is well-known Heyde's characterization theorem for the Gaussian distribution on the real line: if j are independent random variables, j , j are nonzero constants such that i ± j –1 j 0 for all i j and the conditional distribution of L 2=1 1 + ··· + n n given L 1=1 1 + ··· + n n is symmetric, then all random variables j are Gaussian. We prove some analogs of this theorem, assuming that independent random variables take on values in a finite Abelian group X and the coefficients j , j are automorphisms of X.  相似文献   

4.
We investigate the category mod of finite length modules over the ring =A k , where is a V-ring, i.e. a ring for which every simple module is injective, k a subfield of its centre and A an elementary k-algebra. Each simple module E j gives rise to a quasiprogenerator P j = A E j . By a result of K. Fuller, P j induces a category equivalence from which we deduce that mod j mod EndP j . As a consequence we can(1) construct for each elementary k-algebra A over a finite field k a nonartinian noetherian ring such that modA mod(2) find twisted versions of algebras of wild representation type such that itself is of finite or tame representation type (in mod)(3) describe for certain rings the minimal almost split morphisms in mod and observe that almost all of these maps are not almost split in Mod.  相似文献   

5.
Paul Jolissaint 《K-Theory》1989,2(6):723-735
We associate to any length function L on a group a space of rapidly decreasing functions on (in the l 2 sense), denoted by H L (). When H L () is contained in the reduced C*-algebra C r * () of (), then it is a dense *-subalgebra of C r * () and we prove a theorem of A. Connes which asserts that under this hypothesis H L () has the same K-theory as C r * (). We introduce another space of rapidly decreasing functions on (in the l 1 sense), denoted by H L 1, (), which is always a dense *-subalgebra of the Banach algebra l 1(), and we show that H L 1, () has the same K-theory as l 1().  相似文献   

6.
We examine the efficiency of PL path following algorithms in followingF T -1 (0), whereF T is the PL approximation, induced by the simplicial triangulationT, to a mapf: n n-1. In particular, we consider the problem of determining an upper bound on the expected number of pivots made per unit length off –1(0) that is approximated. We show that if the sizes of the simplices ofT are sufficiently small, where sufficiently small is an explicitly given quantity dependent on measurements of how nicef is, then the average directional density ofT, as introduced by Todd, really does give a good approximation to the expected number of pivots made, confirming what researchers have believed on intuitive grounds for a decade. Because what constitutes sufficiently small is a precisely given quantity, i.e., non-asymptotic, we are able to provide some rigorous justification for the claim that the expected number of pivots grows only polynomially inn, the number of variables.Several other issues are also examined.Research supported by an NSF Mathematical Sciences Postdoctoral Research Fellowship. This research was performed while the author was a member of the Mathematical Sciences Research Institute, Berkeley, California.  相似文献   

7.
We study the class of bounded C 0-semigroups T=(T t ) t0 on a Banach space X satisfying the asymptotic finite dimensionality condition: codim X 0(T)<, where X 0(T):={x X:limt T t x=0}. We prove a theorem which provides some necessary and sufficient conditions for asymptotic finite dimensionality.  相似文献   

8.
For an end and a tree T of a graph G we denote respectively by m() and m T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m T () = f() for every end of G.  相似文献   

9.
Summary It is proved that, iff ij:]0, 1[ C (i = 1, ,k;j = 1, ,l) are measurable, satisfy the equation (1) (with some functionsg it, hjt:]0, 1[ C), then eachf ij is in a linear space (called Euler space) spanned by the functionsx x j(logx) k (x ]0, 1[;j = 1, ,M;k = 0, ,m j – 1), where 1, , M are distinct complex numbers andm 1, , mM natural numbers. The dimension of this linear space is bounded by a linear function ofN.  相似文献   

10.
Let T , be a transformation of the two-dimensional torus T 2 given by the formula T , (x, y)(2x, y+ +x) mod 1.A version of the functional central limit theorem is formulated for variables of the form ,where is an irrational number and f belongs to a class of real- valued functions on T 2 described in terms of . The proof will be published elsewhere.Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 240, 1997, pp. 78–81.This work was performed as part of the Russian-German project DFG-RFBR, grant 96-01-00096. The second author was also supported by the Russian Foundation for Basic Research, grant 96-01-00672.  相似文献   

11.
One considers the problem of the maximum of the product of powers of conformal radii of nonoverlapping domains in the following formulation. Let A=a1, ..., an and B=(b1, ..., bm be systems of distinguished points in ¯C and let ={1,..., m} be a system of positive numbers. ByU(D,b ) we denote the reduced modulus of the simply connected domain D relative to the pointb D. Find the maximum of the sum in the familyD of all systems of nonoverlapping simply connected domains Dj, j=1, ..., m, satisfying the following condition: the domain Dj does not contain points bi B, different from bj, and some collection Aj, for each domain, of points from A, j=1 m A j =A. The solution of this problem is obtained by the simultaneous use of the method of variation and of the method of the moduli of families of curves and is given by Theorem 1 of the present paper. As consequences of Theorem 1 one obtains Theorems 2 and 3, strengthening the corresponding results of a previous paper of the author.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 149–154, 1985.  相似文献   

12.
The convergence of the Luus-Jaakola search method for unconstrained optimization problems is established.Notation E n Euclideann-space - f Gradient off(x) - 2 f Hessian matrix - (·) T Transpose of (·) - I Index set {1, 2, ...,n} - [x i1 *(j) ] Point around which search is made in the (j + 1)th iteration, i.e., [x 1l *(j) ,x 2l *(j) ,...,x n1 *(j) ] - r i (i) Range ofx il *(i) in the (j + 1)th iteration - l 1 mini {r i (0) } - l 2 mini {r i (0) } - A j Region of search in thejth iteration, i.e., {x E n:x il *(j-1) –0.5r i (j-1) x ix il *(j-1) +0.5r i (j-1) ,i I} - S j Closed sphere with center origin and radius j - Reduction factor in each iteration - 1– - (·) Gamma function Many discussions with Dr. S. N. Iyer, Professor of Electrical Engineering, College of Engineering, Trivandrum, India, are gratefully acknowledged. The author has great pleasure to thank Dr. K. Surendran, Professor, Department of Electrical Engineering, P.S.G. College of Technology, Coimbatore, India, for suggesting this work.  相似文献   

13.
When the Hurst coefficient of a fBm B t H is greater than 1/2, it is possible to define a stochastic integral with respect to B t H as the pathwise limit of Riemann sums. In this article we consider diffusion equations of the type Xt = x0 + 0 T (Xs) dBs H. We then construct a simple-to-use estimator of the diffusion coefficient (x), based on the number of crossings of level x of the process X t. We then study consistency in probability of this estimator and calculate convergence rates in probability.  相似文献   

14.
One considers the total scattering cross section on the potential gV(x), xm, m3, for large values of the coupling constant g and of the wave number k. One assumes that V(x)(x/|1x|)|x|, 2>m+1, as ¦x¦. It is shown that for gk–1 , g3–ak2(a–2) the scattering cross section is equal asymptotically to a(gk–1), x=(m–1)(–1)–1. Here the coefficient a is determined only by the function and the number . Under the additional conditions >0, V>0, the indicated asymptotic behavior holds in the large domain gk–1 , gka–z c(gk–1), >0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 152, pp. 105–136, 1986.  相似文献   

15.
The basic problem in this paper is that of determining the geometry of an arbitrary doubly-connected region inR 2 with mixed boundary conditions, from the complete knowledge of the eigenvalues { j } j=1 for the Laplace operator, using the asymptotic expansion of the spectral function (t)= j=1 exp(–t j ) ast0.  相似文献   

16.
Summary In the situation of the classical mean motion, we haven planets moving in the plane, planetk+1 being a satellite of planetk. A classcal result then states that planetn has a mean motion,i.e. its mean angular speed between time 0 and timet has a limit whent. We show in this article that any real gaussian dynamical system can be interpreted as the limit of this situation, whenn. From a given nonatomic probability measure on [0,], we construct a transformationT of the complex brownian path (B u)0u1 which preserves Wiener measure.T is defined as the limit of a sequenceT n, whereT n acts as the motion of 2n planets. In this way we get a real gaussian dynamical system, whose spectral measure is the symetric probability on [-,] obtained from . The transformationT can be inserted in a flow (T t) t, and the orbitstZ t=B 1T t still have almost surely a mean motion, which is the mean of .  相似文献   

17.
A permutation :i| i , 0i<n is called a TDP permutation ifia i ja j (modn) fori j. This paper finds all TDP permutations forn15, discusses the method for generating TDP permutations, and finally by applying MLE method obtains a formula for estimating the number of TDP permutations forn> 15.Project supported by National Natural Science Foundation of China.  相似文献   

18.
Let i be an i-tb population with a probability density function f(· | i ) with one dimensional unknown parameter i = 1, 2, ... , k. Let n i sample be drawn from each i . The likelihood ratio criteria j|(j–1) for testing hypothesis that the first j parameters are equal against alternative hypothesis that the first (j – 1) parameters are equal and the j-th parameter is different with the previous ones are defined, j = 2, 3, ... , k. The paper shows the asymptotic independence of j|(j–1)'s up to the order 1/n under a hypothesis of equality of k parameters, where n is a number of total samples.  相似文献   

19.
Mathias  Roy 《Positivity》2004,8(1):85-87
It is shown that for any (n + 1)-positive (possibly non-linear) map and any bounded linear operators A i ,i = 1,¨,n we have [(A i * A j )] i,j = 1 *[(A i )*(A j )] i,j = 1 *, and that the statement is false if "(n + 1)-positive" is replaced by "n-positive". This resolves an issue raised by Bhatia and Davis in relation to a Schwartz inequality which can be regarded as a non-commutative variance-covariance inequality [2]  相似文献   

20.
The focusing nonlinear Schrödinger equation with finite-density boundary conditions as |x| is considered. The asymptotic behavior of the solution ast is investigated by means of the complex theory of deformations of Whitham.Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 104, No. 3, pp. 393–419, September, 1995.  相似文献   

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

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