Sparse Matrix Computations on Parallel Processor Arrays

DOI10.1137/0914033zbMath0783.65019OpenAlexW1966476169MaRDI QIDQ4693189

Andrew T. Ogielski, William Aiello

Publication date: 10 March 1994

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/24361da816f378e21c2140946100b882281d14f9

zbMATH Keywords

parallel algorithmsload balancingrandomized algorithmslarge sparse matricesparallel computerdistributed data structures

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs ⋮ A hybrid GMRES/LS-Arnoldi method to accelerate the parallel solution of linear systems ⋮ Site-percolation threshold of carbon nanotube fibers--fast inspection of percolation with Markov stochastic theory ⋮ A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges

This page was built for publication: Sparse Matrix Computations on Parallel Processor Arrays