A Comparative study of finite difference and multiquadric schemes for the Euler equations
- 1 November 1988
- journal article
- research article
- Published by SAGE Publications in SIMULATION
- Vol. 51 (5) , 180-183
- https://doi.org/10.1177/003754978805100503
Abstract
We present a true scattered-data, grid free spatial approximation scheme called multiquadrics (MQ) first developed by Hardy. We have modified the original MQ scheme and demonstrated that it is exceptionally accurate for not only surface approximations, but also partial derivative estimates. Unlike familiar polynomial ap proximations, MQ is excellent for moderate to steep gradient regions, but rather poor in relatively flat regions. For that reason, we advocate a hybrid scheme which uses MQ in moderate to steep regions, but switches to the familiar polynomial methods in relatively flat regions. In this paper, we compare the accuracy and operation counts of finite differences and MQ schemes for the solution of time depen dent nonlinear set of hyperbolic partial differential equations. We have demonstrated both from an operations count and accuracy that MQ is superior to the familiar finite difference scheme.Keywords
This publication has 4 references indexed in Scilit:
- Interpolating matrix method: A finite difference method for arbitrary arrangement of mesh pointsJournal of Computational Physics, 1988
- HIGHLY ACCURATE SHOCK FLOW CALCULATIONS WITH MOVING GRIDS AND MESH REFINEMENT*Published by Elsevier ,1986
- Estimation of gradients from scattered dataRocky Mountain Journal of Mathematics, 1984
- Multiquadric equations of topography and other irregular surfacesJournal of Geophysical Research, 1971