定常围压作用时平面应变理想塑性体Mises屈伏条件的精确解

把应力函数引入平面问题的Mises屈状条件后那个二阶非线性偏微分方程分解为两个二阶线性偏微分方程,用柯西积分公式求出这两个方程右端的已知函数,然后解这个方程,由此定出弹塑性区域的分界线和求出塑性区内的各应力分量,给出一个例题说明本文方法的应用.     

正交异性双材料Ⅱ型界面裂纹问题研究

探讨正交异性双材料Ⅱ型界面裂纹问题,给出了它的力学模型.将控制方程化为广义重调和方程,借助复变函数方法推出了含两个应力奇异指数的应力函数.基于边界条件得到了两个八元非齐次线性方程组.求解该方程组,在双材料工程参数满足适当的条件下确定了两个实应力奇异指数.根据极限的唯一性定理推出了应力强度因子的公式和裂纹尖端应力场的理论解.作为特例,当两种正交异性材料相同时,可以推出正交异性单材料Ⅱ型断裂的已有结果.     

不可压缩弹性固体中的二维应力波分析

本文研究不可压缩弹性固体中的二维应力波.首先对一般的应变能函数给出了分析简单波和激波的基本方程,然后求出了波速和相应的本征向量,证明在一般情况下有两组简单波和两组激波,最后举了平面变形和反平面变形两个例子.在平面变形的情况下,平面激波的斜反射问题一般无解.     

守恒积分与奇性场的定解方程

本文利用守恒积分,对HRR奇性场的角分布函数作了进一步的探讨.证明了角分布函数满足两个函数方程.并由此导出几种新的定解方程.对于平面应变及平面应力的情况分别给出函数方程与定解方程的具体公式.最后针对若干典型情况,给出了不同定解方程的精确的数值计算结果,验证了在一般情况下不同定解方程的等价性.     

隧洞围岩应力复变函数分析法中的解析函数求解

利用复变函数理论进行地下任意开挖断面隧洞围岩应力分析的前提,是根据围岩应力边界条件方程推导出两个解析函数．从Harnack定理出发,将隧洞围岩应力边界条件方程转化成积分方程;把Laurent级数有限项表示的映射函数引入积分方程中,将以任意开挖断面为边界条件的解析函数求解转化成以单位圆周线为边界条件的求解问题．对积分方程中各被积函数在讨论域内的解析性进行了分析,在此基础上利用留数理论求解了方程中各项积分值,并获得了用来表示任意开挖断面隧道围岩应力的两个解析函数通式．给出了圆形和椭圆形隧道的两个解析函数求解算例,所获得的结果与文献中的结果一致．利用留数理论推导出的两个解析函数通式,适用于任意开挖断面隧洞的围岩应力解析解的计算,且计算过程更为简单,计算结果更为精确．     

双周期平面弹性基本问题

周期平面弹性基本问题,路见可教授早已解决。至于双周期平面弹性问题,W.T.Koiter在基本周期胞腔仅含一个洞的情况下,对第一基本问题曾作过讨论,但是求解复应力函数时理论上有明显的漏洞,问题并没有解决。本文首先建立复应力函数的一般表达式,然后用类似于的方法,把寻求复应力函数的问题归结为求解一唯一可解的第二类Fredholm积分方程,从而完全解决了基本周期胞腔含任意个任意形状的洞的一般情况下的第一、第二基本问题。     

平面动力问题的理论求解

通过对平面动力问题控制方程的分析,研究了相应的应力函数，得出了关于应力函数的基本方程。     

平面应变和反平面应变复合型裂纹尖端的理想塑性应力场

在裂纹尖端的理想塑性应力分量都只是θ的函数的条件下.利用平衡方程.应力应变率关系、相容方程和屈服条件,本文导出了平面应变和反平面应变复合型裂纹尖端的理想塑性应力场的一般解析表达式.将这些一般解析表达式用于复合型裂纹.我们就可以得到Ⅰ-Ⅲ、Ⅱ-Ⅲ及Ⅰ-Ⅱ-Ⅲ复合型裂纹尖端的理想塑性应力场的解析表达式.     

