Papers
Topics
Authors
Recent
Search
2000 character limit reached

Spectral computations for birth and death chains

Published 2 May 2013 in math.PR | (1305.0353v1)

Abstract: We consider the spectrum of birth and death chains on a $n$-path. An iterative scheme is proposed to compute any eigenvalue with exponential convergence rate independent of $n$. This allows one to determine the whole spectrum in order $n2$ elementary operations. Using the same idea, we also provide a lower bound on the spectral gap, which is of the correct order on some classes of examples.

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.