Sökning: "triangular matrix"

Visar resultat 1 - 5 av 7 uppsatser innehållade orden triangular matrix.

  1. 1. A C++ Matrix library for computing the Gateaux derivative of the Fermi-Dirac operator

    Kandidat-uppsats, Uppsala universitet/Avdelningen för beräkningsvetenskap

    Författare :William Samuelsson; [2023]
    Nyckelord :C ; Quantum Chemistry; Matrix functions;

    Sammanfattning : Computing the Fermi-Dirac operator is done through recursive polynomial expansions, using the SP2 and SP2 Acc algorithms. The Gateaux derivative is computed for both schemes by mapping the zeroth and first order matrices onto a block upper triangular matrix, which is implemented in Python using Numpy arrays to store full matrices and in C++ by first constructing a basic matrix library to use as blocks in a later created block upper triangular matrix library which only directly references two blocks in a 2 x 2 block matrix. LÄS MER

  3. 2. Beyond 5G Baseband Processing on Epiphany Architecture

    Master-uppsats, Högskolan i Halmstad/Akademin för informationsteknologi

    Författare :Yash Sawant; [2021]
    Nyckelord :;

    Sammanfattning : Massive Multiple Input Multiple Output (mMIMO) is a key technology for wireless communications. The concept behind the technology is using a large number of antennas at the base station which servers multiple user equipment simultaneously. LÄS MER

  4. 3. Ensemble Green's Function Theory for Interacting Electrons with Degenerate Ground States

    Master-uppsats, Lunds universitet/Matematisk fysik; Lunds universitet/Fysiska institutionen

    Författare :Erik Linnér; [2019]
    Nyckelord :Green s function; Degeneracy; Density matrix; Ensemble; GW; Zero-temperature; Finite-temperature; Hubbard model; Two-dimensional harmonic oscillator; Ising model; Hydrogen-like model; Physics and Astronomy;

    Sammanfattning : An ensemble Green's function theory for many-electron systems with degenerate ground states, based on the von Neumann density matrix formalism, is proposed. The formalism is constructed without an assumption of an adiabatic connection. An ensemble analogue of Hedin's equations and the GW Approximation (GWA) is constructed. LÄS MER

  5. 4. One Million-Point FFT

    Master-uppsats, Linköpings universitet/Datorteknik

    Författare :Tobias Mellqvist; Hans Kanders; [2018]
    Nyckelord :Large FFT; FFT; Cooley–Tukey; SDF; Binary tree; FPGA; triangular matrix;

    Sammanfattning : The goal of this thesis has been to implement a hardware architecture for FPGA that calculates the fast Fourier transform (FFT) of a signal using one million samples. The FFT has been designed using a single-delay feedback architecture withrotators and butterflies, including a three-stage rotator with one million rotation angles. LÄS MER

  7. 5. Parallelizing the Critical Path

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

    Författare :Linda Sandström; [2016]
    Nyckelord :;

    Sammanfattning : For many parallel matrix computations the execution time is determinedby the length of the critical path. The baseline approach used to reduce the execution time is to adjust the task granularity. If the tasks are made smaller, the length of the critical path will decrease and by extension reduce the execution time for the computation. LÄS MER