Essays about: "Implicit Runge-Kutta methods"
Showing result 1 - 5 of 6 essays containing the words Implicit Runge-Kutta methods.
-
1. Efficient Calculations of Two-Dimensional Radar Cross-Section Using DGFEM
University essay from Uppsala universitet/Avdelningen för beräkningsvetenskapAbstract : A two-dimensional discontinuous Galerkin finite element method algorithm in the time domain was developed for calculation of the radar cross-section of an arbitrary object. The algorithm was formed using local nodal basis functions in each element and coupling them via numerical upwind flux. READ MORE
-
2. A Study of Time-Stepping Methods for Optimization in Supervised Learning
University essay from Lunds universitet/Matematik LTH; Lunds universitet/MatematikcentrumAbstract : In supervised machine learning, training neural networks requires solving optimization problems. These problems can be restated as gradient flow problems and solved numerically using time-stepping methods. READ MORE
-
3. Optimizing multigrid smoothers using GLT theory
University essay from Lunds universitet/Matematik LTH; Lunds universitet/MatematikcentrumAbstract : Multigrid algorithms are algorithms used to find numerical solutions to differential equations using a hierarchy of grids of different coarseness. This exploits the fact that short-wavelength components of the solutions converges at a faster rate than the long-wavelength components when using some basic iterative methods, such as the Jacobi method or the Gauss-Seidel method. READ MORE
-
4. Parallelization of the SDIRK and Newton’s method and analysis of a weighted norm for error estimations
University essay from Lunds universitet/Matematik LTHAbstract : Execution time is an important issue in the field of numerical analysis. Simulations are getting more and more complex and the execution times are rapidly increasing. In the scope of this thesis a time integration library is used to solve initial value problems. READ MORE
-
5. Implementation of Singly Diagonally Implicit Runge-Kutta Methods with Constant Step Sizes
University essay from Lunds universitet/Matematik LTHAbstract : Runge–Kutta methods can be used for solving ordinary differential equations of the form y0 = f(t, y) with initial condition y(t0) = y0 and where f : R x R^m -> R^m. The idea is to find a method that is efficient to implement. But it is also important for the method to be of high order and be stable. READ MORE
