The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Non-intrusive reduced order modeling of unsteady flows using artificial neural networks with application to a combustion problem
Open accessAbstract
Abstract A non-intrusive reduced-basis (RB) method is proposed for parametrized unsteady flows. A set of reduced basis functions are extracted from a collection of high-fidelity solutions via a proper orthogonal decomposition (POD), and the coefficients of the reduced basis functions are recovered by a feedforward neural network (NN). As a regression model of the RB method for unsteady flows, the neural network approximates the map between the time/parameter value and the projection coefficients of the high-fidelity solution onto the reduced space. The generation of the reduced basis and the training of the NN are accomplished in the offline stage, thus the RB solution of a new time/parameter value can be recovered via direct outputs of the NN in the online stage. Due to its non-intrusive nature, the proposed RB method, referred as the POD-NN, fully decouples the online stage and the high-fidelity scheme, and is thus able to provide fast and reliable solutions of complex unsteady flows. To test this assertion, the POD-NN method is applied to the reduced order modeling (ROM) of the quasi-one dimensional Continuously Variable Resonance Combustor (CVRC) flow. Numerical results demonstrate the efficiency and robustness of the POD-NN method.
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S. (2024) · arXiv (Cornell University) · doi:10.57702/o9raffed · Cited by 14,214
(2010) · Cited by 14,134
(2016) · Cited by 11,679
Efficient Implementation of Weighted ENO Schemes
Jiang, G.-S., & Shu, C.-W. (1996) · Journal of Computational Physics · doi:10.1006/jcph.1996.0130 · Cited by 6,571
Efficient implementation of essentially non-oscillatory shock-capturing schemes
Shu, C.-W., & Osher, S. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90177-5 · Cited by 4,886
Efficient implementation of essentially non-oscillatory shock-capturing schemes, II
Shu, C.-W., & Osher, S. (1989) · Journal of Computational Physics · doi:10.1016/0021-9991(89)90222-2 · Cited by 4,851
The Proper Orthogonal Decomposition in the Analysis of Turbulent Flows
Berkooz, G., Holmes, P., & Lumley, J. L. (1993) · Annual Review of Fluid Mechanics · doi:10.1146/annurev.fl.25.010193.002543 · Cited by 4,431
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Gardner, M. W., & Dorling, S. R. (1998) · Atmospheric Environment · doi:10.1016/s1352-2310(97)00447-0 · Cited by 3,324
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
Maulik, R., Lusch, B., & Balaprakash, P. (2021) · Physics of Fluids · doi:10.1063/5.0039986 · Cited by 299
Digital Twin: Values, Challenges and Enablers
Rasheed, A., San, O., & Kvamsdal, T. (2019) · arXiv · doi:10.48550/arxiv.1910.01719 · Cited by 81
Approach to combustion calculation using neural network
Nikitin, V. F., Karandashev, I. M., Malsagov, M. Y., & Mikhalchenko, E. V. (2022) · Acta Astronautica · doi:10.1016/j.actaastro.2021.10.034 · Cited by 27
Metadata
- Authors
- Wang, Q., Hesthaven, J. S., & Ray, D.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2019-05
- Volume
- 384
- Pages
- 289-307
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2809491586
- Cited by
- 286
- References
- 32
- FWCI
- 16.53
- Type
- journal article
- Language
- en
- Open access
- green
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: Non-intrusive reduced order modeling of unsteady flows using artificial neural networks with application to a combustion problem. https://app.cochat.ai/papers/10.1016/j.jcp.2019.01.031
- The paper
- Wang, Q., Hesthaven, J. S., & Ray, D. (2019). Non-intrusive reduced order modeling of unsteady flows using artificial neural networks with application to a combustion problem. Journal of Computational Physics. https://doi.org/10.1016/j.jcp.2019.01.031
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.