Back to results

Wake Forest University

ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS

Abstract

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.

Degree

thesis:*
Grantor dc:publisher
Wake Forest University
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rouse, Kathryn Margaret Zuhr

Subjects

dc:subject × 1

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10339/90764
OAI identifier oai:identifier
oai:wakespace.lib.wfu.edu:10339/90764

Chain of custody

source
Harvested from
Wake Forest University
Base URL
wakespace.lib.wfu.edu/oai/request
Last updated
2026-07-27
Source record
OAI-PMH GetRecord
related terms
citation

Rouse, Kathryn Margaret Zuhr. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. Wake Forest University, 2018. http://hdl.handle.net/10339/90764