首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Consider the advection–diffusion equation: u1 + aux1 ? vδu = 0 in ?n × ?+ with initial data u0; the Support of u0 is contained in ?(x1 < 0) and a: ?n → ? is positive. In order to approximate the full space solution by the solution of a problem in ? × ?+, we propose the artificial boundary condition: u1 + aux1 = 0 on ∑. We study this by means of a transmission problem: the error is an O(v2) for small values of the viscosity v.  相似文献   

2.
The paper studies the longtime behavior of solutions to the initial boundary value problem (IBVP) for a nonlinear wave equation arising in elasto‐plastic flow utt?div{|?u|m?1?u}?λΔut2u+g(u)=f(x). It proves that under rather mild conditions, the dynamical system associated with above‐mentioned IBVP possesses a global attractor, which is connected and has finite Hausdorff and fractal dimension in the phase spaces X1=H(Ω) × L2(Ω) and X=(H3(Ω)∩H(Ω)) × H(Ω), respectively. Copyright © 2008 John Wiley & Sons, Ltd.  相似文献   

3.
In this paper we prove subelliptic estimates for operators of the form Δx + λ2 (x)S in ?N = ? × ?, where the operator S is an elliptic integro - differential operator in ?N and λ is a nonnegative Lipschitz continuous function.  相似文献   

4.
5.
The classical surgery theory (see [5] and [23]) computes the structure set Sm (M, rel ?) of manifolds homotopy equivalent to M relative to the boundary. Siebenmann showed that in topological category, the structure set is 4-periodic: Sm(M, rel ?) ? Sm+4(M × D4, rel ?) up to a copy of ?; see [12]. Cappell and Weinberger gave a geometric interpretation of this periodicity in [8]. By using Weinberger's stratified surgery theory (see [24]), we extend this to an equivariant periodicity result for topological manifolds with homotopically stratified actions by compact Lie groups, with D4 replaced by the unit ball of certain group representations. In particular, if G is an odd order group acting on a topological manifold M, then the equivariant stable structure sets satisfy S (M, rel ?) ? S(M × D(?4 ? ?G), rel ?) up to copies of ?. © 1993 John Wiley & Sons, Inc.  相似文献   

6.
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and ? = m ? n empty places. For a noncomputer science‐minded reader, we shall use the metaphore of n cars parking on m places: each car ci chooses a place pi at random, and if pi is occupied, ci tries successively pi + 1, pi + 2, until it finds an empty place. Pittel [42] proves that when ?/m goes to some positive limit β < 1, the size B of the largest block of consecutive cars satisfies 2(β ? 1 ? log β)B = 2 log m ? 3 log log m + Ξm, where Ξm converges weakly to an extreme‐value distribution. In this paper we examine at which level for n a phase transition occurs between B = o(m) and m ? B = o(m). The intermediate case reveals an interesting behavior of sizes of blocks, related to the standard additive coalescent in the same way as the sizes of connected components of the random graph are related to the multiplicative coalescent. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 76–119, 2002  相似文献   

7.
In this work, we prove the existence of global attractor for the nonlinear evolution equation uttuututt + g(x, u)=f(x) in X=(H2(Ω)∩H(Ω)) × (H2(Ω)∩H(Ω)). This improves a previous result of Xie and Zhong in (J. Math. Anal. Appl. 2007; 336 :54–69.) concerning the existence of global attractor in H(Ω) × H(Ω) for a similar equation. Further, the asymptotic behavior and the decay property of global solution are discussed. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   

8.
We consider a domain Ω in ?n of the form Ω = ?l × Ω′ with bounded Ω′ ? ?n?l. In Ω we study the Dirichlet initial and boundary value problem for the equation ? u + [(? ? ?… ? ?)m + (? ? ?… ? ?)m]u = fe?iωt. We show that resonances can occur if 2ml. In particular, the amplitude of u may increase like tα (α rational, 0<α<1) or like in t as t∞∞. Furthermore, we prove that the limiting amplitude principle holds in the remaining cases.  相似文献   

