Abstract

Let us define $A=C_{r}(a_{0},a_{1},\ldots,a_{n-1})$ to be a $n \times n$ r-circulant matrix. The entries in the first row of $A=C_{r}(a_{0},a_{1},\ldots,a_{n-1})$ are $a_{i}=P_{i}$ , $a_{i}=Q_{i}$ , $a_{i}=P_{i}^{2}$ or $a_{i}=Q_{i}^{2}$ ( $i=0, 1, 2, \ldots, n-1$ ), where $P_{i}$ and $Q_{i}$ are the ith Pell and Pell-Lucas numbers, respectively. We find some bounds estimation of the spectral norm for r-Circulant matrices with Pell and Pell-Lucas numbers.

Highlights

  • Special matrices is a widely studied subject in matrix analysis

  • Lots of article have been written so far, which concern estimates for spectral norms of circulant and r-circulant matrices, which have connections with signal and image processing, time series analysis and many other problems

  • We thicken the identities of estimations for spectral norms of r-circulant matrices with the Pell and Pell-Lucas numbers

Read more

Summary

Introduction

Special matrices is a widely studied subject in matrix analysis. Special matrices whose entries are well-known number sequences have become a very interesting research subject in recent years and many authors have obtained some good results in this area. We derive expressions of spectral norms for r-circulant matrices. We thicken the identities of estimations for spectral norms of r-circulant matrices with the Pell and Pell-Lucas numbers. If we start from n = , the Pell and Pell-Lucas sequence are given by n:. The following sum formulas for the Pell and Pell-Lucas numbers are well known [ , ]: n. Let r = , the matrix C is called a circulant matrix [ ]

The Euclidean norm of the matrix A is defined as
We have
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.