Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems.     

高维抛物方程迎风区域分裂差分方法

结合迎风方法和区域分裂思想,采用一阶迎风、二阶修正迎风法逼近高维抛物方程的对流项.内边界处和子区域分别对应区域分裂显隐格式;并运用极值原理和嵌入定理给出了收敛性分析,最后给出数值试验,说明其实际意义.     

Barycentric Method for Boundary Value Problems of Mathematical Physics

Differential Equations - We consider an application of the barycentric method for the numerical solution of boundary value problems of mathematical physics. The main assumptions are that the system...     

数理方程教学方法探讨

旨在通过教学实践体会来探讨数理方程课的教学方法.主要在分析课程特点、挖掘学生学习难点的基础上,从授课内容和思路、理论结合实际、培养学生学习思想、教学手段等多方面论述了提高数理方程课程教学质量的教学方法,同时结合教学实践列举多个数理方程的教学实例来说明锻炼学生能力的途径.     

Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems

To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an $H_+$-matrix, which improve the existing convergence theory. Numerical results show that the symmetric modulus-based multisplitting relaxation methods are effective in actual implementation.     

Economical Iterative Algorithms for Solving Stationary Problems of Mathematical Physics

We construct and investigate additive iterative methods of complete approximation for solving stationary problems of mathematical physics. We prove the convergence of the proposed methods and obtain error estimates without the requirement of commutativity of the decomposition operators. We provide the results of a computational experiment for a three-dimensional boundary-value problem. We consider possible generalizations of algorithms for equations with mixed derivatives and Navier–Stokes equation systems.     

Two-Stage Multisplitting Iteration Methods Using Modulus-Based Matrix Splitting as Inner Iteration for Linear Complementarity Problems

The matrix multisplitting iteration method is an effective tool for solving large sparse linear complementarity problems. However, at each iteration step we have to solve a sequence of linear complementarity sub-problems exactly. In this paper, we present a two-stage multisplitting iteration method, in which the modulus-based matrix splitting iteration and its relaxed variants are employed as inner iterations to solve the linear complementarity sub-problems approximately. The convergence theorems of these two-stage multisplitting iteration methods are established. Numerical experiments show that the two-stage multisplitting relaxation methods are superior to the matrix multisplitting iteration methods in computing time, and can achieve a satisfactory parallel efficiency.     

Additive Schwarz Methods for Elliptic Mortar Finite Element Problems

Summary. Two variants of the additive Schwarz method for solving linear systems arising from the mortar finite element discretization on nonmatching meshes of second order elliptic problems with discontinuous coefficients are designed and analyzed. The methods are defined on subdomains without overlap, and they use special coarse spaces, resulting in algorithms that are well suited for parallel computation. The condition number estimate for the preconditioned system in each method is proportional to the ratio H/h, where H and h are the mesh sizes, and it is independent of discontinuous jumps of the coefficients. For one of the methods presented the choice of the mortar (nonmortar) side is independent of the coefficients.This work has been supported in part by the Norwegian Research Council, grant 113492/420This work has been supported in part by the National Science Foundation, grant NSF-CCR-9732208 and in part by the Polish Science Foundation, grant 2P03A02116 Mathematics Subject Classification (2000):65N55     

M-矩阵线性互补问题模系多分裂迭代方法的收敛性

首先证明了M-矩阵的H-相容分裂都是正则分裂,反之不成立.这表明对于M-矩阵而言,其正则分裂包含H-相容分裂.然后针对系数矩阵为M-矩阵的线性互补问题,建立了两个收敛定理:一是模系多分裂迭代方法关于正则分裂的收敛定理;二是模系二级多分裂迭代方法关于外迭代为正则分裂和内迭代为弱正则分裂的收敛定理.     

Some Uniformly Convergent Spline Difference Schemes for Singularly Parturbed Boundary Value Problems

In this paper some difference schemes for singularly perturbedtwo-point boundary value problems are derived using cubic splinesv(x) C¹[0,1]. One of them is the well-known Allen-Southwell-Il'inscheme. These schemes are first-order uniformly convergent.Numerical examples support the theoretical results.     

Hilbert空间中分裂可行性问题的改进Halpern迭代和黏性逼近算法

在无限维Hilbert空间中,提出了求解分裂可行性问题（SFP）的改进Halpern迭代和黏性逼近算法,证明了当参数满足一定条件时,由给定算法生成的序列强收敛到分裂可行性问题的一个解.这些结论推广了Deepho和Kumam近年来的一些结果     

严格拟伪压缩映像族的复合迭代算法

在Hilbert空间中设计了一种关于严格拟伪压缩映像族的复合迭代算法,并利用度量投影法证明了严格拟伪压缩映像族的公共不动点的强收敛定理,所得结果改进和推广了一些最新文献的相关结果.