Experimental observation on a low-rank tensor model for eigenvalue problems
Not on the map. Why?
Abstract (arXiv)
Here we utilize a low-rank tensor model (LTM) as a function approximator, combined with the gradient descent method, to solve eigenvalue problems including the Laplacian operator and the harmonic oscillator. Experimental results show the superiority of the polynomial-based low-rank tensor model (PLTM) compared to the tensor neural network (TNN). We also test such low-rank architectures for the classification problem on the MNIST dataset.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 17 references that are in the map. First posted on arXiv 1 Feb 2023.
Builds on
5 of 17 references.
References · 5
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017DGM: A deep learning algorithm for solving partial differential equationscited by 674
- 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 581
- 2021Physics-informed neural networks with hard constraints for inverse designcited by 277
- 2022MIONet: Learning multiple-input operators via tensor productcited by 180
Built on by
Citing papers per year: 2024: 2.
2 papers.