Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition

DOI10.1145/355791.355796zbMath0384.65016OpenAlexW2089437293WikidataQ127332713 ScholiaQ127332713MaRDI QIDQ4164723

Fred G. Gustavson

Publication date: 1978

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355791.355796

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (28)

AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods ⋮ Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures ⋮ Flyspeck II: The basic linear programs ⋮ Unnamed Item ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit ⋮ GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm ⋮ Finite strain plasticity, the stress condition and a complete shell model ⋮ Techniques for parallel manipulation of sparse matrices ⋮ Efficient parallel linear scaling method to get the response density matrix in all-electron real-space density-functional perturbation theory ⋮ Skew-polynomial-sparse matrix multiplication ⋮ An interior-point implementation developed and tuned for radiation therapy treatment planning ⋮ Continuous gap contact formulation based on the screened Poisson equation ⋮ Sparse givens resolution of large system of linear equations: applications to image reconstruction ⋮ Massively parallel sparse matrix function calculations with NTPoly ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A survey of direct methods for sparse linear systems ⋮ Advantages of static condensation in implicit compressible Navier-Stokes DGSEM solvers ⋮ Sparse matrix multiplication and triangle listing in the congested clique model ⋮ Bibliography on the evaluation of numerical software ⋮ Optimizing Sparse Matrix—Matrix Multiplication for the GPU ⋮ Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) ⋮ A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION ⋮ Hierarchical Orthogonal Factorization: Sparse Square Matrices

This page was built for publication: Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition