奇异半线性发展方程的局部Cauchy问题

本文在Ｂａｎａｃｈ空间Ｅ中讨论如下问题ｄｕｄｔ＋１ｔσＡｕ＝Ｊ（ｕ），０＜ｔＴ，ｌｉｍｔ→０＋ｕ（ｔ）＝０，其中ｕ：（０，Ｔ］Ｅ，Ａ是与ｔ无关的线性算子．（－Ａ）是Ｅ上Ｃ０半群｛Ｔ（ｔ）｝ｔ０的无穷小生成元，常数σ１，Ｊ是一个非线性映射ＥＪ→Ｅ．它满足局部Ｌｉｐｓｃｈｉｔｚ条件．我们证明了当其Ｌｉｐｓｃｈｉｔｚ常数ｌ（ｒ）满足一定条件时．问题（Ｓ）有局部解，且在某函类中解唯一．设Ｊ（ｕ）＝｜ｕ｜γ－１ｕ＋ｆ（ｘ）（γ＞１），Ｅ＝Ｌｐ，ＥＪ＝Ｌｐγ时得到了与Ｗｅｉｓｌｅｒ［２］在非奇异情形类似的结果．     

Lipschitz常数缩减的散乱数据插值

在计算机辅助设计几何中，变差缩减是一个非常重要的概念，本文分析了函数的变差和Ｌｉｐｓｃｈｉｔｚ常数的关系，指出可以用Ｌｉｐｓｃｈｉｔｚ常数来控制变差，由于变差的概念只限于一维的情形，而Ｌｉｐｓｃｈｉｔｚ常数适用于任意维，这样在高维时就可用Ｌｉｐｓｃｈｉｔｚ常数缩减的概念来代替变差缩减的概念，文中构造性地证明了Ｌｉｐｓｃｈｉｔｚ常数缩减的散乱数据插值函数的存在性，并且对这类函数的性质及光滑性条件进行了讨论．     

三阶非线性常微分方程非线性两点边值问题解的存在性与唯一性

本文得用Ｂｏｌｚａｎｏ定理，给出了三阶非线性常微分方程具非线性两点边界条件的边值问题（１）（２）存在解与存在唯一解的一般结果，并将所得结果应用于Ｌｉｐｓｃｈｉｔｚ方程，对Ｌｉｐｓｃｈｉｔｚ方程满足（２），（３）的边值问题给出了解存在与存在唯一解的较具体的充分条件。     

四阶非线性常微分方程非线性两点边值问题解的存在唯一性

本文利用Ｂｏｌｚａｎｏ定理，给出了四阶非线性常微微分方程具有非线性边界条件的两点边值问题（１）（２）２，（１）（２）３存在解与存在唯一解的一般性结果，并将所得结果应用于Ｌｉｐｓｃｈｉｚ方程，对Ｌｉｐｓｃｈｉｔｚ方程满足边界条件（２）２，（２）３的边值问题给出了存在解与存在唯一解的具体的充分条件。     

非线性Lipschitz算子的Lipschitz对偶算子及其应用

在文山中我们对非线性Ｌｉｐｓｃｈｉｔｚ算子定义了其Ｌｉｐｓｃｈｉｔｚ对偶算子，并证明了任意非线性Ｌｉｐｓｃｈｉｔｚ算子的Ｌｉｐｓｃｈｉｔｚ对偶算子是一个定义在Ｌｉｐｓｃｈｉｔｚ对偶空间上的有界线性算子．本文还进一步证明：设Ｃ为 Ｂａｎａｃｈ空间 Ｘ的闭子集，Ｃ＊Ｌ为Ｃ的 Ｌｉｐｓｃｈｉｔｚ对偶空间，Ｕ为 Ｃ＊Ｌ上的有界线性算子，则当且仅当 Ｕ为 ｗ＊－ｗ＊连续的同态变换时，存在Ｌｉｐｓｃｈｉｔｚ连续算子Ｔ，使Ｕ为Ｔ的Ｌｉｐｓｃｈｉｔｚ对偶算子．这一结论的理论意义在于：它表明一个非线性Ｌｉｐｓｃｈｉｔｚ算子的可逆性问题可转化为有界线性算子的可逆性问题．作为应用，通过引入一个新概念──ＰＸ－对偶算子，在一般框架下给出了非线性算子半群的生成定理．     

关于非线性Lipschitz算子的Soderlind猜想

