A Bounds for block sparse tensors
نویسندگان
چکیده
A Bounds for block sparse tensors One of the main bounds to control is the spectral norm of the sparse perturbation tensor S. The success of the power iterations and the improvement in accuracy of recovery over iterative steps of RTD requires this bound.
منابع مشابه
An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
Tensors, which are the linear-algebraic extensions of matrices in arbitrary dimensions, have numerous applications to data processing tasks in computer science and computational science. Many tensors used in diverse application domains are sparse, typically containing more than 90% zero entries. Efficient computation with sparse tensors hinges on algorithms that can leverage the sparsity to do ...
متن کاملThe Sign-Real Spectral Radius for Real Tensors
In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.
متن کاملAn Introduction to Hierarchical (H-) Rank and TT-Rank of Tensors with Examples
We review two similar concepts of hierarchical rank of tensors (which extend the matrix rank to higher order tensors): the TT-rank and the H-rank (hierarchical or H-Tucker rank). Based on this notion of rank, one can define a data-sparse representation of tensors involving O(dnk + dk 3) data for order d tensors with mode sizes n and rank k. Simple examples underline the differences and similari...
متن کاملA Video Self-descriptor Based on Sparse Trajectory Clustering
In order to describe the main movement of the video a new motion descriptor is proposed in this work. We combine two methods for estimating the motion between frames: block matching and brightness gradient of image. In this work we use a variable size block matching algorithm to extract displacement vectors as a motion information. The cross product between the block matching vector and the gra...
متن کاملCommunication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
Accurate numerical calculations of electronic structure are often dominated in cost by tensor contractions. These tensors are typically symmetric under interchange of modes, enabling reduced-size representations as well as a reduced computation cost. Direct evaluation algorithms for such contractions use matrix and vector unfoldings of the tensors, computing and accumulating products of input e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016