首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 156 毫秒
1.
The problem of homogenization is considered for an elastic body occupying a perforated domain = obtained from a fixed domain and an -contraction of a 1-periodic domain .  相似文献   

2.
Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in p , n , respectively, Z is a closed convex set in p+n, while G is the complement of an open convex set in n . The function c: p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in n . Computational experiments show that the resulting algorithms work well for problems with smalln.  相似文献   

3.
Rovira  Carles  Tindel  Samy 《Potential Analysis》2001,14(4):409-435
We consider the family {X , 0} of solution to the heat equation on [0,T]×[0,1] perturbed by a small space-time white noise, that is t X = X +b({X })+({X }) . Then, for a large class of Borelian subsets of the continuous functions on [0,T]×[0,1], we get an asymptotic expansion of P({X }A) as 0. This kind of expansion has been handled for several stochastic systems, ranging from Wiener integrals to diffusion processes.  相似文献   

4.
In the paper one investigates the dependence of Weyl's solution ,)=c(,)+n()s(,) of the Sturm-Liouville equation y+q()y=2y on the spectral parameter . Under the condition that the potential q is bounded from below and q()exp(c0+c[in1 ¦¦), it is proved for {ie217-01} for any positive values and A. If q()>1 and {ie217-02} for all >0, then in the semiplane >0 the Weyl solution (, ) is obtained from the Weyl solution (,x) is obtained from the Weyl solution eix with zero potential, with the aid of a generalization of B. Ya Levin's transformation operators.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 184–206, 1989.I express my sincere gratitude to L. A. Pastur and I. V. Ostrovskii for valuable advice and discussions.  相似文献   

5.
LetK be a compact Hausdorff space and letFK be a peak interpolation set for a function algebraAC(K). Let be a map fromK to the family of all convex subsets of such that the set {(z, x)zK, x(z)} is open inK×C and such thatg(z)(z) (zK) for somegA. We prove that everyfC(F) satisfyingf(s)(s) (sF) (f(s)closure (s) (sF)) admits an extensionfAA} satisfyingf(z)(z) (zK) (f(z))}closure (z) (zK), respectively). We prove a more general theorem of this kind and present various applications which generalize known dominated interpolation theorems for subspaces ofC(K).  相似文献   

6.
Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X0)| for some integer vector X0 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.  相似文献   

7.
Suppose thatk, rz+, W o r H[]C= {ff is a 2-periodic function,f Cr [–, ], (f(r), ) ()}, Tk is the space of trigonometric polynomials of order k, pk(f)Tk is the polynomial of best uniform approximation to f, and Ek(f) is the error of the best approximation. It is shown that for an arbitrary > 0 we have,where for 0<&#x2A7D;(1),k > 0.R () is the root of the equation , and for k = 0 or > (1) we have R()=.Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 85–101, July, 1977.The author thanks S. B. Stechkin for posing the problem and for his attention to this work.  相似文献   

8.
Summary We define a constraint system , [0,0), which is a kind of family of vector fields on a manifold. This is a generalized version of the family of the equations , [0,0),x m ,y n . Finally, we prove a singular perturbation theorem for the system , [0,0).Dedicated to Professor Kenichi Shiraiwa on his 60th birthday  相似文献   

9.
We consider a Ginzburg–Landau equation in the interval [–, ], >0, 1, with Neumann boundary conditions, perturbed by an additive white noise of strength We prove that if the initial datum is close to an "instanton" then, in the limit 0+, the solution stays close to some instanton for times that may grow as fast as any inverse power of , as long as the center of the instanton is far from the endpoints of the interval. We prove that the center of the instanton, suitably normalized, converges to a Brownian motion. Moreover, given any two initial data, each one close to an instanton, we construct a coupling of the corresponding processes so that in the limit 0+ the time of success of the coupling (suitably normalized) converges in law to the first encounter of two Brownian paths starting from the centers of the instantons that approximate the initial data.  相似文献   

