Approximating the Perfect Sampling Grids for Computing the Eigenvalues of Toeplitz-like Matrices Using the Spectral Symbol

Abstract

In a series of papers the author and others have studied an asymptotic expansion of the errors of the eigenvalue approximation, using the spectral symbol, in connection with Toeplitz (and Toeplitz-like) matrices, that is, Ej,n in λj(An)=f(θj,n)+Ej,n, An=Tn(f), f real-valued cosine polynomial. In this paper we instead study an asymptotic expansion of the errors of the equispaced sampling grids θj,n, compared to the exact grids j,n (where λj(An)=f(j,n)), that is, Ej,n in j,n=θj,n+Ej,n. We present an algorithm to approximate the expansion. Finally we show numerically that this type of expansion works for various kind of Toeplitz-like matrices (Toeplitz, preconditioned Toeplitz, low-rank corrections of them). We critically discuss several specific examples and we demonstrate the superior numerical behavior of the present approach with respect to the previous ones.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…