DocumentCode :
2833039
Title :
The inverse M-matrix completion study on omega tree
Author :
Ji, NaiHua ; Yao, HuiPing
Author_Institution :
Comput. Eng. Inst., Qingdao Technol. Univ., Qingdao, China
fYear :
2012
fDate :
June 30 2012-July 2 2012
Firstpage :
552
Lastpage :
554
Abstract :
The partial inverse M matrix completion is a part of the work of the inverse M matrix judgment. The partial matrices completions have been discussed widely. But the researches demand that the entries in diagonal positions of the matrices are all specified. In the paper, the condition will be drop and the completion theorem and algorithm of the omega tree will be discussed.
Keywords :
matrix algebra; trees (mathematics); diagonal positions; inverse M matrix judgment; omega tree; partial inverse M matrix completion; Biological neural networks; Computers; Cybernetics; Educational institutions; Electronic mail; Linear algebra; clique; omega tree; specified entries; unspecified entries;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Science and Engineering (ICSSE), 2012 International Conference on
Conference_Location :
Dalian, Liaoning
Print_ISBN :
978-1-4673-0944-8
Electronic_ISBN :
978-1-4673-0943-1
Type :
conf
DOI :
10.1109/ICSSE.2012.6257247
Filename :
6257247
Link To Document :
بازگشت