We consider a class of multilevel matrices, which arise from the discretization of linear diffusion operators in a $d$-dimensional hypercube. Under certain assumptions on the structure of the diffusion tensor (motivated by financial models), we derive an explicit representation of such a matrix in the recently introduced Tensor Train (TT) format with the $TT$ ranks bounded from above by $2 + \lfloor \frac{d}{2}\rfloor$. We also show that if the diffusion tensor is constant and semiseparable of order $r < \lfloor \frac{d}{2}\rfloor$, the representation can be refined and the bound on the TT ranks can be sharpened to $2 + r$ (we do this in a more general setting, for non-constant diffusion tensors of a certain structure). As a result, when $n...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
AbstractQuantics tensor train (QTT), a new data-sparse format for one- and multi-dimensional vectors...
In this article we describe an efficient approximation of the stochastic Galerkin matrix which stems...
The computation of matrix functions using quadrature formulas and rational approximations of very la...
Multidimensional data, or tensors, arise natura lly in data analysis applications. Hitchcock&##39;s ...
The structured tensor-product approximation of multi-dimensional nonlocal oper-ators by a two-level ...
This paper deals with the best low multilinear rank approximation of higher-order tensors. Given a t...
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
Abstract — We present a new connection between higher-order tensors and affinely structured matrices...
We derive rank bounds on the quantized tensor train (QTT) compressed approximation of singularly per...
We consider the problem of developing parallel decomposition and approximation algorithms for high d...
AbstractA general proposal is presented for fast algorithms for multilevel structured matrices. It i...
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matric...
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
International audienceWith the increase in measurement/sensing technologies, the collected data are ...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
AbstractQuantics tensor train (QTT), a new data-sparse format for one- and multi-dimensional vectors...
In this article we describe an efficient approximation of the stochastic Galerkin matrix which stems...
The computation of matrix functions using quadrature formulas and rational approximations of very la...
Multidimensional data, or tensors, arise natura lly in data analysis applications. Hitchcock&##39;s ...
The structured tensor-product approximation of multi-dimensional nonlocal oper-ators by a two-level ...
This paper deals with the best low multilinear rank approximation of higher-order tensors. Given a t...
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
Abstract — We present a new connection between higher-order tensors and affinely structured matrices...
We derive rank bounds on the quantized tensor train (QTT) compressed approximation of singularly per...
We consider the problem of developing parallel decomposition and approximation algorithms for high d...
AbstractA general proposal is presented for fast algorithms for multilevel structured matrices. It i...
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matric...
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
International audienceWith the increase in measurement/sensing technologies, the collected data are ...
Computing low-rank approximations is one of the most important and well-studied problems involving t...
AbstractQuantics tensor train (QTT), a new data-sparse format for one- and multi-dimensional vectors...
In this article we describe an efficient approximation of the stochastic Galerkin matrix which stems...