Provably Efficient Algorithms for Numerical Tensor Algebra
<p> This thesis targets the design of parallelizable algorithms and communication-efficient parallel schedules for numerical linear algebra as well as computations with higher-order tensors. Communication is a growing bottleneck in the execution of most algorithms on parallel computers, which...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
University of California, Berkeley
2015
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=3686016 |