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 9 of 9 for “"Matrices -- Data processing"”.

  1. A computational study of sparse matrix storage schemes

    … of linear algebra operations for sparse matrices on modern high performance computing system is often constrained by the available memory bandwidth. We are interested in sparse matrices whose sparsity pattern is unknown. In this thesis, we study the efficiency of major storage schemes of …

    lethbridge Repository record for A computational study of sparse matrix storage schemes (opens in a new tab)

  2. An MPI-based 2D data redistribution library for dense arrays

    In HPC, data redistributions (reorganizations) are used in parallel applications to improve performance and/or provide data-locality compatibility with sequences of parallel operations. Data reorganization refers to changing the logical and physical arrangement of data (such as dense arrays or …

    utc Repository record for An MPI-based 2D data redistribution library for dense arrays (opens in a new tab)

  3. A new general purpose systolic array for matrix computations

    … the arrays. - It allows for maximum overlaps of processing between consecutive computations, thereby increasing system throughput.

    portland-state Repository record for A new general purpose systolic array for matrix computations (opens in a new tab)

  4. An improved implementation of sparsity detection of sparse derivative matrices

    … and represent sparsity of unknown Jacobian matrices. Automated sparsity detection algorithms find an optimal or near-optimal solution, which reduces time and space complexity for large scale data. Our proposed approach efficiently generates symmetric pattern utilizing band matrix and reduces …

    lethbridge Repository record for An improved implementation of sparsity detection of sparse derivative matrices (opens in a new tab)

  5. The Linear Least Squares Problem of Bundle Adjustment

    A method is described for finding the least squares solution of the overdetermined linear system that arises in the photogrammetric problem of bundle adjustment of aerial photographs. Because of the sparse, blocked structure of the coefficient matrix of the linear system, the proposed method is …

    unf Repository record for The Linear Least Squares Problem of Bundle Adjustment (opens in a new tab) Download PDF for The Linear Least Squares Problem of Bundle Adjustment (opens in a new tab)

  6. On diagonally structured matrix computation

    … The proposed storage scheme handles dense matrices and matrices with special structures such as banded, symmetric in a uniform manner. Test results from numerical experiments with OpenMP implementation are promising. We also show that, using our diagonal framework, Java native arrays can …

    lethbridge Repository record for On diagonally structured matrix computation (opens in a new tab)

  7. A Computational study of sparse or structured matrix operations

    … of a subset of matrix operations, where the matrices are dense, sparse, or structured in Java. We implement a subset of BLAS operations in Java and compare their performance with standard data structures Compressed Row Storage (CRS) and Java Sparse Array (JSA) for dense and sparse structured …

    lethbridge Repository record for A Computational study of sparse or structured matrix operations (opens in a new tab)

  8. Implementation of Inversion Algorithms in Reconfigurable Systolic Arrays

    … architectures containing orthogonally connected processing elements capable of few instructions multiple data have allowed for new algorithms to be implemented. Two algorithms are examined that rely on the triangularization methods for matrix inversion. One can be applied to the general …

    ucf Repository record for Implementation of Inversion Algorithms in Reconfigurable Systolic Arrays (opens in a new tab)