scispace - formally typeset
Open AccessJournal ArticleDOI

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

Stable generalised predictive control: an algorithm with guaranteed stability

TL;DR: In this article, the authors propose a new algorithm which deploys most of the ideas of generalized predictive control (GPC) but yields control configurations with guaranteed stability and provides a systematic means of optimising robust stability margins.
Journal ArticleDOI

Approximation of delay systems—a case study

TL;DR: In this article, a numerically well-behaved method for computing Hankel optima (CF) rational approximations for delay systems is presented based on certain properties of Hankel matrices and the theory of Laguerre polynomials.
Journal ArticleDOI

On identification of stable systems and optimal approximation

P. M. Mäkilä
- 01 Jul 1991 - 
TL;DR: Approximative modelling of stable continuous-time, possibly infinite dimensional, systems is studied based on an optimal approximation approach and Laguerre-Fourier series methods and Hankel operator techniques can be utilized to develop fully practical identification methods.
Journal ArticleDOI

A polynomial approach to Hankel norm and balanced approximations

TL;DR: In this article, a unified approach to Hankel norm and balanced approximations is presented which is based on a combination of polynomial algebra and the geometry of invariant subspaces.
Journal ArticleDOI

Numerical algorithms for the Nevanlinna-Pick problem

TL;DR: In this paper, efficient algorithms for two variants of the Nevanlinna-Pick problem are devised based on the formulation in [14] and their implementation is validated by several examples, based on establishing the equivalence of two different operator-theoretic approaches to the solution of classical interpolation problems.
References
More filters
Book ChapterDOI

Moment Methods and Lanczos Methods

TL;DR: In contrast to many of the speakers at this conference, the authors is less interested in the average properties of nuclei than in detailed spectroscopy, however, the two are very closely connected and that shell-model calculations may be used to give a great deal of information not normally associated with the shell model.
Related Papers (5)