9.
The random assignment problem is to choose a minimum‐cost perfect matching in a complete n×n bipartite graph, whose edge weights are chosen randomly from some distribution such as the exponential distribution with mean 1. In this case it is known that the expectation does not grow unboundedly with n, but approaches some limiting value c* between 1.51 and 2. The limit is conjectured to be π2/6, while a recent conjecture is that for finite n, the expected cost is ∑ 1/i2. This paper contains two principal results. First, by defining and analyzing a constructive algorithm, we show that the limiting expectation is c*<1.94. Second, we extend the finite‐n conjecture to partial assignments on complete m×n bipartite graphs and prove it in some limited cases. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 113–144, 1999  相似文献   

10.
In this paper the long‐time behaviour of the solutions of 2‐D wave equation with a damping coefficient depending on the displacement is studied. It is shown that the semigroup generated by this equation possesses a global attractor in H(Ω) × L2(Ω) and H2(Ω)∩H(Ω) × H(Ω). Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

11.
Under certain conditions (known as the restricted isometry property, or RIP) on the m × N matrix Φ (where m < N), vectors x ∈ ?N that are sparse (i.e., have most of their entries equal to 0) can be recovered exactly from y := Φx even though Φ?1(y) is typically an (N ? m)—dimensional hyperplane; in addition, x is then equal to the element in Φ?1(y) of minimal ??1‐norm. This minimal element can be identified via linear programming algorithms. We study an alternative method of determining x, as the limit of an iteratively reweighted least squares (IRLS) algorithm. The main step of this IRLS finds, for a given weight vector w, the element in Φ?1(y) with smallest ??2(w)‐norm. If x(n) is the solution at iteration step n, then the new weight w(n) is defined by w := [|x|2 + ε]?1/2, i = 1, …, N, for a decreasing sequence of adaptively defined εn; this updated weight is then used to obtain x(n + 1) and the process is repeated. We prove that when Φ satisfies the RIP conditions, the sequence x(n) converges for all y, regardless of whether Φ?1(y) contains a sparse vector. If there is a sparse vector in Φ?1(y), then the limit is this sparse vector, and when x(n) is sufficiently close to the limit, the remaining steps of the algorithm converge exponentially fast (linear convergence in the terminology of numerical optimization). The same algorithm with the “heavier” weight w = [|x|2 + ε]?1+τ/2, i = 1, …, N, where 0 < τ < 1, can recover sparse solutions as well; more importantly, we show its local convergence is superlinear and approaches a quadratic rate for τ approaching 0. © 2009 Wiley Periodicals, Inc.  相似文献   

12.
For a potential function that attains its global minimum value at two disjoint compact connected submanifolds N± in , we discuss the asymptotics, as ? → 0, of minimizers u? of the singular perturbed functional under suitable Dirichlet boundary data . In the expansion of E ? (u?) with respect to , we identify the first‐order term by the area of the sharp interface between the two phases, an area‐minimizing hypersurface Γ, and the energy c of minimal connecting orbits between N+ and N?, and the zeroth‐order term by the energy of minimizing harmonic maps into N± both under the Dirichlet boundary condition on ?Ω and a very interesting partially constrained boundary condition on the sharp interface Γ. © 2012 Wiley Periodicals, Inc.  相似文献   

13.
Hoover [2] proved a completeness theorem for the logic L(∫)??. The aim of this paper is to prove a similar completeness theorem with respect to product measurable biprobability models for a logic L(∫1, ∫2) with two integral operators. We prove: If T is a ∑1 definable theory on ?? (a countable admissible set and ω ∈) and consistent with the axioms of L(∫1, ∫2), then there is an analytic absolutely continuous biprobability model in which every sentence in T is satified.  相似文献   

