Integrable algorithm

This article relies excessively on references to primary sources. Please improve this article by adding secondary or tertiary sources. Find sources: "Integrable algorithm" – news · newspapers · books · scholar · JSTOR (April 2020) (Learn how and when to remove this message)

Integrable algorithms are numerical algorithms that rely on basic ideas from the mathematical theory of integrable systems.^[1]

The theory of integrable systems has advanced with the connection between numerical analysis. For example, the discovery of solitons came from the numerical experiments to the KdV equation by Norman Zabusky and Martin David Kruskal.^[2] Today, various relations between numerical analysis and integrable systems have been found (Toda lattice and numerical linear algebra,^[3][4] discrete soliton equations and series acceleration^[5][6]), and studies to apply integrable systems to numerical computation are rapidly advancing.^[7][8]

Generally, it is hard to accurately compute the solutions of nonlinear differential equations due to its non-linearity. In order to overcome this difficulty, R. Hirota has made discrete versions of integrable systems with the viewpoint of "Preserve mathematical structures of integrable systems in the discrete versions".^{[9][10][11][12][13]}

At the same time, Mark J. Ablowitz and others have not only made discrete soliton equations with discrete Lax pair but also compared numerical results between integrable difference schemes and ordinary methods.^{[14][15][16][17][18]} As a result of their experiments, they have found that the accuracy can be improved with integrable difference schemes at some cases.^{[19][20][21][22]}

• Soliton
• Integrable system