Sökning: "QR-factorization"

Hittade 4 avhandlingar innehållade ordet QR-factorization.

  1. 1. Algorithms for a Partially Regularized Least Squares Problem

    Författare :Ingegerd Skoglund; Tommy Elfving; Inge Söderkvist; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Least squares; Regularization; Block-matrices; Conjugate gradient; QR-factorization; Cross-validation; Numerical analysis; Numerisk analys;

    Sammanfattning : Vid analys av vattenprover tagna från t.ex. ett vattendrag betäms halten av olika ämnen. Dessa halter är ofta beroende av vattenföringen. 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. Identification of Time Varying Systems and Application of System Identification to Signal Processing

    Författare :Alf Isaksson; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; System identification; Time varying systems; Signal processing;

    Sammanfattning : Part IA new approach to identification of time varying systems is presented, and evaluated using computer simulations. The new approach is built upon the similarities between recursive least squares identification and Kalman filtering. LÄS MER

  5. 4. Studies of reursive projection methods for convergence acceleration of steady state Calculations

    Författare :Joakim Möller; KTH; []
    Nyckelord :;

    Sammanfattning : this paper we have defined two classes of projectionmethods. RPM(m) and NPGS(m), where RPM(1) is the classicalscheme due to Shroff \&Keller. Following the ideas in Lustet al., we obtain NPGS(m). LÄS MER