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 167 for “"Sparse matrices"”.

  1. Bandwidth Minimization for Sparse Matrices

    <p>A short survey of recent developments in sparse matrix techniques is presented in this project. One of the problems in this area is concerned with bandwidth reduction. Several algorithms for finding symmetric row and column permutations for a given sparse symmetric matrix, such that the …

    mcmaster Repository record for Bandwidth Minimization for Sparse Matrices (opens in a new tab)

  2. Processing graphs and sparse matrices efficiently

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-05-01

    uiuc Repository record for Processing graphs and sparse matrices efficiently (opens in a new tab)

  3. External Memory Algorithms for Factoring Sparse Matrices

    We consider the factorization of sparse symmetric matrices in the context of a two-layer storage system: disk/core. When the core is sufficiently large the factorization can be performed in-core. In this case we must read the input, compute, and write the output, in this sequence. On the other …

    odu Repository record for External Memory Algorithms for Factoring Sparse Matrices (opens in a new tab)

  4. Inversion of sparse matrices using Monte Carlo methods

    … of the inverse of well-conditioned, large, sparse, and positive definite matrices. In this research, we have explored some aspects of the inversion of such matrices. For this class of matrices, it has been shown that desired elements of their inverse may be evaluated with desired accuracy …

    iastate Repository record for Inversion of sparse matrices using Monte Carlo methods (opens in a new tab)

  5. An Object-Oriented Algorithmic Laboratory for Ordering Sparse Matrices

    … known NP-hard problems that have applications in sparse matrix computations: the envelope/wavefront reduction problem and the fill reduction problem. Envelope/wavefront reducing orderings have a wide range of applications including profile and frontal solvers, incomplete factorization …

    odu Repository record for An Object-Oriented Algorithmic Laboratory for Ordering Sparse Matrices (opens in a new tab)

  6. Ordering Strategies for Sparse Matrices in Chemical Process Simulation

    … of such machines to solve the large, sparse matrices which arise from such problems. Since the row and column ordering of these matrices has a direct impact on the efficiency of frontal methods, this work has developed a number of ordering strategies specifically designed for use with …

    uiuc Repository record for Ordering Strategies for Sparse Matrices in Chemical Process Simulation (opens in a new tab)

  7. Randomized algorithms for revealing hidden structure in data-sparse matrices

    … of efficient algorithms for handling large dense matrices that have rank-structure. To simplify slightly, this means that they can be tessellated into O(N) submatrices in such a way that each submatrix is either small, or of numerically low rank. A matrix that is rank-structured can be stored …

    texas Repository record for Randomized algorithms for revealing hidden structure in data-sparse matrices (opens in a new tab)

  8. Fast Direct Solvers and Effective Preconditioners for Large-Scale Sparse Matrices

    … solvers and efficient preconditioners mainly for sparse matrices. Hierarchical low-rank approximations such as hierarchically semiseparable (HSS) representation play a vital role in the development of these methods. As have been explored by many pioneers, hierarchical low-rank approximations can …

    purdue-thes Repository record for Fast Direct Solvers and Effective Preconditioners for Large-Scale Sparse Matrices (opens in a new tab)

  9. Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework

    Applications of matrices are found in most scientific fields, such as physics, computer graphics, numerical analysis, etc. The high applicability of matrix algorithms and representations make them an important component in any parallel programming language, therefore matrix frameworks are a …

    tamu Repository record for Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework (opens in a new tab)

  10. Developing A New Storage Format And A Warp-Based Spmv Kernel For Configuration Interaction Sparse Matrices On The Gpu

    … as multiple excited states. The CI matrix is a sparse matrix, and the bigger the CI matrix, the more electron correlation can be captured. However, due to the large size of the CI sparse matrix that is involved in CI computations, a good amount of the time spent on the eigenvalue computations is …

    nodak Repository record for Developing A New Storage Format And A Warp-Based Spmv Kernel For Configuration Interaction Sparse Matrices On The Gpu (opens in a new tab)

  11. 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 …

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

  12. Grammar-Based Representations of Large Sparse Binary Matrices

    Large sparse matrices representation is a fundamental problem in big data processing and analysis. In some applications dealing with large sparse matrices, the I/O of these sparse matrices is the bottleneck of the whole system. To reduce the requirement of memory bandwidth in this scenario, it is …

    waterloo Repository record for Grammar-Based Representations of Large Sparse Binary Matrices (opens in a new tab)

  13. Sequential and data-parallel implementations of a Lanczos algorithm for the singular value decomposition

    … value decomposition of large unstructured sparse matrices. Our intent is to produce robust numerical software in C that is portable across a variety of high-performance workstations such as the IBM RS/6000, DEC 5000-200, Sun Sparcstation 2, and Apple Macintosh Ilfx. Furthermore, this …

    ut-knoxville Repository record for Sequential and data-parallel implementations of a Lanczos algorithm for the singular value decomposition (opens in a new tab)

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

    … 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)

  15. Multiprocessor sparse SVD algorithms and applications

    … the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly consider the SVD of unstructured sparse matrices in which the number of rows may be substantially larger or smaller than the number of columns. On vector machines, considerable …

    uiuc Repository record for Multiprocessor sparse SVD algorithms and applications (opens in a new tab)

  16. Atsitiktinių labai retų matricų spektro tyrimas /

    Firstly, the concept of the sparse and very sparse matrices was introduced in this thesis. The methods used in very sparse matrices theory were thoroughly studied and the results were illustrated by examples. The analysis also focused on the selection method for very sparse random matrices. This …

    vilnius Repository record for Atsitiktinių labai retų matricų spektro tyrimas / (opens in a new tab)

  17. Atsitiktinių labai retų matricų spektro tyrimas /

    Firstly, the concept of the sparse and very sparse matrices was introduced in this thesis. The methods used in very sparse matrices theory were thoroughly studied and the results were illustrated by examples. The analysis also focused on the selection method for very sparse random matrices. This …

    vilnius Repository record for Atsitiktinių labai retų matricų spektro tyrimas / (opens in a new tab)

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

    … consume large amounts of data, realized as matrices. Matrices are common in many applications, such as system analysis, image processing, machine learning, and many other scientific and engineering domains. The sparse matrix is a typical matrix topology that plagues large and complex …

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

  19. Sparsity and decoupling in load power flow analysis

    … of operating on and computer storage of large sparse matrices are investigated. Methods to efficiently order, store and work with large sparse matrices are discussed and demonstrated. The general acceptance and use of Newton's Method by power engineers for Load Flow Studies has resulted in many …

    njit Repository record for Sparsity and decoupling in load power flow analysis (opens in a new tab)

Page 1 of 9