Multi-resolution analysis of Wiener-type uncertainty propagation schemes

O. P. Le Maître; H. N. Najm; R. G. Ghanem; O. M. Knio

doi:10.1016/j.jcp.2003.12.020

Multi-resolution analysis of Wiener-type uncertainty propagation schemes

O. P. Le Maître, H. N. Najm, R. G. Ghanem, O. M. Knio^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

284 Scopus citations

Abstract

A multi-resolution analysis (MRA) is applied to an uncertainty propagation scheme based on a generalized polynomial chaos (PC) representation. The MRA relies on an orthogonal projection of uncertain data and solution variables onto a multi-wavelet basis, consisting of compact piecewise-smooth polynomial functions. The coefficients of the expansion are computed through a Galerkin procedure. The MRA scheme is applied to the simulation of the Lorenz system having a single random parameter. The convergence of the solution with respect to the resolution level and expansion order is investigated. In particular, results are compared to two Monte-Carlo sampling strategies, demonstrating the superiority of the MRA. For more complex problems, however, the MRA approach may require excessive CPU times. Adaptive methods are consequently developed in order to overcome this drawback. Two approaches are explored: the first is based on adaptive refinement of the multi-wavelet basis, while the second is based on adaptive block-partitioning of the space of random variables. Computational tests indicate that the latter approach is better suited for large problems, leading to a more efficient, flexible and parallelizable scheme.

Original language	English (US)
Pages (from-to)	502-531
Number of pages	30
Journal	Journal of Computational Physics
Volume	197
Issue number	2
DOIs	https://doi.org/10.1016/j.jcp.2003.12.020
State	Published - Jul 1 2004
Externally published	Yes

Bibliographical note

Funding Information:
This work was supported by the Laboratory Directed Research and Development Program at Sandia National Laboratories, funded by the US Department of Energy and by the DOE office of Basic Energy Sciences, Chemical Sciences Division. Support was also provided by the Defense Advanced Research Projects Agency (DARPA) and Air Force Research Laboratory, Air Force Materiel Command, USAF, under agreement number F30602-00-2-0612. The US government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. Computations were performed at the National Center for Supercomputer Applications.

Keywords

Adaptive scheme
Multi-resolution analysis
Multi-wavelets
Polynomial chaos
Uncertainty quantification

ASJC Scopus subject areas

Numerical Analysis
Modeling and Simulation
Physics and Astronomy (miscellaneous)
General Physics and Astronomy
Computer Science Applications
Computational Mathematics
Applied Mathematics

Access to Document

10.1016/j.jcp.2003.12.020

Cite this

