On a numerically stable algorithm for the analysis of Generalized Volterra lattice

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Volterra or Langmuir lattice is the dynamical model where the interaction of particle with the nearest neighbors is taken into account. It is known since J. Moser that the analysis of the Volterra lattice is related with isospectral deformation of a tridiagonal Jacobi operator. The main numerical problem in this setting is the inverse spectral problem for this Jacobi operator. Generalized Volterra lattice is a dynamical model where the interaction of particle with some fixed number of neighbors is taken into account. This model is a particular case of the discrete KP equation. The analysis of discrete KP equation is related with a class of Hessenberg operators. In this chapter we propose and study a stable algorithm for the numerical solution of the inverse spectral problem for the band Hessenberg operator with application to the analysis of generalized Volterra lattice. © Springer Science+Business Media New York 2013.

Cite

CITATION STYLE

APA

Kalyagin, V., & Sokolov, M. (2013). On a numerically stable algorithm for the analysis of Generalized Volterra lattice. In Springer Proceedings in Mathematics and Statistics (Vol. 32, pp. 107–116). Springer New York LLC. https://doi.org/10.1007/978-1-4614-5574-5_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free