Results 11 to 20 of about 26,670 (208)
Testing the Rank of the Hankel Matrix: A Statistical Approach [PDF]
SSRN Electronic Journal, 2001 The rank of the Hankel matrix, corresponding to a system transfer function, is equal to the order of its minimal state space realization. The computation of the rank of the Hankel matrix is complicated by the fact that its block elements are rarely given exactly but are estimated instead. In this paper, we propose new statistical tests to determine the
Gonzalo Camba-Méndez, George Kapetanios
openalex +4 more sources
On determinants identity minus Hankel matrix [PDF]
Bulletin of the London Mathematical Society, 2019 In this note, we study the asymptotics of the determinant $\det(I_N - H_N)$ for $N$ large, where $H_N$ is the $N\times N$ restriction of a Hankel matrix $H$ with finitely many jump discontinuities in its symbol satisfying $\|H\|\leq 1$. Moreover, we assume $ \in\mathbb C$ with $| |<1$ and $I_N$ denotes the identity matrix. We determine the first
Emilio Fedele, Martin Gebert
openalex +4 more sources
Fredholm Property of Matrix Wiener-Hopf plus and minus Hankel Operators with Semi-Almost Periodic Symbols [PDF]
Cubo, 2010 We will present sufficient conditions for the Fredholm property of Wiener-Hopf plus and minus Hankel operators with different Fourier matrix symbols in the C*-algebra of semialmost periodic elements.
L. P Castro, A. S. Silva
doaj +2 more sources
Hankel Matrix Rank as Indicator of Ghost in Bearing-only Tracking. [PDF]
IEEE Trans Aerosp Electron Syst, 2018 Usually, bearing angle measurements are employed in triangulation methods to display the position of targets. However, in multi-radar and multi-target scenarios, triangulation approaches bring out ghosts that operate like real targets. This article proposes a target/ghost classifier that relies on the fact that the trajectory of a ghost is actually a ...
Bekiroglu K +3 more
europepmc +4 more sources
A Hankel matrix acting on Hardy and Bergman spaces [PDF]
Studia Mathematica, 2010 Let μ be a finite positive Borel measure on [0, 1). Let Hμ = (μn,k)n,k≥0 be the Hankel matrix with entries μn,k = ∫ [0,1) t dμ(t) . The matrix Hμ induces formally an operator on the space of all analytic functions in the unit disc in the following sense Hμ(f)(z) = ∞ ∑
Πέτρος Γαλανόπουλος +1 more
openalex +3 more sources
Bearing Fault Diagnosis Method Based on Improved Singular Value Decomposition Package [PDF]
Sensors, 2023 The singular value decomposition package (SVDP) is often used for signal decomposition and feature extraction. At present, the general SVDP has insufficient feature extraction ability due to the two-row structure of the Hankel matrix, which leads to mode
Huibin Zhu +4 more
doaj +2 more sources
A note on the maximization of matrix valued Hankel determinants with applications [PDF]
Journal of Computational and Applied Mathematics, 2004 In this note we consider the problem of maximizing the determinant of moment matrices of matrix measures. The maximizing matrix measure can be characterized explicitly by having equal (matrix valued) weights at the zeros of classical (one dimensional) orthogonal polynomials.
Holger Dette, W. J. Studden
openalex +5 more sources
Multichannel Hankel Matrix Completion Through Nonconvex Optimization
IEEE Journal of Selected Topics in Signal Processing, 2018 This paper studies the multichannel missing data recovery problem when the measurements are generated by a dynamical system. A new model, termed multichannel low-rank Hankel matrices, is proposed to characterize the intrinsic low-dimensional structures in multichannel time series.
Shuai Zhang +3 more
openalex +3 more sources
On the Nuclear Norm heuristic for a Hankel matrix Recovery Problem
, 2012 This note addresses the question if and why the nuclear norm heuristic can recover an impulse response generated by a stable single-real-pole system, if elements of the upper-triangle of the associated Hankel matrix were given. Since the setting is deterministic, theories based on stochastic assumptions for low-rank matrix recovery do not apply here. A
Liang Dai, Kristiaan Pelckmans
openalex +4 more sources
The singular-value decomposition of an infinite Hankel matrix
Linear 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.
N. J. Young
openalex +3 more sources