@article{3c20a3344d2f4117ba37ab68205d00dd,

title = "Multi-resolution analysis of Wiener-type uncertainty propagation schemes",

abstract = "A multi-resolution analysis (MRA) is applied to an uncertainty propagation scheme based on a generalized polynomial chaos (PC) representation. The MRA relies on an orthogonal projection of uncertain data and solution variables onto a multi-wavelet basis, consisting of compact piecewise-smooth polynomial functions. The coefficients of the expansion are computed through a Galerkin procedure. The MRA scheme is applied to the simulation of the Lorenz system having a single random parameter. The convergence of the solution with respect to the resolution level and expansion order is investigated. In particular, results are compared to two Monte-Carlo sampling strategies, demonstrating the superiority of the MRA. For more complex problems, however, the MRA approach may require excessive CPU times. Adaptive methods are consequently developed in order to overcome this drawback. Two approaches are explored: the first is based on adaptive refinement of the multi-wavelet basis, while the second is based on adaptive block-partitioning of the space of random variables. Computational tests indicate that the latter approach is better suited for large problems, leading to a more efficient, flexible and parallelizable scheme.",

keywords = "Adaptive scheme, Multi-resolution analysis, Multi-wavelets, Polynomial chaos, Uncertainty quantification",

author = "{Le Ma{\^i}tre}, {O. P.} and Najm, {H. N.} and Ghanem, {R. G.} and Knio, {O. M.}",

note = "Funding Information: This work was supported by the Laboratory Directed Research and Development Program at Sandia National Laboratories, funded by the US Department of Energy and by the DOE office of Basic Energy Sciences, Chemical Sciences Division. Support was also provided by the Defense Advanced Research Projects Agency (DARPA) and Air Force Research Laboratory, Air Force Materiel Command, USAF, under agreement number F30602-00-2-0612. The US government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. Computations were performed at the National Center for Supercomputer Applications. ",

year = "2004",

month = jul,

day = "1",

doi = "10.1016/j.jcp.2003.12.020",

language = "English (US)",

volume = "197",

pages = "502--531",

journal = "Journal of Computational Physics",

issn = "0021-9991",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Multi-resolution analysis of Wiener-type uncertainty propagation schemes

AU - Le Maître, O. P.

AU - Najm, H. N.

AU - Ghanem, R. G.

AU - Knio, O. M.

N1 - Funding Information: This work was supported by the Laboratory Directed Research and Development Program at Sandia National Laboratories, funded by the US Department of Energy and by the DOE office of Basic Energy Sciences, Chemical Sciences Division. Support was also provided by the Defense Advanced Research Projects Agency (DARPA) and Air Force Research Laboratory, Air Force Materiel Command, USAF, under agreement number F30602-00-2-0612. The US government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. Computations were performed at the National Center for Supercomputer Applications.

PY - 2004/7/1

Y1 - 2004/7/1

N2 - A multi-resolution analysis (MRA) is applied to an uncertainty propagation scheme based on a generalized polynomial chaos (PC) representation. The MRA relies on an orthogonal projection of uncertain data and solution variables onto a multi-wavelet basis, consisting of compact piecewise-smooth polynomial functions. The coefficients of the expansion are computed through a Galerkin procedure. The MRA scheme is applied to the simulation of the Lorenz system having a single random parameter. The convergence of the solution with respect to the resolution level and expansion order is investigated. In particular, results are compared to two Monte-Carlo sampling strategies, demonstrating the superiority of the MRA. For more complex problems, however, the MRA approach may require excessive CPU times. Adaptive methods are consequently developed in order to overcome this drawback. Two approaches are explored: the first is based on adaptive refinement of the multi-wavelet basis, while the second is based on adaptive block-partitioning of the space of random variables. Computational tests indicate that the latter approach is better suited for large problems, leading to a more efficient, flexible and parallelizable scheme.

AB - A multi-resolution analysis (MRA) is applied to an uncertainty propagation scheme based on a generalized polynomial chaos (PC) representation. The MRA relies on an orthogonal projection of uncertain data and solution variables onto a multi-wavelet basis, consisting of compact piecewise-smooth polynomial functions. The coefficients of the expansion are computed through a Galerkin procedure. The MRA scheme is applied to the simulation of the Lorenz system having a single random parameter. The convergence of the solution with respect to the resolution level and expansion order is investigated. In particular, results are compared to two Monte-Carlo sampling strategies, demonstrating the superiority of the MRA. For more complex problems, however, the MRA approach may require excessive CPU times. Adaptive methods are consequently developed in order to overcome this drawback. Two approaches are explored: the first is based on adaptive refinement of the multi-wavelet basis, while the second is based on adaptive block-partitioning of the space of random variables. Computational tests indicate that the latter approach is better suited for large problems, leading to a more efficient, flexible and parallelizable scheme.

KW - Adaptive scheme

KW - Multi-resolution analysis

KW - Multi-wavelets

KW - Polynomial chaos

KW - Uncertainty quantification

UR - http://www.scopus.com/inward/record.url?scp=3242712896&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2003.12.020

DO - 10.1016/j.jcp.2003.12.020

M3 - Article

AN - SCOPUS:3242712896

SN - 0021-9991

VL - 197

SP - 502

EP - 531

JO - Journal of Computational Physics

JF - Journal of Computational Physics

IS - 2

ER -

Multi-resolution analysis of Wiener-type uncertainty propagation schemes

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this