Some Complexity Results for Matrix Computations on Parallel Processors

DOI10.1145/322047.322057zbMath0364.68055OpenAlexW2152033109MaRDI QIDQ4139687

W. M. Gentleman

Publication date: 1978

Published in: Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (16)

Communication complexity of the Gaussian elimination algorithm on multiprocessors ⋮ Unconditionally stable concurrent procedures for transient finite element analysis ⋮ Solving structural mechanics problems on the CalTech hypercube machine ⋮ Reconfigurable meshes and image processing ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ The semantics and complexity of parallel programs for vector computations. I: A case study using Ada ⋮ On the Parallel Evaluation of Dwba Integrals ⋮ Alternating sequential-parallel calculation of eigenvalues for symmetric matrices ⋮ A survey of gossiping and broadcasting in communication networks ⋮ Parallel computation and conflicts in memory access ⋮ COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA ⋮ Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors ⋮ Parallel algorithms and architectures for matrix multiplication ⋮ On the communication complexity of Lipschitzian optimization for the coordinated model of computation ⋮ The communication complexity of computing differentiable functions in a multicomputer network ⋮ Complexity of dense-linear-system solution on a multiprocessor ring

This page was built for publication: Some Complexity Results for Matrix Computations on Parallel Processors