skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: GMRES with embedded ensemble propagation for the efficient solution of parametric linear systems in uncertainty quantification of computational models

Journal Article · · Computer Methods in Applied Mechanics and Engineering
 [1];  [1];  [2];  [2];  [1]
  1. Univ. of Liege, (Belgium)
  2. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

In a previous work, embedded ensemble propagation was proposed to improve the efficiency of sampling-based uncertainty quantification methods of computational models on emerging computational architectures. It consists of simultaneously evaluating the model for a subset of samples together, instead of evaluating them individually. A first approach introduced to solve parametric linear systems with ensemble propagation is ensemble reduction. In Krylov methods for example, this reduction consists in coupling the samples together using an inner product that sums the sample contributions. Ensemble reduction has the advantages of being able to use optimized implementations of BLAS functions and having a stopping criterion which involves only one scalar. However, the reduction potentially decreases the rate of convergence due to the gathering of the spectra of the samples. In this paper, we investigate a second approach: ensemble propagation without ensemble reduction in the case of GMRES. This second approach solves each sample simultaneously but independently to improve the convergence compared to ensemble reduction. This raises two new issues which are solved in this paper: the fact that optimized implementations of BLAS functions cannot be used anymore and that ensemble divergence, whereby individual samples within an ensemble must follow different code execution paths, can occur. We tackle those issues by implementing a high-performing ensemble GEMV and by using masks. The proposed ensemble GEMV leads to a similar cost per GMRES iteration for both approaches, i.e. with and without reduction. For illustration, we study the performances of the new linear solver in the context of a mesh tying problem. Furthermore, this example demonstrates improved ensemble propagation speed-up without reduction.

Research Organization:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
AC04-94AL85000; NA0003525
OSTI ID:
1639083
Alternate ID(s):
OSTI ID: 1644057
Report Number(s):
SAND-2020-6657J; SAND-2019-8324J; 687024
Journal Information:
Computer Methods in Applied Mechanics and Engineering, Vol. 369; ISSN 0045-7825
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 1 work
Citation information provided by
Web of Science

References (20)

A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data journal January 2007
Sparse grid collocation schemes for stochastic natural convection problems journal July 2007
Polynomial Chaos in Stochastic Finite Elements journal March 1990
Swift: A language for distributed parallel scripting journal September 2011
Prediction and reduction of runtime in non-intrusive forward UQ simulations journal August 2019
Embedded Ensemble Propagation for Improving Performance, Portability, and Scalability of Uncertainty Quantification on Emerging Computational Architectures journal January 2017
An overview of the Trilinos project journal September 2005
Kokkos: Enabling manycore performance portability through polymorphic memory access patterns journal December 2014
Ensemble Grouping Strategies for Embedded Stochastic Collocation Methods Applied to Anisotropic Diffusion Problems journal January 2018
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems journal July 1986
Iterative Methods for Sparse Linear Systems book January 2003
Tensor Decompositions and Applications journal August 2009
Vc: A C++ library for explicit vectorization: VC: A C++ LIBRARY FOR EXPLICIT VECTORIZATION journal December 2011
Anatomy of high-performance matrix multiplication journal May 2008
Boost.SIMD: generic programming for portable SIMDization
  • Estérie, Pierre; Falcou, Joel; Gaunard, Mathias
  • Proceedings of the 2014 Workshop on Workshop on programming models for SIMD/Vector processing - WPMVP '14 https://doi.org/10.1145/2568058.2568063
conference January 2014
A high-performance portable abstract interface for explicit SIMD vectorization
  • Karpiński, P.; McDonald, J.
  • PPoPP '17: 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Proceedings of the 8th International Workshop on Programming Models and Applications for Multicores and Manycores https://doi.org/10.1145/3026937.3026939
conference February 2017
Numerical solution of saddle point problems journal April 2005
Eigenvalue analysis of the SIMPLE preconditioning for incompressible flow journal June 2004
A taxonomy and comparison of parallel block multi-level preconditioners for the incompressible Navier–Stokes equations journal January 2008
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts journal October 2017

Similar Records

Marker ReDistancing/Level Set Method for High-Fidelity Implicit Interface Tracking
Journal Article · Mon Feb 01 00:00:00 EST 2010 · SIAM Journal on Scientific Computing · OSTI ID:1639083

Toward efficient polynomial preconditioning for GMRES
Journal Article · Thu Dec 30 00:00:00 EST 2021 · Numerical Linear Algebra with Applications · OSTI ID:1639083

Robust large-scale parallel nonlinear solvers for simulations.
Technical Report · Tue Nov 01 00:00:00 EST 2005 · OSTI ID:1639083