Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Abstract For practical model-based demands, such as design space exploration and uncertainty quantification (UQ), a high-fidelity model that produces accurate outputs often has high computational cost, while a low-fidelity model with less accurate outputs has low computational cost. It is often possible to construct a bi-fidelity model having accuracy comparable with the high-fidelity model and computational cost comparable with the low-fidelity model. This work presents the construction and analysis of a non-intrusive (i.e., sample-based) bi-fidelity model that relies on the low-rank structure of the map between model parameters/uncertain inputs and the solution of interest, if exists. Specifically, we derive a novel, pragmatic estimate for the error committed by this bi-fidelity model. We show that this error bound can be used to determine if a given pair of low- and high-fidelity models will lead to an accurate bi-fidelity approximation. The cost of this error bound is relatively small and depends on the solution rank. The value of this error estimate is demonstrated using two example problems in the context of UQ, involving linear and non-linear partial differential equations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Automated Solution of Differential Equations by the Finite Element Method: The FEniCS Book
(2012) · Lecture Notes in Computational Science and Engineering · doi:10.1007/978-3-642-23099-8 · Cited by 2,204
Cited by
Digital twin: values, challenges and enablers from a modeling perspective
Rasheed, A., San, O., & Kvamsdal, T. (2020) · IEEE Access · doi:10.1109/access.2020.2970143 · Cited by 1,952
Digital Twin: Values, Challenges and Enablers
Rasheed, A., San, O., & Kvamsdal, T. (2019) · arXiv · doi:10.48550/arxiv.1910.01719 · Cited by 81
Gao, H., Zhu, X., & Wang, J.-X. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113047 · Cited by 27
“Practical estimation of the error bound of the BF approach was proposed in [82], where a number of additional HF samples are required.”
Background
Metadata
- Authors
- Hampton, J., Fairbanks, H. R., Narayan, A., & Doostan, A.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2018-09
- Volume
- 368
- Pages
- 315-332
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2797702392
- Cited by
- 47
- References
- 1
- FWCI
- 3.50
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction. https://app.cochat.ai/papers/10.1016/j.jcp.2018.04.015
- The paper
- Hampton, J., Fairbanks, H. R., Narayan, A., & Doostan, A. (2018). Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction. Journal of Computational Physics. https://doi.org/10.1016/j.jcp.2018.04.015
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.