Sökning: "matrix algorithms"

Visar resultat 1 - 5 av 131 avhandlingar innehållade orden matrix algorithms.

  1. 1. Studies in Efficient Discrete Algorithms

    Författare :DZMITRY SLEDNEU; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

    Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

  2. 2. Software tools for matrix canonical computations and web-based software library environments

    Författare :Pedher Johansson; Bo Kågström; Erik. Elmroth; Alan Edelman; Umeå universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Canonical structure; Jordan canonical form; controllability; StratiGraph; Matlab toolbox; Kronecker canonical form; matrix; matrix pencil; perturbation theory; closure hirerarchy; matrix stratification; control system; observability; Numerical analysis; Numerisk analys;

    Sammanfattning : This dissertation addresses the development and use of novel software tools and environments for the computation and visualization of canonical information as well as stratification hierarchies for matrices and matrix pencils. The simplest standard shape to which a matrix pencil with a given set of eigenvalues can be reduced is called the Kronecker canonical form (KCF). LÄS MER

  3. 3. Parallelization of dynamic algorithms for electronic structure calculations

    Författare :Anton G. Artemov; Emanuel H. Rubensson; Maya Neytcheva; Bo Kågström; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; parallelization; task-based programming; matrix algorithms; sparse matrices; inverse factorization; localized computations; density matrix methods; electronic structure calculations; Scientific Computing; Beräkningsvetenskap;

    Sammanfattning : The aim of electronic structure calculations is to simulate behavior of complex materials by resolving interactions between electrons and nuclei in atoms at the level of quantum mechanics. Progress in the field allows to reduce the computational complexity of the solution methods to linear so that the computational time scales proportionally to the size of the physical system. LÄS MER

  4. 4. Digital Hardware Aspects of Multiantenna Algorithms

    Författare :Fredrik Edman; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Beamforming; MIMO; FPGA; Implementation; Hardware; Matrix; Inversion; QR-decomposition; SVD; Capon; Signal processing; Signalbehandling; Electronics; Elektronik och elektroteknik; Elektronik; Telecommunication engineering; Telekommunikationsteknik; Electronics and Electrical technology;

    Sammanfattning : The field of wireless communication is growing rapidly, with new requirements for the next generation of mobile and wireless communications technology. In order to achieve the capacities needed for future wireless systems, the design and implementation of advanced communications techniques such as multiantenna systems is required. LÄS MER

  5. 5. Algorithms in data mining using matrix and tensor methods

    Författare :Berkant Savas; Lars Eldén; Lieven De Lathauwer; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; Numerical analysis; Numerisk analys;

    Sammanfattning : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. LÄS MER