Abstract
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. This article also introduces the concepts of almost periodic Hankel matrix, multiplicative Hankel matrix and normal almost periodic Hankel matrix. Applications to trigonometric sequences are given.
Highlights
A Hankel matrix is a square matrix, that is constant on each diagonal orthogonal to the main diagonal
Interesting properties of the Hilbert matrix are discussed by Choi [3]
Hankel operators can be defined in several different ways and they admit different understanding
Summary
A Hankel matrix is a square matrix (finite or infinite), that is constant on each diagonal orthogonal to the main diagonal. Hankel operators can be defined in several different ways and they admit different understanding Such variety is important in applications, since in each case we can choose an understanding that is most suitable for the problem considered. For Hankel operators and their applications to approximation theory, prediction theory, and linear system theory, we refer to [4]. Beylkin and Monzón [10] have introduced approximation of a function by exponential sum using results of the Hankel matrix.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.