Related papers: Integrable discretizations and self-adaptive movin…
We consider three novel PDEs associated with the integrable generalizations of the short pulse equation classified recently by Hone {\it et al} (2018 {\it Lett. Math. Phys.} {\bf 108} 927-947). In particular, we obtain a variety of exact…
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MUltiply SEgmented Constraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of…
In the present paper, we are concerned with the general localized solutions for the complex short pulse equation including soliton, breather and rogue wave solutions. With the aid of a generalized Darboux transformation, we construct the…
We employ the $\bar{\partial}$-steepest descent method in order to investigate the Cauchy problem of the complex short pulse (CSP) equation with initial conditions in weighted Sobolev space $H^{1,1}(\mathbb{R})=\{f\in L^{2}(\mathbb{R}):…
The Computational Singular Perturbation (CSP) method of Lam and Goussis is an iterative method to reduce the dimensionality of systems of ordinary differential equations with multiple time scales. In [J. Nonlin. Sci., to appear], the…
In this paper, we present a systematic procedure to derive discrete analogues of integrable PDEs via Hirota's bilinear method. This approach is mainly based on the compatibility between an integrable system and its B\"acklund…
The short pulse (SP) equation is a novel model equation describing the propagation of ultra-short optical pulses in nonlinear media. This article reviews some recent results about the SP equation. In particular, we focus our attention on…
We apply the semi-discrete method, c.f. \emph{N. Halidias and I.S. Stamatiou (2016), On the numerical solution of some non-linear stochastic differential equations using the semi-discrete method, Computational Methods in Applied…
We give a new and constructive proof of the existence of global-in-time weak solutions of the 3-dimensional incompressible semi-geostrophic equations (SG) in geostrophic coordinates, for arbitrary initial measures with compact support. This…
The analytical theory of chirped dissipative soliton solutions of nonlinear complex Ginzburg-Landau equation is exposed. Obtained approximate solutions are easily traceable within an extremely broad range of the equation parameters and…
In this paper, we are concerned with integrable semi- and fully discrete analogues of the massive Thirring model in light core coordinates. By using the Hirota's bilinear approach and the KP reduction method, we propose both the semi- and…
In this paper, we primarily construct Darboux transformation(DT) of the nonlocal coupled modified complex integrable dispersionless (cm-CID) equation, which is first proposed by the connection with a nonlocal coupled modified complex short…
By means of transformations to nonlinear Klein-Gordon equations, we show that a generalized short pulse equation is integrable in two (and, most probably, only two) distinct cases of its coefficients. The first case is the original short…
A self-adaptive moving mesh method is proposed for the numerical simulations of the Camassa-Holm equation. It is an integrable scheme in the sense that it possesses the exact N-soliton solution. It is named a self-adaptive moving mesh…
By concisely representing a joint function of many variables as the combination of small functions, discrete graphical models (GMs) provide a powerful framework to analyze stochastic and deterministic systems of interacting variables. One…
As local and nonlocal reductions of a discrete second-order Ablowitz-Kaup-Newell-Segur equation, two discrete nonlinear Schr\"odinger type equations are considered. Through the bilinearization reduction method, we construct double…
In this paper, we take advantage of the bilinearization reduction method to consider the local and nonlocal reduction of a discrete Ablowitz-Kaup-Newell-Segur equation. Exact solutions in double Casoratian form to the reduced nonlocal…
The Constraint Satisfaction Problem (CSP) is ubiquitous in various areas of mathematics and computer science. Many of its variations have been studied including the Counting CSP, where the goal is to find the number of solutions to a CSP…
In the field of constraint satisfaction problems (CSP), promise CSPs are an exciting new direction of study. In a promise CSP, each constraint comes in two forms: "strict" and "weak," and in the associated decision problem one must…
We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables. First, we show that several…