Deep Eigenspace Network for Parametric Non-self-adjoint Eigenvalue Problems
We consider operator learning for efficiently solving parametric non-self-adjoint eigenvalue problems. To overcome the spectral instability and mode switching associated with non-self-adjoint operators, we choose to learn the eigenspace rather than individual eigenfunctions. In particular, we propose a Deep Eigenspace Network (DEN) architecture integrating Fourier Neural Operators, geometry-adaptive POD bases, and explicit banded cross-mode mixing mechanism to capture complex spectral dependencies. We apply DEN to the non-self-adjoint Steklov eigenvalue problem and prove the Lipschitz continuity of the eigenspace with respect to the parameter. Furthermore, we derive error bounds for the eigenvalues. Numerical experiments validate that DEN is highly effective and efficient.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Tensor PCA from basis in tensor space
The aim of this paper is to present a mathematical framework for tensor PCA. The proposed approach is able to overcome the limitations of previous methods that extract a low dimensional subspace by iteratively solving an…
Physics-informed Gaussian Process Regression in Solving Eigenvalue Problem of Linear Operators
Applying Physics-Informed Gaussian Process Regression to the eigenvalue problem $(\mathcal{L}-λ)u = 0$ poses a fundamental challenge, where the null source term results in a trivial predictive mean and a degenerate margi…
Principal Component Projection and Regression in Nearly Linear Time through Asymmetric SVRG
Given a data matrix $\mathbf{A} \in \mathbb{R}^{n \times d}$, principal component projection (PCP) and principal component regression (PCR), i.e. projection and regression restricted to the top-eigenspace of $\mathbf{A}$…
regressionFast Eigenspace Approximation using Random Signals
We focus in this work on the estimation of the first $k$ eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need $k$ such signals to be able to exactly recover as many o…
ClusteringAn Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity
This paper develops a new storage-optimal algorithm that provably solves generic semidefinite programs (SDPs) in standard form. This method is particularly effective for weakly constrained SDPs. The key idea is to formul…