Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4641898 | Journal of Computational and Applied Mathematics | 2008 | 12 Pages |
Abstract
We propose a fast algorithm for computing the numeric ranks of Sylvester matrices. Let S denote the Sylvester matrix and H denote the Hankel-like-Sylvester matrix. The algorithm is based on a fast Cholesky factorization of STSSTS or HTHHTH and relies on a stabilized version of the generalized Schur algorithm for matrices with displacement structure. All computations can be done in O(r(n+m))O(r(n+m)), where n+mn+m and r denote the size and the numerical rank of the Sylvester matrix, respectively.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Bingyu Li, Zhuojun Liu, Lihong Zhi,