pith. sign in

arxiv: 1012.5744 · v1 · pith:F26FAO4Hnew · submitted 2010-12-28 · 🧮 math.NA · cs.NA

Multistep epsilon-algorithm, Shanks' transformation, and Lotka-Volterra system by Hirota's method

classification 🧮 math.NA cs.NA
keywords multistepepsilon-algorithmtransformationshanksdefinedextensionhirotalotka-volterra
0
0 comments X
read the original abstract

In this paper, we give a multistep extension of the epsilon-algorithm of Wynn, and we show that it implements a multistep extension of the Shanks' sequence transformation which is defined by ratios of determinants. Reciprocally, the quantities defined in this transformation can be recursively computed by the multistep epsilon-algorithm. The multistep epsilon-algorithm and the multistep Shanks' transformation are related to an extended discrete Lotka-Volterra system. These results are obtained by using the Hirota's bilinear method, a procedure quite useful in the solution of nonlinear partial differential and difference equations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.