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 19 of 19 for “"Sparse linear algebra"”.
-
Parallel Sparse Linear Algebra for Homotopy Methods
… homotopy methods are used to solve difficult nonlinear systems of equations by tracking the zero curve of a homotopy map. Homotopy curve tracking involves solving a sequence of linear systems, which often vary greatly in difficulty. In this research, a popular iterative solution tool, GMRES(k), …
-
Enhancing Sparse Data Processing through Energy-Efficient Heterogeneous Architectures
Efficiently processing sparse data is a significant challenge in many high-impact domains, including machine learning, graph analytics, and scientific computing. Sparse data representations, such as compressed sparse row (CSR), often suffer from substantial overheads during indexing and irregular …
-
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 …
-
Optimization of large scale iterative eigensolvers
Sparse matrix computations, in the form of solvers for systems of linear equations, eigenvalue problem or matrix factorizations constitute the main kernel in problems from fields as diverse as computational fluid dynamics, quantum many body problems, machine learning and graph analytics. Iterative …
-
Incremental smoothing and mapping
… of the estimation problem, and therefore avoids linearization errors. iSAM uses methods from sparse linear algebra to provide an efficient incremental solution. In particular, iSAM deploys a direct equation solver based on QR matrix factorization of the naturally sparse smoothing information …
-
A Feasibility Problem Approach For Reachable Set Approximation
… a suitable problem definition we achieve a sparse linear algebra structure within the interior point method which is utilized to speed up the algorithm significantly. The whole algorithm design aims for an efficient execution on parallel CPU hardware and SIMD architecture as well. As an …
-
An Energy-Stable Mixed CG-DG Scheme for a Full SHLIOMIS Phase Field Model of Two-Phase Ferrofluid Flows
… semi-explicit with stabilization. The coupled nonlinear system is solved by a block-Gauss-Seidel Picard iteration. The target model is proved to satisfy a continuous energy law. The fully discrete scheme is proved to satisfy the corresponding discrete free-energy law. Stability is shown to be …
-
Advanced System-Scale and Chip-Scale Interconnection Networks for Ultrascale Systems
… lattice-Boltzmann, particle-in-cell, sparse linear algebra, particle mesh ewald, and FFT-based solvers. This thesis presents an introduction to the fit-tree approach for designing network infrastructure that is tailored to application requirements. A fit-tree minimizes the component …
-
Analytical Modeling and Efficient Implementation for Specialized Hardware Acceleration of Sparse Applications
Sparse linear algebra (SLA) underpins a wide range of critical applications, including data analytics, graph processing, deep learning, and transformers. In light of the growing footprints of sparse processing and diminishing benefits of generalpurpose scaling, recent years have seen an active body …
-
ParU: A Task Based Parallel Multifrontal and Unsymmetric Sparse LU Factorization
We are introducing a new sparse direct solver with a parallel multifrontal algorithm. The algorithm is designed by borrowing the symbolic analysis phase and some ideas from UMFPACK. UMFPACK is a part of the SuiteSparse package and appears as a built-in routine in MATLAB. Although the general idea …
-
Compiler and Runtime Optimization of Computational Kernels for Irregular Applications
… allows users to specify graph algorithms using (sparse) linear algebra building blocks. Even though GraphBLAS libraries usually consist of highly hand-optimized building blocks, GraphBLAS libraries provide limited or no support for inter-kernel optimization. In this dissertation, we investigate …
-
Development of efficient and low-scaling coupled cluster and algebraic diagrammatic construction methods
… of increasing accuracy and cost. Coupled cluster linear response (LR-CC) and algebraic diagrammatic construction (ADC) scheme for the polarization propagator are among the most accurate and hence successful methods for the in silico study of excited state properties. However, the steep scaling in …
-
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. …
-
Bridging the Gap between Sparse Matrix Computation and Graph Models
… network analytics, and scientific computing. In sparse matrices, the majority of values are zeros. Traditional methods of storing and processing dense data are unsuitable for the new nature of sparse data, as they end up wasting storage and compute on zeros. Hence, a variety of sparse data …
-
On the Efficient Mapping and Optimization of Irregular Workloads for Graphics Processing Units
… NVIDIA H100 GPU, design adaptations applied to sparse triangular solves and runtime adaptations applied to irregular set intersections deliver mean speedups of 4.6× and 1.6×, respectively, over state-of-the-art GPU implementations. Beyond the evaluation of the performance gains achieved through …
-
Algorithmic approaches to enhancing and exploiting application-level error tolerance
As late-CMOS process scaling leads to increasingly variable circuits/logic and as most post-CMOS technologies in sight appear to have largely stochastic characteristics, hardware reliability has become a first-order design concern. To make matters worse, emerging computing systems are becoming …