平衡线性互补问题的模系矩阵分裂迭代法  

Modulus-based Matrix Splitting Iteration Method for Balanced Linear Complementarity Problem

作　　者：谢亚君 钟诗羿 柯艺芬 XIE Yajun;ZHONG Shiyi;KE Yifen(School of Big Data&Key Laboratory of Data Science and Intelligent Computing,Fuzhou University of International Studies and Trade,Fuzhou 350202,China;College of Photonic and Electronic Engineering,Fujian Normal University,Fuzhou 350117,China;School of Mathematics and Statistics,Fujian Normal University,Fuzhou 350117,China)

机构地区：[1]福州外语外贸学院大数据学院&数据科学与智能计算重点实验室,福建福州350202 [2]福建师范大学光电与信息工程学院,福建福州350117 [3]福建师范大学数学与统计学院,福建福州350117

出　　处：《应用数学》2024年第4期945-951,共7页Mathematica Applicata

基　　金：国家自然科学基金(12371378);福建省自然科学基金(2023J011127,2023J01955)。

摘　　要：本文考虑平衡线性互补问题的数值解.基于模技巧,将平衡线性互补问题转化为一个等价的不动点方程组,提出一类模系矩阵分裂迭代法,并研究算法收敛的充分条件.数值实验表明所提算法能够有效地求解平衡线性互补问题.In this paper,we consider numerical solutions of the balanced linear complementarity problem.Based on the modulus technique,the balanced linear complementarity problem is transformed into an equivalent xed point equation,and a kind of modulus-based matrix splitting iteration method is proposed.The sucient conditions for the convergence of the proposed algorithm are also studied.Numerical experiments show that the proposed algorithm can e ectively solve the balanced linear com-plementarity problem.

关 键 词：平衡线性互补问题 模方法 收敛性 

分 类 号：O242.2[理学—计算数学]