Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem

2017 ◽  
Vol 7 (2) ◽  
pp. 363-375 ◽  
Author(s):  
Chen-Liang Li ◽  
Jun-Tao Hong

AbstractWe construct modulus-based synchronous multisplitting iteration methods to solve a large implicit complementarity problem on parallel multiprocessor systems, and prove their convergence. Numerical results confirm our theoretical analysis and show that these new methods are efficient.

Author(s):  
Fawang Liu ◽  
Mark Meerschaert ◽  
Robert McGough ◽  
Pinghui Zhuang ◽  
Qingxia Liu

AbstractIn this paper, the multi-term time-fractional wave-diffusion equations are considered. The multi-term time fractional derivatives are defined in the Caputo sense, whose orders belong to the intervals [0,1], [1,2), [0,2), [0,3), [2,3) and [2,4), respectively. Some computationally effective numerical methods are proposed for simulating the multi-term time-fractional wave-diffusion equations. The numerical results demonstrate the effectiveness of theoretical analysis. These methods and techniques can also be extended to other kinds of the multi-term fractional time-space models with fractional Laplacian.


2018 ◽  
Vol 228 ◽  
pp. 05002 ◽  
Author(s):  
Yihan Wang

The problems of multi-objective decision making are analysed and studied. In order to solve its optimization problems, the basic principles and application steps of TOPSIS and AHP are introduced in this paper. Then some practical examples are given to show how to apply these two new methods in multi-objective decision making problems. Finally, the advantage and feasibility of the TOPSIS and AHP methods are demonstrated by theoretical analysis.


2019 ◽  
Vol 11 (1) ◽  
pp. 43-46
Author(s):  
Zsolt Darvay ◽  
Ágnes Füstös

Abstract In this article we discuss the interior-point algorithm for the general complementarity problems (LCP) introduced by Tibor Illés, Marianna Nagy and Tamás Terlaky. Moreover, we present a various set of numerical results with the help of a code implemented in the C++ programming language. These results support the efficiency of the algorithm for both monotone and sufficient LCPs.


2004 ◽  
Vol 15 (01) ◽  
pp. 1-15 ◽  
Author(s):  
Z. A. ANASTASSI ◽  
T. E. SIMOS

In this paper we present a family of explicit Runge–Kutta methods of 5th algebraic order, one of which has variable coefficients, for the efficient solution of problems with oscillating solutions. Emphasis is placed on the phase-lag property in order to show its importance with regards to problems with oscillating solutions. Basic theory of Runge–Kutta methods, phase-lag analysis and construction of the new methods are described. Numerical results obtained for known problems show the efficiency of the new methods when they are compared with known methods in the literature. Furthermore we note that the method with variable coefficients appears to have much higher accuracy, which gets close to double precision, when the product of the frequency with the step-length approaches certain values. These values are constant and independent of the problem solved and depend only on the method used and more specifically on the expressions used to achieve higher algebraic order.


2016 ◽  
Vol 6 (4) ◽  
pp. 367-383 ◽  
Author(s):  
Min-Li Zeng ◽  
Guo-Feng Zhang

AbstractIn this paper, we first construct a preconditioned two-parameter generalized Hermitian and skew-Hermitian splitting (PTGHSS) iteration method based on the two-parameter generalized Hermitian and skew-Hermitian splitting (TGHSS) iteration method for non-Hermitian positive definite linear systems. Then a class of PTGHSS-based iteration methods are proposed for solving weakly nonlinear systems based on separable property of the linear and nonlinear terms. The conditions for guaranteeing the local convergence are studied and the quasi-optimal iterative parameters are derived. Numerical experiments are implemented to show that the new methods are feasible and effective for large scale systems of weakly nonlinear systems.


Filomat ◽  
2020 ◽  
Vol 34 (7) ◽  
pp. 2171-2184
Author(s):  
Lu Jia ◽  
Xiang Wang ◽  
Xuan-Sheng Wang

The modulus-based matrix splitting iteration has received substantial attention as a momentous tool for complementarity problems. For the purpose of solving the horizontal linear complementarity problem, we introduce the two-step modulus-based matrix splitting iteration method. We also show the theoretical analysis of the convergence. Numerical experiments illustrate the effectiveness of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document