A NEW ALGORITHM FOR COMPUTING LARGEST REAL PART EIGENVALUE OF MATRICES：COLLATZ ＆ PERRON-FROBERNIUS＇ APPROACH

This paper describes a new method and algorithm for the numerical solution of eigenvalues with the largest real part of positive matrices.The method is based on a numerical implementation of Collatz’s eigenvalue inclusion theorem for non-negative irreducible matrices.Eigenvalues are analyzed for the studies of the stability of linear systems.Finally, a numerical discussion is given to derive the required number of mathematical operations of the new algorithm. Comparisons between the new algorithm and several well known ones, such as Power, and QR methods, are discussed.     

MIXED INTERIOR PENALTY DISCONTINUOUS GALERKIN METHODS FOR ONE-DIMENSIONAL FULLY NONLINEAR SECOND ORDER ELLIPTIC AND PARABOLIC EQUATIONS

This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations （PDEs）. In the paper we present a general framework for constructing high order interior penalty discontinuous Galerkin （IP-DG） methods for approximating viscosity solutions of these fully nonlinear PDEs. In order to capture discontinuities of the second order derivative uxx of the solution u, three independent functions p1,p2 and p3 are introduced to represent numerical derivatives using various one-sided limits. The proposed DG frame- work, which is based on a nonstandard mixed formulation of the underlying PDE, embeds a nonlinear problem into a mostly linear system of equations where the nonlinearity has been modified to include multiple values of the second order derivative uxz. The proposed framework extends a companion finite difference framework developed by the authors in [9] and allows for the approximation of fully nonlinear PDEs using high order polynomials and non-uniform meshes. In addition to the nonstandard mixed formulation setting, another main idea is to replace the fully nonlinear differential operator by a numerical operator which is consistent with the differential operator and satisfies certain monotonicity （called g-monotonicity） properties. To ensure such a g-monotonicity, the crux of the construction is to introduce the numerical moment, which plays a critical role in the proposed DG frame- work. The g-monotonicity gives the DG methods the ability to select the mathematically ＂correct＂ solution （i.e., the viscosity solution） among all possible solutions. Moreover, the g-monotonicity allows for the possible development of more efficient nonlinear solvers as the special nonlinearity of the algebraic systems can be explored to decouple the equations. This paper also presents and analyzes numerical results for several numerical test problems which are used to guage the accuracy and efficiency of the proposed DG methods.     

关于非定常不可压Navier-Stokes方程的时间高精度隐式差分方法

The incompressible Navier-Stokes equations,upon spatial discretization,become a system of differential algebraic equations,formally of index2.But due to the special forms of the discrete gradient and disrete divergence,its index can be regarded as 1.Thus,in this paper,a systematic approach following the ODE theory and methods is presented for the construction of high-order time-accurate implicit schemes for the incompressible Navier-Stokes equations,with projection methods for efficiency of numerical solution.The 3rd order 3-step BDF with componentconsistent pressure-correction projection method is a first attempt in this direction;the related iterative solution of the auxiliary velocyty,the boundary conditions and the stability of the algorithm are discussed.Results of numerical tests on the incompressible Navier-Stokes equations with an exact solution are presented,confirming the accureacy,stability and component-consistency of the proposed method.     

关于解线性系统的一个有效的贝叶斯迭代方法

This paper concerns with the statistical methods for solving general linear systems. After a brief review of Bayesian perspective for inverse problems,a new and efficient iterative method for general linear systems from a Bayesian perspective is proposed.The convergence of this iterative method is proved,and the corresponding error analysis is studied.Finally, numerical experiments are given to support the efficiency of this iterative method,and some conclusions are obtained.     

ERROR ANALYSIS FOR A FAST NUMERICAL METHOD TO A BOUNDARY INTEGRAL EQUATION OF THE FIRST KIND

