二维抛物型方程的一族高精度分支稳定显格式

1 引言 在渗流、扩散、热传导等领域中经常会遇到求解二维抛物型方程的初边值问题 {(6)u/(6)=a((6)2u/(6)x2+(6)2u/(6)y2), 0＜x,y＜L,t＞0,a＞0u(x, y, 0) =φ(x, y), 0 ≤ x, y ≤ L (1)u(0,y,t) =f1(y,t),u(L,y,t) =f2...     

关于一类拟线性椭圆型方程带有间断边值的Dirichlet问题的注记

<正> 任朝佐在文[1]中讨论了拟线性椭圆型方程Δu(x,y)+f(x,y,u,((?)u)/((?)x),((?)u)/((?)y))=0带有间断边值的 Dirichlet 问题解的存在性、唯一性及间断点附近的性质.本文将这些加以推广,讨论更一般的拟线性椭圆型方程Lu≡a(x,y)((?)~2u)/((?)x~2)+2b(x,y)((?)~2u)/((?)x(?)y)+c(x,y)((?)~2u)/((?)y~2)+f(x,y,u,((?)u)/((?)x),((?)u)/((?)y))=0 (1)的类似问颢,得到相应的结果,而且区域也取消了[1]中的凸性的限制.     

全微分方程的不定积分解法及其证明

0　引言一个一阶微分方程写成P( x,y) dx +Q( x,y) dy =0 ( 1 )形式后 ,如果它的左端恰好是某一个函数 u=u( x,y)的全微分 :du( x,y) =P( x,y) dx +Q( x,y) dy那么方程 ( 1 )就叫做全微分方程。这里 u x=P( x,y) ,　　 u y=Q( x,y)方程 ( 1 )就是 du( x,y) =0 ,其通解为 :u( x,y) =C　 ( C为常数 )可见 ,解全微分方程的关键在于求原函数 u( x,y)。因此 ,本文将提供一种求原函数 u( x,y)的简捷方法 ,并给出证明。1　引入记号为了表述方便 ,先引入记号如下 :设 M( x,y)为一个含有变量 x,y项的二元函数 ,定义 :( 1 )“M( x,y)”表示 M(…     

ON DIRICHLET PROBLEMS FOR SECOND ORDER QUASILINEAR DEGENERATE ELLIPTIC EQUATIONS

The purpose of this paper is to study the existence of the classical solutions of some Dirichlet problems for quasilinear elliptic equations $$\[{a_{11}}(x,y,u)\frac{{{\partial ^2}u}}{{\partial {x^2}}} + 2{a_{12}}(x,y,u)\frac{{{\partial ^2}u}}{{\partial x\partial y}} + {a_{22}}(x,y,u)\frac{{{\partial ^2}u}}{{\partial {y^2}}} + f(x,y,u,\frac{{\partial u}}{{\partial x}},\frac{{\partial u}}{{\partial y}}) = 0\]$$ Where $\[{a_{ij}}(x,y,u)(i,j = 1,2)\]$ satisfy $$\[\lambda (x,y,u){\left| \xi \right|^2} \le \sum\limits_{i,j = 1}^2 {{a_{ij}}(x,y,u)} {\xi _i}{\xi _j} \le \Lambda (x,y,u){\left| \xi \right|^2}\]$$ for all $\[\xi \in {R^2}\]$ and $\[(x,y,u) \in \bar \Omega \times [0, + \infty ),i.e.\lambda (x,y,u),\Lambda (x,y,u)\]$ denote the minimum and maximum eigenvalues of the matrix $\[[{a_{ij}}(x,y,u)]\]$ respectively, moreover $$\[\lambda (x,y,0) = 0,\Lambda (x,u,0) = 0;\Lambda (x,y,u) \ge \lambda (x,y,u) > 0,(u > 0).\]$$ Some existence theorems under tire “ natural conditions imposed on $\[f(x,y,u,p,q)\]$ are obtained.     

具有连续变量的非线性偏差分方程振动准则

本文研究具有连续变量的非线性变系数偏差分方程A(x+a,y) +Q(x,y) A(x,y+a) - R(x,y) A(x,y) +∑mi=1hi(x,y,A(x-σi,y-τi) ) =0其中 ,Q(x,y) ,R(x,y)∈ C(R+ × R+ - { 0 } ) ,hi(x,y,u)关于 u单调非减 ,且 hi(x,y,u) pi(x,y) u,(u>0 ) ;hi(x,y,u) pi(x,y) u,(u<0 )其中 ,pi(x,y)∈ C(R+ × R+ ,R+ - { 0 } ) ,i=1,2 ,… ,m,a,σi,τi∈ R+ ,得到了保证方程的所有解都具有振动生的若干充分条件     

极限方程为退缩椭圆型的一类三阶偏微分方程边值问题的奇摄动

本文研究极限方程在部分边界上为椭圆—抛物的一类三阶偏微分方程第一边值问题ε[(?)~3u]/[(?)y~3]-[y(?)~2u]/[(?)x~2]-[(?)~2u]/[(?)y~2]-a(x,y)[(?)u]/[(?)x]-b(x,y)[(?)u]/[(?)y]-c(x,y)u=f(x,y),u|_Γ=0,[(?)u]/[(?)y]|_(y=β)=0的奇摄动,在适当的假设下,证得解的存在并给出任意阶的一致有效的渐近展开式.     

极限方程为退缩椭圆型的一类三阶偏微分方程边值问题的奇摄动

本文研究极限方程在部分边界上为椭圆—抛物的一类三阶偏微分方程第一边值问题ε[(?)~3u]/[(?)y~3]-[y(?)~2u]/[(?)x~2]-[(?)~2u]/[(?)y~2]-a(x,y)[(?)u]/[(?)x]-b(x,y)[(?)u]/[(?)y]-c(x,y)u=f(x,y),u|_Γ=0,[(?)u]/[(?)y]|_(y=β)=0的奇摄动,在适当的假设下,证得解的存在并给出任意阶的一致有效的渐近展开式.     

一道微分方程题目的多种解法

同济大学数学教研室编高等数学 (第四版 )下册 P40 7有一题目 :求方程的通解。学生普遍感到有些困难。下面给出几种解法。y′+x =x2 +y ( 1 )　　解　方法一　令 x2 +y-x=u,则 yx2 +y+x=u,y=u( x2 +y+x) ,两边对 x求导 ,得 dydx= ( x2 +y+x) dudx+u(2 x+dydx2 x2 +y+1 )。代入 ( 1 ) ,得 dudx+u2 ( u+x) =0 ,或udx +2 ( u +x) du =0 ( 2 )易见有积分因子 μ=u,引用之 ,解得 2 u3 +3 xu2 =c1。换回原变量 ,得 ( 1 )的通解为 ( x2 +y) 3 =x3 +32 xy+c.其中 c=c12 为任意常数。方法二　令 u=x2 +yx ,则 x2 +y =ux,两边对 x求导 ,得2 x+dydx2 x…     

对称函数及其简单应用

一、对称函数定义:如果函数z=f(x,y)=f(y,x),則称函数z=f(x,y)关于自变量x,y是对称的。如果函数u=f(x,y,z)=f(y,x,z),則称函数u=f(x,y,z)关于x,y是对称的。如果u=f(x,y,z)关于任意两个自变量均是对称的,则     

二阶拟线性椭圆型方程的强非线性斜微商问题

本文利用某些算子在强弱拓扑意义下收敛的转换性质,两次运用Schauder不动点定理,建立了二阶拟线性椭圆型方程Lu≡α(x,y,u,u_∝,u_y)u_(∝x) 2b(x,y,u,u_∝,u_y)u_(∝y) c(x,y,u,u_x,u_y)u_(yy) d(x,y,u,u_x,u_y)=0,(x,y)∈G的强非线性斜微商问题αu_x-βu_y=f(x,y,u,u_x,u_y),α~2(x,y) β~2(x,y)≡1,(x,y)∈Г=аG解(或变态解)的存在性定理,并讨论了问题在负指标时的可解性条件。这里f关于u或u、u_0u_y具有指数大手1甚至整函数级增长的非线性,称之为强非线性。     

Travelling Wave Front Solutions for Reaction-diffusion Systems

In this paper by using upper-lower solution method, under appropriate assumptions on f and g the existence of travelling wave front solutions for the following reaction-diffusion system is proved: {u_t - u_{xx}, = f(u,v) v_t - v_{xx} = g(u, v) As an application, the necessary and sufficient condition of the existence of monotone solutions for the boundary value problem {u" + cu' + u(1 - u- rv) = 0 v" + cv' - buv = 0 u(-∞) = v(+∞) = 0 u(+∞) = v(-∞) = 1 where 0 < r < 1, 0 < b < \frac{1 - r}{r} are known constants and c is unknown constant to be obtained.     

双圈连通图的L(2,1)-labelling

给定图G,G的一个L(2,1)-labelling是指一个映射f:V(G)→{0,1,2,…},满足:当dG(u,v)=1时,f(u)-f(v)≥2;当dG(u,v)=2时,f(u)-f(v)≥1.如果G的一个L(2,1)-labelling的像集合中没有元素超过k,则称之为一个k-L(2,1)-labelling.G的L(2,1)-labelling数记作l(G),是指使得G存在k-L(2,1)-labelling的最小整数k.如果G的一个L(2,1)-labelling中的像元素是连续的,则称之为一个no-holeL(2,1)-labelling.本文证明了对每个双圈连通图G,l(G)=△ 1或△ 2.这个工作推广了[1]中的一个结果.此外,我们还给出了双圈连通图的no-hole L(2,1)-labelling的存在性.     

非线性悬臂梁方程的正解存在定理

研究了非线性悬臂梁方程u^（4）（t）=f（t,u（t）,u′（t））,0相似文献   

The $L(3, 2, 1)$-Labeling on Bipartite Graphs

An $L(3, 2, 1)$-labeling of a graph $G$ is a function from the vertex set $V(G)$ to the set of all nonnegative integers such that $|f(u)−f(v)|≥3$ if $d_G(u, v)=1$, $|f(u)−f(v)|≥2$ if $d_G(u, v)=2$, and $|f(u)−f(v)|≥1$ if $d_G(u, v)=3$. The $L(3, 2, 1)$-labeling problem is to find the smallest number $λ_3(G)$ such that there exists an $L(3, 2, 1)$-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of $λ_3$ for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree $T$ such that $λ_3(T)$ attains the minimum value.     

完全图及完全二部图的点可区别Ⅳ-全染色

设G是简单图,图G的一个k-点可区别Ⅵ-全染色(简记为k-VDIVT染色),f是指一个从V(G)∪E(G)到{1,2,…,k}的映射,满足:()uv,uw∈E(G),v≠w,有,f(uv)≠f(uw);()u,V∈V(G),u≠v,有C(u)≠C(v),其中C(u)={f(u)}∪{f(uv)|uv∈E(G)}.数min{k|G有一个k-VDIVT染色}称为图G的点可区别Ⅵ-全色数,记为x_(vt)~(iv)(G).讨论了完全图K_n及完全二部图K_(m,n)的VDIVT色数.     

Remarks on Vertex-Distinguishing IE-Total Coloring of Complete Bipartite Graphs K4,n and Kn,n

Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.     

一個多元函數的內插公式

本文介绍一个新型多元函数结构.它在一定条件下: 1)可根据一定的已知数值决定函数的其他近似值, 2)可作为构成经验公式的骨架.     

An Inverse Problem for the Heat Equation II

Completeness of the set of products of the derivatives of the solutions to the equation ( av ')' m u v = 0, v (0, u ) = 0 is proved. This property is used to prove the uniqueness of the solution to an inverse problem of finding conductivity in the heat equation $ \dot u = (a(x)u')' $ , u ( x , 0) = 0, u (0, t ) = 0, u (1, t ) = f ( t ) known for all t > 0, from the heat flux a (1) u '(1, t ) = g ( t ). Uniqueness of the solution to this problem is proved. The proof is based on Property C. It is proved the inverse that the inverse problem with the extra data (the flux) measured at the point, where the temperature is kept at zero, (point x = 0 in our case) does not have a unique solution, in general.     

弦图的L(3,2,1)}-标号

图 G 的一个 L(3,2,1)- 标号是指从 V(G) 到非负整数集的一个映射 f, 满足: 当 d_G(u,v)=1 时, |f(u)-f(v)|\geq 3; 当 d_G(u,v)=2 时, |f(u)-f(v)|\geq 2; 当 d_G(u,v)=1 时, |f(u)-f(v)|\geq 1. L(3,2,1)-标号问题就是确定出最小的整数 \lambda_3(G) 使得 G存在最大标号不超过该数的 L(3,2,1)- 标号. 本文研究了弦图的 L(3,2,1)- 标号问题,获得了弦图及其一些子类, 如扇, r- 路,r- 树等的 \lambda_3 数的界.     

树的L(3,2,1)-标号问题

An L(3,2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all non-negative integers(labels) such that |f(u)-f(v)|≥3 if d(u,v)=1,|f(u)-f(v)≥2 if d(u,v)=2 and |f(u)-f(v)|≥1 if d(u,v)=3.For a non-negative integer k,a k-L(3,2,1)-labeling is an L(3,2,1)-labeling such that no label is greater than k.The L(3,2,1)-labeling number of G,denoted by λ_(3,2,1)(G), is the smallest number k such that G has a k-L(3,2,1)-labeling.In this article,we characterize the L(3,2,1)-labeling numbers of trees with diameter at most 6.