کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4633694 1340676 2009 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An improved Toeplitz algorithm for polynomial matrix null-space computation
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
An improved Toeplitz algorithm for polynomial matrix null-space computation
چکیده انگلیسی

In this paper, we present an improved algorithm to compute the minimal null-space basis of polynomial matrices, a problem which has many applications in control and systems theory. This algorithm takes advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis of algorithmic complexity and numerical stability shows that the algorithm is reliable and can be considered as an efficient alternative to the well-known pencil (state-space) algorithms found in the literature.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 207, Issue 1, 1 January 2009, Pages 256–272
نویسندگان
, ,