scientific article; zbMATH DE number 1218794

zbMATH Open0908.65022MaRDI QIDQ4216989

Author name not available (Why is that?)

Publication date: 8 March 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

sparse matricessparse matrix multiplicationmesh-connected arraysreconfigurable busses

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (6)

An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh ⋮ Title not available (Why is that?) ⋮ Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout ⋮ Scaling multiple addition and prefix sums on the reconfigurable mesh. ⋮ Title not available (Why is that?) ⋮ Parallel Sparse LU Decomposition on a Mesh Network of Transputers

Recommendations

• Title not available (Why is that?) 👍 👎
• An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh 👍 👎
• Processor-efficient sparse matrix-vector multiplication 👍 👎
• Fast sparse matrix multiplication 👍 👎
• Sparse Matrix-Vector Multiplication on GPGPUs 👍 👎
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS 👍 👎
• Sparse Matrix Computations on Parallel Processor Arrays 👍 👎
• Algorithms – ESA 2004 👍 👎

This page was built for publication:

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