Abstract
In this paper, for solving large sparse vertical linear complementarity problems, the modulus-based synchronous multisplitting iteration method is established. Convergence theorems of the proposed method are given, which are shown to generalize and improve the existing results of the serial method. Numerical tests by OpenACC technique are given to show the efficiency of the proposed method.
Similar content being viewed by others
References
Bai, Z.-Z.: The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems. Comput. Math. Appl. 31:12, 17–33 (1996)
Bai, Z.-Z.: New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems. Comput. Math. Appl. 32, 41–48 (1996)
Bai, Z.-Z.: On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem. IMA J. Numer. Anal. 18:4, 509–518 (1998)
Bai, Z.-Z.: On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J. Matrix Anal. Appl. 21, 67–78 (1999)
Bai, Z.-Z.: Modulus-based matrix splitting iteration methods for linear complementarity problems. Numer. Linear Algebra Appl. 17, 917–933 (2010)
Bai, Z.-Z., Evans, D.J.: Matrix multisplitting relaxation methods for linear complementarity problems. Intern. J. Computer Math. 63, 309–326 (1997)
Bai, Z.-Z., Evans, D.J.: Matrix multisplitting methods with applications to linear complementarity problems: Parallel synchronous and chaotic methods. Reseaux et systemes repartis: Calculateurs Paralleles 13:1, 125–154 (2001)
Bai, Z.-Z., Evans, D.J.: Matrix multisplitting methods with applications to linear complementarity problems: Parallel asynchronous methods. Intern. J. Computer Math. 79:2, 205–232 (2002)
Bai, Z.-Z., Sun, J.-C., Wang, D.-R.: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations. Comput. Math. Appl. 32:12, 51–76 (1996)
Bai, Z.-Z., Wang, D.-R.: A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems. Comput. Math. Appl. 32(8), 79–95 (1996)
Bai, Z.-Z., Zhang, L.-L.: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems. Numer. Linear Algebra Appl. 20, 425–439 (2013)
Bai, Z.-Z., Zhang, L.-L.: Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems. Numer. Algor. 62, 59–77 (2013)
Berman, A., Plemmons, R.J.: Nonnegative Matrix in the Mathematical Sciences. SIAM Publisher, Philadelphia (1994)
Cottle, R.W., Dantzig, G.B.: A generalization of the linear complementarity problem. J. Comb. Theory 8, 79–90 (1970)
Cottle, R.W., Pang, J. -S., Stone, R.E.: The Linear Complementarity Problem. Academic, SanDiego (1992)
Frommer, A.: Parallel nonlinear multisplitting methods. Numer. Math. 56(2–3), 269–282 (1989)
Frommer, A., Mayer, G.: Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl. 119, 141–152 (1989)
Fujisawa, T., Kuh, E.S.: Piecewise-linear theory of nonlinear networks. SIAM J. Appl. Math. 22, 307–328 (1972)
Fujisawa, T., Kuh, E.S., Ohtsuki, T.: A sparse matrix method for analysis of piecewise-linear resistive networks. IEEE Trans. Circuit Theory 19, 571–584 (1972)
Frommer, A., Szyld, D.B.: H-splittings and two-stage iterative methods. Numer. Math. 63, 345–356 (1992)
Gowda, M.S., Sznajder, R.: The generalized order linear complementarity problem. SIAM J. Matrix Anal. Appl. 15, 779–795 (1994)
He, J.-W., Vong, S.: A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems. Appl. Math. Lett. 134, 108344 (2022)
Hu, J.-G.: Estimates of \(\Vert {B^{-1}C}\Vert _{\infty }\) and their applications. Math. Numer. Sin. 3, 272–282 (1982)
Li, C.-L, Hong, J.-T: Modulus-based synchronous multisplitting iteration methods for an implicit complementarity problem. East Asian J. Appl. Math. 7, 363–375 (2017)
Liu, C., Li, C.-L.: Synchronous and Asynchronous Multisplitting Iteration Schemes for Solving Mixed Linear Complementarity Problems with H-Matrices. J. Optim. Theory Appl. 171, 169–185 (2016)
Mezzadri, F.: Modulus-based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers. Numer. Linear Algebra Appl. 27:5, e2319 (2020)
Mezzadri, F.: A modulus-based formulation for the vertical linear complementarity problems. Numer. Algorithms 90, 1547–1568 (2022)
Mezzadri, F., Galligani, E.: Projected splitting methods for vertical linear complementarity problems. J. Optim. Theory Appl. 193:1, 598–620 (2022)
NVIDIA HPC SDK Version 21.5 Documentation, https://docs.nvidia.com/hpc-sdk/index.html
Oh, K.P.: The formulation of the mixed lubrication problem as a generalized nonlinear complementarity problem. J. Tribol. 108, 598–604 (1986)
O’Leary, D.P., White, R.E.: Multisplittings of matrices and parallel solution of linear systems. SIAM J. Algebraic Discrete Methods 6:4, 630–640 (1985)
Sznajder, R., Gowda, M.S.: Generalizations of P0- and P-properties; extended vertical and horizontal linear complementarity problems. Linear Algebra Appl. 223(/224), 695–715 (1995)
White, R.E.: Parallel algorithms for nonlinear problems. SIAM J. Algebraic Discrete Methods 7:1, 137–149 (1986)
Wu, M.-H., Li, C.-L.: A preconditioned modulus-based matrix multisplitting block iteration method for the linear complementarity problems with Toeplitz matrix. Calcolo 56, 13 (2019)
Xu, H.-R, Chen, R.-L., Xie, S.-L., Wu, L.: Modulus-based multisplitting iteration methods for a class of nonlinear complementarity problems. East Asian J. Appl. Math. 8, 519–530 (2018)
Xu, W.-W., Zhu, L., Peng, X.-F., Liu, H., Yin, J.-F.: A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems. Numer. Algorithms 85, 1–21 (2020)
Zhang, L.-L.: Two-step modulus-based synchronous multisplitting iteration methods for linear complementarity problems. J. Comput. Math. 33, 100–112 (2015)
Zheng, H., Vong, S.: Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems. Linear Multilinear Algebra. 67:9, 1773–1784 (2019)
Acknowledgements
The authors would like to thank the anonymous reviewers for their helpful comments.
Funding
This work was supported by the Major Projects of Guangdong Education Department for Foundation Research and Applied Research (No. 2018KZDXM065), the Science and Technology Development Fund, Macau SAR (No. 0005/2019/A, 0073/2019/A2), University of Macau (No. MYRG2020-00035-FST, MYRG2018-00047-FST), the Scientific Computing Research Innovation Team of Guangdong Province (No. 2021KCXTD052), Technology Planning Project of Shaoguan (No. 210716094530390) and the Science Foundation of Shaoguan University (No. SZ2020KJ01, SY2021KJ09).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing interests.
Additional information
Data availability
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zheng, H., Zhang, Y., Lu, X. et al. Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems. Numer Algor 93, 711–729 (2023). https://doi.org/10.1007/s11075-022-01436-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-022-01436-2