Explicit cost bounds of stochastic Galerkin approximations for parameterized PDEs with random coefficients
From MaRDI portal
Publication:2007265
finite elementscomplexity analysisstochastic collocationstochastic Galerkinexplicit cost boundssparse polynomial approximation
Boundary value problems for second-order elliptic equations (35J25) PDEs with randomness, stochastic partial differential equations (35R60) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Probabilistic methods, particle methods, etc. for initial value and initial-boundary value problems involving PDEs (65M75)
Abstract: This work analyzes the overall computational complexity of the stochastic Galerkin finite element method (SGFEM) for approximating the solution of parameterized elliptic partial differential equations with both affine and non-affine random coefficients. To compute the fully discrete solution, such approaches employ a Galerkin projection in both the deterministic and stochastic domains, produced here by a combination of finite elements and a global orthogonal basis, defined on an isotopic total degree index set, respectively. To account for the sparsity of the resulting system, we present a rigorous cost analysis that considers the total number of coupled finite element systems that must be simultaneously solved in the SGFEM. However, to maintain sparsity as the coefficient becomes increasingly nonlinear in the parameterization, it is necessary to also approximate the coefficient by an additional orthogonal expansion. In this case we prove a rigorous complexity estimate for the number of floating point operations (FLOPs) required per matrix-vector multiplication of the coupled system. Based on such complexity estimates we also develop explicit cost bounds in terms of FLOPs to solve the stochastic Galerkin (SG) systems to a prescribed tolerance, which are used to compare with the minimal complexity estimates of a stochastic collocation finite element method (SCFEM), shown in our previous work [16]. Finally, computational evidence complements the theoretical estimates and supports our conclusion that, in the case that the coefficient is affine, the coupled SG system can be solved more efficiently than the decoupled SC systems. However, as the coefficient becomes more nonlinear, it becomes prohibitively expensive to obtain an approximation with the SGFEM.
Recommendations
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- Efficient adaptive multilevel stochastic Galerkin approximation using implicit a posteriori error estimation
- Assessment of collocation and Galerkin approaches to linear diffusion equations with random data
- On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
- Sparse high order FEM for elliptic sPDEs
Cites work
- scientific article; zbMATH DE number 3516003 (Why is no real title available?)
- scientific article; zbMATH DE number 3599198 (Why is no real title available?)
- scientific article; zbMATH DE number 854710 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- A Kronecker Product Preconditioner for Stochastic Galerkin Finite Element Discretizations
- A Simple Mesh Generator in MATLAB
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A method for numerical integration on an automatic computer
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- An adaptive wavelet stochastic collocation method for irregular solutions of partial differential equations with random input data
- Analysis and implementation issues for the numerical approximation of parabolic equations with random coefficients
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Assessment of collocation and Galerkin approaches to linear diffusion equations with random data
- Block-diagonal preconditioning for spectral stochastic finite-element systems
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Computational aspects of the stochastic finite element method
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Efficient iterative solvers for stochastic Galerkin discretizations of log-transformed random diffusion problems
- Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations
- Iterative solution of systems of linear equations arising in the context of stochastic finite elements
- On Leja sequences: some results and applications
- On asymptotics and estimates for the uniform norms of the Lagrange interpolation polynomials corresponding to the Chebyshev nodal points
- Spectral Methods for Uncertainty Quantification
- Stochastic Galerkin matrices
- Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
- Stochastic finite element methods for partial differential equations with random input data
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Theoretical Numerical Analysis
Cited in
(2)
This page was built for publication: Explicit cost bounds of stochastic Galerkin approximations for parameterized PDEs with random coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007265)
