Theory and numerics of subspace approximation of eigenvalue problems
Abstract
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. We provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.
Cite
@article{arxiv.2412.08891,
title = {Theory and numerics of subspace approximation of eigenvalue problems},
author = {Siu Wun Cheung and Youngsoo Choi and Seung Whan Chung and Jean-Luc Fattebert and Coleman Kendrick and Daniel Osei-Kuffuor},
journal= {arXiv preprint arXiv:2412.08891},
year = {2025}
}
Comments
Revised version