Lesson plan
Zero stability
Zero-stability, also known as D-stability in honor of Germund Dahlquist, refers to the stability of a numerical scheme applied to the simple initial value problem y'(x) = 0 . A linear multistep method is zero-stable if all roots of the characteristic equation that arises on applying the method to y'(x) = 0 have magnitude less than or equal to unity, and that all roots with unit magnitude are simple. This is called the root condition and means that the parasitic solutions of the recurrence relation will not grow exponentially.
Article summary
Zero-stability, also known as D-stability in honor of Germund Dahlquist, refers to the stability of a numerical scheme applied to the simple initial value problem y'(x) = 0 . A linear multistep method is zero-stable if all roots of the characteristic equation that arises on applying the method to y'(x) = 0 have magnitude less than or equal to unity, and that all roots with unit magnitude are simple. This is called the root condition and means that the parasitic solutions of the recurrence relation will not grow exponentially.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.