Sökning: "least squares optimization"

Visar resultat 1 - 5 av 49 avhandlingar innehållade orden least squares optimization.

  1. 1. Algorithms for overdetermined systems of equations

    Författare :Mårten Gulliksson; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; least squares; weights; lp; approximation; optimization;

    Sammanfattning : .... LÄS MER

  3. 2. Topics in Sparse Least Squares Problems

    Författare :Mikael Adlers; Michael A. Saunders; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis addresses topics in sparse least squares computation. A stable method for solving the least squares problem, min ||Ax-b||2 is based on the QR factorization.Here we have addressed the difficulty for storing the orthogonal matrix Q. LÄS MER

  4. 3. Algorithms for the Weighted Orthogonal Procrustes Problem and other Least Squares Problems

    Författare :Thomas Viklands; Per-Åke Wedin; Lars Eldén; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Procrustes; weighted; orthogonal; algorithms; global optimization.; Numerical analysis; Numerisk analys;

    Sammanfattning : In this thesis, we present algorithms for local and global minimization of some Procrustes type problems. Typically, these problems are about rotating and scaling a known set of data to fit another set with applications related to determination of rigid body movements, factor analysis and multidimensional scaling. LÄS MER

  5. 4. System Identification with Multi-Step Least-Squares Methods

    Författare :Miguel Galrinho; Håkan Hjalmarsson; Manfred Deistler; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The purpose of system identification is to build mathematical models for dynam-ical systems from experimental data. With the current increase in complexity of engineering systems, an important challenge is to develop accurate and computa-tionally simple algorithms, which can be applied in a large variety of settings. LÄS MER

  7. 5. Numerical Algorithms for Optimization Problems in Genetical Analysis

    Författare :Kateryna Mishchenko; Sverker Holmgren; Dmitrii Silvestrov; Lars Rönnegård; Ann-Charlotte Berglund Sonnhammer; Mälardalens högskola; []
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER