The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Comparison of Non-Intrusive Polynomial Chaos and Stochastic Collocation Methods for Uncertainty Quantification
Abstract
Non-intrusive polynomial chaos expansion (PCE) and stochastic collocation (SC) meth-ods are attractive techniques for uncertainty quantification (UQ) due to their strong math-ematical basis and ability to produce functional representations of stochastic variability. PCE estimates coefficients for known orthogonal polynomial basis functions based on a set of response function evaluations, using sampling, linear regression, tensor-product quadra-ture, or Smolyak sparse grid approaches. SC, on the other hand, forms interpolation functions for known coefficients, and requires the use of structured collocation point sets derived from tensor-products or sparse grids. When tailoring the basis functions or inter-polation grids to match the forms of the input uncertainties, exponential convergence rates can be achieved with both techniques for general probabilistic analysis problems. In this paper, we explore relative performance of these methods using a number of simple alge-braic test problems, and analyze observed differences. In these computational experiments, performance of PCE and SC is shown to be very similar, although when differences are evident, SC is the consistent winner over traditional PCE formulations. This stems from the practical difficulty of optimally synchronizing the form of the PCE with the integration approach being employed, resulting in slight over- or under-integration of prescribed ex-pansion form. With additional nontraditional tailoring of PCE form, it is shown that this performance gap can be reduced, and in some cases, eliminated. I.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
An Analysis of Transformations
Box, G. E. P., & Cox, D. R. (1964) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1964.tb00553.x · Cited by 15,052
The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
Xiu, D., & Karniadakis, G. E. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827501387826 · Cited by 4,807
Wiener, N. (1938) · American Journal of Mathematics · doi:10.2307/2371268 · Cited by 3,074
Remarks on a Multivariate Transformation
Rosenblatt, M. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729394 · Cited by 2,863
Calculation of Gauss quadrature rules
Golub, G. H., & Welsch, J. H. (1969) · Mathematics of Computation · doi:10.1090/s0025-5718-69-99647-1 · Cited by 1,653
High-Order Collocation Methods for Differential Equations with Random Inputs
Xiu, D., & Hesthaven, J. S. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040615201 · Cited by 1,522
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
Babuska, I. M., Nobile, F., & Tempone, R. F. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050645142 · Cited by 1,458
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,163
Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials
Askey, R., & Wilson, J. (1985) · Memoirs of the American Mathematical Society · doi:10.1090/memo/0319 · Cited by 1,129
Nobile, F., Tempone, R. F., & Webster, C. (2008) · SIAM Journal on Numerical Analysis · doi:10.1137/060663660 · Cited by 965
Numerical integration using sparse grids
Gerstner, T., & Griebel, M. (1998) · Numerical Algorithms · doi:10.1023/a:1019129717644 · Cited by 923
Eldred, M., Dalbey, K., Bohnhoff, W., Adams, B., Swiler, L., Hough, P., Gay, D., Eddy, J., & Haskell, K. (2010) · doi:10.2172/991842 · Cited by 776
Self-citationHigh dimensional polynomial interpolation on sparse grids
Barthelmann, V., Novak, E., & Ritter, K. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018977404843 · Cited by 644
Eldred, M. (2009) · AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference (SDM) · doi:10.2514/6.2009-2274 · Cited by 362
Self-citationNew Algorithm for Structural Reliability Estimation
Wu, Y., & Wirsching, P. H. (1987) · Journal of Engineering Mechanics · doi:10.1061/(asce)0733-9399(1987)113:9(1319 · Cited by 192
Fast probability integration by three-parameter normal tail approximation
Chen, X., & Lind, N. C. (1982) · Structural Safety · doi:10.1016/0167-4730(82)90003-0 · Cited by 111
Cited by
Review of uncertainty-based multidisciplinary design optimization methods for aerospace vehicles
Yao, W., Chen, X., Luo, W., van Tooren, M., & Guo, J. (2011) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2011.05.001 · Cited by 514
Adversarial uncertainty quantification in physics-informed neural networks
Yang, Y., & Perdikaris, P. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2019.05.027 · Cited by 414
Uncertainty quantification patterns for multiscale models
Ye, D., Veen, L., Nikishova, A., Lakhlili, J., Edeling, W., Luk, O. O., Krzhizhanovskaya, V. V., & Hoekstra, A. G. (2021) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2020.0072 · Cited by 19
Efficient Reliability Assessment With the Conditional Probability Method
Mansour, R., & Olsson, M. (2018) · Journal of Mechanical Design · doi:10.1115/1.4040170 · Cited by 12
Metadata
- Authors
- Eldred, M., & Burkardt, J.
- Venue
- 47th AIAA Aerospace Sciences Meeting including The New Horizons Forum and Aerospace Exposition
- Published
- 2009-01-05
- OpenAlex
- W1986232056
- Cited by
- 340
- References
- 18
- FWCI
- 41.09
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.