Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the eigenvalues of Toeplitz matrices with two off-diagonals

Published 24 May 2023 in math.NA and cs.NA | (2305.15107v1)

Abstract: Consider the Toeplitz matrix $T_n(f)$ generated by the symbol $f(\theta)=\hat{f}r e{\mathbf{i}r\theta}+\hat{f}_0+\hat{f}{-s} e{-\mathbf{i}s\theta}$, where $\hat{f}r, \hat{f}_0, \hat{f}{-s} \in \mathbb{C}$ and $0<r<n,~0<s<n$. For $r=s=1$ we have the classical tridiagonal Toeplitz matrices, for which the eigenvalues and eigenvectors are known. Similarly, the eigendecompositions are known for $1<r=s$, when the generated matrices are symmetrically sparse tridiagonal''. In the current paper we study the eigenvalues of $T_n(f)$ for $1\leq r<s$, which arenon-symmetrically sparse tridiagonal''. We propose an algorithm which constructs one or two ad hoc matrices smaller than $T_n(f)$, whose eigenvalues are sufficient for determining the full spectrum of $T_n(f)$. The algorithm is explained through use of a conjecture for which examples and numerical experiments are reported for supporting it and for clarifying the presentation. Open problems are briefly discussed.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.