ABSTRACT
Let us define A=Hr=(aij) to be n×n r-Hankel
matrix. The entries of matrix A are Fn=Fi+j-2 or Ln=Fi+j-2 where Fn and Ln denote the usual Fibonacci and Lucas numbers,
respectively. Then, we
obtained upper and lower bounds for the spectral norm of matrix A. We compared our bounds with exact
value of matrix A’s spectral norm.
These kinds of matrices have connections with
signal and image processing, time series analysis and many other problems.