Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 1,061

The DOI matches its Crossref record; 132 of the 132 references it cites were found in a registry or an index.

Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization

Open access
Peherstorfer, Benjamin, Willcox, Karen, Gunzburger, Max · 2018 · SIAM Review

Abstract

In many situations across computational science and engineering, multiple computational models are available that describe a system of interest. These different models have varying evaluation costs and varying fidelities. Typically, a computationally expensive high-fidelity model describes the system with the accuracy required by the current application at hand, while lower-fidelity models are less accurate but computationally cheaper than the high-fidelity model. Outer-loop applications, such as optimization, inference, and uncertainty quantification, require multiple model evaluations at many different inputs, which often leads to computational demands that exceed available resources if only the high-fidelity model is used. This work surveys multifidelity methods that accelerate the solution of outer-loop applications by combining high-fidelity and low-fidelity model evaluations, where the low-fidelity evaluations arise from an explicit low-fidelity model (e.g., a simplified physics approximation, a reduced model, a data-fit surrogate) that approximates the same output quantity as the high-fidelity model. The overall premise of these multifidelity methods is that low-fidelity models are leveraged for speedup while the high-fidelity model is kept in the loop to establish accuracy and/or convergence guarantees. We categorize multifidelity methods according to three classes of strategies: adaptation, fusion, and filtering. The paper reviews multifidelity methods in the outer-loop contexts of uncertainty propagation, inference, and optimization.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/16m1082469

Cites

