Sökning: "model order reduction"

Visar resultat 1 - 5 av 465 avhandlingar innehållade orden model order reduction.

  1. 1. Model Order Reduction Based on Semidefinite Programming

    Detta är en avhandling från Department of Automatic Control, Lund Institute of Technology, Lund University

    Författare :Aivar Sootla; [2012]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; model reduction; parameterized model reduction; nu-gap metric; semidefinite programming; frequency response matching.;

    Sammanfattning : The main topic of this PhD thesis is complexity reduction of linear time-invariant models. The complexity in such systems is measured by the number of differential equations forming the dynamical system. This number is called the order of the system. LÄS MER

  2. 2. Model Order Reduction with Rational Krylov Methods

    Detta är en avhandling från Stockholm : KTH

    Författare :K. Henrik A. Olsson; Axel Ruhe; Volker Mehrmann; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Model order reduction; dual rational Arnoldi; rational Krylov; moment matching; eigenvalue computation; stability analysis; heat exchanger model; MATHEMATICS Applied mathematics Numerical analysis; MATEMATIK Tillämpad matematik Numerisk analys;

    Sammanfattning : Rational Krylov methods for model order reduction are studied. A dual rational Arnoldi method for model order reduction and a rational Krylov method for model order reduction and eigenvalue computation have been implemented. It is shown how to deflate redundant or unwanted vectors and how to obtain moment matching. LÄS MER

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

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :Daniel Skoogh; Göteborgs universitet.; Gothenburg University.; [1998]
    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; sparse; iterative; parallel; 65F15; Arnoldi; eigenvectors; invert; model; 65F50; 93B40; Krylov; shift; 93A30; linear systems; passive; 65F10; reduction; 65Y05;

    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. 4. Model Reduction Using Semidefinite Programming

    Detta är en avhandling från Department of Automatic Control, Lund Institute of Technology, Lund University

    Författare :Aivar Sootla; [2009]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; semidefinite programming; model reduction; convex optimization;

    Sammanfattning : In this thesis model reduction methods for linear time invariant systems are investigated. The reduced models are computed using semidefinite programming. Two ways of imposing the stability constraint are considered. However, both approaches add a positivity constraint to the program. LÄS MER

  5. 5. Effective Techniques for Stateless Model Checking

    Detta är en avhandling från Department of Automatic Control, Lund Institute of Technology, Lund University

    Författare :Stavros Aronis; Konstantinos Sagonas; Bengt Jonsson; Patrice Godefroid; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Concurrent; Parallel; Model Checking; Partial Order Reduction; Dynamic Partial Order Reduction; DPOR; Sleep Set Blocking; Source Sets; Source DPOR; Wakeup Trees; Optimal DPOR; Observers; Verification; Bounding; Exploration Tree Bounding; Testing; Erlang; Concuerror; Protocol; Chain Replication; CORFU; Computer Science; Datavetenskap;

    Sammanfattning : Stateless model checking is a technique for testing and verifying concurrent programs, based on exploring the different ways in which operations executed by the processes of a concurrent program can be scheduled. The goal of the technique is to expose all behaviours that can be a result of scheduling non-determinism. LÄS MER