ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS
| dc.contributor.author | Rouse, Kathryn Margaret Zuhr | en_US |
| dc.date.accessioned | 2018-05-24T08:36:20Z | |
| dc.date.available | 2018-05-24T08:36:20Z | |
| dc.date.issued | 2018 | en_US |
| dc.description.abstract | Multi-dimensional arrays, or tensors, are fundamental objects in computational science for their ability to store multi-dimensional data and to encode bilinear forms. We will consider algorithms and applications of the CP and Tucker tensor decompositions, focusing our efforts on optimizing subroutines required to compute tensor decompositions. | en_US |
| dc.identifier.uri | https://wakespace.lib.wfu.edu/handle/10339/90764 | |
| dc.language.iso | en | en_US |
| dc.publisher | Wake Forest University | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Communication Complexity | en_US |
| dc.subject | Multilinear Algebra | en_US |
| dc.subject | Tensors | en_US |
| dc.title | ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS | en_US |
| dc.type | Thesis | en_US |
| thesis.contributor.committeeChair | Ballard, Grey | en_US |
| thesis.contributor.committeeMember | John, David | en_US |
| thesis.contributor.committeeMember | Plemmons, Robert J | en_US |
| thesis.degree.discipline | Computer Science | en_US |