Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1508.05432

The Cauchy problem of coupled elliptic sine-Gordon equations with noise: Analysis of a general kernel-based regularization and reliable tools of computing

Vo Anh Khoa·Mai Thanh Nhat Truong·Nguyen Ho Minh Duy·Nguyen Huy Tuan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Developments in numerical methods for problems governed by nonlinear partial differential equations underpin simulations with sound arguments in diverse areas of science and engineering. In this paper, we explore the regularization method for the coupled elliptic sine-Gordon equations along with Cauchy data. The system of equations originates from the static case of the coupled hyperbolic sine-Gordon equations modeling the coupled Josephson junctions in superconductivity, and so far it addresses the Josephson $π$-junctions. In general, the Cauchy problem is not well-posed, and herein the Hadamard-instability occurs drastically. Generalizing the kernel-based regularization method, we propose a stable approximate solution. Confirmed by the error estimate, this solution strongly converges to the exact solution in $L^2$-norm. The main concern of this paper is also with the way to compute the regularized solution formed by an alike integral equation. We employ the proposed techniques that successfully approximated the highly oscillatory integral, and apply the Picard-like iteration to organize an efficient and reliable tool of computations. The results are viewed as the improvement as well as the generalization of many previous works. The paper is also accompanied by a numerical example that demonstrates the potential of this idea.

Explore related subjects

math.APcs.NAmath.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vo Anh Khoa, Mai Thanh Nhat Truong, Nguyen Ho Minh Duy, Nguyen Huy Tuan. 2017-10-22. The Cauchy problem of coupled elliptic sine-Gordon equations with noise: Analysis of a general kernel-based regularization and reliable tools of computing. https://doi.org/10.1016/j.camwa.2016.11.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A linear test approach to global controllability of third- and fifth-order nonlinear dispersive equations

We investigate third- and fifth-order nonlinear dispersive equations of KdV type on the torus and establishes approximate controllability by a fixed four-dimensional control; rather than relying solely on the saturation machinery, the analysis exploits the finite-dimensional controllability of the inviscid Burgers equation linearized around a carefully constructed return trajectory, with the trajectory itself obtained from an observable family. This ``linear test" strategy, yields more information about the structure of the control than the standard approach. In particular, the constructed control is shown to depend continuously on the initial and target states, a property that is by no means automatic in nonlinear control problems, and to decompose as a bounded linear operator applied to the data plus a fixed remainder, with the operator part interestingly independent of the order of dispersion.

math.AP↗
arXiv2026

A conditional Lagrangian clock barrier at the $C^{1,\frac{1}{3}}$ threshold for axisymmetric Euler without swirl

We consider axisymmetric no-swirl solutions to the three-dimensional incompressible Euler equations, with initial velocity in $C^{1,α}\cap L^2$, where $α\in\left[\frac{1}{3},1\right)$. In a major breakthrough, Shkoller introduced a clock-and-driver framework that he used in order to prove finite-time type I blow-up below the $C^{1,\frac{1}{3}}$ threshold in this setting. Motivated by this, we define Lagrangian classes of coherent conditional solutions for which the same mechanism yields a supercritical-critical barrier to blow-up when $α\geq\frac{1}{3}$. When $α>\frac{1}{3}$, the aforementioned barrier is genuinely depleted, whereas at the critical endpoint $α=\frac{1}{3}$, we obtain an exponential bound preventing blow-up. In the general case, we formulate a matrix-clock criterion in terms of the smallest singular value of the deformation gradient and show that, under transverse cusp-tail, longitudinal, off-clock, Dini, and suitable geometric coherence hypotheses, this singular value cannot collapse in finite time. In particular, we also show that the class of such coherent solutions includes the smooth ones locally in time. In the on-axis case, the criterion reduces to the scalar clock inequality $\displaystyle \dot{J}(t)\gtrsim -B(t)J(t)-CJ(t)^{3α}$, which rules out Shkoller-type clock collapse for $α\geq\frac{1}{3}$. These results do not enlarge the known Lorentz-space global regularity classes. Rather, they in particular identify the supercritical Lagrangian obstruction dual to Shkoller's subcritical blow-up mechanism in the case $α>\frac{1}{3}$.

math.AP↗