A new method to generate non-autonomous discrete integrable systems via convergence acceleration algorithms

2015 ◽  
Vol 27 (2) ◽  
pp. 194-212 ◽  
Author(s):  
YI HE ◽  
XING-BIAO HU ◽  
HON-WAH TAM ◽  
YING-NAN ZHANG

In this paper, we propose a new algebraic method to construct non-autonomous discrete integrable systems. The method starts from constructing generalizations of convergence acceleration algorithms related to discrete integrable systems. Then the non-autonomous version of the corresponding integrable systems are derived. The molecule solutions of the systems are also obtained. As an example of the application of the method, we propose a generalization of the multistep ϵ-algorithm, and then derive a non-autonomous discrete extended Lotka–Volterra equation. Since the convergence acceleration algorithm from the lattice Boussinesq equation is just a particular case of the multistep ϵ-algorithm, we have therefore arrived at a generalization of this algorithm. Finally, numerical experiments on the new algorithm are presented.

2011 ◽  
Vol 33 (3) ◽  
pp. 1234-1245 ◽  
Author(s):  
Yi He ◽  
Xing-Biao Hu ◽  
Jian-Qing Sun ◽  
Ernst Joachim Weniger

Author(s):  
Allan P. Fordy ◽  
Pavlos Xenitidis

We recently introduced a class of Z N graded discrete Lax pairs and studied the associated discrete integrable systems (lattice equations). In this paper, we introduce the corresponding Yang–Baxter maps. Many well-known examples belong to this scheme for N =2, so, for N ≥3, our systems may be regarded as generalizations of these. In particular, for each N we introduce a class of multi-component Yang–Baxter maps, which include H B III (of Papageorgiou et al. 2010 SIGMA 6, 003 (9 p). (doi:10.3842/SIGMA.2010.033)), when N =2, and that associated with the discrete modified Boussinesq equation, for N =3. For N ≥5 we introduce a new family of Yang–Baxter maps, which have no lower dimensional analogue. We also present new multi-component versions of the Yang–Baxter maps F IV and F V (given in the classification of Adler et al. 2004 Commun. Anal. Geom. 12, 967–1007. (doi:10.4310/CAG.2004.v12.n5.a1)).


2021 ◽  
Vol 24 (1) ◽  
Author(s):  
Matteo Petrera ◽  
Yuri B. Suris ◽  
Kangning Wei ◽  
René Zander

AbstractWe contribute to the algebraic-geometric study of discrete integrable systems generated by planar birational maps: (a) we find geometric description of Manin involutions for elliptic pencils consisting of curves of higher degree, birationally equivalent to cubic pencils (Halphen pencils of index 1), and (b) we characterize special geometry of base points ensuring that certain compositions of Manin involutions are integrable maps of low degree (quadratic Cremona maps). In particular, we identify some integrable Kahan discretizations as compositions of Manin involutions for elliptic pencils of higher degree.


Nonlinearity ◽  
2016 ◽  
Vol 29 (5) ◽  
pp. 1487-1506 ◽  
Author(s):  
Alexander I Aptekarev ◽  
Maxim Derevyagin ◽  
Walter Van Assche

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Arnak Poghosyan

We consider the convergence acceleration of the Krylov-Lanczos interpolation by rational correction functions and investigate convergence of the resultant parametric rational-trigonometric-polynomial interpolation. Exact constants of asymptotic errors are obtained in the regions away from discontinuities, and fast convergence of the rational-trigonometric-polynomial interpolation compared to the Krylov-Lanczos interpolation is observed. Results of numerical experiments confirm theoretical estimates and show how the parameters of the interpolations can be determined in practice.


2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Qinghua Wu ◽  
Meiying Xiang

A simpler GMRES method for computing oscillatory integral is presented. Theoretical analysis shows that this method is mathematically equivalent to the GMRES method proposed by Olver (2009). Moreover, the simpler GMRES does not require upper Hessenberg matrix factorization, which leads to much simpler program and requires less work. Numerical experiments are conducted to illustrate the performance of the new method and show that in some cases the simpler GMRES method could achieve higher accuracy than GMRES.


Nonlinearity ◽  
2015 ◽  
Vol 28 (7) ◽  
pp. 2279-2306 ◽  
Author(s):  
Xiao-Min Chen ◽  
Xiang-Ke Chang ◽  
Jian-Qing Sun ◽  
Xing-Biao Hu ◽  
Yeong-Nan Yeh

Author(s):  
Zhi Xin Shi ◽  
Yu Feng Luo ◽  
Lu Bing Hang ◽  
Ting Li Yang

Because the solution to inverse kinematics problem of the general 5R serial robot is unique and its assembly condition has been derived, a simple effective method for inverse kinematics problem of general 6R serial robot or forward kinematics problem of general 7R single-loop mechanism is presented based on one-dimension searching algorithm. The new method has the following features: (1) Using one-dimension searching algorithm, all the real inverse kinematic solutions are obtained and it has higher computing efficiency; (2) Compared with algebraic method, it has evidently reduced the difficulty of deducing formulas. The principle of the new method can be generalized to kinematic analysis of parallel mechanisms.


Sign in / Sign up

Export Citation Format

Share Document