Search for dissertations about: "Tillämpad matematik"

Showing result 11 - 15 of 189 swedish dissertations containing the words Tillämpad matematik.

  1. 11. Numerical Algorithms for Optimization Problems in Genetical Analysis

    Author : Kateryna Mishchenko; Sverker Holmgren; Dmitrii Silvestrov; Lars Rönnegård; Ann-Charlotte Berglund Sonnhammer; Mälardalens högskola; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Quantitative Trait Loci QTL ; restricted maximum likelihood REML ; variance components; average information AI matrix; Local optimization; Quasi-Newton method; Active Set method; Hessian approximation; BFGS update; Applied mathematics; Tillämpad matematik; Matematik tillämpad matematik;

    Abstract : The focus of this thesis is on numerical algorithms for efficient solution of QTL analysis problem in genetics.Firstly, we consider QTL mapping problems where a standard least-squares model is used for computing the model fit. READ MORE

  2. 12. Regularization of Parameter Problems for Dynamic Beam Models

    Author : Sara Rydström; Börje Nilsson; Fredrik Berntsson; Linnéuniversitetet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Euler-Bernoulli beam equation; parameter identification; bending stiffness; refractive index; Tikhonov regularization; Applied mathematics; Tillämpad matematik; Mathematics; Matematik;

    Abstract : The field of inverse problems is an area in applied mathematics that is of great importance in several scientific and industrial applications. Since an inverse problem is typically founded on non-linear and ill-posed models it is a very difficult problem to solve. READ MORE

  3. 13. Local Conditions for Cycles in Graphs

    Author : Jonas Granholm; Armen Asratian; Carl Johan Casselgren; Victor Falgas Ravry; Linköpings universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions for Hamiltonicity. READ MORE

  4. 14. On some computer-aided proofs in analysis

    Author : Tomas Johnson; Warwick Tucker; Piotr Zgliczynski; Uppsala universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; MATHEMATICS; MATEMATIK; Mathematics; Matematik; Mathematics; Matematik;

    Abstract : .... READ MORE

  5. 15. Extreme points of the Vandermonde determinant in numerical approximation, random matrix theory and financial mathematics

    Author : Asaph Keikara Muhumuza; Sergei Silvestrov; Anatoliy Malyarenko; Karl Lundengård; Milica Rancic; Olga Liivapuu; Mälardalens högskola; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Mathematics Applied Mathematics; matematik tillämpad matematik;

    Abstract : This thesis discusses the extreme points of the Vandermonde determinant on various surfaces, their applications in numerical approximation, random matrix theory and financial mathematics. Some mathematical models that employ these extreme points such as curve fitting, data smoothing, experimental design, electrostatics, risk control in finance and method for finding the extreme points on certain surfaces are demonstrated. READ MORE