A tensor decomposition approach to data compression and approximation of ND systems
From MaRDI portal
Publication:1937799
DOI10.1007/s11045-010-0144-xzbMath1255.93033OpenAlexW1963895703MaRDI QIDQ1937799
Publication date: 1 February 2013
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-010-0144-x
model reductionheat diffusion problemmulti-linear algebraproper orthogonal decompositionsND systemsprojection spacestensor decomposition techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- TT-cross approximation for multidimensional arrays
- Galerkin finite element methods for parabolic problems
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Orthogonal Tensor Decompositions
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
- Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
- Realisation and Approximation of Linear Infinite-Dimensional Systems with Error Bounds
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Singular Value Decompositions and Low Rank Approximations of Tensors
- Galerkin Proper Orthogonal Decomposition Methods for a General Equation in Fluid Dynamics
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Algorithms for Numerical Analysis in High Dimensions
This page was built for publication: A tensor decomposition approach to data compression and approximation of ND systems
