Results 1 to 10 of about 26,670 (208)
Space-time POD and the Hankel matrix. [PDF]
PLoS One, 2023 Time-delay embedding is an increasingly popular starting point for data-driven reduced-order modeling efforts. In particular, the singular value decomposition (SVD) of a block Hankel matrix formed from successive delay embeddings of the state of a dynamical system lies at the heart of several popular reduced-order modeling methods.
Frame P, Towne A.
europepmc +6 more sources
A block Hankel generalized confluent Vandermonde matrix [PDF]
Linear Algebra and its Applications, 2012 Vandermonde matrices are well known. They have a number of interesting properties and play a role in (Lagrange) interpolation problems, partial fraction expansions, and finding solutions to linear ordinary differential equations, to mention just a few ...
Klein, Andre, Spreij, Peter
core +6 more sources
A study on the empirical distribution of the scaled Hankel matrix eigenvalues [PDF]
Journal of Advanced Research, 2015 The empirical distribution of the eigenvalues of the matrix XXT divided by its trace is evaluated, where X is a random Hankel matrix. The distribution of eigenvalues for symmetric and nonsymmetric distributions is assessed with various criteria.
Hossein Hassani +2 more
doaj +5 more sources
Noise Suppression for GPR Data Based on SVD of Window-Length-Optimized Hankel Matrix [PDF]
Sensors, 2019 Ground-penetrating radar (GPR) is an effective tool for subsurface detection. Due to the influence of the environment and equipment, the echoes of GPR contain significant noise.
Wei Xue, Yan Luo, Yue Yang, Yujin Huang
doaj +2 more sources
Companion matrices and their relations to Toeplitz and Hankel matrices
Special Matrices, 2015 In this paper we describe some properties of companion matrices and demonstrate some special patterns that arisewhen a Toeplitz or a Hankel matrix is multiplied by a related companion matrix.We present a necessary and sufficient condition, generalizing ...
Luo Yousong, Hill Robin
doaj +4 more sources
Exponential Signal Reconstruction With Deep Hankel Matrix Factorization [PDF]
IEEE Transactions on Neural Networks and Learning Systems, 2021 Exponential is a basic signal form, and how to fast acquire this signal is one of the fundamental problems and frontiers in signal processing. To achieve this goal, partial data may be acquired but result in the severe artifacts in its spectrum, which is the Fourier transform of exponentials. Thus, reliable spectrum reconstruction is highly expected in
Yihui Huang +5 more
openalex +5 more sources
A fast method to diagonalize a Hankel matrix
Linear Algebra and its Applications, 1998 AbstractWe consider a Vandermonde factorization of a Hankel matrix, and propose a new approach to compute the full decomposition in O(n2) operations. The method is based on the use of a variant of the Lanczos method to compute a tridiagonal matrix whose eigenvalues are the modes generating the entries in the Hankel matrix.
Daniel Boley +2 more
openalex +3 more sources
Asymmetric Truncated Hankel Operators: Rank One, Matrix Representation [PDF]
Journal of Function Spaces, 2021 Asymmetric truncated Hankel operators are the natural generalization of truncated Hankel operators. In this paper, we determine all rank one operators of this class.
Firdaws Rahmani, Yufeng Lu, Ran Li
doaj +2 more sources
Hankel matrix transforms and operators [PDF]
Journal of Inequalities and Applications, 2012 Hankel operators and Hankel transforms are required in a number of applications. This article proves a number of theorems that efficiently and accurately approximates a function using Hankel transforms and Hankel sum. A characterization of the Hankel matrix sequences and Hankel matrix of semi-periodic and almost periodic sequences are also given.
Suliman Al‐Homidan
openalex +4 more sources
Lower Bounds for Arithmetic Circuits via the Hankel Matrix [PDF]
computational complexity, 2020 We study the complexity of representing polynomials by arithmetic circuits in both the commutative and the non-commutative settings. Our approach goes through a precise understanding of the more restricted setting where multiplication is not associative, meaning that we distinguish (xy)z from x(yz).
Nathanaël Fijalkow +3 more
openalex +8 more sources