首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 328 毫秒
1.
本文研究了高阶非齐次微分方程的解及其导数与小函数之间的关系.利用复分析的研究方法,获得了微分方程解取这些小函数的点的收敛指数以及二级收敛指数的估计,说明了微分方程解和小函数的关系与解的增长性密切相关.  相似文献   

2.
抽象微分方程的全局解及应用   总被引:1,自引:0,他引:1  
本文研究Banach空间中非齐次与半线性微分方程的全局解,得到一些基本的存在性结果,并给出在具有扰动项的连续人口发展方程及非线性抽象散射问题中的应用。  相似文献   

3.
应用李群理论中的伸缩变换群,把非线性二阶偏微分方程-Burgers方程转化为非线性非齐次一阶常微分方程-Riccati方程,将Riccati方程转化为Bernoulli方程和齐次线性二阶常微分方程,从而找到了Riccati方程的许多解,最后进一步求出了Burgers方程许多新的解析解.  相似文献   

4.
根据二阶常系数齐次线性微分方程的特征根,利用降阶法,可给出求解一般二阶常系数非齐次线性微分方程的通解公式.  相似文献   

5.
利用高阶变系数之间的关系,通过适当的线性变换,得到了五阶变系数线性非齐次方程常系数化的条件,给出了一类高阶变系数线性非齐次微分方程的新解法.  相似文献   

6.
利用初等方法可证明,在特征方程具有重根时,高阶常系数齐次线性微分方程对应的通解形式.  相似文献   

7.
根据常系数线性微分方程的求解原理,通过一个适当变换,研究了一类变系数线性微分方程及其解的问题,从而可以得到这类方程在特征根都是互异单根时的解法和通解,并对三阶方程的各种情况进行了较为详尽的讨论.  相似文献   

8.
线性齐次微分方程的x^re^kx型解   总被引:1,自引:0,他引:1  
线性齐次微分方程的x~re~(kx)型解周传忠,曾子平(华南师大510631)设。u1,u2……,um是线性无关的2的函数组,aij(i=0,1,……,n;j=1,2,…,m)都是常数,且an1,an2……,anm不全为零.对于方程(1)i=0j=1的...  相似文献   

9.
讨论常系数非齐次线性微分方程L[y]=Pm(x)eαx特解的一种新的分析方法.  相似文献   

10.
对一道数学竞赛题,介绍微分方程解法,通过对参数β取值的分类讨论,将原命题等价转化成一阶和二阶常系数齐次线性微分方程的求解问题,能够直观地给出证明.  相似文献   

11.
We define the generalized potential polynomials associated to an independent variable, and prove an explicit formula involving the generalized potential polynomials and the exponential Bell polynomials. We use this formula to describe closed type formulas for the higher order Bernoulli, Eulerian, Euler, Genocchi, Apostol-Bernoulli, Apostol-Euler polynomials and the polynomials involving the Stirling numbers of the second kind. As further applications, we derive several known identities involving the Bernoulli numbers and polynomials and Euler polynomials, and new relations for the higher order tangent numbers, the higher order Bernoulli numbers of the second kind, the numbers , the higher order Bernoulli numbers and polynomials and the higher order Euler polynomials and their coefficients.  相似文献   

12.
EXISTENCEANDUNIQUENESSOFSOLUTIONSFORNONLINEARBOUNDARYVALUEPROBLEMSOFVOLTERRA-HAMMERSTEINTYPEINTEGRODIFFERENTIALEQUATION¥WangG...  相似文献   

13.
The modified lower box dimension can be redefined in terms of the d-measure [4]. In this note we prove a decomposition theorem for this measure and show that strong regularity can be interpreted as this d-measure regularity in Rn. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

14.
15.
16.
That we are morally responsible for what we do willingly and knowingly is a commonplace. That our moral responsibility extends as far as to cover at least the intended consequences of our voluntary actions and perhaps also the ones we did not intend, but could or did foresee, is equally beyond dispute. But what about omissions? Are we, or can we be, (equally) morally responsible for the harm that has occured because we did not prevent it, even though we could have done so? Say, for all the enormous suffering, caused daily by famine, deprivation and curable diseases in the Third World countries?Moral intuitions and practices that one could consult in this matter seem to leave us in the dark. We regularly ascribe responsibility to people for harms resulting from their negligence or failure to fulfill professional duties. On the other hand, we tend to think that unless there is some evidence of the causal contribution that agents made to a harmful event and/or state, it is not really fair to blame it on them. And finally, to complicate things even more, most of us deny that omissions could effect anything (any change) in the world and consequently regard them as causally impotent (as well as possibly harmless).Most of the proposed solutions to this perplexing issue simply take negative moral responsibility for granted and then either try to revise our ordinary notion of causation accordingly or, alternatively, weaken the conditions for holding someone morally responsible. In the paper I present and defend the relative merits of the third approach, one sceptical of the notion of moral responsibility for the ‘outcomes’ of omissions. I try to show that for some identifiable core notion of moral responsibility and paradigmatic cases of omissions, the prospects for a happy marriage are rather slim.  相似文献   

17.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2.  相似文献   

18.
In this note we fix a gap in the proof of (7)?(1) of Theorem 4.3 in the paper “Simple-Direct-Modules, Communications in Algebra, Vol. 45 (2017), 3643–3652”.  相似文献   

19.
D3-Modules     
A right R-module M is called a D3-module, if M 1 and M 2 are direct summands of M with M = M 1 + M 2, then M 1M 2 is a direct summand of M. Following the work of Bass on projective covers, we introduce the notion of D3-covers and provide new characterizations of several well-known classes of rings in terms of D3-modules and D3-covers.  相似文献   

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

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