Cost reduction of stochastic Galerkin method by adaptive identification of significant polynomial chaos bases for elliptic equations

DOI10.1016/j.cma.2018.04.043zbMath1440.65227OpenAlexW2799322189WikidataQ129897711 ScholiaQ129897711MaRDI QIDQ1986283

Debraj Ghosh, Srikara Pranesh

Publication date: 8 April 2020

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cma.2018.04.043

zbMATH Keywords

conjugate gradientuncertainty quantificationpolynomial chaos expansionstochastic Galerkin methodstochastic finite elementgeneralized Sylvester equation

Mathematics Subject Classification ID

Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items (2)

Optimal Bayesian experimental design for subsurface flow problems ⋮ Backward error and condition number of a generalized Sylvester equation, with application to the stochastic Galerkin method

Uses Software

• Matlab

Cites Work

• A domain decomposition method of stochastic PDEs: an iterative solution techniques using a two-level scalable preconditioner
• Basis adaptation in homogeneous chaos spaces
• Reduced basis techniques for stochastic problems
• Solving stochastic systems with low-rank tensor compression
• Partitioned treatment of uncertainty in coupled domain problems: a separated representation approach
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Adaptive sparse polynomial chaos expansion based on least angle regression
• The stochastic finite element method: past, present and future
• Sparse high order FEM for elliptic sPDEs
• Stochastic model reduction for chaos representations
• Random field models of heterogeneous materials
• Faster computation of the Karhunen-Loève expansion using its domain independence property
• Iterative solution of systems of linear equations arising in the context of stochastic finite elements
• Addressing the curse of dimensionality in SSFEM using the dependence of eigenvalues in KL expansion on domain size
• A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
• Reduced chaos expansions with random coefficientsin reduced-dimensional stochastic modeling of coupled problems
• An Efficient Reduced Basis Solver for Stochastic Galerkin Matrix Equations
• Iterative Solvers for the Stochastic Finite Element Method
• A Kronecker Product Preconditioner for Stochastic Galerkin Finite Element Discretizations
• Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
• Computational Methods for Linear Matrix Equations
• Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
• Local Polynomial Chaos Expansion for Linear Differential Equations with High Dimensional Random Inputs
• Parallel Domain Decomposition Methods for Stochastic Elliptic Equations
• A polynomial dimensional decomposition for stochastic computing
• Domain decomposition of stochastic PDEs: Theoretical formulations
• Block-diagonal preconditioning for spectral stochastic finite-element systems
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• A FETI‐preconditioned conjugate gradient method for large‐scale stochastic finite element problems
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
• Hierarchical Schur complement preconditioner for the stochastic Galerkin finite element methods

This page was built for publication: Cost reduction of stochastic Galerkin method by adaptive identification of significant polynomial chaos bases for elliptic equations