Subspace method based on neural networks for eigenvalue problems
Abstract
In this paper, we propose a subspace method based on neural networks for eigenvalue problems with high accuracy and low cost. We first construct a neural network-based orthogonal basis by some deep learning method and dimensionality reduction technique, and then calculate the Galerkin projection of the eigenvalue problem onto the subspace spanned by the orthogonal basis and obtain an approximate solution. Numerical experiments show that we can obtain approximate eigenvalues and eigenfunctions with very high accuracy but low cost.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.