均值及均值方程

均值及均值方程是函数方程领域近二十年研究的热门方向.本文首先介绍了均值的定义及性质、Gauss迭代、不变方程和M-S问题的发展历程.接着围绕Bajraktarevi?均值、Cauchy均值及其他相关均值进行综述,尤其详述了对应的相等性与不变性问题的研究进展.Bajraktarevi?均值和Cauchy均值这两类均值均含两个衍生函数,对应的等式问题已基本得以解决,但这两类对称均值的不变性因含有四个未知函数而求解困难的问题目前仍未完全解决.最后介绍了均值在其他领域中的应用.     

线性分布载荷作用下功能梯度各向异性悬臂梁的解析解

对功能梯度各向异性弹性悬臂梁在线性分布载荷作用下的弯曲问题进行了研究．从平面应力问题的基本方程出发,假定应力函数为梁长度方向的多项式形式,由应力函数求导给出应力,利用协调方程和边界条件可完全确定应力函数．将解析解与有限元数值方法的结果进行了对比,两者吻合良好．     

Numerical approach to differential equations of fractional order

In this paper, the variational iteration method and the Adomian decomposition method are implemented to give approximate solutions for linear and nonlinear systems of differential equations of fractional order. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of differential equations. In these schemes, the solution takes the form of a convergent series with easily computable components. This paper presents a numerical comparison between the two methods for solving systems of fractional differential equations. Numerical results show that the two approaches are easy to implement and accurate when applied to differential equations of fractional order.     

Convergence analysis of modified Newton-HSS method for solving systems of nonlinear equations

Hermitian and skew-Hermitian splitting(HSS) method has been proved quite successfully in solving large sparse non-Hermitian positive definite systems of linear equations. Recently, by making use of HSS method as inner iteration, Newton-HSS method for solving the systems of nonlinear equations with non-Hermitian positive definite Jacobian matrices has been proposed by Bai and Guo. It has shown that the Newton-HSS method outperforms the Newton-USOR and the Newton-GMRES iteration methods. In this paper, a class of modified Newton-HSS methods for solving large systems of nonlinear equations is discussed. In our method, the modified Newton method with R-order of convergence three at least is used to solve the nonlinear equations, and the HSS method is applied to approximately solve the Newton equations. For this class of inexact Newton methods, local and semilocal convergence theorems are proved under suitable conditions. Moreover, a globally convergent modified Newton-HSS method is introduced and a basic global convergence theorem is proved. Numerical results are given to confirm the effectiveness of our method.     

Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods

Conjugate-gradient acceleration provides a powerful tool for speeding up the convergence of a symmetrizable basic iterative method for solving a large system of linear algebraic equations with a sparse matrix. The object of this paper is to describe three generalizations of conjugate-gradient acceleration which are designed to speed up the convergence of basic iterative methods which are not necessarily symmetrizable. The application of the procedures to some commonly used basic iterative methods is described.     

Accurate bending analysis of rectangular plates with two adjacent edges free and the others clamped or simply supported based on new symplectic approach

The symplectic geometry approach is introduced for accurate bending analysis of rectangular thin plates with two adjacent edges free and the others clamped or simply supported. The basic equations for rectangular plates are first transferred into Hamilton canonical equations. Using the symplectic approach, the analytic solution of rectangular thin plate with two adjacent edges simply supported and the others slidingly supported is derived. Accurate bending solutions of title problems are then obtained using the superposition method. The approach used in this paper eliminates the need to pre-determine the deformation function and is hence more reasonable than conventional methods. Numerical results are presented to demonstrate the validity and efficiency of the approach as compared with those reported in other literatures.     

Zur Konstruktion gewisser Integraloperatoren für partielle Differentialgleichungen Teil II

