首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 796 毫秒
1.
二阶椭圆型偏微分方程奇异摄动问题的差分解法   总被引:1,自引:0,他引:1  
近十多年来出现了一系列奇异摄动问题的数值解法,例如C.E.Pearson,F.W.Door,H.O.Kreiss,A.M.,K.B.等人的工作,他们大都对常微分方程和常微分方程组奇异摄动问题来讨论的。 苏煜城、吴启光在1980年用差分方法讨论了椭圆——抛物偏微分方程的奇异摄动问  相似文献   

2.
研究了一类线性奇异摄动最优控制问题的空间对照结构,讨论了初始点固定,终端自由的情形.首先根据变分法得到了一阶最优性条件,其次运用退化最优控制问题的解证明了异宿轨道的存在性,从而结合奇异摄动理论证明了原问题空间对照结构解的存在性.进一步根据解的结构,利用边界层函数法构造了奇异摄动最优控制问题一致有效的形式渐近解.最后,通...  相似文献   

3.
矩阵奇异值分解的摄动重分析技术具有广泛的应用前景,作者继在文[2]中提出了一种间接摄动分析方法之后,在本文中又进一步提出了直接摄动法,建立了一般实矩阵的非重奇异值及其左、古奇异向量的二阶摄动计算公式.这可满足大多数实际应用问题的一般需要.文中以算例说明了直接摄动法的有效性.  相似文献   

4.
简要介绍了《奇异摄动丛书》和奇异摄动研究的几个热点方向:几何奇异摄动、空间对照结构理论、高阶微分方程和非线性微分方程奇异摄动边值问题等.  相似文献   

5.
时滞奇异摄动问题单支方法的收敛性   总被引:8,自引:0,他引:8       下载免费PDF全文
甘四清  孙耿 《中国科学A辑》2001,31(4):314-323
讨论数值求解一类单参数多刚性时滞奇异摄动问题的单支方法的误差分析.获得了A-稳定的单支方法关于这类时滞奇异摄动问题(在时滞部分用线性插值时)的收敛性结果.数值例子进一步证实了理论结果的正确性.  相似文献   

6.
利用奇异摄动理论对矩形域内二阶椭圆型奇异摄动方程的Dirichlet问题建立了边界层格式,并作出了误差估计。  相似文献   

7.
朱红宝 《应用数学和力学》2019,40(12):1356-1363
讨论了一类奇异摄动非线性分数阶时滞问题.首先利用奇异摄动方法求出了问题的外部解.再利用伸展变量法构造了问题在边界附近的两个边界层校正项,得出了所提问题的形式渐近解.最后,在合适的假设条件下,利用微分不等式理论证明了解的一致有效性,并给出了结论及未来的研究方向.  相似文献   

8.
利用奇异摄动方法,提供了一种以光滑的多尺度解的观点来研究一类脉冲微分方程.通过引入适当的奇异摄动项,定义了相应的奇异摄动边值问题,其对应的退化方程即为原脉冲微分方程.利用边界层函数法和缝接法,构造了该奇异摄动边值问题的光滑多尺度解,并有效地刻画原脉冲微分方程的不连续解,同时也证明了多尺度解的存在性及余项估计.最后,通过...  相似文献   

9.
本文讨论了一类具奇异右端项的伪抛物方程的初边值问题的摄动,证明了摄动问题广义解的存在性及极限性态,并得到了当ε趋于零时,摄动问题的解在一定意义下收敛于原问题的解.  相似文献   

10.
李翠萍 《中国科学A辑》1999,29(12):1084-1093
鸭解问题是近年来在奇异摄动方程的研究中发现并开始研究的 ,是一种新的分支现象 .用渐近分析方法、微分方程定性理论及不动点方法对一类二维单参数奇异摄动系统进行了研究 ,给出了鸭解和鸭极限环存在的条件及对应的参数估计 .  相似文献   

