Shaowu Pan

Dr. Shaowu Pan

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2020 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
LSLuning Sun
Luning Sun
HGHan Gao
Han Gao
SPShaowu Pan
Shaowu Pan
JWJian-Xun Wang
Jian-Xun Wang

12 June 2019 in Computational Mechanics
Verified
Journal Article
Closed access
PDF file
SBSaakaar Bhatnagar
Saakaar Bhatnagar
YAYaser Afshar
Yaser Afshar
SPShaowu Pan
Shaowu Pan
KDKarthik Duraisamy
Karthik Duraisamy
SKShailendra Kaushik
Shailendra Kaushik

1 January 2020 in SIAM Journal on Applied Dynamical Systems
Verified
Journal Article
Closed access
SPShaowu Pan
Shaowu Pan
KDKarthik Duraisamy
Karthik Duraisamy
The Koopman operator has emerged as a powerful tool for the analysis of nonlinear dynamical systems as it provides coordinate transformations to globally linearize the dynamics. While recent deep l...

1 January 2018 in SIAM Journal on Applied Dynamical Systems
Verified
Journal Article
Closed access
SPShaowu Pan
Shaowu Pan
KDKarthik Duraisamy
Karthik Duraisamy
Derivation of reduced order representations of dynamical systems requires the modeling of the truncated dynamics on the retained dynamics. In its most general form, this so-called closure model has to account for memory effects. In this work, we present a framework of operator inference to extract the governing dynamics of closure from data in a compact, non-Markovian form. We employ sparse polynomial regression and artificial neural networks to extract the underlying operator. For a special class of nonlinear systems, observability of the closure in terms of the resolved dynamics is analyzed, and theoretical results are presented on the compactness of the memory. The proposed framework is evaluated on examples consisting of linear to nonlinear systems with and without chaotic dynamics, with an emphasis on predictive performance on unseen data.

1 July 2020 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
SPShaowu Pan
Shaowu Pan
KDKarthik Duraisamy
Karthik Duraisamy
This work addresses fundamental issues related to the structure and conditioning of linear time-delayed models of non-linear dynamics on an attractor. While this approach has been well-studied in the asymptotic sense (e.g., for an infinite number of delays), the non-asymptotic setting is not well-understood. First, we show that the minimal time-delays required for perfect signal recovery are solely determined by the sparsity in the Fourier spectrum for scalar systems. For the vector case, we provide a rank test and a geometric interpretation for the necessary and sufficient conditions for the existence of an accurate linear time delayed model. Furthermore, we prove that the output controllability index of a linear system induced by the Fourier spectrum serves as a tight upper bound on the minimal number of time delays required. An explicit expression for the exact linear model in the spectral domain is also provided. From a numerical perspective, the effect of the sampling rate and the number of time delays on numerical conditioning is examined. An upper bound on the condition number is derived, with the implication that conditioning can be improved with additional time delays and/or decreasing sampling rates. Moreover, it is explicitly shown that the underlying dynamics can be accurately recovered using only a partial period of the attractor. Our analysis is first validated in simple periodic and quasiperiodic systems, and sensitivity to noise is also investigated. Finally, issues and practical strategies of choosing time delays in large-scale chaotic systems are discussed and demonstrated on 3D turbulent Rayleigh–Bénard convection.

1 January 2018 in Complexity
Verified
Journal Article
Open access
PDF file
SPShaowu Pan
Shaowu Pan
KDKarthik Duraisamy
Karthik Duraisamy
We study the use of feedforward neural networks (FNN) to develop models of nonlinear dynamical systems from data. Emphasis is placed on predictions at long times, with limited data availability. Inspired by global stability analysis, and the observation of strong correlation between the local error and the maximal singular value of the Jacobian of the ANN, we introduce Jacobian regularization in the loss function. This regularization suppresses the sensitivity of the prediction to the local error and is shown to improve accuracy and robustness. Comparison between the proposed approach and sparse polynomial regression is presented in numerical examples ranging from simple ODE systems to nonlinear PDE systems including vortex shedding behind a cylinder and instability‐driven buoyant mixing flow. Furthermore, limitations of feedforward neural networks are highlighted, especially when the training data does not include a low dimensional attractor. Strategies of data augmentation are presented as remedies to address these issues to a certain extent.