Skip to content
DraconiticResearch
Search Sources API
182,469 studies31 sourcesUpdated 10 min ago
PreprintarXiv licencearXiv

Multilevel Monte Carlo methods for random nonlinear eigenvalue problems

Abstract

We develop a multilevel Monte Carlo (MLMC) estimator to compute statistical quantities of interest of solutions to parameter-dependent nonlinear eigenvalue problems. The main difficulty for this problem is that parametrized eigenpairs often lack a globally well-defined parameter-to-solution map due to crossings and bifurcations. These phenomena render eigenvalue-tracking infeasible in multi-dimensional parameter domains. To overcome this issue, we propose both an Eulerian and a Lagrangian perspective on parameter-to-solution maps for nonlinear eigenvalue problems, which remain well-defined even in the presence of local crossings and bifurcations. Their implementation is based on a straightforward modification of Beyn's contour integral approach. Building on these maps, we propose an MLMC estimator that does not rely on matching eigenvalues or eigenvectors across samples or discretization levels. Nested approximation spaces and inter-level prolongation are only required when statistical quantities of interest related to the eigenspaces are of interest, but not for quantities of interest related to the eigenvalues. We demonstrate the feasibility and validity of our approach by numerical examples using a quasi-Monte Carlo method, including a nonlinear formulation of the Laplace Dirichlet eigenvalue problem on random domains in three dimensions motivated by the work of Steinbach and Unger. To the best of our knowledge, this is the first work considering the approximation of statistical quantities of interest for random nonlinear eigenvalue problems.

Related

  1. Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems
    Sameh Gana
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Conditioning and backward errors for nonlinear eigenvalue problems with eigenvector nonlinearities
    Vilhelm Peterson Lithell, Victor Janssens, Elias Jarlebring +2
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingarXiv
  3. Deep learning methods for stochastic Galerkin approximations of random domain problems
    Fabio Musco, Andrea Barth
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Convergence Analysis of Newton Methods for Nonlinear Optimal Control Problems
    Yushu Feng, Haisen Zhang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. A Class of Higher-Order Iterative Methods for Simultaneous Solutions of Nonlinear Equations with Applications to Biological Problems
    Monika Panwar, Sonia Bhalla, Ramandeep Behl +3
    MathematicsPeer-reviewedCC BY 4.0Numerical analysis & scientific computingCrossref
BibTeX
@misc{dolz2026multilevel,
  title = {{Multilevel Monte Carlo methods for random nonlinear eigenvalue problems}},
  author = {Jürgen Dölz and Jimena Lozano-Simón},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.36955},
  eprint = {2610.36955},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.36955},
}
RIS
TY  - UNPB
TI  - Multilevel Monte Carlo methods for random nonlinear eigenvalue problems
AU  - Jürgen Dölz
AU  - Jimena Lozano-Simón
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.36955
UR  - https://arxiv.org/abs/2610.36955
AB  - We develop a multilevel Monte Carlo (MLMC) estimator to compute statistical quantities of interest of solutions to parameter-dependent nonlinear eigenvalue problems. The main difficulty for this problem is that parametrized eigenpairs often lack a globally well-defined parameter-to-solution map due to crossings and bifurcations. These phenomena render eigenvalue-tracking infeasible in multi-dimensional parameter domains. To overcome this issue, we propose both an Eulerian and a Lagrangian perspective on parameter-to-solution maps for nonlinear eigenvalue problems, which remain well-defined even in the presence of local crossings and bifurcations. Their implementation is based on a straightforward modification of Beyn's contour integral approach. Building on these maps, we propose an MLMC estimator that does not rely on matching eigenvalues or eigenvectors across samples or discretization levels. Nested approximation spaces and inter-level prolongation are only required when statistical quantities of interest related to the eigenspaces are of interest, but not for quantities of interest related to the eigenvalues. We demonstrate the feasibility and validity of our approach by numerical examples using a quasi-Monte Carlo method, including a nonlinear formulation of the Laplace Dirichlet eigenvalue problem on random domains in three dimensions motivated by the work of Steinbach and Unger. To the best of our knowledge, this is the first work considering the approximation of statistical quantities of interest for random nonlinear eigenvalue problems.
ER  -