Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Estimating Discretization Error with Preset Orders of Accuracy and Fractional Refinement Ratios (2201.00264v2)

Published 1 Jan 2022 in math.NA, cs.NA, and physics.comp-ph

Abstract: Verification of solutions is crucial for establishing the reliability of simulations. A central challenge is to find an accurate and reliable estimate of the discretization error. Current approaches to this estimation rely on the observed order of accuracy; however, studies have shown that it may alter irregularly or become undefined. Therefore, we propose a grid refinement method which adopts constant orders given by the user, called the Preset Orders Expansion Method (POEM). The user is guaranteed to obtain the optimal set of orders through iterations and hence an accurate estimate of the discretization error. This method evaluates the reliability of the estimation by assessing the convergence of the expansion terms, which is fundamental for all grid refinement methods. We demonstrate these capabilities using advection and diffusion problems along different refinement paths. POEM requires a lower computational cost when the refinement ratio is higher. However, the estimated error suffers from higher uncertainty due to the reduced number of shared grid points. We circumvent this by using fractional refinement ratios and the Method of Interpolating Differences between Approximate Solutions (MIDAS). As a result, we can obtain a global estimate of the discretization error of lower uncertainty at a reduced computational cost.

Summary

We haven't generated a summary for this paper yet.