S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

Abstract

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce a points selection algorithm developed by Shin and Xiu [SIAM J. Sci. Comput., 38 (2016), pp. A385-A411], as a hyper-reduction method. The selection algorithm is originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity S that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with an over-sampled Discrete Empirical Interpolation (DEIM) algorithm. We found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy for a given number of indices.

A centrality-based selection method for SDN measurement nodes in large-scale networks

“…In addition to heuristic algorithms, there are also approximate algorithms like greedy algorithms [17] and reduced-order algorithms [18]. These algorithms either have a relatively high time complexity, or limit the size of the problem, or have a poor performance approximation ratio, or the algorithm search process is somewhat blind, or the execution is poor, which affects the application of the algorithms.…”

gLaSDI: Parametric Physics-informed Greedy Latent Space Dynamics Identification

“…Popular linear projection techniques include the proper orthogonal decomposition (POD) [9], the reduced basis method [10], and the balanced truncation method [11], while autoencoders [12,13] are often applied for nonlinear projection [14,15,16]. The linear-subspace ROM (LS-ROM) has been successfully applied to various problems, such as nonlinear heat conduction [17], Lagrangian hydrodynamics [18,19,20], nonlinear diffusion equations [17,21], Burgers equations [20,22,23,24], convection-diffusion equations [25,26], Navier-Stokes equations [27,28], Boltzmann transport problems [29,30], fracture mechanics [31,32], molecular dynamics [33,34], fatigue analysis under cycling-induced plastic deformations [35], topology optimization [36,37], structural design optimization [38,39], etc. Despite successes of the classical LS-ROM in many applications, it is limited to the assumption that intrinsic solution space falls into a low-dimensional subspace, which means the solution space has a small Kolmogorov n-width.…”