Sökning: "Structure preserving algorithms"

Visar resultat 1 - 5 av 12 avhandlingar innehållade orden Structure preserving algorithms.

  1. 1. Symplectic methods for Hamiltonian isospectral flows and 2D incompressible Euler equations on a sphere

    Författare :Milo Viviani; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Fluid dynamics; Symplectic methods; Isospectral flows; Geometric integration; Hamiltonian systems; Structure preserving algorithms; Euler equations; Lie–Possion systems; Fluid dynamics.;

    Sammanfattning : The numerical solution of non-canonical Hamiltonian systems is an active and still growing field of research. At the present time, the biggest challenges concern the realization of structure preserving algorithms for differential equations on infinite dimensional manifolds. Several classical PDEs can indeed be set in this framework. LÄS MER

  3. 2. Symplectic methods for isospectral flows and 2D ideal hydrodynamics

    Författare :Milo Viviani; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Symplectic methods; Fluid dynamics; Integrability theory; Euler equations; Lie--Possion systems; Isospectral flows; Geometric integration; Structure preserving algorithms; Hamiltonian systems;

    Sammanfattning : The numerical solution of non-canonical Hamiltonian systems is an active and still growing field of research. At the present time, the biggest challenges concern the realization of structure preserving algorithms for differential equations on infinite dimensional manifolds. LÄS MER

  4. 3. Algorithms for aggregate information extraction from sequences

    Författare :Fredrik Bengtsson; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : In this thesis, we propose efficient algorithms for aggregate information extraction from sequences and multidimensional arrays. The algorithms proposed are applicable in several important areas, including large databases and DNA sequence segmentation. LÄS MER

  5. 4. Regular Model Checking

    Författare :Marcus Nilsson; Bengt Jonsson; Parosh Aziz Abdulla; Kim Larsen; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal methods; model checking; verification; regular sets; Computer science; Datavetenskap;

    Sammanfattning : A major current challenge in the area of program verification is to extend its applicability to infinite-state systems. A system can be infinite-state because it operates on unbounded data structures, such as queues, stacks, integers, etc., or because its description is parameterized by the number of components inside the system. LÄS MER

  7. 5. Structured Model Reduction and its Application to Power Systems

    Författare :Christopher Sturk; Henrik Sandberg; Olof Samuelsson; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : Many of today’s engineering systems have a network structure. Consider for instance power systems, where multiple grids of different geographical coverage are interconnected to form larger grids, a set of vehicles moving in formation or distributed control systems, where several controllers act locally with limited information. LÄS MER