Reduced basis approximation of parametric eigenvalue problems in presence of clusters and intersections
Daniele Boffi, Abdul Halim, Gopal Priyadarshi

TL;DR
This paper explores reduced basis methods for parametric eigenvalue problems, focusing on challenges posed by eigenvalue intersections and clusters, and examines how existing techniques extend to higher frequencies.
Contribution
It analyzes the extension of reduced basis approaches to complex eigenvalue scenarios involving intersections and clusters, addressing singularities in parametric eigenvalue problems.
Findings
Reduced basis methods face challenges with eigenvalue clusters.
Singularities complicate straightforward generalizations.
Extensions to higher frequencies require specialized strategies.
Abstract
In this paper we discuss reduced order models for the approximation of parametric eigenvalue problems. In particular, we are interested in the presence of intersections or clusters of eigenvalues. The singularities originating by these phenomena make it hard a straightforward generalization of well known strategies normally used for standards PDEs. We investigate how the known results extend (or not) to higher order frequencies.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Numerical methods in engineering · Numerical methods for differential equations