14.
We study an initial‐boundary value problem in one‐space dimension for the discrete Boltzmann equation extended to a diatomic gas undergoing both elastic multiple collisions and chemical reactions. By integration of conservation equations, we prove a global existence result in the half‐space for small initial data N0∈??∩L1. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

15.
We consider the following singularly perturbed Neumann problem: where Δ = Σ ?2/?x is the Laplace operator, ? > 0 is a constant, Ω is a bounded, smooth domain in ?N with its unit outward normal ν, and f is superlinear and subcritical. A typical f is f(u) = up where 1 < p < +∞ when N = 2 and 1 < p < (N + 2)/(N ? 2) when N ≥ 3. We show that there exists an ?0 > 0 such that for 0 < ? < ?0 and for each integer K bounded by where αN, Ω, f is a constant depending on N, Ω, and f only, there exists a solution with K interior peaks. (An explicit formula for αN, Ω, f is also given.) As a consequence, we obtain that for ? sufficiently small, there exists at least [αN, Ωf/?N (|ln ?|)N] number of solutions. Moreover, for each m ∈ (0, N) there exist solutions with energies in the order of ?N?m. © 2006 Wiley Periodicals, Inc.  相似文献   

16.
The random assignment (or bipartite matching) problem asks about An=minπc(i, π(i)), where (c(i, j)) is a n×n matrix with i.i.d. entries, say with exponential(1) distribution, and the minimum is over permutations π. Mézard and Parisi (1987) used the replica method from statistical physics to argue nonrigorously that EAn→ζ(2)=π2/6. Aldous (1992) identified the limit in terms of a matching problem on a limit infinite tree. Here we construct the optimal matching on the infinite tree. This yields a rigorous proof of the ζ(2) limit and of the conjectured limit distribution of edge‐costs and their rank‐orders in the optimal matching. It also yields the asymptotic essential uniqueness property: every almost‐optimal matching coincides with the optimal matching except on a small proportion of edges. ©2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 381–418, 2001  相似文献   

17.
It is known that the joint distribution of the number of nodes of each type of an m‐ary search tree is asymptotically multivariate normal when m ≤ 26. When m ≥ 27, we show the following strong asymptotics of the random vector Xn = t(X, … , X), where X denotes the number of nodes containing i ? 1 keys after having introduced n ? 1 keys in the tree: There exist (nonrandom) vectors X, C, and S and random variables ρ and φ such that (Xn ? nX)/n ? ρ(C cos(τ2log n + φ) + S sin(τ2log n + φ)) →n→∞ 0 almost surely and in L2; σ2 and τ2 denote the real and imaginary parts of one of the eigenvalues of the transition matrix, having the second greatest real part. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   

18.
By using the LITTLEWOOD matrices A2n we generalize CLARKSON' S inequalities, or equivalently, we determine the norms ‖A2n: l(LP) → l(LP)‖ completely. The result is compared with the norms ‖A2n: ll‖, which are calculated implicitly in PIETSCH [6].  相似文献   

19.
We study the maximal function Mf(x) = sup |f(x + y, t)| when Ω is a region in the (y,t) Ω upper half space R and f(x, t) is the harmonic extension to R+N+1 of a distribution in the Besov space Bαp,q(RN) or in the Triebel-Lizorkin space Fαp,q(RN). In particular, we prove that when Ω= {|y|N/ (N-αp) < t < 1} the operator M is bounded from F (RN) into Lp (RN). The admissible regions for the spaces B (RN) with p < q are more complicated.  相似文献   

20.
Let x1,…,xm∈ \input amssym $ \Bbb R$ n be a sequence of vectors with ∥xi2 ≤ 1 for all i. It is proved that there are signs ε1,…,εm = ±1 such that where C1, C2 are some numerical constants. It is also proved that there are signs ε,…,ε = ±1 and a permutation π of {1,…,m} such that where C is some other numerical constant. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011  相似文献   

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

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