Sökning: "computer algebra"

Visar resultat 1 - 5 av 22 uppsatser innehållade orden computer algebra.

  1. 1. A geometric approach to calculating the limit set of eigenvalues for banded Toeplitz matrices

    Master-uppsats, Lunds universitet/Matematik LTH

    Författare :Teodor Bucht; [2023]
    Nyckelord :Toeplitz matrices; Banded Toeplitz matrices; Limit set; Eigenvalues; Mathematics and Statistics;

    Sammanfattning : This thesis is about the limiting eigenvalue distribution of n × n Toeplitz matrices as n → ∞. The two classical questions we want to answer are: what is the limit set of the eigenvalues, and what is the limiting distribution of the eigenvalues. Our main result is a new approach to calculate the limit set Λ(b) for a Laurent polynomial b, i.e. LÄS MER

  3. 2. Persistent Homology : A Modern Application of Algebraic Topology in Data Analysis

    Master-uppsats,

    Författare :Staffan Leijnse; [2023]
    Nyckelord :Data; Algebraic Topology; Persistent; Homology; Graded; Representation;

    Sammanfattning : Topological data analysis emerged as a field in the 2000s and has proven very useful for examining the shape of data sets. Using persistent homology as their main methodology researchers has succesfully applied the theory presented in this paper to study as varied subjects as robot motion, brain connectivity, network theory, finger print analysis and computer vision. LÄS MER

  4. 3. Benchmarking linear-algebra algorithms on CPU- and FPGA-based platforms

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Omar Askar Vergara; Karl Törnblom Bartholf; [2023]
    Nyckelord :FPGA; OpenCL; PolyBench; Cholesky; Durbin;

    Sammanfattning : Moore’s law is the main driving factor behind the rapid evolution of computers that has been observed in the past 50 years. Though the law is soon ending due to heat- and sizing-related issues. One solution to continuing the evolution is utilizing alternative computer hardware, where parallel hardware is especially interesting. LÄS MER

  5. 4. Language Theoretic Properties of Graph Extension Languages : An Investigation of Graph Extension Grammars with Context Matching and Logic

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Yannick Stade; [2022]
    Nyckelord :graph language; formal language; theoretical computer science;

    Sammanfattning : Graph extension grammars provide a way to define graph languages. They consist of a regular tree grammar and an algebra. The regular tree grammar generates trees, so-called derivation trees. Those are evaluated by the algebra into a set of graphs. LÄS MER

  7. 5. High-Performance Beamforming for Radar Technology : A Comparative Study of GPU Beamforming Algorithms

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Oscar Lindgren; [2022]
    Nyckelord :Accelerated signal processing software; Beamforming; Electronic warfare; Electromagnetic waves; Emitter identification; Radar technology; Accelererad signalbehandlingsmjukvara; Beamforming; Elektronisk krigsföring; Elektromagnetiska vågor; Sändaridentifikation; Radarteknologi;

    Sammanfattning : Radar technology is widely used in today´s society, whether it is the localisation and identification of aircraft in air traffic control systems, ships in harbour management systems, or the weather forecast presented on the news. In military applications, such as in fighter jets or missile lock-on systems, the speed at which the radar processes incoming data is essential to ensure a successful outcome. LÄS MER