Processor-efficient sparse matrix-vector multiplication

DOI10.1016/J.CAMWA.2003.06.009MaRDI QIDQ1767967zbMATH OpenOpenAlexFDO

Authors Lenwood S. Heath, Calvin J. Ribbens, Sriram Pemmaraju

Publication date 8 March 2005

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2003.06.009

zbMATH Keywords

algorithmssparse matricesmatrix-vector multiplicationsystolic arraysstaircase width

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical algorithms for specific classes of architectures (65Y10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 641555
• scientific article; zbMATH DE number 4066229
• Sparse Matrix Computations on Parallel Processor Arrays
• Parallel solution of linear systems with striped sparse matrices
• Parallel sparse matrix vector multiply software for matrices with data locality

Cites work

• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 1069171 (Why is no real title available?)
• scientific article; zbMATH DE number 819139 (Why is no real title available?)
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• A decomposition theorem for partially ordered sets
• A framework for run-time reconfigurable systems
• A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• Block matrix multiplication and lu factorisation systolic arrays
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Determination of Stripe Structures for Finite Element Matrices
• ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
• Laying Out Graphs Using Queues
• Minimizing the bandwidth of sparse symmetric matrices
• Parallel solution of linear systems with striped sparse matrices
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Stack and Queue Layouts of Posets
• Systolic Sorting on a Mesh-Connected Network
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• Variable order panel clustering

Cited in

(19)

• Determination of Stripe Structures for Finite Element Matrices
• scientific article; zbMATH DE number 641555 (Why is no real title available?)
• Fast multiplication and sparse structures
• The Local Queue Number of Graphs with Bounded Treewidth
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
• On optimizing multiplications of sparse matrices
• Cache-efficient renumbering for vectorization
• Sparse matrix vector multiplication techniques on the IBM 3090 VF
• The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
• Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
• Sparse matrix multiplication package (SMMP)
• A Highly Efficient Implementation of Multiple Precision Sparse Matrix-Vector Multiplication and Its Application to Product-type Krylov Subspace Methods
• Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors
• The algorithms for FPGA implementation of sparse matrices multiplication
• FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method
• Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
• Parallel solution of linear systems with striped sparse matrices
• Cache oblivious sparse matrix multiplication
• scientific article; zbMATH DE number 1218794 (Why is no real title available?)

Describes a project that uses

Uses Software

• LAPACK
• SparseMatrix
• ILUM

This page was built for publication: Processor-efficient sparse matrix-vector multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767967)