132 of 132 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 91

  1. 10.2514/2.2877 · doi:10.2514/2.2877
  2. Annels A. E., 1991, The Netherlands, 175
  3. Arian E., 2002, NV, 3300
  4. 10.1007/s00211-005-0601-x · doi:10.1007/s00211-005-0601-x
  5. 10.1007/BF01462238 · doi:10.1007/bf01462238
  6. 10.1007/BF01743349 · doi:10.1007/bf01743349
  7. 10.1137/090776925 · doi:10.1137/090776925
  8. Bernardini A., 1999, Vienna, 63
  9. C. M. Bishop, Pattern Recognition and Machine Learning , Springer, 2006.
  10. 10.1016/j.cma.2012.05.003 · doi:10.1016/j.cma.2012.05.003
  11. 10.4310/CMS.2010.v8.n3.a7 · doi:10.4310/cms.2010.v8.n3.a7
  12. 10.1090/S0025-5718-1990-1023042-6 · doi:10.1090/s0025-5718-1990-1023042-6
  13. W. Briggs, V. E. Henson, and S. F. McCormick, A Multigrid Tutorial , 2nd ed., SIAM, Philadelphia, 2000,https://doi.org/10.1137/1.9780898719505. · DOI · Paper page
  14. 10.1137/080731542 · doi:10.1137/080731542
  15. 10.1002/num.20579 · doi:10.1002/num.20579
  16. 10.1002/nme.4800 · DOI
  17. 10.2514/1.J052930 · doi:10.2514/1.j052930
  18. 10.1016/j.cma.2013.08.016 · doi:10.1016/j.cma.2013.08.016
  19. 10.2514/1.34362 · DOI
  20. 10.2514/1.28948 · doi:10.2514/1.28948
  21. 10.1198/106186005X76983 · doi:10.1198/106186005x76983
  22. 10.1007/s00791-011-0160-x · doi:10.1007/s00791-011-0160-x
  23. A. R. Conn, N. I. M. Gould, and P. L. Toint, Trust-Region Methods , MOS-SIAM Ser. Optim. 1, SIAM, Philadelphia, 2000,https://doi.org/10.1137/1.9780898719857(accessed 2014-10-04). · DOI · Paper page
  24. 10.1214/13-STS421 · DOI
  25. 10.1007/BF01385864 · doi:10.1007/bf01385864
  26. I. Daubechies, Ten Lectures on Wavelets , SIAM, Philadelphia, 1992,https://doi.org/10.1137/1.9781611970104. · DOI · Paper page
  27. Du Q., 2003, Birkhäuser Basel, 137
  28. 10.1137/050628568 · doi:10.1137/050628568
  29. Eldred M., 2004, American Institute of Aeronautics and Astronautics, 2004, 10
  30. M. S. Eldred, L. W. T. Ng, M. F. Barone, and S. P. Domino, Multifidelity uncertainty quantification using spectral stochastic discrepancy models , in Handbook of Uncertainty Quantification, R. Ghanem, D. Higdon, and H. Owhadi, eds., Cham, 2016, Springer International, pp. 1-45. · doi:10.1007/978-3-319-11259-6_25-1
  31. 10.1081/STM-120014220 · doi:10.1081/stm-120014220
  32. Fahl M., 2003, Springer, 268
  33. 10.1109/43.384428 · doi:10.1109/43.384428
  34. Fox C., 1997, University of Leeds, 91
  35. 10.1017/S0962492902000120 · doi:10.1017/s0962492902000120
  36. K. Gallivan, E. Grimme, and P. Van Dooren, Padé approximation of large-scale dynamic systems with Lanczos methods , in Proceedings of the 33rd IEEE Conference on Decision and Control, 1994.
  37. W. Gilks, S. Richardson, and D. Spiegelhalter, Markov Chain Monte Carlo in Practice , Chapman & Hall, 1996. · DOI · Paper page
  38. Gilks W. R., 1994, J. Roy. Statist. Soc. Ser. D, 43, 179
  39. 10.1051/m2an:2007031 · doi:10.1051/m2an:2007031
  40. 10.1051/m2an/2012045 · doi:10.1051/m2an/2012045
  41. 10.1051/m2an:2008001 · doi:10.1051/m2an:2008001
  42. W. Hackbusch, Multi-Grid Methods and Applications , Springer, 1985. · DOI · Paper page
  43. 10.1007/s00211-015-0734-5 · doi:10.1007/s00211-015-0734-5
  44. J. M. Hammersley and D. C. Handscomb, Monte Carlo Methods , Methuen, London, 1964. · DOI · Paper page
  45. Heinrich S., 2001, Heidelberg, 58
  46. 10.1007/s10589-007-9058-4 · doi:10.1007/s10589-007-9058-4
  47. Hooke R., 1961, solution of numerical and statistical problems, J. ACM, 8, 212
  48. 10.3934/ipi.2007.1.77 · doi:10.3934/ipi.2007.1.77
  49. 10.1016/j.crma.2007.09.019 · doi:10.1016/j.crma.2007.09.019
  50. J. Kaipio and E. Somersalo, Statistical and Computational Inverse Problems , Springer, 2005. · DOI · Paper page
  51. Kennedy M. C., 2002, London, 227
  52. V. Kolehmainen, M. Schweiger, I. Nissilä, T. Tarvainen, S. R. Arridge, and J. P. Kaipio, Approximation errors and model reduction in three-dimensional diffuse optical tomography , in Biomedical Optics and 3-D Imaging (2012), Optical Society of America, 2012, art. BTu3A.5. · doi:10.1364/biomed.2012.btu3a.5
  53. 10.1137/080733565 · doi:10.1137/080733565
  54. 10.1137/S0036142900382612 · doi:10.1137/s0036142900382612
  55. E. Leamer, Specification Searches: Ad Hoc Inference with Nonexperimental Data , John Wiley & Sons, 1978.
  56. 10.1016/j.jcp.2011.08.008 · DOI
  57. 10.1016/j.jcp.2010.08.022 · doi:10.1016/j.jcp.2010.08.022
  58. J. S. Liu, Monte Carlo Strategies in Scientific Computing , Springer, 2008.
  59. Y. Marzouk and K. Willcox, Uncertainty quantification , in The Princeton Companion to Applied Mathematics, N. Higham, ed., Princeton University Press, 2015.
  60. S. F. McCormick, Multigrid Methods , SIAM, Philadelphia, 1987,https://doi.org/10.1137/1.9781611971057. · doi:10.1137/1.9781611971057
  61. Mira A., 2001, Metron---Internat. J. Statist., 59, 231
  62. 10.1016/0305-0548(87)90024-4 · doi:10.1016/0305-0548(87)90024-4
  63. 10.1007/s40072-015-0055-9 · doi:10.1007/s40072-015-0055-9
  64. J. Nocedal and S. Wright, Numerical Optimization , Springer, 2006.
  65. 10.1080/0740817X.2011.610430 · doi:10.1080/0740817x.2011.610430
  66. Peherstorfer B., 2014, SIAM, 443
  67. 10.1137/140989169 · doi:10.1137/140989169
  68. M. J., 1970, Gordon and Breach, 115
  69. M. J. D. Powell, A new algorithm for unconstrained optimization , in Nonlinear Programming, Academic Press, 1970, pp. 31-65. · DOI · Paper page
  70. M. J. D. Powell, Convergence properties of a class of minimization algorithms , in Nonlinear Programming 2, Academic Press, 1975, pp. 1-27. · doi:10.1016/b978-0-12-468650-2.50005-5
  71. D. Rajnarayan, Trading Risk and Performance for Engineering Design Optimization Using Multifidelity Analyses , Ph.D. thesis, Stanford University, 2009.
  72. C. Rasmussen and C. Williams, Gaussian Processes for Machine Learning , MIT Press, 2006. · DOI · Paper page
  73. 10.1007/s00211-013-0534-8 · doi:10.1007/s00211-013-0534-8
  74. 10.1016/j.cma.2006.09.005 · doi:10.1016/j.cma.2006.09.005
  75. B. Schölkopf and A. Smola, Learning with Kernels , MIT Press, 2001. · DOI · Paper page
  76. Schmid P., 2008, American Physical Society, 208
  77. 10.1016/j.ast.2015.04.011 · doi:10.1016/j.ast.2015.04.011
  78. A. Tarantola, Inverse Problem Theory , Elsevier, 1987.
  79. Tarantola A., 1982, J. Geophys., (, 159
  80. 10.1364/BOE.1.000209 · doi:10.1364/boe.1.000209
  81. 10.1088/0266-5611/26/1/015005 · doi:10.1088/0266-5611/26/1/015005
  82. 10.1137/140969002 · doi:10.1137/140969002
  83. 10.1007/s00211-013-0546-4 · doi:10.1007/s00211-013-0546-4
  84. U. Trottenberg, C. Oosterlee, and A. Schüller, Multigrid , Academic Press, 2001.
  85. 10.1016/j.crma.2012.01.026 · doi:10.1016/j.crma.2012.01.026
  86. 10.2514/2.333 · doi:10.2514/2.333
  87. 10.1002/fld.867 · doi:10.1002/fld.867
  88. 10.1016/j.jcp.2015.05.041 · doi:10.1016/j.jcp.2015.05.041
  89. 10.1137/120903300 · doi:10.1137/120903300
  90. 10.1016/0096-3003(86)90113-X · doi:10.1016/0096-3003(86)90113-x
  91. 10.1137/120869171 · doi:10.1137/120869171

Cited by

See all 1,061

Metadata

Authors
Peherstorfer, B., Willcox, K., & Gunzburger, M.
Venue
SIAM Review
Published
2018-01
Volume
60
Issue
3
Pages
550-591
ISSN
  • 0036-1445 (ISSN-L)
  • 1095-7200
OpenAlex
W2811395263
Cited by
1,061
References
132
FWCI
61.96
Type
journal article
Language
en
Open access
hybrid
Funders
  • DOD | USAF | AFMC | Air Force Office of Scientific Research (FA9550-15-1-0038, FA9550-15-1-0001)
  • U.S. Department of Energy (DE-FG02-08ER2585, DE-SC0009297, DE-SC0009324)
  • DOD | Defense Advanced Research Projects Agency (UTA15-001067)
  • MIT-SUTD International Design Center

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.