Related papers: Integrable discretizations and self-adaptive movin…
In the present work, we revisit the so-called regularized short pulse equation (RSPE) and, in particular, explore the traveling wave solutions of this model. We theoretically analyze and numerically evolve two sets of such solutions. First,…
Multi-physics models governed by coupled partial differential equation (PDE) systems, are naturally suited for partitioned, or modular numerical solution strategies. Although widely used in tackling deterministic coupled models, several…
We consider the problem of estimating the discrete clustering structures under the Sub-Gaussian Mixture Model. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while…
The Constraint-satisfaction problem (CSP) is fundamental in mathematics, physics, and theoretical computer science. Continuous local search (CLS) solvers, as recent advancements, can achieve highly competitive results on certain classes of…
In the present work, we study the nonlinear dynamics of a microtubule, an important part of the cytoskeleton. We use a two-component model of the relevant system. A crucial nonlinear differential equation is solved with semi-discrete…
A discrete analogue of the dressing method is presented and used to derive integrable nonlinear evolution equations, including two infinite families of novel continuous and discrete coupled integrable systems of equations of nonlinear…
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices makes the solution of such nonlinear semidefinite programs more…
We study the existence and stability of standing pulse solutions to a singularly perturbed three-component reaction diffusion system with one-activator and two-inhibitor type. We apply the MAE (matched asymptotic expansion) method to the…
This paper presents a numerical method for variable coefficient elliptic PDEs with mostly smooth solutions on two dimensional domains. The PDE is discretized via a multi-domain spectral collocation method of high local order (order 30 and…
We prove existence of weak solutions of the 3D compressible semi-geostrophic (SG) equations with compactly supported measure-valued initial data. These equations model large-scale atmospheric flows. Our proof uses a particle discretisation…
In this paper, we study the Cauchy problem and multi-soliton solutions for a two-component short pulse system. For the Cauchy problem, we first prove the existence and uniqueness of solution with an estimate of the analytic lifespan, and…
Stochastic partial differential equations (SPDEs) are often difficult to solve numerically due to their low regularity and high dimensionality. These challenges limit the practical use of computer-aided studies and pose significant barriers…
Constraint satisfaction problem (CSP) has been actively used for modeling and solving a wide range of complex real-world problems. However, it has been proven that developing efficient methods for solving CSP, especially for large problems,…
Recently, relaxation methods have been developed to guarantee the preservation of a single global functional of the solution of an ordinary differential equation. Here, we generalize this approach to guarantee local entropy inequalities for…
We present a fully automatic framework for synthesising compact, finite-state deterministic abstractions of deterministic, continuous-state autonomous systems under locally specified resolution requirements. Our approach builds on…
This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many…
A numerical analysis for the fully discrete approximation of an operator Lyapunov equation related to linear SPDEs (stochastic partial differential equations) driven by multiplicative noise is considered. The discretization of the Lyapunov…
The paper focuses on the development of numerical methods for the compressible Euler equations. It is well-known that if the Mach number is small, the system becomes stiff and hence explicit schemes suffer from severe time-step…
Combinatorial problems stated as Constraint Satisfaction Problems (CSP) are examined. It is shown by example that any algorithm designed for the original CSP, and involving the AllDifferent constraint, has at least the same level of…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…