平衡线性互补问题的模系矩阵分裂迭代法OA北大核心CSTPCD
Modulus-based Matrix Splitting Iteration Method for Balanced Linear Complementarity Problem
本文考虑平衡线性互补问题的数值解.基于模技巧,将平衡线性互补问题转化为一个等价的不动点方程组,提出一类模系矩阵分裂迭代法,并研究算法收敛的充分条件.数值实验表明所提算法能够有效地求解平衡线性互补问题.
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 fixed point equation,and a kind of modulus-based matrix splitting iteration method is proposed.The sufficient conditions for the convergence of the proposed algorithm are also studied.Numerical experiments show that the proposed algorithm can effectively solve the balanced linear com-plementarity problem.
谢亚君;钟诗羿;柯艺芬
福州外语外贸学院大数据学院&数据科学与智能计算重点实验室,福建福州 350202福建师范大学光电与信息工程学院,福建福州 350117福州外语外贸学院大数据学院&数据科学与智能计算重点实验室,福建福州 350202||福建师范大学数学与统计学院,福建福州 350117
数学
平衡线性互补问题模方法收敛性
Balanced linear complementarity problemModulus-based methodConvergence
《应用数学》 2024 (004)
945-951 / 7
国家自然科学基金(12371378);福建省自然科学基金(2023J011127,2023J01955)
评论