Pages that link to "Item:Q5200261"
From MaRDI portal
The following pages link to Communication-optimal Parallel and Sequential Cholesky Decomposition (Q5200261):
Displaying 5 items.
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing (Q608851) (← links)
- The red-blue pebble game on trees and DAGs with large input (Q2097342) (← links)
- Solving a large scale radiosity problem on GPU-based parallel computers (Q2517421) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition (Q5009907) (← links)
