Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"matrix reordering"”.

  1. Recycling Preconditioners for Sequences of Linear Systems and Matrix Reordering

    … by rank-one updates. Properties of the system matrix are analyzed. We use Krylov subspace methods to solve these linear systems. Krylov subspace methods need a preconditioner to be efficient and robust. This causes the problem of computing a sequence of preconditioners corresponding to the …

    vt Repository record for Recycling Preconditioners for Sequences of Linear Systems and Matrix Reordering (opens in a new tab)

  2. Breadslice and Doughnut matrix reordering bijection algorithm for Green’s function calculation

    … to the non-tridiagonal nature of the Hamiltonian matrix that we need to invert to calculate Green’s function. Therefore we want to rearrange the entries of the matrix to obtain tridiagonality. To this end, in this article we will introduce an algorithm to reorder a Hamiltonian matrix for a four …

    reykjavik Repository record for Breadslice and Doughnut matrix reordering bijection algorithm for Green’s function calculation (opens in a new tab)

  3. Field-Programmable Gate Array-Based Accelerators for Sparse Banded Matrices

    … scientific and engineering domains. The sparse matrix is a typical matrix topology that plagues large and complex problems. Sparse matrices occur in systems with sparsely connected objects, such as in circuit analysis, graph theory, and deep neural networks. Using traditional storage and …

    texas-state Repository record for Field-Programmable Gate Array-Based Accelerators for Sparse Banded Matrices (opens in a new tab)

  4. A Framework for Grid Solvers

    … a computational grid without creating the sparse matrix explicitly at any stage of the solution process. This allows it to take advantage of additional information about the problem that is available within the grid data structure. Such an approach leads to an optimal parallel algorithm for matrix …

    uiuc Repository record for A Framework for Grid Solvers (opens in a new tab)