Abstract
The objective of the proposed adaptive scheme is to reduce for a given FVS computational cost and memory requirements while preserving the accuracy of the reference scheme. In order to quantify this we introduce the averages \( \hat u_L^n \) of the exact solution, the averages v n L determined by the FVS and the averages \( \bar v_L^n \) of the adaptive scheme. Note, that all sequences correspond to the finest discretization level indicated by L. In particular, the sequence \( \bar v_L^n \) is not generated by the adaptive scheme on the full uniform highest level L but these data are determined by the adaptive array \( \left\{ {v_{j,k}^n } \right\}_{(j,k) \in \mathcal{G}_{L,\varepsilon }^n } \) and could be retrieved from them by means of the local inverse multiscale transformation (3.21) — (3.23) where the non-significant details d j,k,e in (3.23) are put to zero.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Müller, S. (2003). Error Analysis. In: Adaptive Multiscale Schemes for Conservation Laws. Lecture Notes in Computational Science and Engineering, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18164-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-18164-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44325-4
Online ISBN: 978-3-642-18164-1
eBook Packages: Springer Book Archive