Sökning: "numerical analysis"
Visar resultat 31 - 35 av 1416 avhandlingar innehållade orden numerical analysis.
31. Numerical methods for waveguide modelling
Sammanfattning : Waveguides are used to transmit electromagnetic signals. Their geometry is typically long and slender. This particular shape can be used in the design of efficient computational methods. Only special modes are transmitted and eigenvalue and eigenvector analysis becomes important. LÄS MER
32. Subspace Computations via Matrix Decompositions and Geometric Optimization
Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER
33. Analysis and numerical methods for multiscale problems in magnetization dynamics
Sammanfattning : This thesis investigates a multiscale version of the Landau-Lifshitz equation and how to solve it using the framework of Heterogeneous Multiscale Methods (HMM). The Landau-Lifshitz equation is the governing equation in micromagnetics, modeling magnetization dynamics. LÄS MER
34. Stable High-Order Finite Difference Methods for Aerodynamics
Sammanfattning : In this thesis, the numerical solution of time-dependent partial differential equations (PDE) is studied. In particular high-order finite difference methods on Summation-by-parts (SBP) form are analysed and applied to model problems as well as the PDEs governing aerodynamics. LÄS MER
35. Runge–Kutta Time Step Selection for Flow Problems
Sammanfattning : Optimality is studied for Runge-Kutta iteration for solving steady-state and time dependent flow problems. For the former type an algorithm for determining locally optimal time steps is developed, based on the fact that the squared norm of the residual produced by an m-stage scheme is a 2m-degree polynomial, the coefficients of which can be computed from scalar products of Krylov subspace vectors. LÄS MER