Multigrid accelerated tensor approximation of function related multidimensional arrays
From MaRDI portal
adaptive orthogonal tensor-product basisalgorithmcanonical modelconvolution productdiscrete convolutionelectronic structure calculationslinear complexitymultigrid accelerationNewton potentialorthogonal Tucker tensor decomposition
Multilinear algebra, tensor calculus (15A69) Multiple integral transforms (44A30) Convolution as an integral transform (44A35) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Numerical methods for integral transforms (65R10) Complexity and performance of numerical algorithms (65Y20)
Recommendations
- Tensor numerical methods for multidimensional PDEs: theoretical analysis and initial applications
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
- Tensor numerical methods in scientific computing
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids
- Tensor numerical methods in quantum chemistry
Cited in
(55)- Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
- Superfast Fourier transform using QTT approximation
- Krylov-type methods for tensor computations.I
- A tensor decomposition approach to data compression and approximation of ND systems
- Constructive representation of functions in low-rank tensor formats
- Low-rank quadrature-based tensor approximation of the Galerkin projected Newton/Yukawa kernels
- Prospects of tensor-based numerical modeling of the collective electrostatics in many-particle systems
- Solving differential Riccati equations: a nonlinear space-time method using tensor trains
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- Tensor product method for fast solution of optimal control problems with fractional multidimensional Laplacian in constraints
- Solving phase-field models in the tensor train format to generate microstructures of bicontinuous composites
- Range-separated tensor decomposition of the discretized Dirac delta and elliptic operator inverse
- Low rank tensor methods in Galerkin-based isogeometric analysis
- Tucker tensor analysis of Matérn functions in spatial statistics
- Approximate solution of linear systems with Laplace-like operators via cross approximation in the frequency domain
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation
- A low-rank approach to the computation of path integrals
- On manifolds of tensors of fixed TT-rank
- A literature survey of low-rank tensor approximation techniques
- Simultaneous state-time approximation of the chemical master equation using tensor product formats.
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Approximate multiplication of tensor matrices based on the individual filtering of factors
- Cross approximation in tensor electron density computations
- Møller-Plesset (MP2) energy correction using tensor factorization of the grid-based two-electron integrals
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- Approximation of the electron density of aluminium clusters in tensor-product format
- Fast stray field computation on tensor grids
- Generalized cross approximation for 3D-tensors
- Literature survey on low rank approximation of matrices
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Range-separated tensor format for many-particle modeling
- Fast and accurate 3D tensor calculation of the Fock operator in a general basis
- Fast truncation of mode ranks for bilinear tensor operations
- Use of tensor formats in elliptic eigenvalue problems.
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- Derivation and analysis of fast bilinear algorithms for convolution
- Multiresolution low-rank tensor formats
- Numerical computation for orthogonal low-rank approximation of tensors
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation
- News algorithms for tensor decomposition based on a reduced functional
- Fast low‐rank approximations of multidimensional integrals in ion‐atomic collisions modelling
- Fast tensor method for summation of long-range potentials on 3D lattices with defects.
- Tensor numerical methods for multidimensional PDEs: theoretical analysis and initial applications
- Regularization of Poisson-Boltzmann-type equations with singular source terms using the range-separated tensor format
- Tensor decompositions for the bubbles and cube numerical framework
- Solution decomposition for the nonlinear Poisson-Boltzmann equation using the range-separated tensor format
- Adaptive cross approximation of multivariate functions
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
- Grid-based electronic structure calculations: the tensor decomposition approach
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids
- Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)
- Black box low tensor-rank approximation using fiber-crosses
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
This page was built for publication: Multigrid accelerated tensor approximation of function related multidimensional arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581078)
