Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userError estimates for Galerkin approximations of the Serre equations
62
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the Serre system of equations which is a nonlinear dispersive system that models two-way propagation of long waves of not necessarily small amplitude on the surface of an ideal fluid in a channel. We discretize in space the periodic initial-value problem for the system using the standard Galerkin finite element method with smooth splines on a uniform mesh and prove an optimal-order $L^{2}$-error estimate for the resulting semidiscrete approximation. Using the fourth-order accurate, explicit, `classical Runge-Kutta scheme for time stepping we construct a highly accurate fully discrete scheme in order to approximate solutions of the system, in particular solitary-wave solutions, and study numerically phenomena such as the resolution of general initial profiles into sequences of solitary waves, and overtaking collisions of pairs of solitary waves propagating in the same direction with different speeds.
rate research
Read More
We consider the periodic initial-value problem for the Serre equations of water-wave theory and its semidiscrete approximation in the space of smooth periodic polynomial splines. We prove that the semidiscrete problem is well posed, locally in time, and satisfies a discrete positivity property for the water depth.
Most of the literature on the solution of linear ill-posed operator equations, or their discretization, focuses only on the infinite-dimensional setting or only on the solution of the algebraic linear system of equations obtained by discretization. This paper discusses the influence of the discretization error on the computed solution. We consider the situation when the discretization used yields an algebraic linear system of equations with a large matrix. An approximate solution of this system is computed by first determining a reduced system of fairly small size by carrying out a few steps of the Arnoldi process. Tikhonov regularization is applied to the reduced problem and the regularization parameter is determined by the discrepancy principle. Errors incurred in each step of the solution process are discussed. Computed examples illustrate the error bounds derived.
We consider semi-discrete discontinuous Galerkin approximations of a general elastodynamics problem, in both {it displacement} and {it displacement-stress} formulations. We present the stability analysis of all the methods in the natural energy norm and derive optimal a-priori error estimates. For the displacement-stress formulation, schemes preserving the total energy of the system are introduced and discussed. We include some numerical experiments in three dimensions to verify the theory.
Elliptic partial differential equations on surfaces play an essential role in geometry, relativity theory, phase transitions, materials science, image processing, and other applications. They are typically governed by the Laplace-Beltrami operator. We present and analyze approximations by Surface Finite Element Methods (SFEM) of the Laplace-Beltrami eigenvalue problem. As for SFEM for source problems, spectral approximation is challenged by two sources of errors: the geometric consistency error due to the approximation of the surface and the Galerkin error corresponding to finite element resolution of eigenfunctions. We show that these two error sources interact for eigenfunction approximations as for the source problem. The situation is different for eigenvalues, where a novel situation occurs for the geometric consistency error: The degree of the geometric error depends on the choice of interpolation points used to construct the approximate surface. Thus the geometric consistency term can sometimes be made to converge faster than in the eigenfunction case through a judicious choice of interpolation points.
In two dimensions, we propose and analyze an a posteriori error estimator for finite element approximations of the stationary Navier Stokes equations with singular sources on Lipschitz, but not necessarily convex, polygonal domains. Under a smallness assumption on the continuous and discrete solutions, we prove that the devised error estimator is reliable and locally efficient. We illustrate the theory with numerical examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
