Please use this identifier to cite or link to this item:
|Title:||Hopping numerical approximations of the hyperbolic equation||Authors:||Tkalich, P.||Keywords:||High order
Large Courant number
|Issue Date:||30-Dec-2007||Citation:||Tkalich, P. (2007-12-30). Hopping numerical approximations of the hyperbolic equation. International Journal for Numerical Methods in Fluids 55 (12) : 1171-1188. ScholarBank@NUS Repository. https://doi.org/10.1002/fld.1519||Abstract:||Polynomial functions can be used to derive numerical schemes for an approximate solution of hyperbolic equations. A conventional derivation technique requires a polynomial to pass through every node values of a continuous computational stencil, leading to severe manifestation of the Gibbs phenomenon and strict time-step limitation. To overcome the problem, this paper introduces polynomials that skip regularly ('hop' over) one or more nodes from the computational grid. Polynomials hopping over odd and even nodes yield a series of explicit numerical schemes of a required accuracy, with Lax-Friedrichs method being a particular simplest case. The schemes have two times wider stability interval compared to conventional continuous-stencil explicit methods. Convex combinations of odd- and even-node-based updates improve further accuracy and stability of the method. Out of considered combinations (up to third-order accuracy), derived odd-order methods are stable for the Courant number ranging from 0 to 3, and even-order ones from 0 to 5. A 2-D extension of the hopping polynomial method exhibits similar properties. Copyright © 2007 John Wiley & Sons, Ltd.||Source Title:||International Journal for Numerical Methods in Fluids||URI:||http://scholarbank.nus.edu.sg/handle/10635/115760||ISSN:||02712091||DOI:||10.1002/fld.1519|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.