首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Abstract

We study the regularity of the free boundary in the two membranes problem. We prove that around any point the free boundary is either a C 1, α surface or a cusp, as in the obstacle problem. We also prove C 1, 1 regularity for the pair of functions solving the problem.  相似文献   

2.
We consider the problem of finding the nearest point in a polyhedral cone C={xR n :D x≤0} to a given point bR n , where DR m×n . This problem can be formulated as a convex quadratic programming problem with special structure. We study the structure of this problem and its relationship with the nearest point problem in a pos cone through the concept of polar cones. We then use this relationship to design an efficient algorithm for solving the problem, and carry out computational experiments to evaluate its effectiveness. Our computational results show that our proposed algorithm is more efficient than other existing algorithms for solving this problem.  相似文献   

3.
On the setting of the half-spaceR n–1×R +, we investigate Gleason's problem for harmonic Bergman and Bloch functions. We prove that Gleason's problem for the harmonicL p -Bergman space is solvable if and only ifp>n. We also prove that Gleason's problem for the harmonic (little) Bloch space is solvable.  相似文献   

4.
We consider convex problems of semi-infinite programming (SIP) using an approach based on the implicit optimality criterion. This criterion allows one to replace optimality conditions for a feasible solution x 0 of the convex SIP problem by such conditions for x 0 in some nonlinear programming (NLP) problem denoted by NLP(I(x 0)). This nonlinear problem, constructed on the base of special characteristics of the original SIP problem, so-called immobile indices and their immobility orders, has a special structure and a diversity of important properties. We study these properties and use them to obtain efficient explicit optimality conditions for the problem NLP(I(x 0)). Application of these conditions, together with the implicit optimality criterion, gives new efficient optimality conditions for convex SIP problems. Special attention is paid to SIP problems whose constraints do not satisfy the Slater condition and to problems with analytic constraint functions for which we obtain optimality conditions in the form of a criterion. Comparison with some known optimality conditions for convex SIP is provided.  相似文献   

5.
We study in this article a method which computes the variability of current, density and pressure in an oceanic domain. The equations are of Navier-Stokes type for the velocity and pressure, of transport-diffusion type for the density. They are linearized around a given mean circulation and modified by the Boussinesq approximation: density variations are neglected except in the terms of gravity acceleration. The existence and uniqueness of a solution are proved for two sets of equations: first the three-dimensional problem and then the two-dimensional cyclic problem derived by assuming a sinusoidal x-dependence for the perturbation of mean flow. The latter corresponds to a modelization of tropical instability waves which are illustrated by the El Nino phenomenon.

The value of the pressure p on the surface of ocean is of great interest for physical interpretation. To define that quantity, it is necessary to have the regularity p ? H 1. We have proved that the perturbation (u,ρ,p) of mean circulation is such that: u ? L 2(0T,H 2), ρ ? L 2(0,T H 2) and p ? L 2 L 2(0,T H 1), provided the perturbation of the windstress is sufficiently regular and satisfies compatibility relations. It is proved by means of an extension method, with even-odd reflection. We then develop a problem of control. The observation is the Variability of pressure on the surface of ocean. The control is the variability of windstress f, which acts as to forcing of the perturbation. We prove the existence and uniqueness of an optimal control, which is characterized by a set of equations including the direct problem and the adjoint problem. These results are valid for the three-dimensional problem and the two-dimensional cyclic problem.  相似文献   

6.
We consider the scattering problem for the Hartree equation with potential |x|−1 in a space of dimensionn≥2. We prove the existence ofH m -modified wave operator for Hartree equation on a dense set of a neighborhood of zero inH m (ℝ n ), meanwhile, we obtain also the global existence for the Cauchy problem of Hartree equation in a space of dimensionn≥2. This project is supported by the National Natural Science Foundation of China, 19601005  相似文献   

