Sökning: "numerical algorithms"
Visar resultat 1 - 5 av 325 avhandlingar innehållade orden numerical algorithms.
1. Numerical algorithms for nonlinear eigenproblems with eigenvector nonlinearities
Sammanfattning : Eigenproblems and their nonlinear generalizations appear as important problems in a wide variety of fields, ranging from quantum chemistry and vibration analysis to macroeconomics and data science. Hence, the development and analysis of numerical algorithms to solve such problems has a broad multiplicative effect on our ability to answer several crucial scientific questions. LÄS MER
2. Constructing Evolutionary Trees - Algorithms and Complexity
Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER
3. Structure-Exploiting Numerical Algorithms for Optimal Control
Sammanfattning : Numerical algorithms for efficiently solving optimal control problems are important for commonly used advanced control strategies, such as model predictive control (MPC), but can also be useful for advanced estimation techniques, such as moving horizon estimation (MHE). In MPC, the control input is computed by solving a constrained finite-time optimal control (CFTOC) problem on-line, and in MHE the estimated states are obtained by solving an optimization problem that often can be formulated as a CFTOC problem. LÄS MER
4. The Development of an Automated Prescreener for the Early Detection of Cervical Cancer : Algorithms and Implementation
Sammanfattning : .... LÄS MER
5. Approximation Algorithms for Geometric Networks
Sammanfattning : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. LÄS MER