Iterative algorithms for the post-processing of high-dimensional data
From MaRDI portal
Publication:777570
DOI10.1016/J.JCP.2020.109396zbMATH Open1436.65054arXiv1906.05669OpenAlexW3011675367MaRDI QIDQ777570FDOQ777570
Authors: Mike Espig, Alexander Litvinenko, Hermann G. Matthies, Elmar Zander, Wolfgang Hackbusch 
Publication date: 7 July 2020
Published in: Journal of Computational Physics (Search for Journal in Brave)
Abstract: Scientific computations or measurements may result in huge volumes of data. Often these can be thought of representing a real-valued function on a high-dimensional domain, and can be conceptually arranged in the format of a tensor of high degree in some truncated or lossy compressed format. We look at some common post-processing tasks which are not obvious in the compressed format, as such huge data sets can not be stored in their entirety, and the value of an element is not readily accessible through simple look-up. The tasks we consider are finding the location of maximum or minimum, or minimum and maximum of a function of the data, or finding the indices of all elements in some interval --- i.e. level sets, the number of elements with a value in such a level set, the probability of an element being in a particular level set, and the mean and variance of the total collection. The algorithms to be described are fixed point iterations of particular functions of the tensor, which will then exhibit the desired result. For this, the data is considered as an element of a high degree tensor space, although in an abstract sense, the algorithms are independent of the representation of the data as a tensor. All that we require is that the data can be considered as an element of an associative, commutative algebra with an inner product. Such an algebra is isomorphic to a commutative sub-algebra of the usual matrix algebra, allowing the use of matrix algorithms to accomplish the mentioned tasks. We allow the actual computational representation to be a lossy compression, and we allow the algebra operations to be performed in an approximate fashion, so as to maintain a high compression level. One such example which we address explicitly is the representation of data as a tensor with compression in the form of a low-rank representation.
Full work available at URL: https://arxiv.org/abs/1906.05669
Recommendations
high-dimensional datapost-processingfixed point iterationcompressioneigenvalue computationlow-rank tensor representation
Multilinear algebra, tensor calculus (15A69) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Functions of Matrices
- Title not available (Why is that?)
- Orthogonal tensor decompositions
- Tensor Decompositions and Applications
- Tensor-train decomposition
- TT-cross approximation for multidimensional arrays
- Hierarchical Singular Value Decomposition of Tensors
- How to find a good submatrix
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- A Multilinear Singular Value Decomposition
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Inverse problems: a Bayesian perspective
- Title not available (Why is that?)
- Tensor numerical methods in scientific computing
- Tensor Spaces and Numerical Tensor Calculus
- Application of hierarchical matrices for computing the Karhunen-Loève expansion
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- Numerical methods for large eigenvalue problems
- A literature survey of low-rank tensor approximation techniques
- Solving stochastic systems with low-rank tensor compression
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- The Matrix Eigenvalue Problem
- Tensor network states and geometry
- Superfast Fourier transform using QTT approximation
- Variational calculus with sums of elementary tensors of fixed rank
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- A new scheme for the tensor representation
- DMRG approach to fast linear algebra in the TT-format
- Low rank Tucker-type tensor approximation to classical potentials
- The alternating linear scheme for tensor optimization in the tensor train format
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
- Verification of the cross 3D algorithm on quantum chemistry data
- Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
- Use of tensor formats in elliptic eigenvalue problems.
- Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations
- Black box low tensor-rank approximation using fiber-crosses
- Stochastic finite elements: Computational approaches to stochastic partial differential equations
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Constructive representation of functions in low-rank tensor formats
- An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples
- Tensor-product approximation to operators and functions in high dimensions
- Linear algebra for tensor problems
- Approximate iterations for structured matrices
- Title not available (Why is that?)
- Black box approximation of tensors in hierarchical Tucker format
- Separation of variables for function generated high-order tensors
- Kriging and spatial design accelerated by orders of magnitude: combining low-rank covariance approximations with FFT-techniques
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Tree adaptive approximation in the hierarchical tensor format
- Parallel tensor sampling in the hierarchical Tucker format
- A continuous analogue of the tensor-train decomposition
- Spectral tensor-train decomposition
- Covariance regularity and \(\mathcal {H}\)-matrix approximation for rough random fields
- Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
- Simultaneous state-time approximation of the chemical master equation using tensor product formats.
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Analysis of parametric models. Linear methods and approximations
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Tensor numerical methods in quantum chemistry
- Riemannian optimization for high-dimensional tensor completion
- A new truncation strategy for the higher-order singular value decomposition
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- A subspace lanczos method for the generalized symmetric eigenproblem
- Computable error bounds for the generalized symmetric eigenproblem
- Convergence analysis of projected fixed-point iteration on a low-rank matrix manifold.
- Hand-waving and interpretive dance: an introductory course on tensor networks
- Recompression of Hadamard Products of Tensors in Tucker Format
Cited In (6)
- Propagation of uncertainties in density-driven flow
- Efficient probabilistic multi-fidelity calibration of a damage-plastic model for confined concrete
- Non-intrusive tensor reconstruction for high-dimensional random PDEs
- Collocation methods and beyond in non-linear mechanics
- Prospects of tensor-based numerical modeling of the collective electrostatics in many-particle systems
- Computing f‐divergences and distances of high‐dimensional probability density functions
Uses Software
This page was built for publication: Iterative algorithms for the post-processing of high-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777570)
