Visualizing Sparse Matrix Computations
نویسنده
چکیده
This paper describes ideas and tools that help with the visualization of sparse matrix computations. The paper uses the Sparse Matrix Manipulation System, an environment for handling sparse matrices of all types in a vy flexible manner via ASCII file interfaces. Two commands in this environment are ShowMalrix and ShowTree. The first illustrates the pattern of nonzeroes of a sparse matrix. The second illustrates dependencies among matrix elements. Other tools in the package are described, including tools for ordering, factoring and multiplying sparse matrices. This software environment is then used to study the effect of several recent ordering and partitioning algorithms for working with the sparse inverses of L and U . These new algorithms have been proposed as a means of enhancing the parallelism of sparse matrix computations. This paper illustrates in a graphic manner the effect of these algorithms on parallelism and fill-in.
منابع مشابه
Visualizing Sparse Filtrations
Over the last few years, there have been several approaches to building sparser complexes that still give good approximations to the persistent homology [5, 4, 3, 2, 1]. In this video, we have illustrated a geometric perspective on sparse filtrations that leads to simpler proofs, more general theorems, and a more visual explanation. We hope that as these techniques become easier to understand, ...
متن کاملCAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS
In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...
متن کاملSparse Matrix Computations on Bulk Synchronous Parallel Computers
The Bulk Synchronous Parallel (BSP) programming model is studied in the context of sparse matrix computations. As a case study, a BSP algorithm is developed for sparse Cholesky factorisation.
متن کاملSparse Matrix Computations on Bulk Synchronous Parallel Computers
The Bulk Synchronous Parallel (BSP) programming model is studied in the context of sparse matrix computations. As a case study, a BSP algorithm is developed for sparse Cholesky factorisation.
متن کاملBasic Sparse Matrix Computations on Massively Parallel Computers ∗
This paper presents a preliminary experimental study of the performance of basic sparse matrix computations on the CM-200 and the CM-5. We concentrate on examining various ways of performing general sparse matrix-vector operations and the basic primitives on which these are based. We compare various data structures for storing sparse matrices and their corresponding matrix – vector operations. ...
متن کامل