Avancerad sökning

Hittade 4 avhandlingar som matchar ovanstående sökkriterier.

  1. 1. 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

  3. 2. Exercising Mathematical Competence: Practising Representation Theory and Representing Mathematical Practice

    Författare :Anna Ida Säfström; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Mathematical competence; exercising competencies; young children; whole number arithmetic; tertiary level; proving; highest weight representation; tensor product decomposition; skew-symmetric matrix; moment map; infinite dimensional unitary representation; highest weight representation;

    Sammanfattning : This thesis assembles two papers in mathematics and two papers in mathematics education. In the mathematics part, representation theory is practised. Two Clebsch-Gordan type problems are addressed. LÄS MER

  4. 3. Subspace Computations via Matrix Decompositions and Geometric Optimization

    Författare :Lennart Simonsson; Axel Ruhe; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; Numerical analysis; Numerisk analys;

    Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER

  5. 4. Riemann-Hilbert methods in general relativity and random matrix theory

    Författare :Julian Mauersberger; Jonatan Lenells; Tom Claeys; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis focuses on problems in general relativity and random matrix theory that can be solved by means of Riemann-Hilbert techniques. The first part of the thesis is dedicated to solving boundary value problems related to colliding plane waves in vacuum in general relativity. LÄS MER