2013
DOI: 10.48550/arxiv.1310.1666
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The discrete mKdV equation revisited: a Riemann-Hilbert approach

Junyi Zhu,
Xianguo Geng,
Yonghui Kuang

Abstract: We study the plus and minus type discrete mKdV equation. Some different symmetry conditions associated with two Lax pairs are introduced to derive the matrix Riemann-Hilbert problem with zero. By virtue of regularization of the Riemann-Hilbert problem, we obtain the complex and real solution to the plus type discrete mKdV equation respectively. Under the gauge transformation between the plus and minus type, the solutions of minus type can be obtained in terms of the given plus ones.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…Recently, soliton solutions and Jordan-block solutions for the equation (1.2) [21] was derived through the generalized Cauchy matrix approach [22]. For the sd-mKdV equation (1.3), many approaches, such as inverse scattering transform [23,24], Darboux transformation [25,26], bilinear approach [27], discrete Jacobi sub-equation method [28], algebro-geometric approach [29], Riemann-Hilbert approach [30] and Deift-Zhou nonlinear steepest descent method [31], have been developed to construct its exact solutions.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, soliton solutions and Jordan-block solutions for the equation (1.2) [21] was derived through the generalized Cauchy matrix approach [22]. For the sd-mKdV equation (1.3), many approaches, such as inverse scattering transform [23,24], Darboux transformation [25,26], bilinear approach [27], discrete Jacobi sub-equation method [28], algebro-geometric approach [29], Riemann-Hilbert approach [30] and Deift-Zhou nonlinear steepest descent method [31], have been developed to construct its exact solutions.…”
Section: Introductionmentioning
confidence: 99%