共查询到20条相似文献,搜索用时 15 毫秒
1.
Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem 总被引:1,自引:0,他引:1
For the large sparse linear complementarity problem, a class of accelerated modulus-based matrix splitting iteration methods is established by reformulating it as a general implicit fixed-point equation, which covers the known modulus-based matrix splitting iteration methods. The convergence conditions are presented when the system matrix is either a positive definite matrix or an H +-matrix. Numerical experiments further show that the proposed methods are efficient and accelerate the convergence performance of the modulus-based matrix splitting iteration methods with less iteration steps and CPU time. 相似文献
2.
Two-step modulus-based matrix splitting iteration method for linear complementarity problems 总被引:1,自引:0,他引:1
Li-Li Zhang 《Numerical Algorithms》2011,57(1):83-99
Bai has recently presented a modulus-based matrix splitting iteration method, which is a powerful alternative for solving
the large sparse linear complementarity problems. In this paper, we further present a two-step modulus-based matrix splitting
iteration method, which consists of a forward and a backward sweep. Its convergence theory is proved when the system matrix
is an H
+ -matrix. Moreover, for the two-step modulus-based relaxation iteration methods, more exact convergence domains are obtained
without restriction on the Jacobi matrix associated with the system matrix, which improve the existing convergence theory.
Numerical results show that the two-step modulus-based relaxation iteration methods are superior to the modulus-based relaxation
iteration methods for solving the large sparse linear complementarity problems. 相似文献
3.
In this paper, a relaxation modulus-based matrix splitting iteration method is established, which covers the known general modulus-based matrix splitting iteration methods. The convergence analysis and the strategy of the choice of the parameters are given. Numerical examples show that the proposed methods are efficient and accelerate the convergence performance with less iteration steps and CPU times. 相似文献
4.
To solve a class of nonlinear complementarity problems, accelerated modulus-based matrix splitting iteration methods are presented and analyzed. Convergence analysis and the choice of the parameters are given when the system matrix is either positive definite or an H +-matrix. Numerical experiments further demonstrate that the proposed methods are efficient and have better performance than the existing modulus-based iteration method in aspects of the number of iteration steps and CPU time. 相似文献
5.
Hua Zheng 《Linear and Multilinear Algebra》2013,61(9):1773-1784
AbstractIn this paper, the convergence conditions of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems of H-matrices are weakened. The convergence domain given by the proposed theorems is larger than the existing ones. 相似文献
6.
In order to solve large sparse linear complementarity problems on parallel multiprocessor systems, we construct modulus-based synchronous two-stage multisplitting iteration methods based on two-stage multisplittings of the system matrices. These iteration methods include the multisplitting relaxation methods such as Jacobi, Gauss–Seidel, SOR and AOR of the modulus type as special cases. We establish the convergence theory of these modulus-based synchronous two-stage multisplitting iteration methods and their relaxed variants when the system matrix is an H ?+?-matrix. Numerical results show that in terms of computing time the modulus-based synchronous two-stage multisplitting relaxation methods are more efficient than the modulus-based synchronous multisplitting relaxation methods in actual implementations. 相似文献
7.
In this paper, a modified modulus-based matrix splitting iteration method is established for solving a class of implicit complementarity problems. The global convergence conditions are given when the system matrix is a positive definite matrix or an H+-matrix, respectively. In addition, some numerical examples show that the proposed method is efficient.
相似文献8.
We weaken the convergence conditions of modulus-based matrix splitting and matrix two-stage splitting iteration methods for linear complementarity problems. Thus their applied scopes are further extended. 相似文献
9.
Min-Li Zeng & Guo-Feng Zhang 《数学研究》2015,48(1):1-17
In this paper, a modulus-based generalized skew-Hermitian triangular splitting
(MGSTS) iteration method is present for solving a class of linear complementarity
problems with the system matrix either being an $H_+$-matrix with non-positive
off-diagonal entries or a symmetric positive definite matrix. The convergence of the
MGSTS iteration method is studied in detail. By choosing different parameters, a series
of existing and new iterative methods are derived, including the modulus-based Jacobi
(MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental
results are given to show the effectiveness and feasibility of the new method
when it is employed for solving this class of linear complementarity problems. 相似文献
10.
关于线性互补问题的模系矩阵分裂迭代方法 总被引:1,自引:0,他引:1
模系矩阵分裂迭代方法是求解大型稀疏线性互补问题的有效方法之一.本文的目标是归纳总结模系矩阵分裂迭代方法的最新发展和已有成果,主要内容包括相应的多分裂迭代方法, 二级多分裂迭代方法和两步多分裂迭代方法, 以及这些方法的收敛理论. 相似文献
11.
本文构造了求解一类非线性互补问题的松弛two-sweep模系矩阵分裂迭代法. 理论分析建立了新方法在系数矩阵为正定矩阵或H+矩阵时的收敛性质.数值实验结果表明新方法是行之有效的, 并且在最优参数下松弛two-sweep模系矩阵分裂迭代法在迭代步数和时间上均优于传统的模系矩阵分裂迭代法和two-sweep模系矩阵分裂迭代法. 相似文献
12.
Li-Li Zhang 《Journal of Optimization Theory and Applications》2014,160(1):189-203
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. 相似文献
13.
Numerical Algorithms - In this paper, for solving horizontal linear complementarity problems, a two-step modulus-based matrix splitting iteration method is established. The convergence analysis of... 相似文献
14.
Modified modulus‐based matrix splitting iteration methods for linear complementarity problems 下载免费PDF全文
Wei‐wei Xu 《Numerical Linear Algebra with Applications》2015,22(4):748-760
For solving the large sparse linear complementarity problems, we establish modified modulus‐based matrix splitting iteration methods and present the convergence analysis when the system matrices are H+‐matrices. The optima of parameters involved under some scopes are also analyzed. Numerical results show that in computing efficiency, our new methods are superior to classical modulus‐based matrix splitting iteration methods under suitable conditions. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
15.
本文我们利用预处理技术推广了求解线性互补问题的二步模基矩阵分裂迭代法,并针对H-矩阵类给出了新方法的收敛性分析,得到的理论结果推广了已有的一些方法. 相似文献
16.
Lili Zhang 《计算数学(英文版)》2015,33(1):100-112
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. 相似文献
17.
首先证明了M-矩阵的H-相容分裂都是正则分裂,反之不成立.这表明对于M-矩阵而言,其正则分裂包含H-相容分裂.然后针对系数矩阵为M-矩阵的线性互补问题,建立了两个收敛定理:一是模系多分裂迭代方法关于正则分裂的收敛定理;二是模系二级多分裂迭代方法关于外迭代为正则分裂和内迭代为弱正则分裂的收敛定理. 相似文献
18.
19.
Numerical Algorithms - In this paper, we extend modulus-based matrix splitting iteration methods to horizontal linear complementarity problems. We consider both standard and accelerated methods and... 相似文献
20.
针对系数矩阵为对称正定Toeplitz矩阵的线性互补问题,本文提出了一类预处理模系矩阵分裂迭代方法.先通过变量替换将线性互补问题转化为一类非线性方程组,然后选取Strang或T.Chan循环矩阵作为预优矩阵,利用共轭梯度法进行求解.我们分析了该方法的收敛性.数值实验表明,该方法是高效可行的. 相似文献