期刊文献+

A CLASS OF GENERALIZED MULTISPLITTING RELAXATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS

A CLASS OF GENERALIZED MULTISPLITTING RELAXATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS
全文增补中
导出
摘要 Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not only includes all the existing relaxation methods for the linear complementarity problems,but also yields a lot of novel ones in the sense of multisplitting.We establish the convergence theories of this class of generalized parallel multisplitting relaxation methods under the condition that the system matrix is an H matrix with positive diagonal elements. Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not only includes all the existing relaxation methods for the linear complementarity problems,but also yields a lot of novel ones in the sense of multisplitting.We establish the convergence theories of this class of generalized parallel multisplitting relaxation methods under the condition that the system matrix is an H matrix with positive diagonal elements.
作者 BAI ZHONGZHI
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 1998年第2期188-198,共11页 高校应用数学学报(英文版)(B辑)
关键词 Linear complementarity problem matrix multisplitting relaxation method convergnece theory Linear complementarity problem matrix multisplitting relaxation method convergnece theory
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部