Return to search

Transfer-of-approximation Approaches for Subgrid Modeling

I propose two Galerkin methods based on the transfer-of-approximation property for static and dynamic acoustic boundary value problems in seismic applications. For problems with heterogeneous coefficients, the polynomial finite element spaces are no longer optimal unless special meshing techniques are employed. The transfer-of-approximation property provides a general framework to construct the optimal approximation subspace on regular grids. The transfer-of-approximation finite element method is theoretically attractive for that it works for both scalar and vectorial elliptic problems. However the numerical cost is prohibitive. To compute each transfer-of-approximation finite element basis, a problem as hard as the original one has to be solved. Furthermore due to the difficulty of basis localization, the resulting stiffness and mass matrices are dense. The 2D harmonic coordinate finite element method (HCFEM) achieves optimal second-order convergence for static and dynamic acoustic boundary value problems with variable coefficients at the cost of solving two auxiliary elliptic boundary value problems. Unlike the conventional FEM, no special domain partitions, adapted to discontinuity surfaces in coe cients, are required in HCFEM to obtain the optimal convergence rate. The resulting sti ness and mass matrices are constructed in a systematic procedure, and have the same sparsity pattern as those in the standard finite element method. Mass-lumping in HCFEM maintains the optimal order of convergence, due to the smoothness property of acoustic solutions in harmonic coordinates, and overcomes the numerical obstacle of inverting the mass matrix every time update, results in an efficient, explicit time step.

Identiferoai:union.ndltd.org:RICE/oai:scholarship.rice.edu:1911/71700
Date24 July 2013
CreatorsWang, Xin
ContributorsSymes, William W.
Source SetsRice University
LanguageEnglish
Detected LanguageEnglish
Typethesis, text
Formatapplication/pdf

Page generated in 0.0014 seconds