We propose a non-intrusive, reduced-basis, and data-driven method for approximating both eigenvalues and eigenvectors in parametric eigenvalue problems. We generate the basis of the reduced space by applying the proper orthogonal decomposition (POD) approach on a collection of pre-computed, full-order snapshots at a chosen set of parameters. Then, we use Bayesian linear regression (a.k.a. Gaussian Process Regression) in the online phase to predict both eigenvalues and eigenvectors at new parameters. A split of the data generated in the offline phase into training and test data sets is utilized in the numerical experiments following standard practices in the field of supervised machine learning. Furthermore, we discuss the connection between Gaussian Process Regression and spline methods, and compare the performance of GPR method against linear and cubic spline methods. We show that GPR outperforms other methods for functions with a certain regularity. To this end, we discuss various different covariance functions which influence the performance of GPR. The proposed method is shown to be accurate and efficient for the approximation of multiple 1D and 2D affine and non-affine parameter-dependent eigenvalue problems that exhibit crossing of eigenvalues.

翻译：我们提出一种非侵入式、降基、数据驱动的方法，用于近似参数化特征值问题中的特征值和特征向量。通过对选定参数集上预先计算的全阶快照集合应用本征正交分解（POD）方法，生成降阶空间的基函数。随后，在在线阶段使用贝叶斯线性回归（即高斯过程回归）预测新参数下的特征值和特征向量。数值实验中，按照监督机器学习领域的标准做法，将离线阶段生成的数据划分为训练集和测试集，并加以利用。此外，我们讨论了高斯过程回归与样条方法之间的关联，并将GPR方法的性能与线性样条和三次样条方法进行比较。研究表明，对于具有一定正则性的函数，GPR方法优于其他方法。为此，我们探讨了影响GPR性能的多种不同协方差函数。实验表明，所提出的方法在近似多个一维和二维仿射及非仿射参数依赖、且存在特征值交叉的特征值问题时，具有准确性和高效性。