In this paper, we present an explicit and computable lower bound for the first eigenvalue of birth-death processes with killing. This estimate is qualitatively sharp for birth-death processes without killing. We also ...In this paper, we present an explicit and computable lower bound for the first eigenvalue of birth-death processes with killing. This estimate is qualitatively sharp for birth-death processes without killing. We also establish an approximation procedure for the first eigenvalue of the birth-death process with killing by an increasing principal eigenvalue sequence of some birth-death processes without killing. Some applications of our results are illustrated by many examples.展开更多
文摘In this paper, we present an explicit and computable lower bound for the first eigenvalue of birth-death processes with killing. This estimate is qualitatively sharp for birth-death processes without killing. We also establish an approximation procedure for the first eigenvalue of the birth-death process with killing by an increasing principal eigenvalue sequence of some birth-death processes without killing. Some applications of our results are illustrated by many examples.
