English

Examples of computational approaches to accommodate randomness in elliptic PDEs

Numerical Analysis 2016-04-19 v1 Probability

Abstract

We overview a series of recent works addressing numerical simulations of partial differential equations in the presence of some elements of randomness. The specific equations manipulated are linear elliptic, and arise in the context of multiscale problems, but the purpose is more general. On a set of prototypical situations, we investigate two critical issues present in many settings: variance reduction techniques to obtain sufficiently accurate results at a limited computational cost when solving PDEs with random coefficients, and finite element techniques that are sufficiently flexible to carry over to geometries with random fluctuations. Some elements of theoretical analysis and numerical analysis are briefly mentioned. Numerical experiments, although simple, provide convincing evidence of the efficiency of the approaches.

Keywords

Cite

@article{arxiv.1604.05061,
  title  = {Examples of computational approaches to accommodate randomness in elliptic PDEs},
  author = {Claude Le Bris and Frederic Legoll},
  journal= {arXiv preprint arXiv:1604.05061},
  year   = {2016}
}

Comments

arXiv admin note: text overlap with arXiv:1509.02389, arXiv:1307.0876

R2 v1 2026-06-22T13:34:39.709Z