On a shifted LR transformation derived from the discrete hungry Toda equation

Abstract

The discrete hungry Toda (dhToda) equation is known as an integrable system which is derived from the study of the numbered box and ball system. In the authors’ paper (Fukuda et al., in Phys Lett A 375, 303–308, 2010), we associate the dhToda equation with a sequence of LR transformations for a totally nonnegative (TN) matrix, and then, in another paper (Fukuda et al. in Annal Math Pura Appl, 2011), based on the dhToda equation, we design an algorithm for computing the eigenvalues of the TN matrix. In this paper, in order to accelerate the convergence speed, we first introduce the shift of origin into the LR transformations associated with the dhToda equation, then derive a recursion formula for generating the shifted LR transformations.We next present a shift strategy for avoiding the breakdown of the shifted LR transformations. We finally clarify the asymptotic convergence and show that the sequence of TN matrices generated by the shifted LR transformations converges to a lower triangular matrix, exposing the eigenvalues of the original TN matrix. The asymptotic convergence is also verified through some numerical examples.