变系数Euler-Bernoulli梁振动发展系统的存在性

讨论变系数Euler-Bernoulli梁振动系统{uu(x,t) η(t)uxxxx(x,t)=0,0＜x＜1,0≤t≤T u(0,t)=ux(0,t)=0,0≤t≤t -uxxx(1,t) muu(1,t)=-αu1(1,t) βuxxx(1,t),0≤t≤T uxt(1,t) =-γuxx(1,t),0≤t≤t u(x,0)=u1(x),u1(x,0),0≤x≤1证明了该系统产生一个发展系统．     

关于广义Schrodinger型方程组第三边值问题的差分方法

本文讨论下述定解问题的差分解法 u_t(x,t)=Au_(xx)(x,t) f(u),(x,t)∈Q_T=(0,L)×(0,T) u_x(0,t)—σ_1u(0,t)=0,σ_1>0,t∈[0,T]; u_x(L,t) σ_2u(L,t)=0,σ_2>0,t∈[0,T]; u(x,0)=■(x),x∈[0,L].其中u(x,t)=(u_1(x,t),…,u_m(x,t)),f(u)=f(f_1(u),…,f_m(u)),■(x)=(■_1(x),…■_m(x))满足适定性条件,且假定     

Glimm方法对于燃烧模型组的收敛性

本文对于反应速率无穷的燃烧模型组的初值问题 (u qz)/t f(u)/X=0, s(x,t)=0,sup_(0≤τ≤t) u(x,τ)>0,t≥0,-∞0,f~(11)(u)≥δ>0(u≥0),常数q>0以及当u_0(x)>0时s_0(x)=0。     

一类非线性抛物方程的反问题

本文讨论了下述反问题 u_1-△u=β(t)f(u) γ(x,t),x∈Ω,0相似文献   

半线性抛物型方程的双移动边界问题

本文运用Fourier方法和压缩映像不动点原理,证明了半线性抛物型方程的双移动边界问题 u_t=a~2u_(xx) F(x,t,u,u_x),(x,t)∈D_∞, u(l_1(t),t)=0,l_1(0)=0,t∈(0, ∞), u(l_2(t),t)=0,l_2(0)=l_0,t∈(0, ∞), u(x,0)=φ(x),0≤x≤l_0,φ(0)=φ(l_0)=0.解的存在唯一性,其中D_∞={(x,t)|l_1(t)相似文献   

UPPER SEMICONTINUITY OF ATTRACTORS FORTHE REACTION DIFFUSION EQUATION

1IntroductionInthepresentpaper,weconsiderthefollowingreactiondiffusionequation:at~vAn f(u) A0u g(x)=0,V(x,t)ERxR .(1.1).u(x,0)=u000,VxER,(1.2)andforO=(--n,n)withnEN,otu.~aam. f(,u.) A0u,, g(x)=0,V(x,t)EfixR .(1.3)u.(x,0)=.no.(x),VxeO,(1.4)un(~n,f)=un(n,t)=0,(1.5)whereuandAcarepositivenumbers,g(x)EL'(R),f:R~Risasmoothfunctionwhichsatisfiesf(u)u20,VatER,(1.6)f(0)=0,f,(0)=0,f'(u)2~C,VatER,(1.7)If'(u)I5C(1 fi4lp),p>0,V.uER,(1.8)Inthefollowing,wedenotebyH=L'(R)witlltheusualillnerpro…     

IDENTIFICATION OF PARAMETERS IN SEMILINEAR PARABOLTC EQUATIONS

1IntroductionWeconsiderthefollowingsystem:notu--Z0',(a(x)ox.u)=f(x,t,u),(x,t)EQ,i=1,u(x,t)=0,(x,t)ES,(1)u(x,0)=u000,xEfi,wherefiisaboundeddomaininR"(n21),Q={(x,t):xEfi,tE(0,T)}with0相似文献   

FINITE ELEMENT ANALYSIS OF A LOCAL EXPONENTIALLY FITTED SCHEME FOR TIME-DEPENDENTCONVECTION-DIFFUSION PROBLEMS

1.IntroductionConsiderthetime-dependentconvection-diffusionproblemat--Euzx a(x,t)u. b(x,t)u~f(x,t),(x,t)E[0,1]x[0,T](1.1)u(0,t)=u(1,t)~0,tE[0,T].(1.2)u(x,0)=u000,xE[0,1],(1.3)a(x,t)2or>0,(1.4)b(x,t)--a.(x,t)/220>0,(1.5)where0SE<<1'(1.1)-(1.5)canbereg...     

非线性双曲型方程的混合元方法

1　引　　言考虑下述非线性双曲型方程的混合问题:c(x,u)utt-.(a(x,u)u)=f(x,u,t),　　x∈Ω,t∈J,(1.1)u(x,0)=u0(x),　　x∈Ω,(1.2)ut(x,0)=u1(x),　　x∈Ω,(1.3)u(x,t)=-g(x,t),　　(x,t)∈Ω×J,(1.4)其中ΩR2是一具有Lipschitz边界Ω的有界区域,J=[0,T],0相似文献   

一个局部波动方程组的解的全局存在性与爆破

我们研究初始值问题(e)u1/(e)t2=(e)2u1/(e)x2+‖u2(·,t)‖p, (e)2u2/(e)t2=(e)2u2/(e)x2+‖u1(·,t)‖q,-∞<x<∞,t>0,u1(x,0)=f1(x), (e)u1/(e)t(x,0)=g1(x),u2(x,0)=f2(x), (e)u2/(e)t(x,0)=g2(x),- ∞<x<∞,where‖ui(·,t)‖=∫∞-∞(4)i(x)|ui(x,t)|dx with (4)i(x)≥0 and ∫∞-∞(4)i(x)dx=1,i=1,2.然后建立解的全局存在和爆破的标准,提出爆破增长率.     

A Note on the Stability of the Integral-Differential Equation of the Hyperbolic Type in a Hilbert Space

In this paper, the initial-value problem for integral-differential equation of the hyperbolic type in a Hilbert space H is considered. The unique solvability of this problem is established. The stability estimates for the solution of this problem are obtained. The difference scheme approximately solving this problem is presented. The stability estimates for the solution of this difference scheme are obtained. In applications, the stability estimates for the solutions of the nonlocal boundary problem for one-dimensional integral-differential equation of the hyperbolic type with two dependent limits and of the local boundary problem for multidimensional integral-differential equation of the hyperbolic type with two dependent limits are obtained. The difference schemes for solving these two problems are presented. The stability estimates for the solutions of these difference schemes are obtained.     

Solving the discrete-continuous project scheduling problem via its discretization

In this paper a discrete-continuous project scheduling problem is considered. In this problem activities simultaneously require discrete and continuous resources. The processing rate of each activity depends on the amount of the continuous resource allotted to this activity at a time. All the resources are renewable ones. The activities are nonpreemtable and the objective is to minimize the makespan. Discretization of this problem leading to a classical (i.e. discrete) project scheduling problem in the multi-mode version is presented. A simulated annealing (SA) approach to solving this problem is described and tested computationally in two versions: with and without finding an optimal continuous resource allocation for the final schedule. In the former case a nonlinear solver is used for solving a corresponding convex programming problem. The results are compared with the results obtained using SA for the discrete-continuous project scheduling problem where the nonlinear solver is used for exact solving the continuous part in each iteration. The results of a computational experiment are analyzed and some conclusions are included.     

Iterative approximation of a common solution of a split equilibrium problem,a variational inequality problem and a fixed point problem

In this paper, we introduce an iterative method to approximate a common solution of a split equilibrium problem, a variational inequality problem and a fixed point problem for a nonexpansive mapping in real Hilbert spaces. We prove that the sequences generated by the iterative scheme converge strongly to a common solution of the split equilibrium problem, the variational inequality problem and the fixed point problem for a nonexpansive mapping. The results presented in this paper extend and generalize many previously known results in this research area.     

A branch and bound network approach to the canonical constrained entropy problem

In this paper, we present a branch and bound algorithm for solving the constrained entropy mathematical programming problem. Unlike other methods for solving this problem, our method solves more general problems with inequality constraints. The advantage of the proposed technique is that the relaxed problem solved at each node is a singly constrained network problem. The disadvantage is that the relaxed problem has twice as many variables as the original problem. An application to regional planning is given, and an example problem is solved.     

Some remarks on the dynamics of cell membranes

Motivated by the desire to model the entry of 1,25D into a cell by receptor mediated endocytosis, we have formulated the problem as the dynamics of a bilayer membrane. We have discussed setting the problem as a variational problem using the Helfrich modeling of the bilayer in terms of the free energy. Using a Lagrangian formulation we arrive at the Euler–Lagrange equations for the system. The model we have used depends on the amount of reagent in the neighborhood of the upper membrane. The problem thereby reduces to a moving boundary problem, which is dependent on a diffusion equation for a region changing with time. In order to solve this problem we seek the correct Neumann function for this altered. This is accomplished by deriving a Hadamard variational formula for the diffusion equation. We also offer an iterative procedure for solving this non-linear problem.     

An Algorithm for the 0-1 Equality Knapsack Problem

The 0-1 knapsack problem is a linear integer-programming problem with a single constraint and binary variables. The knapsack problem with an inequality constraint has been widely studied, and several efficient algorithms have been published. We consider the equality-constraint knapsack problem, which has received relatively little attention. We describe a branch-and-bound algorithm for this problem, and present computational experience with up to 10,000 variables. An important feature of this algorithm is a least-lower-bound discipline for candidate problem selection.     

一类亚半正定矩阵的左右逆特征值问题

1．引言在工程技术中常常遇到这样一类逆特征值问题：要求在一个矩阵集合S中，找具有给定的部分右特征对（特征值及相应的特征向量）和给定的部分左特征对（特征值及相应的特征向量）的矩阵．文［2］，［3］讨论了S为。x。实矩阵集合的情形．文［4］－［7］对S为nxn实对称矩阵．对称正定矩阵，对称半正定矩阵集合的情形进行了讨论．文【川讨论了S为亚正定阵集合的情形．并提到了对于亚半正定矩阵的情形目下无人涉及，有待进一步研究．本文将对S为nxn亚半正定矩阵集合的情形进行讨论．给出了亚半正定矩阵的左右逆特征值问题有解的充要条件…     

一种新的向量互补问题

本文在实局部凸空间中引入了一种新的向量互补问题,这一向量互补问题不仅包含了由Ｙｕ和Ｙａｏ提出的广义向量互补问题由Ｃｈｅｎ和Ｙａｎｇ定义的弱向量互补问题,而且还包含了Ｉｓａｃ意义下的隐互补问题。本文还讨论了新的向量互补问题,向量变分不等式,向量单向极小化问题和最小元问题之间的关系,给出了这一向量互补问题解的存在定理。     

Reconstruction of boundary regimes in the inverse problem of thermal convection of a high-viscosity fluid

A problem of reconstruction of boundary regimes in a model for free convection of a high-viscosity fluid is considered. A variational method and a quasi-inversion method are suggested for solving the problem in question. The variational method is based on the reduction of the original inverse problem to some equivalent variational minimum problem for an appropriate objective functional and solving this problem by a gradient method. When realizing the gradient method for finding a minimizing element of the objective functional, an iterative process actually reducing the original problem to a series of direct well-posed problems is organized. For the quasi-inversion method, the original differential model is modified by means of introducing special additional differential terms of higher order with small parameters as coefficients. The new perturbed problem is well-posed; this allows one to solve this problem by standard methods. An appropriate choice of small parameters gives an opportunity to obtain acceptable qualitative and quantitative results in solving the inverse problem. A comparison of the methods suggested for solving the inverse problem is made with the use of model examples.     

Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems

We consider the problem of obtaining integer solutions to a minmax linear programming problem. Although this general problem is NP-complete, it is shown that a restricted version of this problem can be solved in polynomial time. For this restricted class of problems two polynomial time algorithms are suggested, one of which is strongly polynomial whenever its continuous analogue and an associated linear programming problem can be solved by a strongly polynomial algorithm. Our algorithms can also be used to obtain integer solutions for the minmax transportation problem with an inequality budget constraint. The equality constrained version of this problem is shown to be NP-complete. We also provide some new insights into the solution procedures for the continuous minmax linear programming problem.