This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Efficiently Computing Tensor Eigenvalues on a GPU
Anchorage, Alaska USA
May 16-May 20
ISBN: 978-0-7695-4577-6
The tensor eigenproblem has many important applications, generating both mathematical and application-specific interest in the properties of tensor eigenpairs and methods for computing them. A tensor is an $m$-way array, generalizing the concept of a matrix (a 2-way array). Kolda and Mayo have recently introduced a generalization of the matrix power method for computing real-valued tensor eigenpairs of symmetric tensors. In this work, we present an efficient implementation of their algorithm, exploiting symmetry in order to save storage, data movement, and computation. For an application involving repeatedly solving the tensor eigenproblem for many small tensors, we describe how a GPU can be used to accelerate the computations. On an NVIDIA Tesla C 2050 (Fermi) GPU, we achieve 318 Gflops/s (31% of theoretical peak performance in single precision) on our test data set.
Citation:
Grey Ballard, Tamara Kolda, Todd Plantenga, "Efficiently Computing Tensor Eigenvalues on a GPU," ipdpsw, pp.1340-1348, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, 2011
Usage of this product signifies your acceptance of the Terms of Use.