Results 121 to 130 of about 3,062 (211)

A Lanczos Bidiagonalization Algorithm for Hankel Matrices ∗

open access: yes, 2008
This paper presents an O(mn log m) algorithm for bidiagonalizing a Hankel matrix. An m×n Hankel matrix is reduced to a real bidiagonal matrix in O((m+n)n log(m+n)) floating-point operations (flops) using the Lanczos method with modified partial ...
Browne, Kevin   +5 more
core   +1 more source

TOEPLITZ/HANKEL MATRIX ALGEBRA IN MODEL PREDICTIVE CONTROL

open access: yesPerner’s Contacts, 2008
Model-based Predictive Control (MPC) algorithms popularity grows steadily in industry and academic area as well. Control actions are computed as an optimization problem.
Daniel Honc, Libor Havlíček
doaj  

The singular-value decomposition of an infinite Hankel matrix

open access: yesLinear Algebra and its Applications, 1983
AbstractLet H be an infinite Hankel matrix of known finite rank r. A new algorithm for the numerical calculation of the singular values and vectors of H is presented. The method proceeds by reduction to the singular value problem for an r×r matrix; this is achieved without solving for the poles of the symbol of H. The resulting algorithm is of order r3.
openaire   +1 more source

Hankel norm of polytopic systems with time-varying delay

open access: yes, 2008
This paper addresses the Hankel norm of polytopic systems with time-varying delay. Delay-dependent sufficient conditions are presented such that the polytopic system is stable and the Hankel norm of the polytopic system is less than a prescribed scalar ...
Wang QY(王清阳), Qing Wang
core  

Fast Algorithms for Solving H-infinity-Norm Minimization Problems

open access: yes, 2001
In this paper we propose an efficient computation approach to minimize the H-infinity-norm of a transfer-function matrix depending affinely on a set of free parameters.
Varga, Andras, Parrilo, Pablo
core  

Hankel tensors : associated Hankel matrices and Vandermonde decomposition

open access: yes, 2014
Hankel tensors arise from applications such as signal processing. In this paper, we make an initial study on Hankel tensors. For each Hankel tensor, we associate a Hankel matrix and a higher order two-dimensional symmetric tensor, which we call the ...
Qi, L, Liqun Qi
core  

On the computation of the structured total least squares estimator

open access: yes, 2004
A class of structured total least squares problems is considered, in which the extended data matrix is partitioned into blocks and each of the blocks is (block) Toeplitz/Hankel structured, unstructured, or noise free.
Van Huffel, S.   +2 more
core  

Home - About - Disclaimer - Privacy