7.
In this paper we consider a general nonlinear boundary value problem for second-order differential inclusions. We prove two existence theorems, one for the ``convex' problem and the other for the ``nonconvex' problem. Then we show that the solution set of the latter is dense in the C 1 (T,R N ) -norm to the solution set of the former (relaxation theorem). Subsequently for a Dirichlet boundary value problem we prove the existence of extremal solutions and we show that they are dense in the solutions of the convexified problem for the C 1 (T,R N ) -norm . Our tools come from multivalued analysis and the theory of monotone operators and our proofs are based on the Leray—Schauder principle. Accepted 18 September 1997  相似文献   

8.
Faster Subtree Isomorphism   总被引:2,自引:0,他引:2  
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O((k1.5/log k)n)-time algorithm for this problem, where k and n are the number of vertices in H and G, respectively. This improves over the O(k1.5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(k1.376n)-time algorithm for the decision problem.  相似文献   

9.
In this paper, parallel algorithms are presented for solving some problems on permutation graphs. The coloring problem is solved inO(log2 n) time usingO(n 3/logn) processors on the CREW PRAM, orO(logn) time usingO(n 3) processors on the CRCW PRAM. The weighted clique problem, the weighted independent set problem, the cliques cover problem, and the maximal layers problem are all solved with the same complexities. We can also show that the longest common subsequence problem belongs to the class NC.  相似文献   

10.
We establish the existence and stability of multidimensional transonic shocks (hyperbolic‐elliptic shocks) for the Euler equations for steady compressible potential fluids in infinite cylinders. The Euler equations, consisting of the conservation law of mass and the Bernoulli law for velocity, can be written as a second order nonlinear equation of mixed elliptic‐hyperbolic type for the velocity potential. The transonic shock problem in an infinite cylinder can be formulated into the following free boundary problem: The free boundary is the location of the multidimensional transonic shock which divides two regions of C1,α flow in the infinite cylinder, and the equation is hyperbolic in the upstream region where the C1,α perturbed flow is supersonic. We develop a nonlinear approach to deal with such a free boundary problem in order to solve the transonic shock problem in unbounded domains. Our results indicate that there exists a solution of the free boundary problem such that the equation is always elliptic in the unbounded downstream region, the uniform velocity state at infinity in the downstream direction is uniquely determined by the given hyperbolic phase, and the free boundary is C1,α, provided that the hyperbolic phase is close in C1,α to a uniform flow. We further prove that, if the steady perturbation of the hyperbolic phase is C2,α, the free boundary is C2,α and stable under the steady perturbation. © 2003 Wiley Periodicals Inc.  相似文献   

11.
An iteration scheme is used to show the well‐posedness of the initial‐boundary value problem for incompressible hypoelastic materials, which arise as a high Weissenberg number limit of viscoelastic fluids. We first assume that the stress is a rank‐one matrix T=qqT, q∈?n, and develop energy estimates to show that the problem is locally well‐posed. This problem is related to incompressible ideal magnetohydrodynamics (MHD). We show that the general case T=CCT, C∈?n×n can be handled by a generalization of the method we developed. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   

12.
We investigate a backward problem for the Rayleigh‐Stokes problem, which aims to determine the initial status of some physical field such as temperature for slow diffusion from its present measurement data. This problem is well‐known to be ill‐posed because of the rapid decay of the forward process. We construct a regularized solution using the filter regularization method in the Gaussian random noise. Under some a priori assumptions on the exact solution, we establish the expectation between the exact solution and the regularized solution in the L2 and Hm norms.  相似文献   

13.
We prove that C2+α,1+α/2 (Q?) solutions of problem (1.6) below are in a subspace Hcm+2(Q) of Hm+2,(m+2)/2(Q) for all m ∈ ?, if f and the coefficients are in Hcm(Q)∪Cα,α/2 (Q?). We apply this result to obtain global existence of Sobolev solutions to the quasilinear problem (1.26) below.  相似文献   

14.
We consider the problem of partitioning the node set of a graph intopequal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded error ratio can be given for the problem unless P = NP. We present anO(n2) time algorithm for the problem, wherenis the number of nodes in the graph. Assuming that the edge lengths satisfy the triangle inequality, its error ratio is at most 2p − 1. We also present an improved algorithm that obtains as an input a positive integerx. It runs inO(2(p + x)pn2) time, and its error ratio is at most (2 − x/(x + p − 1))p.  相似文献   

15.
We show how to speed up Karmarkar's linear programming algorithm for the case of multicommodity flows. The special structure of the constraint matrix is exploited to obtain an algorithm for the multicommodity flow problem which requires O(s 3.5 v 2.5 eL) arithmetic operations, each operation being performed to a precision of O (L) bits. Herev is the number of vertices ande is the number of edges in the given network,s is the number of commodities, andL is bounded by the number of bits in the input. We obtain a speed up of the order of (e 0.5/v 0.5)+(e 2.5/v 2.5s2) over Karmarkar's modified algorithm which is substantial for dense networks. The techniques in the paper can also be used to speed up any interior point algorithm for any linear programming problem whose constraint matrix is structurally similar to the one in the multicommodity flow problem. Research supported by a fellowship from the Shell Foundation. Research supported by NSF under grant NSF DCR-8404239.  相似文献   

16.
We prove that a linear bounded extension operator exists for the trace of C 1·ω (R n )to an arbitrary closed subset of R n .The similar result is obtained for some other spaces of multivariate smooth functions. We also show that unlike the one-dimensional case treated by Whitney, for some trace spaces of multivariate smooth functions a linear bounded extension operator does not exist. The proofs are based on a relation between the problem under consideration and a similar problem for Lipschitz spaces defined on hyperbolic Riemannian manifolds.  相似文献   

17.
We study the Cauchy problem for a class of quasilinear hyperbolic systems with coefficients depending on (t, x) ∈ [0, T ] × ?n and presenting a linear growth for |x | → ∞. We prove well‐posedness in the Schwartz space ?? (?n ). The result is obtained by deriving an energy estimate for the solution of the linearized problem in some weighted Sobolev spaces and applying a fixed point argument. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

18.
The Picard variety Pic0(? n ) of a complex n-dimensional torus? n is the group of all holomorphic equivalence classes of topologically trivial holomorphic (principal) line bundles on ? n . The total space of a topologically trivial holomorphic (principal) line bundle on a compact K?hler manifold is weakly pseudoconvex. Thus we can regard Pic0(? n ) as a family of weakly pseudoconvex K?hler manifolds. We consider a problem whether the Kodaira's -Lemma holds on a total space of holomorphic line bundle belonging to Pic0(? n ). We get a criterion for this problem using a dynamical system of translations on Pic0(? n ). We also discuss the problem whether the -Lemma holds on strongly pseudoconvex K?hler manifolds or not. Using the result of ColColţoiu, we find a 1-convex complete K?hler manifold on which the -Lemma does not hold. Received: 11 June 1999 / Revised version: 22 November 1999  相似文献   

19.
In this paper we are concerned with the initial boundary value problem of the micropolar fluid system in a three dimensional bounded domain. We study the resolvent problem of the linearized equations and prove the generation of analytic semigroup and its time decay estimates. In particular, LpLq type estimates are obtained. By use of the LpLq estimates for the semigroup, we prove the existence theorem of global in time solution to the original nonlinear problem for small initial data. Furthermore, we study the magneto‐micropolar fluid system in the final section. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

20.
We study the asymptotic behaviour of the solution of a stationary quasilinear elliptic problem posed in a domain Ω(ε) of asymptotically degenerating measure, i.e. meas Ω(ε) → 0 as ε → 0, where ε is the parameter that characterizes the scale of the microstructure. We obtain the convergence of the solution and the homogenized model of the problem is constructed using the notion of convergence in domains of degenerating measure. Proofs are given using the method of local characteristics of the medium Ω(ε) associated with our problem in a variational form. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

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

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