Sökning: "subspace methods"

Visar resultat 16 - 20 av 54 avhandlingar innehållade orden subspace methods.

  1. 16. Direction finding in the presence of mutual coupling

    Författare :Thomas Svantesson; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; physical modeling; subspace methods; detection; estimation; sensor array processing; direction of arrival estimation; mutual coupling;

    Sammanfattning : .... LÄS MER

  3. 17. Krylov Subspace Methods for Linear Systems, Eigenvalues and Model Order Reduction

    Författare :Daniel Skoogh; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; eigenvalues; eigenvectors; sparse; parallel; rational; Krylov; shift; invert; Arnoldi; linear systems; iterative; model; reduction; passive; 65F15; 65F50; 65Y05; 65F10; 93A30; 93B40; rational;

    Sammanfattning : New variants of Krylov subspace methods for numerical solution of linear systems, eigenvalue, and model order reduction problems are described. A new method to solve linear systems of equations with several right-hand sides is described. LÄS MER

  4. 18. On subspace methods in system identification and sensor array signal processing

    Författare :Magnus Jansson; KTH; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  5. 19. Parameter-free Krylov subspace iteration methods for the Euler and Navier–Stokes equations

    Författare :Karl Hörnell; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Numerical Analysis; Numerisk analys;

    Sammanfattning : .... LÄS MER

  7. 20. On Methods for Solving Symmetric Systems of Linear Equations Arising in Optimization

    Författare :Tove Odland; Anders Forsgren; William W. Hager; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; symmetric system of linear equations; method of conjugate gradients; quasi-Newton method; unconstrained optimization; unconstrained quadratic optimiza- tion; Krylov subspace method; unnormalized Lanczos vectors; minimum-residual method; symmetriska linjära ekvationssystem; konjugerade gradientmetoden; kvasi- Newtonmetoder; optimering utan bivillkor; kvadratisk optimering utan bivillkor; Kry- lovunderrumsmetoder; icke-normaliserade Lanczosvektorer; minimum-residualmetoden; Mathematics; Matematik;

    Sammanfattning : In this thesis we present research on mathematical properties of methods for solv- ing symmetric systems of linear equations that arise in various optimization problem formulations and in methods for solving such problems.In the first and third paper (Paper A and Paper C), we consider the connection be- tween the method of conjugate gradients and quasi-Newton methods on strictly convex quadratic optimization problems or equivalently on a symmetric system of linear equa- tions with a positive definite matrix. LÄS MER