Pages that link to "Item:Q1077125"
From MaRDI portal
The following pages link to Communication complexity of the Gaussian elimination algorithm on multiprocessors (Q1077125):
Displaying 7 items.
- Parallel solution of Fredholm integral equations of the second kind by orthogonal polynomial expansions (Q1122352) (← links)
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- Parallel direct methods for solving banded linear systems (Q1820554) (← links)
- Optimal scheduling algorithms for parallel Gaussian elimination (Q1823614) (← links)
- Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors (Q1823615) (← links)
- The implementation of a generalized cross validation algorithm using deflation techniques for linear systems (Q1917400) (← links)
- An optimal schedule for Gaussian elimination on an MIMD architecture (Q2570029) (← links)