The authors consider the problem of finding necessary and sufficient conditions for the existence of a Q with no more than k poles in the closed left-half plane such that the norm of a certain matrix ≤ 1. If solutions exist, a formula for all solutions is given. Special attention is given to the characterization of all optimal solutions. As an application, the frequency weighted optimal Hankel norm model reduction problem is recast as a problem of characterizing every Q which satisfies a certain condition. After reformulation, the model reduction problem is easily solved using the techniques presented in this work.link_to_subscribed_fulltex
International audienceStructured low-rank approximation is the problem of minimizing a weighted Frob...
Algorithms are presented for least-squares approximation of Toeplitz and Hankel matrices from noise ...
The sub-optimal Hankel norm approximation problems have been studied extensively in the literature a...
A constrained Hankel-norm approximation problem is considered. The reduced-order model is required t...
Model reduction is an important engineering problem, in which one aims to replace an elaborate model...
[[abstract]]The best approximation in the optimal solution set of the Hankel-norm model reduction pr...
An elementary proof is presented for sufficient conditions for the existence of a solution to the su...
Hankel matrices are closely related to linear time-invariant (LTI) models, which are widely used in ...
The operation ‘multiplication of a vector by a matrix ’ can be represented by a computational scheme...
Abstract — In this paper, a frequency-weighted extension of a recently proposed model reduction meth...
We obtain a simple solution for the sub-optimal Hankel norm approximation problem for the Wiener cla...
AbstractThe operation of multiplication of a vector by a matrix can be represented by a computationa...
We obtain a simple solution for the sub-optimal Hankel norm approximation problem for the Wiener cla...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
The sub-optimal Hankel norm approximation problem is solved for a well-posed linear system with gene...
International audienceStructured low-rank approximation is the problem of minimizing a weighted Frob...
Algorithms are presented for least-squares approximation of Toeplitz and Hankel matrices from noise ...
The sub-optimal Hankel norm approximation problems have been studied extensively in the literature a...
A constrained Hankel-norm approximation problem is considered. The reduced-order model is required t...
Model reduction is an important engineering problem, in which one aims to replace an elaborate model...
[[abstract]]The best approximation in the optimal solution set of the Hankel-norm model reduction pr...
An elementary proof is presented for sufficient conditions for the existence of a solution to the su...
Hankel matrices are closely related to linear time-invariant (LTI) models, which are widely used in ...
The operation ‘multiplication of a vector by a matrix ’ can be represented by a computational scheme...
Abstract — In this paper, a frequency-weighted extension of a recently proposed model reduction meth...
We obtain a simple solution for the sub-optimal Hankel norm approximation problem for the Wiener cla...
AbstractThe operation of multiplication of a vector by a matrix can be represented by a computationa...
We obtain a simple solution for the sub-optimal Hankel norm approximation problem for the Wiener cla...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
The sub-optimal Hankel norm approximation problem is solved for a well-posed linear system with gene...
International audienceStructured low-rank approximation is the problem of minimizing a weighted Frob...
Algorithms are presented for least-squares approximation of Toeplitz and Hankel matrices from noise ...
The sub-optimal Hankel norm approximation problems have been studied extensively in the literature a...