10.
We consider a selfadjoint and smooth enough operator-valued functionL() on the segment [a, b]. LetL(a)0,L(b)0, and there exist two positive numbers and such that the inequality |(L()f, f)|< ([a, b] f=1) implies the inequality (L'()f, f)>. Then the functionL() admits a factorizationL()=M()(I-Z) whereM() is a continuous and invertible on [a, b] operator-valued function, and operatorZ is similar to a selfadjoint one. This result was obtained in the first part of the present paper [10] under a stronge conditionL()0 ( [a,b]). For analytic functionL() the result of this paper was obtained in [13].  相似文献   

11.
We consider a general class of singularly perturbed delay differential systems depending on a singular parameter and another parameter . For =0, the equation defines a mapT which undergoes a generic period doubling at =0. If the bifurcation is supercritical (subcritical), these period two points define a stable period two square wave (unstable period two pulse wave). We give conditions on the vector field such that there is a sectorS in the , plane such that there is a unique periodic orbit if the parameters are inS, the orbit is stable (unstable) if the period doubling bifurcation is supercritical (subcritical) and approaches the square (pulse) wave as 0.Partially supported by NSF and DARPA.  相似文献   

12.
LetX be the solution of the SDE:dX t = (X t)dB t +b(X t)dt, with andb C b (R) such that >0 for some constant , andB a real Brownian motion. Let be the law ofX onE=C([0, 1],R) andk E* – {0}, whereE* is the topological dual space ofE. Consider the classical form: k (u, v)=u / kv / kd, whereu andv are smooth functions onE. We prove that, if k is closable for anyk in a dense subset ofE* and if the smooth functions are contained in the domain of the generator of the closure of k , must be a constant function.  相似文献   

13.
In this paper we compute the values of series of the form if k N is add. This was done by Glaisher [4] if k1 (mod 4), but if k 3 (mod 4) the result seems to be new.  相似文献   

14.
Let be the collection of parallelepipeds in R with edges parallel with the coordinate axes and let be the collection of closed sets in R. Let (G, H)=inf {G{A}H{A}+, H{A}G{A}+ for any; L(G, H)= inf {G{A}H{A}+, H{A}G{A}+ for any, where G, H are distributions in . In the paper one gives the proofs of results announced earlier by the author (Dokl. Akad. Nauk SSSR,253, No. 2, 277–279 (1980)). One considers the problem of the approximation of the distributions of sums of independent random vectors with the aid of infinitely divisible distributions. One obtains estimates for the distances (·, ·), L(·, ·) and. It is proved that, where 0pi1, ; E is the distribution concentrated at zero; Vi(i=1, ..., n) are arbitrary distributions; the products and the exponentials are understood in the sense of convolution.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 130, pp. 89–103, 1983.  相似文献   

15.
Let for anyf H(R), where (x): = –1(x–1). Then (x) P (x + h) for some h R and > 0; P denotes the Poisson kernel.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 82–89, 1989.  相似文献   

16.
We investigate the completeness of an ( nq – q + n – , n)-arc in the Desarguesian plane of order q where n divides q. It is shown that such arcs are incomplete for 0< n/2 if q/n3. For q = 2n they are incomplete for 0 < < 0.381n and for q = 3n they are incomplete for 0 < < 0.476n. For q odd it is known that such arcs do not exist for = 0 and, hence, we improve the upper bound on the maximum size of such a ( k, n)-arc.  相似文献   

17.
18.
Korn-type inequalities for thin periodic structures of period and width h() with h() 0 are presented. Periodic meshes, three-dimensional road structures, and three-dimensional box structures are considered. A particular attention is paid to structures with the so-called critical width when 0$$ " align="middle" border="0"> .  相似文献   

19.
Given a point-to-set operator T, we introduce the operator T defined as T(x)= {u: u – v, x – y – for all y Rn, v T(y)}. When T is maximal monotone T inherits most properties of the -subdifferential, e.g. it is bounded on bounded sets, T(x) contains the image through T of a sufficiently small ball around x, etc. We prove these and other relevant properties of T, and apply it to generate an inexact proximal point method with generalized distances for variational inequalities, whose subproblems consist of solving problems of the form 0 H(x), while the subproblems of the exact method are of the form 0 H(x). If k is the coefficient used in the kth iteration and the k's are summable, then the sequence generated by the inexact algorithm is still convergent to a solution of the original problem. If the original operator is well behaved enough, then the solution set of each subproblem contains a ball around the exact solution, and so each subproblem can be finitely solved.  相似文献   

20.
The vector -algorithm is obtained from the scalar -algorithm by taking the pseudo-inverse of a vector instead of the inverse of a scalar. Thus the vector -algorithm is known only through its rules contrarily to the scalar -algorithm and some other extrapolation algorithms.The aim of this paper is to provide an algebraic approach to the vector -algorithm.  相似文献   

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

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