On the finite rank and finite-dimensional representation of bounded semi-infinite Hankel operators

Moody T. Chu, Matthew M. Lin

Research output: Contribution to journalReview articlepeer-review

1 Citation (Scopus)

Abstract

Bounded, semi-infinite Hankel matrices of finite rank over the space ℓ2 of square-summable sequences occur frequently in classical analysis and engineering applications. The notion of finite rank often appears under different contexts and the literature is diverse. The first part of this paper reviews some elegant, classical criteria and establishes connections among the various characterizations of finite rank in terms of rational functions, recursion, matrix factorizations and sinusoidal signals. All criteria require 2d parameters, though with different meanings, for a matrix of rank d. The Vandermonde factorization, in particular, permits immediately a singular-value preserving, finite-dimensional representation of the original semi-infinite Hankel matrix and, hence, makes it possible to retrieve the nonzero singular values of the semi-infinite Hankel matrix. The second part of this paper proposes using the LDL∗ decomposition of a specially constructed sample matrix to find the unitarily equivalent finite-dimensional representation. This approach enjoys several advantages, including the ease of computation by avoiding infinite-dimensional vectors, the ability to reveal rank deficiency and the established pivoting strategy for stability. No error analysis is given, but several computational issues are discussed.

Original languageEnglish
Pages (from-to)1256-1276
Number of pages21
JournalIMA Journal of Numerical Analysis
Volume35
Issue number3
DOIs
Publication statusPublished - 2015 Jul

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On the finite rank and finite-dimensional representation of bounded semi-infinite Hankel operators'. Together they form a unique fingerprint.

Cite this