2000 character limit reached
Spectral computations for birth and death chains (1305.0353v1)
Published 2 May 2013 in math.PR
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.