Abstract
AbstractIn this paper we explore theoretically and numerically the application of the advection transport algorithm introduced by Smolarkiewicz to the one‐dimensional unsteady advection–diffusion equation. The scheme consists of a sequence of upwind iterations, where the initial iteration is the first‐order accurate upwind scheme, while the subsequent iterations are designed to compensate for the truncation error of the preceding step. Two versions of the method are discussed. One, the classical version of the method, regards the second‐order terms of the truncation error and the other considers additionally the third‐order terms. Stability and convergence are discussed and the theoretical considerations are illustrated through numerical tests. The numerical tests will also indicate in which situations are advantageous to use the numerical methods presented. Copyright © 2008 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
