Linear algebra for tensor problems
From MaRDI portal
Recommendations
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Fast truncation of mode ranks for bilinear tensor operations
- Multiresolution low-rank tensor formats
- The alternating linear scheme for tensor optimization in the tensor train format
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
Cites work
- A Multilinear Singular Value Decomposition
- A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
- A theory of pseudoskeleton approximations
- Algorithm 862
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Approximate iterations for structured matrices
- Combining Kronecker Product Approximation with Discrete Wavelet Transforms to Solve Dense, Function-Related Linear Systems
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- Fast simultaneous orthogonal reduction to triangular matrices
- Hierarchical Kronecker tensor-product approximations
- Matrix inversion cases with size-independent tensor rank estimates
- Numerical operator calculus in higher dimensions
- On cross approximation of multi-index arrays
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Sequentiality, monadic second-order logic and tree automata.
- Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure
- The maximal-volume concept in approximation by low-rank matrices
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
Cited in
(24)- Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP
- Cross approximation in tensor electron density computations
- Approximate solution of linear systems with Laplace-like operators via cross approximation in the frequency domain
- Grid-based electronic structure calculations: the tensor decomposition approach
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Numerical solution of the Boltzmann equation with S-model collision integral using tensor decompositions
- Computations in quantum tensor networks
- Tensor rank bounds for point singularities in \(\mathbb{R}^3\)
- Superfast solution of linear convolutional Volterra equations using QTT approximation
- Multiresolution low-rank tensor formats
- The condition number of many tensor decompositions is invariant under Tucker compression
- A Lanczos-type procedure for tensors
- A low-rank isogeometric solver based on Tucker tensors
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Approximate multiplication of tensor matrices based on the individual filtering of factors
- Iterative algorithms for the post-processing of high-dimensional data
- Black box approximation of tensors in hierarchical Tucker format
- Fast stray field computation on tensor grids
- Tensor product approach to modelling epidemics on networks
- A literature survey of low-rank tensor approximation techniques
- Fast tensor product solvers for optimization problems with fractional differential equations as constraints
- Fast truncation of mode ranks for bilinear tensor operations
- Numerical tensor calculus
This page was built for publication: Linear algebra for tensor problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841137)
