QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
From MaRDI portal
Publication:417446
DOI10.1016/j.laa.2011.11.008zbMath1244.65253OpenAlexW2020084487MaRDI QIDQ417446
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.11.008
numerical experimentsfast Fourier transformquantum Fourier transformdata-sparse formatsfull-rank Fourier imagequantics tensor trainrank-one vectors
Numerical methods for discrete and fast Fourier transforms (65T50) Multilinear algebra, tensor calculus (15A69)
Related Items (8)
A low-rank approach to the computation of path integrals ⋮ Tensor product approach to modelling epidemics on networks ⋮ Parallel cross interpolation for high-precision calculation of high-dimensional integrals ⋮ Direct tensor-product solution of one-dimensional elliptic equations with parameter-dependent coefficients ⋮ Superfast Fourier transform using QTT approximation ⋮ Multigrid Methods for Tensor Structured Markov Chains with Low Rank Approximation ⋮ Superfast solution of linear convolutional Volterra equations using QTT approximation ⋮ A literature survey of low-rank tensor approximation techniques
Cites Work
- Tensor-Train Decomposition
- Tensorisation of vectors and their efficient convolution
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
- A new tensor decomposition
- The rank of a random matrix
- Gauss and the history of the fast Fourier transform
- Finitely correlated states on quantum spin chains
- Superfast Fourier transform using QTT approximation
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Uncertainty Principles and Signal Recovery
- Approximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
- On the Inversion of Certain Matrices
- Quantum algorithms: entanglement–enhanced information processing
- Tensor approximations of matrices generated by asymptotically smooth functions
- A generalized uncertainty principle and sparse representation in pairs of bases
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Unnamed Item
- Unnamed Item
This page was built for publication: QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
