Subspace method based on neural networks for eigenvalue problems
Xiaoying Dai, Yunying Fan, Zhiqiang Sheng
TL;DR
This work introduces a subspace method based on neural networks (SNN-EP) for eigenvalue problems by first training neural-network-based functions to form a subspace and then applying POD to obtain an orthogonal, low-dimensional basis. The eigenproblem is solved via Galerkin projection onto this neural-network-derived subspace, yielding very accurate eigenvalues and eigenfunctions at a fraction of the training effort required by traditional neural approaches. Key contributions include integrating a POD-based dimensionality reduction with a decoupled training-and-solving workflow, enforcing boundary conditions within the network, and demonstrating substantial accuracy and speed advantages on Laplace, harmonic oscillator, and Schrödinger-type problems. The approach promises efficient handling of high-dimensional or quantum-mechanical eigenproblems by combining machine learning with classical variational discretization.
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.
