Home WakeSpace Scholarship › Electronic Theses and Dissertations

ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS

Electronic Theses and Dissertations

Item Files

Item Details

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.
subject
Algorithms
Communication Complexity
Multilinear Algebra
Tensors
contributor
Rouse, Kathryn Margaret Zuhr (author)
Ballard, Grey (committee chair)
John, David (committee member)
Plemmons, Robert J (committee member)
date
2018-05-24T08:36:20Z (accessioned)
2018-05-24T08:36:20Z (available)
2018 (issued)
degree
Computer Science (discipline)
identifier
http://hdl.handle.net/10339/90764 (uri)
language
en (iso)
publisher
Wake Forest University
title
ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS
type
Thesis

Usage Statistics