For two-dimensional boundary integral equations of the first kind with logarithmic kernels, the use of the conventional boundary element methods gives linear systems with dense matrix. In a recent work [J. Comput. Math., 22 （2004）, pp. 287-298], it is demonstrated that the dense matrix can be replaced by a sparse one if appropriate graded meshes are used in the quadrature rules. The numerical experiments also indicate that the proposed numerical methods require less computational time than the conventional ones while the formal rate of convergence can be preserved. The purpose of this work is to establish a stability and convergence theory for this fast numerical method. The stability analysis depends on a decomposition of the coefficient matrix for the collocation equation. The formal orders of convergence observed in the numerical experiments are proved rigorously.     

ON THE METHODS FOR FINDING ROOTS OF ALGEBRAIC EQUATIONS WITH WEIERSTRASS'''' CORRECTIONS

This is a study of the Durand-Kerner and Nourein methods for finding the roots of a given algebraic equation simultaneously. We consider the conditions under which the iterative methods fail. The numerical example is presented.     

BOUNDARY VALUE METHODS FOR CAPUTO FRACTIONAL DIFFERENTIAL EQUATIONS

This paper deals with the numerical computation and analysis for Caputo fractional differential equations(CFDEs).By combining the p-order boundary value methods(B-VMs)and the m-th Lagrange interpolation,a type of extended BVMs for the CFDEs with y-order(0相似文献   

ON NEWTON-HSS METHODS FOR SYSTEMS OF NONLINEAR EQUATIONS WITH POSITIVE-DEFINITE JACOBIAN MATRICES

The Hermitian and skew-Hermitian splitting （HSS） method is an unconditionally convergent iteration method for solving large sparse non-Hermitian positive definite system of linear equations. By making use of the HSS iteration as the inner solver for the Newton method, we establish a class of Newton-HSS methods for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices at the solution points. For this class of inexact Newton methods, two types of local convergence theorems are proved under proper conditions, and numerical results are given to examine their feasibility and effectiveness. In addition, the advantages of the Newton-HSS methods over the Newton-USOR, the Newton-GMRES and the Newton-GCG methods are shown through solving systems of nonlinear equations arising from the finite difference discretization of a two-dimensional convection-diffusion equation perturbed by a nonlinear term. The numerical implemen- tations also show that as preconditioners for the Newton-GMRES and the Newton-GCG methods the HSS iteration outperforms the USOR iteration in both computing time and iteration step.     

ON SPECTRAL METHODS FOR VOLTERRA INTEGRAL EQUATIONS AND THE CONVERGENCE ANALYSIS

The main purpose of this work is to provide a novel numerical approach for the Volterra integral equations based on a spectral approach. A Legendre-collocation method is proposed to solve the Volterra integral equations of the second kind. We provide a rigorous error analysis for the proposed method, which indicates that the numerical errors decay exponentially provided that the kernel function and the source function are sufficiently smooth. Numerical results confirm the theoretical prediction of the exponential rate of convergence. The result in this work seems to be the first successful spectral approach （with theoretical justification） for the Volterra type equations.     

非线性中立型延迟积分微分方程一般线性方法的稳定性分析

本文研究求解R(α,β₁,β₂,γ)类非线性中立型延迟积分微分方程的一般线性方法的数值稳定性,获得了代数稳定的一般线性方法稳定及渐近稳定的条件,最后的数值试验验证了所获理论的正确性.       

一类求解分片延迟微分方程的线性多步法的散逸性

本文研究分片延迟微分方程本身及数值方法的散逸性问题．给出了一个关于此类问题本身散逸性的充分条件,同时得到了一类求解此类问题的线性多步法的数值散逸性结果,此结果表明所考虑的数值方法继承了方程本身的散逸性．数值试验进一步验证了理论结果的正确性．     

随机比例方程带线性插值的半隐式Euler方法的均方收敛性

本文研究非线性随机比例方程带线性捅值的半隐式Euler方法的均方收敛性,证明了这类方法是1/2阶均方收敛的.数值试验验证了所获理论结果的正确性.     

A LEAP FROG FINITE DIFFERENCE SCHEME FOR A CLASS OF NONLINEAR SCHRODINGER EQUATIONS OF HIGHORDER

1.IntroductionItiswellknowthatthenonlinearequationsofSchr6dingertypeareofgreatimportancetophysicsandcanbeusedtodescribeextensivephysicalphenomenatll.InthispapergwewillconsidertheperiodicinitialvalueproblemforthefollowingclassofnonlinearSchrodingerequationofhighorder:wherem',MandMIareallpositiveconstant.Inthepaper[2])therehavediscussedinitialValueproblemofsystemsuchas(1.1)(1.3),introducedadifferenceschemeofconservationtype,andresearcheditsstabilityandconvergence.Otherwise,itisanimplicitmetho…     

NUMERICAL ANALYSIS OF CRANK-NICOLSON SCHEME FOR THE ALLEN-CAHN EQUATION

We consider numerical methods to solve the Allen-Cahn equation using the second-order Crank-Nicolson scheme in time and the second-order central difference approach in space.The existence of the finite difference solution is proved with the help of Browder fixed point theorem.The difference scheme is showed to be unconditionally convergent in L∞ norm by constructing an auxiliary Lipschitz continuous function.Based on this result,it is demonstrated that the difference scheme preserves the maximum principle without any restrictions on spatial step size and temporal step size.The numerical experiments also verify the reliability of the method.     

Stiff微分方程初值问题的一类数值方法

1.引言 实践表明,数值积分常微分方程初值问题 dx/dt=f(t,x), (1.1) x(t_0)=x_0时,若(1.1)是Stiff的,积分过程的稳定性是一个突出的问题.用传统的数值方法,比如Euler法,Adams法或Runge-Kutta法,为了保证计算稳定,积分步长受到相当地限制.即使运算速度为 100万次/秒的计算机,计算时间也将成为重大的负担.     

Numerical Solution to Hybrid Stochastic Differential Systems

Abstract

In this article numerical methods for solving hybrid stochastic differential systems of Itô-type are developed by piecewise application of numerical methods for SDEs. We prove a convergence result if the corresponding method for SDEs is numerically stable with uniform convergence in the mean square sense. The Euler and Runge–Kutta methods for hybrid stochastic differential equations are specifically described and the order of the error is given for the Euler method. A numerical example is given to illustrate the theory.     

STABILITY OF THEORETICAL SOLUTION AND NUMERICAL SOLUTION OF NONLINEAR DIFFERENTIAL EQUATIONS WITH PIECEWISE DELAYS

This paper is concerned with the stability of theoretical solution and numerical solutionof a class of nonlinear differential equations with piecewise delays.At first,a sufficientcondition for the stability of theoretical solution of these problems is given,then numericalstability and asymptotical stability are discussed for a class of multistep methods whenapplied to these problems.     

Entropy production in second-order three-point schemes

Summary We discuss semi-discrete three-point finite difference methods for the numerical solution of system of conservation laws which are second order accurate in space in the sense of truncation error. Particular discretizations of the numerical entropy flux associated with such schemes are studied clarifying the importance of this discretization with regard to the production of numerical entropy. Using a numerical entropy flux constructed in a canonical way we prove that a wide class of finite difference methods cannot satisfy a discrete entropy inequality. Together with a well known result of Schonbek concerning Lax-Wendroff type schemes our result indicates a strong relationship between entropy production and oscillations in numerical solutions.The research reported here was supported by a grant from the Stiftung Volkswagenwerk, Federal Republic of Germany. It is a part of the doctoral thesis of the above author, Universität Stuttgart, 1991.     

发展并行数值方法

1 引言 本世纪40年代中期至50年代初,第一台电子计算机和第一批存储程序计算机即vonNeumann计算机相继问世 。此后,计算机新陈代谢异常迅速,大约每隔5年运算速度增加10倍.50年代的计算机是串行结构,每一时刻只能按照一条指令对一个数据进行操作。由于电子信息传输速度以光速为极限,单靠改进线路已难于得到所期望的计算性能,串行计算机性能已接近了物理极限。为了克服传统计算机结构对提高运行速度的限制,从60年代起人们开始探索将并行性引入计算机结构设计,提出了研制并行计算机的设想。1972年单指令流多数据流并行计算机Illiac Ⅳ投入运行;1976年向量计算机Cray—1投入运行。在整个80年代,具有共享存储的并行向量计算机研制、生产和商售都获得了很大成功。当代高