کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9498317 1631195 2005 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The symmetric N-matrix completion problem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
The symmetric N-matrix completion problem
چکیده انگلیسی
An n × n matrix is called an N-matrix if all its principal minors are negative. In this paper, we are interested in the symmetric N-matrix completion problem, that is, when a partial symmetric N-matrix has a symmetric N-matrix completion. Here, we prove that a partial symmetric N-matrix has a symmetric N-matrix completion if the graph of its specified entries is chordal. Furthermore, if this graph is not chordal, then examples exist without symmetric N-matrix completions. Necessary and sufficient conditions for the existence of a symmetric N-matrix completion of a partial symmetric N-matrix whose associated graph is a cycle are given.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 406, 1 September 2005, Pages 235-252
نویسندگان
, , ,