We investigate the large time behavior of compactly supported solutions for a one-dimensional thin-film equation with linear mobility in the regime of partial wetting. We show the stability of steady state solutions. The proof uses the Lagrangian coordinates. Our method is to establish and exploit differential relations between the energy and the dissipation as well as some interpolation inequalities. Our result is different from earlier results because here we consider solutions with finite mass.
In this technical report, we consider a nonlinear 4th-order degenerate parabolic partial differential equation that arises in modelling the dynamics of an incompressible thin liquid film on the outer surface of a rotating horizontal cylinder in the presence of gravity. The parameters involved determine a rich variety of qualitatively different flows. Depending on the initial data and the parameter values, we prove the existence of nonnegative periodic weak solutions. In addition, we prove that these solutions and their gradients cannot grow any faster than linearly in time; there cannot be a finite-time blow-up. Finally, we present numerical simulations of solutions.
We consider a nonlinear 4th-order degenerate parabolic partial differential equation that arises in modelling the dynamics of an incompressible thin liquid film on the outer surface of a rotating horizontal cylinder in the presence of gravity. The parameters involved determine a rich variety of qualitatively different flows. Depending on the initial data and the parameter values, we prove the existence of nonnegative periodic weak solutions. In addition, we prove that these solutions and their gradients cannot grow any faster than linearly in time; there cannot be a finite-time blow-up. Finally, we present numerical simulations of solutions.
In this paper, we consider the following three dimensional defocusing cubic nonlinear Schrodinger equation (NLS) with partial harmonic potential begin{equation*}tag{NLS} ipartial_t u + left(Delta_{mathbb{R}^3 }-x^2 right) u = |u|^2 u, quad u|_{t=0} = u_0. end{equation*} Our main result shows that the solution $u$ scatters for any given initial data $u_0$ with finite mass and energy. The main new ingredient in our approach is to approximate (NLS) in the large-scale case by a relevant dispersive continuous resonant (DCR) system. The proof of global well-posedness and scattering of the new (DCR) system is greatly inspired by the fundamental works of Dodson cite{D3,D1,D2} in his study of scattering for the mass-critical nonlinear Schrodinger equation. The analysis of (DCR) system allows us to utilize the additional regularity of the smooth nonlinear profile so that the celebrated concentration-compactness/rigidity argument of Kenig and Merle applies.
We study the hyperboloidal initial value problem for the one-dimensional wave equation perturbed by a smooth potential. We show that the evolution decomposes into a finite-dimensional spectral part and an infinite-dimensional radiation part. For the radiation part we prove a set of Strichartz estimates. As an application we study the long-time asymptotics of Yang-Mills fields on a wormhole spacetime.
This paper analyzes inverse scattering for the one-dimensional Helmholtz equation in the case where the wave speed is piecewise constant. Scattering data recorded for an arbitrarily small interval of frequencies is shown to determine the wave speed uniquely, and a direct reconstruction algorithm is presented. The algorithm is exact provided data is recorded for a sufficiently wide range of frequencies and the jump points of the wave speed are equally spaced with respect to travel time. Numerical examples show that the algorithm works also in the general case of arbitrary wave speed (either with jumps or continuously varying etc.) giving progressively more accurate approximations as the range of recorded frequencies increases. A key underlying theoretical insight is to associate scattering data to compositions of automorphisms of the unit disk, which are in turn related to orthogonal polynomials on the unit circle. The algorithm exploits the three-term recurrence of orthogonal polynomials to reduce the required computation.