Modeling seismic wave propagation using staggered-grid mimetic finite differences
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2017, Vol 5, Issue 2
Abstract
Mimetic finite difference (MFD) approximations of continuous gradient and divergence operators satisfy a discrete version of the Gauss-Divergence theorem on staggered grids. On the mimetic approximation of this integral conservation principle, an unique boundary flux operator is introduced that also intervenes on the discretization of a given boundary value problem (BVP). In this work, we present a second-order MFD scheme forseismic wave propagation on staggered grids that discretized free surface and absorbing boundary conditions (ABC) with same accuracy order. This scheme is time explicit after coupling a central three-level finite difference (FD) stencil for numerical integration. Here, we briefly discuss the convergence properties of this scheme and show its higher accuracy on a challenging test when compared to a traditional FD method. Preliminary applications to 2-D seismic scenarios are also presented and show the potential of the mimetic finite difference method.
Authors and Affiliations
Freysimar Solano-Feo, Juan Guevara-Jordan, Carlos González-Ramirez, Otilio Rojas-Ulacio, Beatriz Otero-Calvinyo
Keywords
Related Articles
- EP ID EP254268
- DOI -
- Views 99
- Downloads 0
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...
Solving the KPI wave equation with a moving adaptive FEM grid
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 consisti...
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...
Fundamentals of soft category theory
The soft category theory offers a way to study soft theories developed so far more generally. The main purpose of this paper is to introduce the basic algebraic operations in soft categories, and for that we introduce so...
A convex optimization approach for solving large scale linear systems
The well-known Conjugate Gradient (CG) method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this wo...