On the matching of eigensolutions to parametric partial differential equations

07/13/2022
by   Moataz M. Alghamdi, et al.
0

In this paper a novel numerical approximation of parametric eigenvalue problems is presented. We motivate our study with the analysis of a POD reduced order model for a simple one dimensional example. In particular, we introduce a new algorithm capable to track the matching of eigenvalues when the parameters vary.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2019

A Theoretical Analysis of Deep Neural Networks and Parametric PDEs

We derive upper bounds on the complexity of ReLU neural networks approxi...
research
08/10/2023

Match-based solution of general parametric eigenvalue problems

We describe a novel algorithm for solving general parametric (nonlinear)...
research
02/02/2023

Reduced basis approximation of parametric eigenvalue problems in presence of clusters and intersections

In this paper we discuss reduced order models for the approximation of p...
research
08/30/2022

A greedy MOR method for the tracking of eigensolutions to parametric elliptic PDEs

In this paper, we introduce an algorithm based on a sparse grid adaptive...
research
12/31/2020

Virtual element approximation of eigenvalue problems

We discuss the approximation of eigenvalue problems associated with elli...
research
01/05/2020

Approximation of PDE eigenvalue problems involving parameter dependent matrices

We discuss the solution of eigenvalue problems associated with partial d...
research
06/25/2020

A sorting algorithm for complex eigenvalues

We present SPEC-RE, a new algorithm to sort complex eigenvalues, generat...

Please sign up or login with your details

Forgot password? Click here to reset