Local Error Analysis and Comparison of the Swept- and Intersection-Based Remapping Methods. (7th February 2017)

• Record Type: Journal Article
• Authors: Klima, Matej; Kucharik, Milan; Shashkov, Mikhail
• Is Part Of: Communications in computational physics. Volume 21:Number 2(2017:Feb.)
• Page Start: 526
• Page End: 558
• Publication Date: 2017-02-07
• Subjects: 47.11.-j, -- 02.60.Ed; Conservative interpolation, -- remapping, -- numerical error analysis, -- swept regions, -- polygon intersections; Mathematical physics -- Data processing -- Periodicals; Physics -- Data processing -- Periodicals; 530.150285
• DOI: 10.4208/cicp.OA-2015-0021
• Languages: English
• ISSNs: 1815-2406

Abstract

Abstract: In this paper, the numerical error of two widely used methods for remapping of discrete quantities from one computational mesh to another is investigated. We compare the intuitive, but resource intensive method utilizing intersections of computational cells with the faster and simpler swept-region-based method. Both algorithms are formally second order accurate, however, they are known to produce slightly different quantity profiles in practical applications. The second-order estimate of the error formula is constructed algebraically for both algorithms so that their local accuracy can be evaluated. This general estimate is then used to assess the dependence of the performance of both methods on parameters such as the second derivatives of the remapped distribution, mesh geometry or mesh movement. Due to the complexity of such analysis, it is performed on a set of simplified elementary mesh patterns such as cell corner expansion, rotation or shear. On selected numerical tests it is demonstrated that the swept-based method can distort a symmetric quantity distribution more substantially than the intersection-based approach when the computational mesh moves in an unsuitable direction.