11.
In this paper, the problem of disturbance attenuation with internalstability for nonlinear systems with Markovian jumping parametersis considered. It is shown that this problem is solvable ifthere exists a sequence of smooth-positive semidefinite functionssatisfying certain Hamilton-Jacobi-Isaac equations (inequalities).Furthermore, it is shown that, if this solution exists, it representsa stochastic Lyapunov function for the closed-loop nonlinearsystem. A parametrization of the family of full-informationstate-feedback controllers satisfying the disturbance-attenuationrequirement with stochastic stability for the closed-loop systemis also given.  相似文献   

12.
This paper is concerned with iterative procedures for the monotone complementarity problem. Our iterative methods consist of finding fixed points of appropriate continuous maps. In the case of the linear complementarity problem, it is shown that the problem is solvable if and only if the sequence of iterates is bounded in which case summability methods are used to find a solution of the problem. This procedure is then used to find a solution of the nonlinear complementarity problem satisfying certain regularity conditions for which the problem has a nonempty bounded solution set.  相似文献   

13.
We study a nonlocal boundary-value problem for a degenerate hyperbolic equation. We prove that this problem is uniquely solvable if Volterra integral equations of the second kind are solvable with various values of parameters and a generalized fractional integro-differential operator with a hypergeometric Gaussian function in the kernel.  相似文献   

14.
Feasibility is an important property for a complementarity problem. A complementarity problem is solvable if it is feasible and some supplementary assumptions are satisfied. In this paper, we introduce the notion of (, )-exceptional family of elements for a continuous function and we apply this notion to the study of feasibility of nonlinear complementarity problems.  相似文献   

15.
The initial boundary value problem for a nonlinear nonhomogeneous equation of Sobolev type used for modeling nonstationary processes in semiconductors is examined. It is proved that this problem is uniquely solvable at least locally in time. Sufficient conditions for the problem to be solvable globally in time are found, as well as sufficient conditions for the local (but not global) solvability. In the case of only local solvability, upper and lower estimates for the time when a solution exists are determined in the form of either explicit or quadrature formulas.  相似文献   

16.
A complementarity problem is said to be globally uniquely solvable (GUS) if it has a unique solution, and this property will not change, even if any constant term is added to the mapping generating the problem.A characterization of the GUS property which generalizes a basic theorem in linear complementarity theory is given. Known sufficient conditions given by Cottle, Karamardian, and Moré for the nonlinear case are also shown to be generalized. In particular, several open questions concerning Cottle's condition are settled and a new proof is given for the sufficiency of this condition.A simple characterization for the two-dimensional case and a necessary condition for then-dimensional case are also given.The research described in this paper was carried out while N. Megiddo was visiting Tokyo Institute of Technology under a Fellowship of the Japan Society for the Promotion of Science.  相似文献   

17.
A generalization of Segal's theorem on nonlinear perturbations of semigroups is proven. The Yang-Mills equations in a spatially bounded subset of the Minkowski space are studied under the assumption of temporal gauge. It is shown that the Cauchy problem for these equations is uniquely solvable (locally in time) if the metallic boundary conditions are imposed. An a'priori estimate of the second Sobolev norm of a 1-form is given.  相似文献   

18.
The embedding problem of number fields is considered. It is proved that the problem is solvable if and only if all associated local problems corresponding to infinite points are solvable. It is also proved that the solvability of the adjoined problem with Sylow 2-group implies the solvability of the original problem. Bibliography: 6 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 349, 2007, pp. 135–145.  相似文献   

19.
一类非线性时滞系统与时滞相关的H_∞控制   总被引:1,自引:0,他引:1  
考虑一类非线性时滞系统的H∞控制.并对非线性项给出了一个新假设,在其假设下利用线性矩阵不等式方法得到了与时滞相关的H∞控制,同时也得到了该类非线性时滞系统鲁棒镇定的充分条件.  相似文献   

20.
We consider the problem of finding a shortest solution for the Post correspondence problem over a unary alphabet. We show that the complexity of this problem heavily depends on the representation of the input: the problem is NP-complete if the input is given in compact (logarithmic) form, whereas it becomes polynomially solvable if the input is encoded in unary.  相似文献   

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

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