Subspace method based on neural networks for eigenvalue problems

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.

Paper

References (62)

Scroll for more · 38 remaining

Similar papers

© 2026 NYSGPT2525 LLC