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 96
- Downloads 0
Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
In this work, we considered two-person zero-sum games with fuzzy payoffs and matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). The concepts of TrIFNs and their arithmetic operations were use...
Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
To achieve the good features of the linear conjugate gradient algorithm in a recent extension of the Dai-Liao method, two adaptive choices for parameter of the extended method are proposed based on a penalization approac...
Matrix completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iter...
Numerical solution of mixed Volterra-Fredholm integral equations using iterative method via two-variables Bernstein polynomials
This paper is concerned with the numerical solution of mixed Volterra-Fredholm integral equations, based on iterative method and two variable Bernstein polynomials. In the main result, this method has several benefits in...
Some Convergence Strategies for the Alternating Generalized Projection Method
In this paper we extend the application of the alternating projection algorithm to solve the problem of finding a point in the intersection of $n$ sets ($n\geq2$), which are not all of them convex sets. Here we term such...