一类随机算子方程的随机解的存在唯一性

利用Mann迭代技巧,讨论了一类随机算子方程A（ω,x（ω）,x（ω））=B（ω,x（ω））的随机解的存在唯一性,并给出了迭代序列收敛于解的误差估计,所得结果是某些已知结果本质改进和推广.     

随机迭代算法的几乎必然T-稳定性及收敛性

目的是在可分Banach空间的框架下,研究某些类型的-弱压缩型的随机算子的Ishikawa-型及Mann-型随机迭代算法的几乎必然T-稳定性及收敛性.在适当的条件下,证明了该类随机算子的随机不动点的Bochner可积性以及这两类随机迭代算法的几乎必然T-稳定性及收敛性.     

时滞脉冲微分方程三点边值问题解的存在性和唯一性

研究一类时滞与脉冲共存的微分方程三点边值问题,利用上下解与单调迭代方法获得了边值问题解的存在性定理和唯一性定理,给出求解该类问题解析近似解的迭代方法,得出了新的结论.     

A note on simultaneous preconditioning and symmetrization of non‐symmetric linear systems

Motivated by the theory of self‐duality that provides a variational formulation and resolution for non‐self‐adjoint partial differential equations (Ann. Inst. Henri Poincaré (C) Anal Non Linéaire 2007; 24 :171–205; Selfdual Partial Differential Systems and Their Variational Principles. Springer: New York, 2008), we propose new templates for solving large non‐symmetric linear systems. The method consists of combining a new scheme that simultaneously preconditions and symmetrizes the problem, with various well‐known iterative methods for solving linear and symmetric problems. The approach seems to be efficient when dealing with certain ill‐conditioned, and highly non‐symmetric systems. The numerical and theoretical results are provided to show the efficiency of our approach. Copyright © 2010 John Wiley & Sons, Ltd.     

A splitting preconditioner for saddle point problems

For large sparse systems of linear equations iterative techniques are attractive. In this paper, we study a splitting method for an important class of symmetric and indefinite system. Theoretical analyses show that this method converges to the unique solution of the system of linear equations for all t>0 (t is the parameter). Moreover, all the eigenvalues of the iteration matrix are real and nonnegative and the spectral radius of the iteration matrix is decreasing with respect to the parameter t. Besides, a preconditioning strategy based on the splitting of the symmetric and indefinite coefficient matrices is proposed. The eigensolution of the preconditioned matrix is described and an upper bound of the degree of the minimal polynomials for the preconditioned matrix is obtained. Numerical experiments of a model Stokes problem and a least‐squares problem with linear constraints presented to illustrate the effectiveness of the method. Copyright © 2011 John Wiley & Sons, Ltd.     

Numerical iterative method for Volterra equations of the convolution type

The objective of this paper is to present an algorithm from which a rapidly convergent solution is obtained for Volterra integral equations of Hammerstein type. Such equations are often encountered when describing the response of viscoelastic materials where the time dependency of the material properties is often expressed in the form of a convolution integral. Frequently, singularity is encountered and often ignored when dealing with the constitutive equations of viscoelastic materials. In this paper, the singularity is incorporated in the solution and the iterative scheme used to solve the equation converges within six iterations to a typical toleration error of 10^?5. The algorithm is applied to the strain response of a polymer under impulsive (constant) loading and the results show excellent correlation between the experimental and analytical solution. Copyright © 2010 John Wiley & Sons, Ltd.     

Reproducing Kernel method for the solution of nonlinear hyperbolic telegraph equation with an integral condition

In this article, an iterative method is proposed for solving nonlinear hyperbolic telegraph equation with an integral condition. Its exact solution is represented in the form of series in the reproducing kernel space. In the mean time, the n‐term approximation u_n(x, t) of the exact solution u(x, t) is obtained and is proved to converge to the exact solution. Moreover, the partial derivatives of u_n(x, t) are also convergent to the partial derivatives of u(x, t). Some numerical examples have been studied to demonstrate the accuracy of the present method. Results obtained by the method have been compared with the exact solution of each example and are found to be in good agreement with each other. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 867–886, 2011     

Iterative operator‐splitting methods for nonlinear differential equations and applications

In this article, we consider iterative operator‐splitting methods for nonlinear differential equations with bounded and unbounded operators. The main feature of the proposed idea is the embedding of Newton's method for solving the split parts of the nonlinear equation at each step. The convergence properties of such a mixed method are studied and demonstrated. We confirm with numerical applications the effectiveness of the proposed scheme in comparison with the standard operator‐splitting methods by providing improved results and convergence rates. We apply our results to deposition processes. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1026–1054, 2011     

Banach空间中无限簇广义集值变分包含

在Banach空间中推广两个集值映射的广义变分包含到无限个集值映射的广义变分包含的情况,利用预解方程和迭代的方法,研究了其解的存在性及其迭代逼近问题.所得结果改进和推广了一些最新的成果.     

Weighted FOM and GMRES for solving nonsymmetric linear systems

This paper presents two new methods called WFOM and WGMRES, which are variants of FOM and GMRES, for solving large and sparse nonsymmetric linear systems. To accelerate the convergence, these new methods use a different inner product instead of the Euclidean one. Furthermore, at each restart, a different inner product is chosen. The weighted Arnoldi process is introduced for implementing these methods. After describing the weighted methods, we give the relations that link them to FOM and GMRES. Experimental results are presented to show the good performances of the new methods compared to FOM(m) and GMRES(m). This revised version was published online in August 2006 with corrections to the Cover Date.