Skip to main content
SpringerLink
Log in

A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

In this paper, a relaxed two-step modulus-based matrix synchronous multisplitting iteration method for solving the linear complementarity problems is constructed. The convergence conditions of the proposed method are analyzed with the convergence range of the relaxation parameters. Some parallel numerical experiments under OpenACC framework are given to show that the proposed method can accelerate the convergence rate of the existing method significantly.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Data availability statement

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

References

  • Bai Z-Z (1999) On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J. Matrix Anal. Appl. 21:67–78

    Article  MathSciNet  Google Scholar 

  • Bai Z-Z (2010) Modulus-based matrix splitting iteration methods for linear complementarity problems. Numer. Linear Algebra Appl. 17:917–933

    Article  MathSciNet  Google Scholar 

  • Bai Z-Z A two-step matrix splitting iteration paradigm based on one single splitting for solving systems of linear equations, Numer. Linear Algebra Appl. (In press) https://doi.org/10.1002/nla.2510

  • Bai Z-Z, Zhang L-L (2013) Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems. Numer. Algorithms 62:59–77

    Article  MathSciNet  Google Scholar 

  • Bai Z-Z, Zhang L-L (2013) Modulus-based synchronous multisplitting iteration methods for linear complementarity problems. Numer. Linear Algebra Appl. 20:425–439

    Article  MathSciNet  Google Scholar 

  • Berman A, Plemmons RJ (1994) Nonnegative Matrix in the Mathematical Sciences. SIAM Publisher, Philadelphia

    Book  Google Scholar 

  • Cottle R-W, Pang J-S (1992) Stone RE. Academic, The Linear Complementarity Problem. SanDiego

    Google Scholar 

  • Cryer C (1971) The solution of a quadratic programming using systematic overrelaxation. SIAM J. Control Opt. 9:385–392

    Article  MathSciNet  Google Scholar 

  • Dong J-L, Jiang M-Q (2009) A modified modulus method for symmetric positive-definite linear complementarity problems. Numer. Linear Algebra Appl. 16:129–143

    Article  MathSciNet  Google Scholar 

  • Fang X-M (2022) The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems. Comp. Appl. Math. 41:134

    Article  MathSciNet  Google Scholar 

  • Fang X-M, Gu Z, Qiao Z-J (2023) Convergence of the two-point modulus-based matrix splitting iteration method. J. Appl. Anal. Comput. 13(5):2504–2521

    MathSciNet  Google Scholar 

  • Fang X-M, Zhu Z-W (2019) The modulus-based matrix double splitting iteration method for linear complementarity problems. Comput. Math. Appl. 78:3633–3643

    Article  MathSciNet  Google Scholar 

  • Frommer A, Szyld DB (1992) \(H\)-splittings and two-stage iterative methods. Numer. Math. 63:345–356

    Article  MathSciNet  Google Scholar 

  • Frommer A, Mayer G (1989) Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl. 119:141–152

    Article  MathSciNet  Google Scholar 

  • Huang B-H, Ma C-F (2018) Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems. Comp. Appl. Math. 37:3053–3076

    Article  MathSciNet  Google Scholar 

  • Hu J-G (1982) Estimates of \(\Vert {B^{-1}C}\Vert _\infty \) and their applications. Math. Numer. Sin. 4:272–282

    Google Scholar 

  • Ke Y-F, Ma C-F (2014) On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems. Appl. Math. Comput. 243:413–418

    MathSciNet  Google Scholar 

  • Ke Y-F, Ma C-F, Zhang H (2018) The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems. Comp. Appl. Math. 37:6795–6820

    Article  MathSciNet  Google Scholar 

  • Murty KG (1988) Linear Complementarity, Linear and Nonlinear Programming. Heldermann Verlag, Berlin

    Google Scholar 

  • NVIDIA HPC SDK Version 23.5 Documentation, URL https://docs.nvidia.com/hpc-sdk/index.html

  • Ren H, Wang X, Tang X-B, Wang T (2019) The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems. Comput. Math. Appl. 77:1071–1081

    Article  MathSciNet  Google Scholar 

  • Song Y-L, Zheng H, Lu X-P, Vong S (1882) A two-step iteration method for vertical linear complementarity problems. Symmetry 14(9)(2022)

  • Wu M-H, Li C-L (2019) A preconditioned modulus-based matrix multisplitting block iteration method for the linear complementarity problems with Toeplitz matrix. Calcolo 56:13

    Article  MathSciNet  Google Scholar 

  • Wu X-P, Peng X-F, Li W (2018) A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices. Numer Algorithms 79:1131–1146

    Article  MathSciNet  Google Scholar 

  • Xu W-W, Zhu L, Peng X-F, Liu H, Yin J-F (2020) A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems. Numer. Algorithms 85:1–21

    Article  MathSciNet  Google Scholar 

  • Zhang L-L (2011) Two-step modulus-based matrix splitting iteration for linear complementarity problems. Numer. Algorithms 57:83–99

    Article  MathSciNet  Google Scholar 

  • Zhang L-L (2014) Two-stage multisplitting iteration method using modulus-based matrix splitting as inner iteration for linear complementarity problems. J. Opt. Theory Appl. 160:189–203

    Article  MathSciNet  Google Scholar 

  • Zhang L-L (2015) Two-step modulus-based synchronous multisplitting iteration methods for linear complementarity problems. J. Comput. Math. 33:100–112

    Article  MathSciNet  Google Scholar 

  • Zhang Y-X, Zheng H, Lu X-P, Vong S (2023) A two-step parallel iteration method for large sparse horizontal linear complementarity problems. Appl. Math. Comput. 438:127609

    MathSciNet  Google Scholar 

  • Zheng H, Luo L, Li S-Y (2021) A two-step iteration method for the horizontal nonlinear complementarity problem. JPN. J. Ind. Appl. Math. 38:1023–1036

    Article  MathSciNet  Google Scholar 

  • Zheng H, Vong S (2021) A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems. Numer. Algorithms 86:1791–1810

    Article  MathSciNet  Google Scholar 

  • Zheng H, Vong S, Liu L (2019) The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems. Intern. J. Comput. Math. 96(8):1648–1667

    Article  MathSciNet  Google Scholar 

  • Zheng H, Li W, Vong S (2017) A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems. Numer. Algorithms 74:137–152

    Article  MathSciNet  Google Scholar 

  • Zheng H, Lu X-P, Vong S A two-step modulus-based matrix splitting iteration method without auxiliary variable for solving vertical linear complementarity problems, Commun. Appl. Math. Comput. (In press) https://doi.org/10.1007/s42967-023-00280-y

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their helpful comments. This work was supported by Scientific Computing Research Innovation Team of Guangdong Province (No. 2021KCXTD052), Science and Technology Development Fund, Macau SAR (No. 0151/2022/A), University of Macau (No. MYRG2022-00076-FST, MYRG-GRG2023-00037-FST-UMDF), Guangdong Key Construction Discipline Research Capacity Enhancement Project (No. 2022ZDJS049), Characteristic innovation project of Guangdong Provincial Department of Education (No. 2023KTSCX195) and Technology Planning Project of Shaoguan (No. 230330108034184).

Author information

Authors and Affiliations

  1. School of Engineering and Technology, Guangzhou College of Technology and Business, Guangzhou, People’s Republic of China

    Yongxiong Zhang

  2. School of Computer Science and Engineering, Macau University of Science and Technology, Macau, People’s Republic of China

    Wenxiu Guo

  3. School of Mathematics and Statistics, Shaoguan University, Shaoguan, People’s Republic of China

    Wenxiu Guo & Hua Zheng

  4. Department of Mathematics, University of Macau, Macau, People’s Republic of China

    Seakweng Vong

Authors
  1. Yongxiong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenxiu Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hua Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Seakweng Vong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hua Zheng.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by Jinyun Yuan.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Y., Guo, W., Zheng, H. et al. A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems. Comp. Appl. Math. 43, 33 (2024). https://doi.org/10.1007/s40314-023-02563-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-023-02563-9

Keywords

Mathematics Subject Classification

Search

Navigation