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 ...
متن کاملBlock Toeplitz Algorithms for Polynomial Matrix Null-space Computation
In this paper we present new algorithms to compute the minimal basis of the nullspace of polynomial matrices, a problem which has many applications in control. These algorithms take advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis done in both aspects, algorithmic complexity and numerical stability, shows that the algorithms a...
متن کاملAn Improved Distance Matrix Computation Algorithm for Multicore Clusters
Distance matrix has diverse usage in different research areas. Its computation is typically an essential task in most bioinformatics applications, especially in multiple sequence alignment. The gigantic explosion of biological sequence databases leads to an urgent need for accelerating these computations. DistVect algorithm was introduced in the paper of Al-Neama et al. (in press) to present a ...
متن کاملFast computation of the matrix exponential for a Toeplitz matrix
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured n×n matrix it can be computed in O(n3) operations. An interesting problem arises if the input matrix is a Toeplitz matrix, for example as the result of discretizing integral equations with a time invariant kernel. In this case it is not obvious how to take advantage of t...
متن کاملBlock Toeplitz Methods in Polynomial Matrix Computations
Some block Toeplitz methods applied to polynomial matrices are reviewed. We focus on the computation of the structure (rank, null-space, infinite and finite structures) of an arbitrary rectangular polynomial matrix. We also introduce some applications of this structural information in control theory. All the methods outlined here are based on the computation of the null-spaces of suitable block...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2009
ISSN: 0096-3003
DOI: 10.1016/j.amc.2008.10.037