The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Data-driven reduced order modeling for time-dependent problems
Open accessAbstract
A data-driven reduced basis (RB) method for parametrized time-dependent problems is proposed. This method requires the offline preparation of a database comprising the time history of the full-order solutions at parameter locations. Based on the full-order data, a reduced basis is constructed by the proper orthogonal decomposition (POD), and the maps between the time/parameter values and the projection coefficients onto the RB are approximated as a regression model. With a natural tensor grid between the time and the parameters in the database, a singular-value decomposition (SVD) is used to extract the principal components in the data of projection coefficients. The regression functions are represented as the linear combinations of several tensor products of two Gaussian processes, one of time and the other of parameters. During the online stage, the solutions at new time/parameter locations in the domain of interest can be recovered rapidly as outputs from the regression models. Featuring a non-intrusive nature and the complete decoupling of the offline and online stages, the proposed approach provides a reliable and efficient tool for approximating parametrized time-dependent problems, and its effectiveness is illustrated by non-trivial numerical examples.
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
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Bathe, K. (1995) · CERN Document Server (European Organization for Nuclear Research) · Cited by 10,651
(2012) · Cited by 9,062
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Pattern recognition and machine learning
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5091 · Cited by 2,650
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16
Storkey, A. (2004) · neural information processing systems · Cited by 2,085
Nonlinear Model Reduction via Discrete Empirical Interpolation
Chaturantabut, S., & Sorensen, D. C. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090766498 · Cited by 1,925
Cited by
Integrating Scientific Knowledge with Machine Learning for Engineering and Environmental Systems
Willard, J., Jia, X., Xu, S., Steinbach, M., & Kumar, V. (2023) · ACM Computing Surveys · doi:10.1145/3514228 · Cited by 878
Physics-informed multi-LSTM networks for metamodeling of nonlinear structures
Zhang, R., Liu, Y., & Sun, H. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113226 · Cited by 504
Fresca, S., Dede’, L., & Manzoni, A. (2021) · Journal of Scientific Computing · doi:10.1007/s10915-021-01462-7 · Cited by 309
Metadata
- Authors
- Guo, M., & Hesthaven, J. S.
- Venue
- Computer Methods in Applied Mechanics and Engineering
- Publisher
- Elsevier BV
- Published
- 2019-03
- Volume
- 345
- Pages
- 75-99
- ISSN
- 0045-7825 (ISSN-L)
- OpenAlex
- W2885469054
- Cited by
- 260
- References
- 36
- FWCI
- 10.36
- 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: Data-driven reduced order modeling for time-dependent problems. https://app.cochat.ai/papers/10.1016/j.cma.2018.10.029
- The paper
- Guo, M., & Hesthaven, J. S. (2019). Data-driven reduced order modeling for time-dependent problems. Computer Methods in Applied Mechanics and Engineering. https://doi.org/10.1016/j.cma.2018.10.029
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.