Sökning: "iterative solution methods"
Visar resultat 16 - 20 av 90 avhandlingar innehållade orden iterative solution methods.
16. Fast Numerical Techniques for Electromagnetic Problems in Frequency Domain
Sammanfattning : The Method of Moments is a numerical technique for solving electromagnetic problems with integral equations. The method discretizes a surface in three dimensions, which reduces the dimension of the problem with one. A drawback of the method is that it yields a dense system of linear equations. LÄS MER
17. Iterative Methods for Solving the Cauchy Problem for the Helmholtz Equation
Sammanfattning : The inverse problem of reconstructing the acoustic, or electromagnetic, field from inexact measurements on a part of the boundary of a domain is important in applications, for instance for detecting the source of acoustic noise. The governing equation for the applications we consider is the Helmholtz equation. LÄS MER
18. On some Numerical Methods and Solution Techniques for Incompressible Flow Problems
Sammanfattning : The focus of this work is on numerical solution methods for solving the incompressible Navier-Stokes equations, which consist of a set of coupled nonlinear partial differential equations.In general, after linearization and finite element discretization in space, the original nonlinear problem is converted into finding the solutions of a sequence of linear systems of equations. LÄS MER
19. Runge-Kutta Solution of Initial Value Problems: Methods, Algorithms and Implementation
Sammanfattning : The last decades have seen a strongly increasing use of computers for modeling larger and more complex systems. This has been made possible by a combination of increasing computer power and easy-to-use graphical modeling environments and libraries of components. LÄS MER
20. Approximate Solution Methods to Optimal Control Problems via Dynamic Programming Models
Sammanfattning : Optimal control theory has a long history and broad applications. Motivated by the goal of obtaining insights through unification and taking advantage of the abundant capability to generate data, this thesis introduces some suboptimal schemes via abstract dynamic programming models. LÄS MER