Sökning: "Linear Multistep Methods"

Hittade 2 uppsatser innehållade orden Linear Multistep Methods.

1. 1. Comparing Multistep Methods Within Parametric Classes to Determine Viability in Solver Applications

   Master-uppsats, Lunds universitet/Matematik LTH; Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/Matematikcentrum

   Författare :Michael Andrew Kraut; [2021]
   Nyckelord :Ordinary Differential Equations; Initial Value Problems; Linear Multistep Methods; Numerical Analysis; Numerical Solvers; Parametrized; Algorithms; Control Theory; Mathematics and Statistics;

   Sammanfattning : In the 2017 paper by Arévalo and Söderlind, a framework was established for creating linear multistep methods of various classes based on a polynomial formulation which includes variable step size adaptivity. These classes are: k step explicit and implicit methods of order k and k+1 respectively for nonstiff problems (such as Adams methods), and k step implicit methods of order k for stiff problems (such as BDF methods). LÄS MER

3. 2. Construction and benchmarking of adaptive parameterized linear multistep methods

   Master-uppsats, Lunds universitet/Matematik LTH

   Författare :Josefine Olander; Erik Jonsson Glans; [2016]
   Nyckelord :Linear multistep method; matlab software; variable step-size; variable order; numerical solver of ODEs; Mathematics and Statistics; Technology and Engineering;

   Sammanfattning : A recent publication introduced a new way to define all k-step linear multistep methods of order k and k+1, in a parametric form that builds in variable step-size. In this framework it is possible to continuously change method and step-size, making it possible to create better behaving adaptive numerical solvers. LÄS MER