کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5773291 1631073 2017 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The real nonnegative inverse eigenvalue problem is NP-hard
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
The real nonnegative inverse eigenvalue problem is NP-hard
چکیده انگلیسی
A list of complex numbers is realizable if it is the spectrum of a nonnegative matrix. In 1949 Suleı̌manova posed the nonnegative inverse eigenvalue problem (NIEP): the problem of determining which lists of complex numbers are realizable. The version for reals of the NIEP (RNIEP) asks for realizable lists of real numbers. In the literature there are many sufficient conditions or criteria for lists of real numbers to be realizable. We will present an unified account of these criteria. Then we will see that the decision problem associated to the RNIEP is NP-hard and we will study the complexity for the decision problems associated to known criteria.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 522, 1 June 2017, Pages 127-139
نویسندگان
, ,