Solving the KPI wave equation with a moving adaptive FEM grid
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2013, Vol 1, Issue 1
Abstract
The Kadomtsev-Petviashvili I (KPI) equation is the difficult nonlinear wave equation $U_{xt} + 6U_x^2 + 6UU_{xx} + U_{xxxx} = 3U_{yy}.$ We solve this equation using PDE2D (www.pde2d.com) with initial conditions consisting of two lump solitons, which collide and reseparate. Since the solution has steep, moving, peaks, an adaptive finite element grid is used with a grading which moves with the peaks.
Authors and Affiliations
Granville Sewell
Keywords
Related Articles
- EP ID EP245756
- DOI -
- Views 85
- Downloads 0
A deterministic optimization approach for solving the rainfall disaggregation problem
One of the main problems in hydrology is the time scale of the historical rainfall data, available from many meteorological data bases. Most of the rainfall data is given at a time scale coarser than the one needed for...
Stability and square integrability of solutions of nonlinear fourth order differential equations
The aim of the present paper is to establish a new result, which guarantees the asymptotic stability of zero solution and square integrability of solutions and their derivatives to nonlinear differential equations of fou...
L(2,1)-Labeling for Subdivisions of Cycle Dominated Graphs
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that |f(x)-f(y)| &ge...
On solution of a nonlocal problem with dynamic boundary conditions for a loaded linear parabolic equation by straight-line methods
We consider a nonlocal problem with dynamic boundary conditions for a loaded linear parabolic equation. For this problem we prove the unique solvability in Sobolev's spaces and the maximum principle under some natural c...
Total dominator chromatic number of some operations on a graph
Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominat...