The singular-value decomposition of an infinite Hankel matrix
Reads0
Chats0
TLDR
In this paper, a new algorithm for the numerical calculation of the singular values and vectors of an infinite Hankel matrix of known finite rank r is presented, which proceeds by reduction to the singular value problem for an r × r matrix, achieved without solving for the poles of the symbol of H.About:
This article is published in Linear Algebra and its Applications.The article was published on 1983-04-01 and is currently open access. It has received 38 citations till now. The article focuses on the topics: Hankel matrix & Singular solution.read more
Citations
More filters
Journal ArticleDOI
On the finite rank and finite-dimensional representation of bounded semi-infinite Hankel operators
Moody T. Chu,Matthew M. Lin +1 more
TL;DR: In this article, the authors review some elegant, classical criteria and establish connections among various characterizations of finite rank in terms of rational functions, recursion, matrix factorizations and sinusoidal signals.
Robust Multivariable Feedback Design for Uncertain Linear Systems
TL;DR: This work establishes that, for a given class of uncertainty and a specific class of gain- limited controllers, feedback compensation can be optimally deployed to reduce perturbed interaction.
Journal ArticleDOI
Tracking poles and representing Hankel operators directly from data
TL;DR: In this article, the poles near the unit circle T of a function G whose values are given at a grid of points on T were estimated and a convergence theorem was proved for this method.
Journal ArticleDOI
A computational algorithm for the super-optimal solution of the model matching problem
Fang-Bo Yeh,Thong-Shing Hwang +1 more
TL;DR: A computational algorithm is developed to implement the strengthened minimization technique in the model matching problem which arises in robust controller design and weighted sensitivity minimization and the extremal functions for the H ∞ -optimization problem are diagonalized using the constructed unitary matrices.
Posted Content
Exterior products of operators and superoptimal analytic approximation
TL;DR: In this paper, a new algorithm for the construction of the unique superoptimal analytic approximant of a given continuous matrix-valued function on the unit circle, making use of exterior powers of operators in preference to spectral or Wiener-Masani factorizations, is presented.
References
More filters
Journal ArticleDOI
Generalized interpolation in
Journal ArticleDOI
Fast solution of toeplitz systems of equations and computation of Padé approximants
TL;DR: It is proved that entries in the Pade table can be computed by the Extended Euclidean Algorithm, and an algorithm EMGCD (Extended Middle Greatest Common Divisor) is described which is faster than the algorithm HGCD of Aho, Hopcroft and Ullman, although both require time O(n log2 n).
Related Papers (5)
Analytic properties of schmidt pairs for a hankel operator and the generalized schur-takagi problem
V M Adamjan,D. Z. Arov,M G Kreĭn +2 more