一类障碍问题解梯度的局部和边界更高可积性

本文考虑了主部为非线性的障碍问题 ,先证明了其弱解的梯度的更高可积性 ;然后 ,在边界满足P Poincar啨厚的情况下证明了解梯度的边界更高可积性     

非线性椭圆障碍问题很弱解的全局可积性

本文研究一类非线性椭圆方程的K_(ψ,θ)~r(Ω)-障碍问题很弱解u的全局可积性,其中u的可积指数r满足max{1,p-1}r p n.令θ_*=max{θ,ψ},若θ_*∈W~(1,q)(Ω),q r,则上述问题的很弱解u具有全局可积性,这里r充分接近p.     

椭圆方程障碍问题很弱解的全局正则性

在区域Ω的边界是r-Poincaré厚条件下,利用r-Poincaré厚的Sobolev不等式和极大函数表示的有关Sobolev函数的逐点不等式,来构造全局的Lipschitz型检验函数,得到一类拟线性椭圆方程-divA(x,u,Du) =0的Krφ,θ-障碍问题很弱解的全局正则性.     

非齐次障碍问题的正则性结果

本文研究了非齐次椭圆方程的障碍问题,给出了二阶非齐次障碍问题解的定义,利用Poincar啨不等式,获得非齐次障碍问题的解及其导数的一些性质,填补了对非齐次障碍问题研究的空白.     

双障碍问题阻尼牛顿法的二阶收敛性

本文研究由双障碍问题导出的一类B可微函数的性质，并在一定条件下证明了求解相应的B可微方程阻尼牛顿法的全局收效性和二阶收效性．数值例子表明这一算法是有效的．     

外幂的可积性

本文利用Hodge分解等工具,给出了保证空间映射微分的外幂可积性的一个充分条件．     

线性方程组逼近双障碍问题

针对双障碍问题,本文提出了与其等价的B可微方程的类Broyden算法,并 在一定条件下证明了该算法的全局收敛性和超线性收敛性.经数值实验表明该算法是 有效的.     

Neumann系统的量子化与量子可积性

本文首先讨论了球面上的量子化与从欧氏空间中所诱导的Weyl变换之间的关系,然后通过计算Moyal括号证明了量子Neumann系统是完全可积的。     

一类二阶泛函微分方程解的平方可积性和有界性

讨论了二阶泛函微分方程x(″t)+p(t)x(′t)+q1(t)x(t)+q2(t)x(t-τ)=f(t)通过构造一类泛函,借助于两个重要不等式建立了其属于L.S或L.S∩L.C(L.S表示解有界,L.C表示平方可积)的充分条件.     

Riccati方程的可积性条件

得到了R iccati方程的一些可积的充分条件及其在这些条件下的通积分,此结果包含了已有文献中的一些结论,最后给出定理应用的例子.     

椭圆方程双侧障碍问题解的局部有界性

研究非齐次椭圆方程divA(x,u,■u)=f(x)的双侧障碍问题,获得了解的局部有界性结果,这可以认为是经典结果的推广.     

双退化拟线性椭圆型方程Keldys-Fichera障碍问题

讨论一类双退化散度型拟线性椭圆型方程的Keldys-Fichera障碍问题,证明了解的存在性.     

Integrability and linearizability of the Lotka-Volterra systems

Integrability and linearizability of the Lotka-Volterra systems are studied. We prove sufficient conditions for integrable but not linearizable systems for any rational resonance ratio. We give new sufficient conditions for linearizable Lotka-Volterra systems. Sufficient conditions for integrable Lotka-Volterra systems with 3:−q resonance are given. In the particular cases of 3:−5 and 3:−4 resonances, necessary and sufficient conditions for integrable systems are given.     

放缩,反演和障碍问题

代替移动平面法和滑动区域法，作者利用放缩和反演变换研究某些半线性椭圆型分分下等方程解的单调性和对称性，这些变换依赖某一参数，在关于数据的单调性的适当假定下，当参数近某一初始值最大值时，解和其变换的差在某一“窄区域”满足一个椭圆型不等式，利用Ｖａｒａｄｈａｎ的极值原理，即得这个差是正的并得到解的单调性。     

声学反问题的整体唯一性

It is proved that a sound-soft scatterer in R^N （N = 2, 3） is uniquely determined by a finite number of acoustic far-field measurements. The admissible scatterer possibly consists of finitely many solid obstacles and subsets of （N - 1）- dimensional hyperplanes.     

单侧障碍问题解梯度的Hlder连续性

对1相似文献   

A Dynamical Method for Solving the Obstacle Problem

In this paper, we consider the unilateral obstacle problem, trying to find the numerical solution and coincidence set. We construct an equivalent format of the original problem and propose a method with a second-order in time dissipative system for solving the equivalent format. Several numerical examples are given to illustrate the effectiveness and stability of the proposed algorithm. Convergence speed comparisons with existent numerical algorithm are also provided and our algorithm is fast.     

Inverse Obstacle Problem for the Non-Stationary Wave Equation with an Unknown Background

We consider boundary measurements for the wave equation on a bounded domain M ? ?² or on a compact Riemannian surface, and introduce a method to locate a discontinuity in the wave speed. Assuming that the wave speed consist of an inclusion in a known smooth background, the method can determine the distance from any boundary point to the inclusion. In the case of a known constant background wave speed, the method reconstructs a set contained in the convex hull of the inclusion and containing the inclusion. Even if the background wave speed is unknown, the method can reconstruct the distance from each boundary point to the inclusion assuming that the Riemannian metric tensor determined by the wave speed gives simple geometry in M. The method is based on reconstruction of volumes of domains of influence by solving a sequence of linear equations. For τ ∈C(?M) the domain of influence M(τ) is the set of those points on the manifold from which the distance to some boundary point x is less than τ(x).     

A Priori Error Estimates for Obstacle Optimal Control Problem,Where the Obstacle Is the Control Itself

In this paper we deal with the convergence analysis of the finite element method for an elliptic penalized unilateral obstacle optimal control problem where the control and the obstacle coincide. Error estimates are established for both state and control variables. We apply a fixed point type iteration method to solve the discretized problem.To corroborate our error estimations and the efficiency of our algorithms, the convergence results and numerical experiments are illustrated by concrete examples.