| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6931973 | Journal of Computational Physics | 2015 | 30 Pages |
Abstract
We reduce the problem of finding tensor IDs to that of constructing interpolative decompositions of certain matrices. These matrices are generated via randomized projection of the terms of the given tensor. We provide cost estimates and several examples of the new approach to the reduction of separation rank.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
David J. Biagioni, Daniel Beylkin, Gregory Beylkin,