On Error Bound for Linear Complementarity Problem of Double α-Chain Diagonally Dominant Matrix

doi:10.3969/j.issn.1007-2985.2015.02.005

journal6 ›› 2015, Vol. 36 ›› Issue (2): 20-22.DOI: 10.3969/j.issn.1007-2985.2015.02.005

• Mathematics • Previous Articles Next Articles

On Error Bound for Linear Complementarity Problem of Double α-Chain Diagonally Dominant Matrix

PENG Ling, MO Hong-Min

(College of Mathematics and Statistics，Jishou University,Jishou 416000，Hunan China)

Online:2015-03-25 Published:2015-04-28

Abstract

Abstract: In this paper,we give new error bound for the linear complementarity problem where the involved matrix is a double α-chain diagonally dominant matrix based on its definition and properties.Preliminary numerical results show that the proposed error bound is efficient for verifying accuracy of approximate solutions.

Key words: accuracy, error bound, linear complementarity problem, double &alpha, -chain diagonally dominant matrix

PENG Ling, MO Hong-Min. On Error Bound for Linear Complementarity Problem of Double α-Chain Diagonally Dominant Matrix[J]. journal6, 2015, 36(2): 20-22.

[1]	LI Huijun, MO Hongmin, HUANG Jiaxian. Error Bound Estimation for Linear Complementarity Problems of B-Matrices [J]. Journal of Jishou University(Natural Sciences Edition), 2021, 42(5): 20-26.
[2]	ZHOU Cuiling, MO Hongmin. New Estimate of Error Bounds for Linear Complementarity Problems of B^S-Matrices [J]. Journal of Jishou University(Natural Sciences Edition), 2021, 42(2): 31-37.
[3]	DONG Yingxue, MO Hongmin. Error Bounds for Linear Complementarity Problem of B-Matrices [J]. Journal of Jishou University(Natural Sciences Edition), 2021, 42(1): 16-22.
[4]	SONG Mongpei, MO Liping, ZHOU Kaiqing. Influence of Inertia Weight and Learning Factor on Performance of Standard PSO Algorithm [J]. Journal of Jishou University（Natural Sciences Edition), 2019, 40(4): 24-32.
[5]	YU Min, MO Hongmin. Error Bound of Linear Complementarity Problem for Dashnic-Zusmanovich₊ Matrix [J]. Journal of Jishou University（Natural Sciences Edition), 2019, 40(4): 4-8.
[6]	LONG Jun, ZENG San-Yun. Extragradient-Filter Method for Solving Nonlinear Complementarity Problems [J]. journal6, 2014, 35(4): 19-22.
[7]	PENG Hua, MO Li-Ping, TANG Zan-Yu. Construction of a SVM Learning Model in the Categorization Framework for CVE [J]. journal6, 2013, 34(4): 62-66.
[8]	DAI Ping-Fan, LI Yao-Tang. Convergence Analysis of the Parallel Multisplitting GAOR Method for Linear Complementarity Problem [J]. journal6, 2009, 30(3): 19-21.
[9]	YONG Long-Quan, DENG Fang-An. Two Notes on Positiveness Judgement of Matrix in Linear Complementarity Problem [J]. journal6, 2009, 30(1): 33-35.
[10]	XIAO Ze-Chang, DU Yue-Peng. Modified Formula for Simpson Rule with Third Derivatives of Endpoint [J]. journal6, 2008, 29(4): 20-23.
[11]	CAI Guo-Min, WANG Ya-Lin. Analysis and Optimization on Search Engines' Relevance Ranking Algorithm [J]. journal6, 2006, 27(5): 17-19.

On Error Bound for Linear Complementarity Problem of Double α-Chain Diagonally Dominant Matrix

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 11

Recommended Articles

Metrics

Comments