用有限元法近似解Stokes方程

这里Ω是R~N中的有界开集,边界Γ充分光滑。为了叙述简单起见,只讨论N=2的情形。(1.1)中的u=(u_1,u_2)表示流体的速度,p表示压力,f表示单位质量的体积力,v>0是动力粘滞度。 Falk曾讨论用有限元法求(1.1)的近似解,近似解空间取为[H_0~1(Ω)]~2×L~2(Ω)的有限维子空间。我们知道,当Ω不是多角形区域时,由分片多项式构成的有限维空间不可     

抛物型方程描述的分布参数系统最优控制的区域扰动

设Ω_0为 R~n 中有界区域,其边界Γ_0=(?)_0足够光滑,Ω_0局部地位于Γ_0的一侧.设T 为固定正数,记 Q_0=Ω_0×(0,T).在 Q_0上考虑如下的最优控制问题:(?)其中 U_0为 L~2(Q_0)中的闭凸子集,N>0为常数,u_0(v)表示(1.1)的对应于 v∈L~(?)(Q_0)     

非线性波动方程的数值解

Ω是n维空间R_x~n中的有界开域,x=(x_1,x_2,…,x_n).Γ是Ω的边界,Γ适当光滑.T是固定的正数.Q=Ω×]0,T[,∑=Γ×]0,T[.本文考虑下列问题:     

Stokes问题的混合有限元分析

在问题(ST)中,u=(u_1,u_2)~T是流体速度,p是压力. 设X_h及M_h分别为(H_0~1(Ω))~2及L_0~2(Ω)的有限元离散空间。且X_h(H_0~1(Ω))~2,M_h?     

THE GLOBAL SMOOTH SOLUTIONS OF SECOND ORDER QUASILINEAR HYPERBOLIC EQUATIONS WITH DISSIPATIVE BOUNDARY CONDITIONS

The paper deals with the following boundary problem of the second order quasilinear hyperbolic equation with a dissipative boundary condition on a part of the boundary:u_(tt)-sum from i,j=1 to n a_(ij)(Du)u_(x_ix_j)=0, in (0, ∞)×Ω,u|Γ_0=0,sum from i,j=1 to n, a_(ij)(Du)n_ju_x_i+b(Du)u_t|Γ_1=0,u|t=0=φ(x), u_t|t=0=ψ(x), in Ω, where Ω=Γ_0∪Γ_1, b(Du)≥b_0>0. Under some assumptions on the equation and domain, the author proves that there exists a global smooth solution for above problem with small data.     

STOKES COUPLING METHOD FOR THE EXTERIOR FLOW PART Ⅰ:APPROXIMATE ACCURACY

1.IntroductionLetΩ0beasimply-connectedboundedopensetofR2withthesmoothboundaryΓandletΩdenotethecomplementofΩ0Γ,wheretheoriginofcoordinatesislocatedintheinteriorofΩ0.InQ =Ω×R ,weconsiderthefollowinginitial-boundaryvalueproblemoftheNavier-Stokes...     

变秩特征边界正对称组的齐次合格边值问题

本文考虑在变秩特征边界附近为双曲型的正对称组的齐次合格边值问题的L~2适定性。设,在Ω中是正对称组合格边值问题。Ω为x<0,Γ=Γ1Γ2={y≤0}{y≥0}。 若B正定,π关于B恰当定号,π_1(?)π_2在Γ_1∩Γ_2上,则边值问题存在唯一强解u∈L~2(Ω)。又若共轭问题也满足同样条件,则L~2强弱解一致。     

Robin反问题的线性互补解法

正1引言考虑二维Laplace方程的Robin边界问题{△u=0,u∈Ω,?u/?v+pu=g,u∈?Ω=Γ,(1)其中Ω■R~2,Γ表示区域Ω的边界,v(向量)表示Γ上的单位外法向量,Robin系数p是一个非负函数,其支撑Γ_1■Γ,g是给定的函数,其支撑Γ_0■Γ,Γ_0与Γ_1满足Γ_0∩Γ_1=?.这类微分方程产生于一些实际应用,例如模拟电导体和周围环境之间的稳态热传导模型和半导体中金属和硅的接触面模型等,方程中的u,p,g在不同的环境下代表不同的     

圆周自映射的v极限集

设 f:s~1→s~1为连续映射。f 的回归点集和非游荡集分别记为 R 和Ω.xes~1,令v(x)=ω(x)∩α(x),其中ω(x)(α(x)为 x 的ω-(α-)极限集.令Γ=(?)v(x),若 y(?)s~1,记∧(y)=(?)ω(x).我们证明了:(1)Γ=∧(Ω)=∧(∧)=∧(Γ);(2)Ω-Γ是 s~1中无处稠密的可数集;(3)若以 x 为端点的每个开弧至少包含某个轨道中的的两点,则 x∈Γ;(4)若Γ-R≠φ,则Γ-R 为不可数集;(5)如(?)-R≠φ,则(?)-R 为无限集;(6)Γ=R 当且仅当(?)~(+)∩(?)~(-)=R.其中(?)~(+)((?)~(-))表示 R 的右(左)闭包。     

关于复Schr(?)dinger方程和实Klein-Gordon方程耦合方程组整体解的不存在性

§1.具Neumann边界条件的初边值问题 考虑如下初边值问题其中Ω是R~n中具光滑边界Ω的有界域,v是Ω上的外法向,u(t,x)与f是实值函数,v(t,x)与g是复值函数,Du=(u_1,u_(x_1),…,u_(x_n)).     

Strong formulations for the pooling problem

The pooling problem is a well-studied global optimization problem with applications in oil refining and petrochemical industry. Despite the strong NP-hardness of the problem, which is proved formally in this paper, most instances from the literature have recently been solved efficiently by use of strong formulations. The main contribution from this paper is a new formulation that proves to be stronger than other formulations based on proportion variables. Moreover, we propose a promising branching strategy for the new formulation and provide computational experiments confirming the strength of the new formulation and the effectiveness of the branching strategy.     

Dynamic Programming State-Space Relaxation for Single-Machine Scheduling

The problem of sequencing jobs on a single machine to minimize total cost is considered. Machine capacity constraints require that, at any time, at most one job is processed. Also, no machine idle-time between processing jobs is allowed. In contrast to most research, it is not assumed that the cost is a non-decreasing function of completion time. A dynamic programming formulation of the problem is presented. Since the number of states required by this formulation is prohibitively large, the possibilities for branch and bound algorithms are explored. It is shown that the dynamic programming formulation can be relaxed by mapping the state-space onto a smaller state-space and performing the recursion on this smaller state-space, thereby giving a lower bound. Techniques for improving this lower bound through the use of penalties and through the use of state-space modifiers are discussed. Computational results are presented for the problem in which each job has a due date, and the objective is to minimize the sum of holding costs for jobs completed before their due date and tardiness costs for jobs completed after their due date.     

Vorticity–velocity-pressure and stream function-vorticity formulations for the Stokes problem

We study the Stokes problem of incompressible fluid dynamics in two and three-dimension spaces, for general bounded domains with smooth boundary. We use the vorticity–velocity-pressure formulation and introduce a new Hilbert space for the vorticity. We develop an abstract mixed formulation that gives a precise variational frame and conducts to a well-posed Stokes problem involving a new velocity–vorticity boundary condition. In the particular case of simply connected bidimensional domains with homogeneous boundary conditions, the link with the classical stream function-vorticity formulation is completely described, and we show that the vorticity–velocity-pressure formulation is a natural mathematical extension of the previous one.     

A variational inequality approach to constrained control problems for parabolic equations

A distributed optimal control problem for parabolic systems with constraints in state is considered. The problem is transformed to control problem without constraints but for systems governed by parabolic variational inequalities. The new formulation presented enables the efficient use of a standard gradient method for numerically solving the problem in question. Comparison with a standard penalty method as well as numerical examples are given.     

Minimum-weight design of structures with natural-frequency constraints

The problem of minimum-weight design of structures with several natural-frequency constraints is considered in this paper. The problem is solved by using a combined finite element method and sequential linear programming (FEM-SLP) formulation. The unique features of the present approach include the use of the assumed mode reanalysis formulation for the repeated eigensolution and the associated sensitivity analysis. The present approach has been implemented using the general-purpose finite element program . Two examples are included to illustrate the effectiveness of the present approach.     

Coupling of mixed finite element and stabilized boundary element methods for a fluid–solid interaction problem in 3D

We introduce and analyze the coupling of a mixed finite element and a boundary element for a three‐dimensional time‐harmonic fluid–solid interaction problem. We consider a formulation in which the Cauchy stress tensor and the rotation are the main variables in the elastic structure and use the usual pressure formulation in the acoustic fluid. The mixed variational formulation in the solid is completed with boundary integral equations relating the Cauchy data of the acoustic problem on the coupling interface. A crucial point in our formulation is the stabilization technique introduced by Hiptmair and coworkers to avoid the well‐known instability issue appearing in the boundary element method treatment of the exterior Helmholtz problem. The main novelty of this formulation, with respect to a previous approach, consists in reducing the computational domain to the solid media and providing a more accurate treatment of the far field effect. We show that the continuous problem is well‐posed and propose a conforming Galerkin method based on the lowest‐order Arnold–Falk–Winther mixed finite element. Finally, we prove that the numerical scheme is convergent with optimal order.Copyright © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1211–1233, 2014     

A finite element method for the double-layer potential solutions of the Neumann exterior problem

A variational formulation for the integral equation used for the double layer potential solution of the Neumann exterior problem in the Laplace equation was proposed in [4]. This formulation allows the use of a finite element method which we describe and experiment here.     

Natural language and the art and science of problem/opportunity formulation: a transportation planning case analysis

The formulation process has been called the most important phase of decision making, yet little is known about how this process is carried out in a group, team, or organizational context through a discussion of issues and opportunities. This paper reviews the literatures on problem/opportunity formulation, particularly as related to the use of natural language in developing collective perception. Applying a taxonomy of six linguistic structures, the formulation process of a 13-member transportation planning committee is analysed. The results of this field study suggest overall preferences for simple rather than complex linguistic structures, differentiated by member roles (leader versus non-leader). Further, exploration of the problem/opportunity-space began with a relatively broad interpretation of the problematic situation, and proceeded incrementally. Digressions from this incremental exploration increased as the process unfolded, precipitated by changes in speakers. The implications of this analysis for understanding and managing the formulation process, as well as for future research, are discussed.     

Branching in branch-and-price: a generic scheme

Developing a branching scheme that is compatible with the column generation procedure can be challenging. Application specific and generic schemes have been proposed in the literature, but they have their drawbacks. One generic scheme is to implement standard branching in the space of the compact formulation to which the Dantzig-Wolfe reformulation was applied. However, in the presence of multiple identical subsystems, the mapping to the original variable space typically induces symmetries. An alternative, in an application specific context, can be to expand the compact formulation to offer a wider choice of branching variables. Other existing generic schemes for use in branch-and-price imply modifications to the pricing problem. This is a concern because the pricing oracle on which the method relies might become obsolete beyond the root node. This paper presents a generic branching scheme in which the pricing oracle of the root node remains of use after branching (assuming that the pricing oracle can handle bounds on the subproblem variables). The scheme does not require the use of an extended formulation of the original problem. It proceeds by recursively partitioning the subproblem solution set. Branching constraints are enforced in the pricing problem instead of being dualized via Lagrangian relaxation, and the pricing problem is solved by a limited number of calls to the pricing oracle. This generic scheme builds on previously proposed approaches and unifies them. We illustrate its use on the cutting stock and bin packing problems. This is the first branch-and-price algorithm capable of solving such problems to integrality without modifying the subproblem or expanding its variable space.     

Robust solution of monotone stochastic linear complementarity problems

We consider the stochastic linear complementarity problem (SLCP) involving a random matrix whose expectation matrix is positive semi-definite. We show that the expected residual minimization (ERM) formulation of this problem has a nonempty and bounded solution set if the expected value (EV) formulation, which reduces to the LCP with the positive semi-definite expectation matrix, has a nonempty and bounded solution set. We give a new error bound for the monotone LCP and use it to show that solutions of the ERM formulation are robust in the sense that they may have a minimum sensitivity with respect to random parameter variations in SLCP. Numerical examples including a stochastic traffic equilibrium problem are given to illustrate the characteristics of the solutions.