设ｆ是以Ｌ（ｆ）为最小上界Ｌｉｐｓｃｈｉｔｚ常数，以ρ（ｆ）为谱域半径，以γ（ｆ）为Ｇｅｒｓｃｈｇｏｒｉｍ域半径的有限维非线性Ｌｉｐｓｃｈｉｔｚ算子，本文证明了“存在等价范数‖．‖＾＊使Ｌ＾＊（ｆ）＝ｒ＾＊（ｆ）的Ｓｏｄｅｒｌｉｎｄ猜想；给出反例否定了Ｓｏｄｅｒｌｉｎｄ的另一猜想：”存在等价范烤‖．‖ε使Ｌε使Ｌε（ｆ）≤ρ（ｆ）＋δ的猜想。     

最佳L_P逼近对P的依赖性

设。本文证明了Ｎ（ｐ）（ｐ≥２）是Ｐ的可微函数，并且Ｎ（ｐ）在区间［１，∞］上满足Ｌｉｐｓｃｈｉｔｚ条件。设是定义在区间［ａ，ｂ］上的ｎ个线性无关的连续函数，记给定ｆ∈Ｌ∞［ａ，ｂ］，令Ｎ（ｐ）＝我们称ｖｐ（１≤Ｐ≤∞）是ｆ的最佳Ｌｐ逼近。     

关于非线性Lipschitz算子的Sderlind猜想

设ｆ是以Ｌ（ｆ）为最小上界Ｌｉｐｓｃｈｉｔｚ常数、以ρ（ｆ）为谱域半径、以ｒ（ｆ）为Ｇｅｒｓｃｈｇｏｒｉｍ域半径的有限维非线性Ｌｉｐｓｃｈｉｔｚ算子．本文证明了“存在等价范数‖·‖使Ｌ（ｆ）＝ｒ（ｆ）”的Ｓｄｅｒｌｉｎｄ猜想；给出反例否定了Ｓｄｅｒｌｉｎｄ的另一个猜想：“存在等价范数‖·‖使Ｌ（ｆ）ｒ（ｆ）”（注意ｒ（ｆ）与ｒ（ｆ）的区别），同时也否定了“ε＞０，存在等价范数‖·‖ε使Ｌε（ｆ）ρ（ｆ）＋ε”的猜想．作为以上所获结论的应用，本文将有关Ｄａｕｇａｖｅｔ方程的相应结果推广到了非线性算子情形．     

局部凸空间上的泛函的非光滑分析及多目标规划

该文对定义于局部凸线性拓扑空间Ｘ上的泛函引入广义方向导数、广义梯度及满足Ｌｉｐｓ－ｃｈｉｔｚ条件等概念,证明了它们的几个重要性质,并举例说明这里满足Ｌｉｐｓｃｈｉｔｚ条件的概念是Ｂａ－ｎａｃｈ空间情形的严格推广．最后,作为上述结论及方法的应用,讨论定义于Ｘ的多目标数学规划,得出若干关于弱有效解的最优性条件．     

方程u_(tt)=u_(xxt) f(u_x)_x初边值问题的差分法

１．引言方程是在国内外引起广泛关注的一类重要的非线性发展方程．文［１］在函数ｆ（ｓ）满足局部 Ｌｉｐ－ｓｃｈｉｔｚ条件及单调性条件（ｆ（ｓ２）－ｆ（ｓ１））（ｓ２－ｓ１）＞ ０的假设下得到了（１．１）初边值问题整体弱解的存在与唯一性;文［２］用 Ｇａｌｅｒｋｉｎ方法,研究了（１．１）的初边值问题,周期边值问题和初值问题,并在函数ｆ’（ｓ）下方有界的假设下得到了整体强解的存在与唯一性． 本文在有限区域 ＱＴ＝［０,１］×［０,Ｔ］（Ｔ＞ ０）上讨论方程（１．１）带有初值条件和边值条件（ｕ（ｘ,ｔ）为未知…     

Two-Stage Stochastic Runge-Kutta Methods for Stochastic Differential Equations

In this paper we discuss two-stage diagonally implicit stochastic Runge-Kutta methods with strong order 1.0 for strong solutions of Stratonovich stochastic differential equations. Five stochastic Runge-Kutta methods are presented in this paper. They are an explicit method with a large MS-stability region, a semi-implicit method with minimum principal error coefficients, a semi-implicit method with a large MS-stability region, an implicit method with minimum principal error coefficients and another implicit method. We also consider composite stochastic Runge-Kutta methods which are the combination of semi-implicit Runge-Kutta methods and implicit Runge-Kutta methods. Two composite methods are presented in this paper. Numerical results are reported to compare the convergence properties and stability properties of these stochastic Runge-Kutta methods.     

