Sökning: "triangular sylvester equation"

Hittade 3 avhandlingar innehållade orden triangular sylvester equation.

  1. 1. Improving the efficiency of eigenvector-related computations

    Författare :Angelika Beatrix Schwarz; Lars Karlsson; Bo Kågström; Carl Christian Kjelgaard Mikkelsen; Miroslav Tůma; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; high-performance computing; standard non-symmetric eigenvalue problem; triangular Sylvester equation; tiled algorithms; task parallelism;

    Sammanfattning : An effective strategy in dense linear algebra is the design of algorithms as tiled algorithms. Tiled algorithms that express the bulk of the computation as matrix-matrix operations (level-3 BLAS) have proven successful in achieving high performance on cache-based architectures. LÄS MER

  3. 2. Towards efficient overflow-free solvers for systems of triangular type

    Författare :Angelika Beatrix Schwarz; Lars Karlsson; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; datalogi;

    Sammanfattning : Triangular linear systems are fundamental in numerical linear algebra. A triangular linear system has a straight-forward and efficient solution strategy, namely forward substitution for lower triangular systems and backward substitution for upper triangular systems. LÄS MER

  4. 3. Algorithms and Library Software for Periodic and Parallel Eigenvalue Reordering and Sylvester-Type Matrix Equations with Condition Estimation

    Författare :Robert Granat; Bo Kågström; Isak Jonsson; Volker Mehrmann; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; periodic eigenvalue problems; product eigenvalue problems; periodic Schur form; periodic eigenvalue reordering; periodic eigenspaces; parallel algorithms; Sylvester-type matrix equations; parallel eigenvalue reordering; condition estimation; Computer science; Datavetenskap;

    Sammanfattning : This Thesis contains contributions in two different but closely related subfields of Scientific and Parallel Computing which arise in the context of various eigenvalue problems: periodic and parallel eigenvalue reordering and parallel algorithms for Sylvestertype matrix equations with applications in condition estimation.Many real world phenomena behave periodically, e. LÄS MER