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 15 of 15 for “"Matrix multiplication algorithms"”.

  1. Practical fast matrix multiplication algorithms

    Matrix multiplication is a core building block for numerous scientific computing and, more recently, machine learning applications. Strassen's algorithm, the original Fast Matrix Multiplication (FMM) algorithm, has long fascinated computer scientists due to its startling property of reducing the …

    texas Repository record for Practical fast matrix multiplication algorithms (opens in a new tab)

  2. Implementation Analysis of Strassen-Like Matrix Multiplication Algorithms Based on Block Decomposition

    Matrix multiplication is one of the most widely used operations in all computational fields of linear algebra. The complexity of the naive method for multiplying two n×n matrices requires O(n^3) arithmetic operations over the ring in which the matrix entries lie. In 1969, Strassen proposed the …

    waterloo Repository record for Implementation Analysis of Strassen-Like Matrix Multiplication Algorithms Based on Block Decomposition (opens in a new tab)

  3. Using machine learning to improve dense and sparse matrix multiplication kernels

    … about using machine learning to speed up dense matrix-matrix multiplication computations on a shared-memory computer architecture. We found that found basic loop-based matrix-matrix multiplication algorithms tied to a decision tree algorithm selector were competitive to using Intel's Math Kernel …

    iastate Repository record for Using machine learning to improve dense and sparse matrix multiplication kernels (opens in a new tab)

  4. Second-generation polyalgorithms for parallel dense-matrix multiplication

    … and Anthony Skjellum, includes fourteen dense matrix multiplication algorithms mapped onto two-dimensional process grids using the Message Passing Interface (MPI). This thesis' goal is to achieve optimized performance of parallel, dense linear algebra algorithms by varying the algorithm as a …

    utc Repository record for Second-generation polyalgorithms for parallel dense-matrix multiplication (opens in a new tab)

  5. Sparse matrix product implementation on field programmable gate arrays (EPGAS)

    If dense matrix multiplication algorithms are used with sparse matrices, they can result in a large number of redundant calculations, as numerous elements in sparse matrices are zero valued, thus available resources and time may be wasted. The algorithm discussed here aims to take advantage of the …

    njit Repository record for Sparse matrix product implementation on field programmable gate arrays (EPGAS) (opens in a new tab)

  6. High-performance matrix multiplication on Intel and FGPA platforms

    Matrix multiplication is at the core of high-performance numerical computation. Software methods of accelerating matrix multiplication fall into two categories. One is based on calculation simplification. The other one is based on increasing the memory access efficiency. Also matrix multiplication …

    njit Repository record for High-performance matrix multiplication on Intel and FGPA platforms (opens in a new tab)

  7. Privacy-preserving algorithm for outsourcing matrix multiplication based on Strassen’s algorithm

    Matrix Multiplication is a fundamental mathematical tool and basic problem with various applications in many domains such as data mining and data analyzing. Most of the time, limited-resource clients cannot afford the cost of heavy computations and needs to outsource the information and …

    ets-quebec Download PDF for Privacy-preserving algorithm for outsourcing matrix multiplication based on Strassen’s algorithm (opens in a new tab)

  8. L2 Minimal Algorithms

    … of interest represent (commutative, real) "matrix multiplication algorithms" or "bilinear algorithms." We explain how an algorithm's L2 minimal form might be thought of as optimally stable and as close to attaining the nuclear norm as possible. We demonstrate an algorithm "Strop" that has …

    cornell Repository record for L2 Minimal Algorithms (opens in a new tab)

  9. Algebraic Enhancements for Systolic Arrays

    … direction by presenting new efficient matrix multiplication algorithms and/or their systolic-array hardware architectures that increase performance-per-area by reducing the workload at the algebraic level, and thus by computing the same result from a re-arranged compute pattern …

    mcmaster Repository record for Algebraic Enhancements for Systolic Arrays (opens in a new tab)

  10. Design of efficient block-sparse data structures and associated tensor multiplications for applications in Cluster in Molecule electronic structure calculations

    … the Tile and the Tile Master to provide sparse matrix storage formats and efficient matrix multiplication algorithms benefiting from the high sparsity of the data. The Tile structure focuses on the efficiency of Sparse-matrix dense-matrix multiplication (SpMM), while the Tile Master emphasizes …

    waterloo Repository record for Design of efficient block-sparse data structures and associated tensor multiplications for applications in Cluster in Molecule electronic structure calculations (opens in a new tab)

  11. Methodologies for co-designing supercomputer-scale systems and deep learning software

    … for exploring the co-design space of parallel algorithms for large language models (LLMs) and potential supercomputer architectures during the early phases of the co-design process. On the algorithm side, we consider diverse implementation strategies, including data, tensor, and pipeline …

    gatech Repository record for Methodologies for co-designing supercomputer-scale systems and deep learning software (opens in a new tab)

  12. Supervised and unsupervised methods for learning representations of linguistic units

    … We also show how we can take advantage of fast matrix multiplication algorithms. In the second publication, we use existing unsupervised methods for word representation learning and combine these with semantic resources by learning representations for non-word objects like synsets and entities. …

    lmu-germany Repository record for Supervised and unsupervised methods for learning representations of linguistic units (opens in a new tab)

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

    … such as the polymath library, a library of many algorithms all of which implement parallel dense matrix multiplication algorithms with flexible data layouts. Using the reorganization mode of process grid shapes with constant total processes, we plan to observe the performance trends of the …

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

  14. High-Performance Software for Quantum Chemistry and Hierarchical Matrices

    … for scientific computing kernels, including matrix-multiplications, linear solves, and eigensolves, which accelerate applications including Gaussian processes and quantum chemistry simulations. Notably, we use preconditioned hierarchical matrices for the hyperparameter optimization and …

    gatech Repository record for High-Performance Software for Quantum Chemistry and Hierarchical Matrices (opens in a new tab)

  15. On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication

    Algorithms are the art of efficient computation: it is by the power of algorithms that solving problems becomes feasible, and that we may harness the power of computing machinery. Efficient algorithms translate directly to savings in resources, such as time, storage space, and electricity, and thus …

    aalto Repository record for On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication (opens in a new tab)