Sökning: "multistep methods"
Visar resultat 1 - 5 av 6 uppsatser innehållade orden multistep methods.
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/MatematikcentrumSammanfattning : 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
2. Varför binder dasatinib mycket bra till vissa proteiner men mindre bra till andra?
Kandidat-uppsats, Linnéuniversitetet/Institutionen för kemi och biomedicin (KOB)Sammanfattning : Introduction: Cancer is a group of about 200 different types of diseases. Cancer can appear in different cells and tissues in the body when abnormal cells grow in an uncontrolled manner and invade other tissues. A multistep process that occurs over a long period eventually leads to the onset of cancer. LÄS MER
3. Construction and benchmarking of adaptive parameterized linear multistep methods
Master-uppsats, Lunds universitet/Matematik LTHSammanfattning : 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
4. Analysis and Implementation of Adaptive Explicit Two-Step Methods
Master-uppsats, Lunds universitet/Matematik LTHSammanfattning : Recently a new way of constructing variable step-size multistep methods has been proposed, that parametrizes the entire domain of multistep methods. In the presented work the case of explicit two-step methods is looked at, analyzed and related to the already known theory of multistep methods. LÄS MER
5. A Python Implementation of Explicit 2-step Methods
Kandidat-uppsats, Lunds universitet/Matematik LTHSammanfattning : This paper shows the Python implementation of a new way of constructing a variable multistep ODE solver which is not based on extending fixed step-size methods but rather on defining interpolation and collocation conditions for each new point. The implementation allows for any explicit 2-step method of order 2... LÄS MER
