Towards optimal DRP scheme for linear advection
Claire David (LMM), Pierre Sagaut (LMM)
TL;DR
This paper presents a novel approach to optimize Dispersion-Relation-Preserving (DRP) schemes for linear advection by solving finite difference schemes through a linear matrix equation, minimizing approximation errors.
Contribution
It introduces a new DRP scheme derived from a theoretical analysis of the algebraic system governing finite difference methods.
Findings
Minimized finite difference approximation error
Developed a new DRP scheme with improved accuracy
Provided theoretical insights into the algebraic structure of the scheme
Abstract
Finite difference schemes are here solved by means of a linear matrix equation. The theoretical study of the related algebraic system is exposed, and enables us to minimize the error due to a finite difference approximation, while building a new DRP scheme in the same time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cryptography and Data Security · Lattice Boltzmann Simulation Studies