The influence of parasitic modes on "weakly'' unstable multi-step Finite Difference schemes
Bibliographic record
Abstract
Numerical analysis for linear constant-coefficients Finite Difference schemes was developed approximately fifty years ago. It relies on the assumption of scheme stability and in particular -- for the $L^2$ setting -- on the absence of multiple roots of the amplification polynomial on the unit circle. This allows to decouple, while discussing the convergence of the method, the study of the consistency of the scheme from the precise knowledge of its parasitic/spurious modes, so that multi-step methods can be studied essentially as they were one-step schemes. In other words, the global truncation error can be inferred from the local truncation error. Furthermore, stability alleviates the need to delve into the complexities of floating-point arithmetic on computers, which can be challenging topics to address. In this paper, we show that in the case of ``weakly'' unstable schemes with multiple roots on the unit circle, although the schemes may remain stable, the consideration of parasitic modes is essential in studying their consistency and, consequently, their convergence. Otherwise said, the lack of genuine stability prevents bounding the global truncation error using the local truncation error, and one is thus compelled to study the former on its own. This research was prompted by unexpected numerical results on lattice Boltzmann schemes, which can be rewritten in terms of multi-step Finite Difference schemes. Initial expectations suggested that third-order initialization schemes would suffice to maintain the accuracy of a fourth-order multi-step scheme. However, this assumption proved incorrect for ``weakly'' unstable schemes. This borderline scenario underscores the significance of genuine stability in facilitating the construction of Lax-Richtmyer-like theorems and in mastering the impact of round-off errors. Despite the simplicity and apparent lack of practical usage of the linear transport equation at constant velocity considered throughout the paper, we demonstrate that high-order lattice Boltzmann schemes for this equation can be used to tackle non-linear systems of conservation laws relying on a Jin-Xin approximation and high-order splitting formulae.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".