Approximate methods for stochastic eigenvalue problems
DOI10.1016/J.AMC.2014.12.112zbMATH Open1410.60066OpenAlexW1985289051MaRDI QIDQ669769FDOQ669769
Authors: Harri Hakula, Vesa Kaarnioja, Mikael Laaksonen
Publication date: 15 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.12.112
Recommendations
- Inexact methods for symmetric stochastic eigenvalue problems
- Low-rank solution methods for stochastic eigenvalue problems
- Inverse subspace iteration for spectral stochastic finite element methods
- A method for solving stochastic eigenvalue problems
- Iterative solution of the random eigenvalue problem with application to spectral stochastic finite element systems
inverse iterationsparse gridsstochastic Galerkin methodstochastic collocationSFEMstochastic eigenvalue problem
Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Random nonlinear operators (47H40) Random operators and equations (aspects of stochastic analysis) (60H25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Remarks on a Multivariate Transformation
- Title not available (Why is that?)
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Dimension-adaptive tensor-product quadrature
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- A Sparse Composite Collocation Finite Element Method for Elliptic SPDEs.
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Sparse tensor discretization of elliptic SPDEs
- Sparse high order FEM for elliptic sPDEs
- Polynomial chaos representation of spatio-temporal random fields from experimental measurements
- On the construction and analysis of stochastic models: characterization and propagation of the errors associated with limited data
- Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
- Sparse tensor approximation of parametric eigenvalue problems
- Efficient characterization of the random eigenvalue problem in a polynomial chaos decomposition
- Iterative solution of the random eigenvalue problem with application to spectral stochastic finite element systems
Cited In (30)
- Approximation of some moments in eigenvalue problem including some random variables and its application
- Multiparametric shell eigenvalue problems
- Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
- Iterative solution of the random eigenvalue problem with application to spectral stochastic finite element systems
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Title not available (Why is that?)
- Multi-objective shape optimization of TESLA-like cavities: addressing stochastic Maxwell's eigenproblem constraints
- Low-rank solution methods for stochastic eigenvalue problems
- Asymptotic convergence of spectral inverse iterations for stochastic eigenvalue problems
- An efficient reduced‐order method for stochastic eigenvalue analysis
- Inverse subspace iteration for spectral stochastic finite element methods
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Title not available (Why is that?)
- A data-driven method for parametric PDE eigenvalue problems using Gaussian process with different covariance functions
- Sparse tensor approximation of parametric eigenvalue problems
- Parallel stochastic estimation method of eigenvalue distribution
- Stochastic convergence acceleration through basis enrichment of polynomial chaos expansions
- Uncertain eigenvalue analysis by the sparse grid stochastic collocation method
- Analyticity of parametric elliptic eigenvalue problems and applications to quasi-Monte Carlo methods
- A method for solving stochastic eigenvalue problems
- A low-rank inexact Newton-Krylov method for stochastic eigenvalue problems
- Sparse approximate solutions to stochastic Galerkin equations
- Match-based solution of general parametric eigenvalue problems
- A greedy MOR method for the tracking of eigensolutions to parametric elliptic PDEs
- Efficient characterization of the random eigenvalue problem in a polynomial chaos decomposition
- Stochastic collocation method for computing eigenspaces of parameter-dependent operators
- Some Approximation Formula for Stochastic Eigenvalues
- Inexact methods for symmetric stochastic eigenvalue problems
- Inverse modeling of tracer flow via a mass conservative generalized multiscale finite volume/element method and stochastic collocation
- Stochastic spectral formulations for elliptic problems
Uses Software
This page was built for publication: Approximate methods for stochastic eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669769)