Pages that link to "Item:Q4139687"
From MaRDI portal
The following pages link to Some Complexity Results for Matrix Computations on Parallel Processors (Q4139687):
Displaying 16 items.
- Complexity of dense-linear-system solution on a multiprocessor ring (Q1072340) (← links)
- Communication complexity of the Gaussian elimination algorithm on multiprocessors (Q1077125) (← links)
- Unconditionally stable concurrent procedures for transient finite element analysis (Q1078994) (← links)
- Solving structural mechanics problems on the CalTech hypercube machine (Q1084947) (← links)
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (Q1110310) (← links)
- Alternating sequential-parallel calculation of eigenvalues for symmetric matrices (Q1152685) (← links)
- Parallel computation and conflicts in memory access (Q1171382) (← links)
- The communication complexity of computing differentiable functions in a multicomputer network (Q1318701) (← links)
- Multiplicative circulant networks. Topological properties and communication algorithms (Q1364475) (← links)
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors (Q1823615) (← links)
- Parallel algorithms and architectures for matrix multiplication (Q1825597) (← links)
- Reconfigurable meshes and image processing (Q1898157) (← links)
- A survey of gossiping and broadcasting in communication networks (Q3795460) (← links)
- On the Parallel Evaluation of Dwba Integrals (Q4844588) (← links)
- COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA (Q5151295) (← links)
