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 20 of 286 for “"sparse matrix"”.
-
Sparse matrix spaces
… zero, or an arbitrary real number. We call them sparse matrix spaces, abbreviated SMS, and examine under what conditions they contain matrices for which all eigenvalues have strictly negative real parts. We call an SMS with this property stable. We start by reviewing the necessary background from …
-
Transforming Sparse Matrix Computations
Sparse matrix computations are at the heart of many scientific applications and data analytics codes. The performance and memory usage of these codes depend heavily on their use of specialized sparse matrix data structures that only store the nonzero entries. However, such compaction is done using …
-
Sparse Matrix Belief Propagation
We propose sparse-matrix belief propagation, which executes loopy belief propagation in Markov random fields by replacing indexing over graph neighborhoods with sparse-matrix operations. This abstraction allows for seamless integration with optimized sparse linear algebra libraries, including those …
-
Sparse matrix-vector multiplication by specialization
… in the very common numerical procedure of sparse matrix-vector multiplication, in the case where a single matrix is to be multiplied by many vectors, is explored. The main objective is the evaluation of the speed-ups that can be obtained with program specialization without considering the …
-
Modeling speedup in parallel sparse matrix factorization
… attempt to explain the observed performance of sparse matrix factorization algorithms on parallel computers. In particular, we examine whether the disappointing performance of these algorithms is due to insufficient parallelism in the problem or to the architectural characteristics of existing …
-
On low-rank plus sparse matrix sensing
<p>Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix is a flexible model capturing global and local features in data, and is the foundation of robust principal component analysis (Candès et al., 2011). This thesis is concerned with <em>low-rank plus sparse matrix sensing</em> …
-
Omics Module Detection via Sparse Matrix Decomposition
… and previous work has identified them through sparse matrix decomposition techniques such as sparse principal components analysis. To determine how different parts of the genome work together, we present methods to extend functional modules and identify variables that influence an outcome …
-
Finding Reusable Modules Using Sparse Matrix Decompositions
… systems are represented by a presence-absence matrix, whose columns represent conditions and whose rows represent elements. This matrix is then decomposed into a product of two matrices, using a stochastic gradient descent algorithm, one of which represents the compositions of modules, and the …
-
A quantum computer amenable sparse matrix equation solver
… we study problems involving the solution of matrix equations, for which there currently exists no efficient, general quantum procedure. We develop a generalization of the Harrow/Hassidim/Lloyd algorithm by providing an alternative unitary for eigenphase estimation. This unitary, which we have …
-
Tuning Sparse Matrix Kernel Performance via Lightweight Signatures
This dissertation introduces lightweight sparse-matrix pattern and occupancy signatures for automatic input-dependent tiling of sparse kernels such as sparse-dense matrix multiplication (SpMM), sampled dense-dense matrix multiplication (SDDMM), etc. Sparse matrix kernels are typically bandwidth …
-
Direct sparse matrix methods for interior point algorithms.
… algorithms. It focuses on applications of direct sparse matrix methods to sparse symmetric positive definite systems of linear equations on scalar computers and vector supercomputers. The most computationally intensive step in each iteration of any interior point algorithm is the numerical …
-
Structure-based Optimizations for Sparse Matrix-Vector Multiply
… OSF and PBR, to improve the performance of Sparse Matrix-vector Multiply (SMVM) kernels, which dominate the runtime of iterative solvers for systems of linear equations. SMVM computations that use sparse formats typically achieve only a small fraction of peak CPU speeds because they are …
-
A computational study of sparse matrix storage schemes
The efficiency 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 …
-
Sparse matrix-vector multiplication kernels on the Cray T3D
<p>In this thesis we examine sparse matrix-vector multiplication algorithms for massively- parallel computers such as the CRAY T3D. Performance results on a 256-processor CRAY T3D are presented along with a detailed analysis of each algorithm's computational complexity. The specific sparse …
-
Optimized Sparse Matrix Operations and Hardware Implementation using FPGA
The increasing importance of sparse connectivity representing real-world data has been exemplified by the recent work in areas of graph analytics, machine language, and high-performance. Sparse matrices are the critical component in many scientific computing applications, where increasing the …
-
Cache-Conscious Sparse Matrix Dense Matrix Multiplication on GPUs
… and graph-structured data have established sparse matrix–dense matrix multiplication (SpMM) as a fundamental kernel—particularly in graph neural networks (GNNs). Modern GPUs, with their massive parallelism and high-bandwidth memory, offer immense potential for accelerating these workloads. …
-
ACCELERATION OF SPARSE MATRIX MULTIPLICATION USING BIT-SERIAL ARITHMETIC
… inference requires the multiplication of large, sparse matrices. We argue that direct spatial implementation of these fixed matrices minimizes the work per- formed in the computation, and allows for significant reduction in latency and power through constant propagation and logic minimization. …
-
Optimization by runtime specialization for sparse matrix-vector multiplication
… the potential for obtaining speed-ups for sparse matrix-dense vector multipli- cation using runtime specialization, in the case where a single matrix is to be multiplied by many vectors. We experiment with five methods involving run-time specialization with parallelization, comparing them …
-
On implementing sparse matrix-vector multiplication on intel platform
Sparse matrix-vector multiplication, SpMV, can be a performance bottle-neck in iterative solvers and algebraic eigenvalue problems. In this thesis, we present our sparse matrix compressed chunk storage format (CCF) and SpMV CCF kernel that realizes high performance on Intel Xeon multicore and Phi …
Page 1 of 15