Pages that link to "Item:Q3336691"
From MaRDI portal
The following pages link to On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms (Q3336691):
Displayed 9 items.
- Tridiagonalization of band symmetric matrices for vector computers (Q917223) (← links)
- Complexity of dense-linear-system solution on a multiprocessor ring (Q1072340) (← links)
- Communication complexity of the Gaussian elimination algorithm on multiprocessors (Q1077125) (← links)
- Local uniform mesh refinement on loosely-coupled parallel processors (Q1113648) (← links)
- Parallel direct methods for solving banded linear systems (Q1820554) (← links)
- Solving elliptic partial differential equations on the hypercube multiprocessor (Q1822472) (← links)
- Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors (Q1823615) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) (← links)