The efficiency of Singly-implicit Runge-Kutta methods for stiff differential equations

Singly-implicit Runge-Kutta methods are considered to be good candidates for stiff problems because of their good stability and high accuracy. The existing methods, SIRK (Singly-implicit Runge-Kutta), DESI (Diagonally Extendable Singly-implicit Runge-Kutta), ESIRK (Effective order Singly-implicit Rung-Kutta) and DESIRE (Diagonally Extended Singly-implicit Runge-Kutta Effective order) methods have been shown to be efficient for stiff differential equations, especially for high dimensional stiff problems. In this paper, we measure the efficiency for the family of singly-implicit Runge-Kutta methods using the local truncation error produced within one single step and the count of number of operations. Verification of the error and the computational costs for these methods using variable stepsize scheme are presented. We show how the numerical results are effected by the designed factors: additional diagonal-implicit stages and effective order.     

D-CONVERGENCE OF RUNGE-KUTTA METHODS FOR STIFF DELAY DIFFERENTIAL EQUATIONS

1. IntroductionWhen considering the applicability of numerical methods for the solution of the delay differential equation (DDE) y'(t) = f(t, y(t), y(t - T)), it is necessary to analyze the error behaviourof the methods. In fact, many papers have investigated the local and global error behaviour ofDDE solvers (cL[1,2,14]). These error analyses are based on the assumption that the fUnctionf(t,y,z) satisfies Lipschitz conditions in both the last two variables. They are suitable fornonstiff …     

A local-global version of a stepsize control for Runge-Kutta methods

In this paper we develop a new procedure to control stepsize for Runge-Kutta methods applied to both ordinary differential equations and semi-explicit index 1 differential-algebraic equations. In contrast to the standard approach, the error control mechanism presented here is based on monitoring and controlling both the local and global errors of Runge-Kutta formulas. As a result, Runge-Kutta methods with the local-global stepsize control solve differential or differential-algebraic equations with any prescribed accuracy (up to round-off errors). For implicit Runge-Kutta formulas we give the sufficient number of both full and modified Newton iterations allowing the iterative approximations to be correctly used in the procedure of the local-global stepsize control. In addition, we develop a stable local-global error control mechanism which is applicable for stiff problems. Numerical tests support the theoretical results of the paper.     

Convergence of Runge-Kutta methods for neutral Volterra delay-integro-differential equations

In this paper, we focus on the error behavior of Runge-Kutta methods for nonlinear neutral Volterra delay-integro-differential equations (NVDIDEs) with constant delay. The convergence properties of the Runge-Kutta methods with two classes of quadrature technique, compound quadrature rule and Pouzet type quadrature technique, are investigated.      

Runge-Kutta theory for Volterra integrodifferential equations

Summary The present paper develops the theory of general Runge-Kutta methods for Volterra integrodifferential equations. The local order is characterized in terms of the coefficients of the method. We investigate the global convergence of mixed and extended Runge-Kutta methods and give results on asymptotic error expansions. In a further section we construct examples of methods up to order 4.     

求解刚性振荡问题的两类带显式级的三级对角隐式Runge-Kutta方法

针对刚性振荡问题,讨论了两类带显式级的三级对角隐式Runge-Kutta方法的阶、级阶、A-稳定性、相误差和耗散误差,所构造的方法成功应用于一类大气化学反应问题的求解.     

Non-linear stability of a general class of differential equation methods

For a class of methods sufficiently general as to include linear multistep and Runge-Kutta methods as special cases, a concept known as algebraic stability is defined. This property is based on a non-linear test problem and extends existing results on Runge-Kutta methods and on linear multistep and one-leg methods. The algebraic stability properties of a number of particular methods in these families are studied and a generalization is made which enables estimates of error growth to be provided for certain classes of methods.     

The most storage economical Runge-Kutta methods for the solution of large systems of coupled first-order differential equations

It is shown how the attainable minimum for the memory requirements of Runge-Kutta methods can be realised for methods of the third order. These economisable third order methods belong to a one parameter sub-family from which two particular members with low error bound are selected.     

Two-step almost collocation methods for ordinary differential equations

A new class of two-step Runge-Kutta methods for the numerical solution of ordinary differential equations is proposed. These methods are obtained using the collocation approach by relaxing some of the collocation conditions to obtain methods with desirable stability properties. Local error estimation for these methods is also discussed.