226 research outputs found
Fast truncation of mode ranks for bilinear tensor operations
We propose a fast algorithm for mode rank truncation of the result of a
bilinear operation on 3-tensors given in the Tucker or canonical form. If the
arguments and the result have mode sizes n and mode ranks r, the computation
costs . The algorithm is based on the cross approximation of
Gram matrices, and the accuracy of the resulted Tucker approximation is limited
by square root of machine precision.Comment: 9 pages, 2 tables. Submitted to Numerical Linear Algebra and
Applications, special edition for ICSMT conference, Hong Kong, January 201
A literature survey of low-rank tensor approximation techniques
During the last years, low-rank tensor approximation has been established as
a new tool in scientific computing to address large-scale linear and
multilinear algebra problems, which would be intractable by classical
techniques. This survey attempts to give a literature overview of current
developments in this area, with an emphasis on function-related tensors
- …