Using results of Part I of this paper, we shall now develop two methods of constructing linear partial differential equations which admit Bergman operators with polynomial kernels; these equations will be obtained explicitly. Those methods will also yield general representations of solutions of such an equation which are holomorphic in some domain of complex two-space. For generating all those solutions, one needs a pair of Bergman operators. Whereas in Part I of this paper we required at least one of the two operators to have a polynomial kernel, we now impose the condition that both operators be of that kind. This entails further basic results about the existence, construction, and uniqueness of solutions.     

A globally convergent derivative-free method for solving large-scale nonlinear monotone equations

In this paper, we propose two derivative-free iterative methods for solving nonlinear monotone equations, which combines two modified HS methods with the projection method in Solodov and Svaiter (1998) [5]. The proposed methods can be applied to solve nonsmooth equations. They are suitable to large-scale equations due to their lower storage requirement. Under mild conditions, we show that the proposed methods are globally convergent. The reported numerical results show that the methods are efficient.     

Numerical comparison of methods for solving linear differential equations of fractional order

In this article, we implement relatively new analytical techniques, the variational iteration method and the Adomian decomposition method, for solving linear differential equations of fractional order. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of fractional differential equations. In these schemes, the solution takes the form of a convergent series with easily computable components. This paper will present a numerical comparison between the two methods and a conventional method such as the fractional difference method for solving linear differential equations of fractional order. The numerical results demonstrates that the new methods are quite accurate and readily implemented.     

On Riccati Matrix Differential Equations

In this paper square Riccati matrix differential equations are considered. The coefficients can be arbitrary time—dependent matrices and need not satisfy any symmetry conditions. Contributions to the basic problems — existence and asymptotic behaviour of solutions — are presented based on two new methods. The first one is the usage of maximum principles for second order linear differential equations, the second one is a variety of possibilities for the parametric representation of solutions of Riccati differential equations.     

A General Approach to Obtain Series Solutions of Nonlinear Differential Equations

Based on homotopy, which is a basic concept in topology, a general analytic method (namely the homotopy analysis method) is proposed to obtain series solutions of nonlinear differential equations. Different from perturbation techniques, this approach is independent of small/large physical parameters. Besides, different from all previous analytic methods, it provides us with a simple way to adjust and control the convergence of solution series. Especially, it provides us with great freedom to replace a nonlinear differential equation of order n into an infinite number of linear differential equations of order k , where the order k is even unnecessary to be equal to the order n . In this paper, a nonlinear oscillation problem is used as example to describe the basic ideas of the homotopy analysis method. We illustrate that the second-order nonlinear oscillation equation can be replaced by an infinite number of (2κ)th-order linear differential equations, where κ≥ 1 can be any a positive integer. Then, the homotopy analysis method is further applied to solve a high-dimensional nonlinear differential equation with strong nonlinearity, i.e., the Gelfand equation. We illustrate that the second-order two or three-dimensional nonlinear Gelfand equation can be replaced by an infinite number of the fourth or sixth-order linear differential equations, respectively. In this way, it might be greatly simplified to solve some nonlinear problems, as illustrated in this paper. All of our series solutions agree well with numerical results. This paper illustrates that we might have much larger freedom and flexibility to solve nonlinear problems than we thought traditionally. It may keep us an open mind when solving nonlinear problems, and might bring forward some new and interesting mathematical problems to study.     

A class of one-parameter alternating direction implicit methods for two-dimensional wave equations with discrete and distributed time-variable delays

For solving the initial-boundary value problem of two-dimensional wave equations with discrete and distributed time-variable delays, in the present paper, we first construct a class of basic one-parameter methods. In order to raise the computational efficiency of this class methods, we remold the methods as one-parameter alternating direction implicit (ADI) methods. Under the suitable conditions, the remolded methods are proved to be stable and convergent of second order in both of time and space. With several numerical experiments, the computational effectiveness and theoretical exactness of the methods are confirmed. Moreover, it is illustrated that the proposed one-parameter ADI method has the better advantage in computational efficiency than the basic one-parameter methods.