Expansions for Eigenfunction and Eigenvalues of large-n Toeplitz Matrices

Physics – Mathematical Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This note starts from work done by Dai, Geary, and Kadanoff (Hui Dai, Zachary Geary, and Leo P. Kadanoff, H. Dai, Z. Geary and L. P. Kadanoff, Journal of Statistical Mechanics, P05012 (2009)) on exact eigenfunctions for Toeplitz operators. It builds methods for finding convergent expansions for eigenvectors and eigenvalues of large-n Toeplitz matrices, using the infinite-n case as a starting point. One expansion is derived from operator equations having a two-dimensional continuous spectrum of eigenvalues, which include the eigenvalues of the finite-$n$ matrices. Another expansion is derived from the transpose equations, which have no eigenvalues at all. The two expansions work together to give an apparently convergent expansion with an expansion parameter expressed as an inverse power of n. A variational principle is developed which gives an approximate expression for determining eigenvalues. A consistency condition is generated, which gives to lowest order exactly the same condition for the eigenvalue.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Expansions for Eigenfunction and Eigenvalues of large-n Toeplitz Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Expansions for Eigenfunction and Eigenvalues of large-n Toeplitz Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expansions for Eigenfunction and Eigenvalues of large-n Toeplitz Matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-194439

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.