Some Complexity Results for Matrix Computations on Parallel Processors

DOI10.1145/322047.322057MaRDI QIDQ4139687zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(16)

• Complexity of dense-linear-system solution on a multiprocessor ring
• 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
• The semantics and complexity of parallel programs for vector computations. I: A case study using Ada
• Alternating sequential-parallel calculation of eigenvalues for symmetric matrices
• Parallel computation and conflicts in memory access
• The communication complexity of computing differentiable functions in a multicomputer network
• Multiplicative circulant networks. Topological properties and communication algorithms
• On the communication complexity of Lipschitzian optimization for the coordinated model of computation
• Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors
• Parallel algorithms and architectures for matrix multiplication
• Reconfigurable meshes and image processing
• A survey of gossiping and broadcasting in communication networks
• On the Parallel Evaluation of Dwba Integrals
• Computation of a determinant and a matrix product in cellular automata

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

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