Indirect reduced-order modelling: using nonlinear manifolds to conserve kinetic energy

Nonlinear dynamic analysis of complex engineering structures modelled using commercial finite element (FE) software is computationally expensive. Indirect reduced-order modelling strategies alleviate this cost by constructing low-dimensional models using a static solution dataset from the FE model. The applicability of such methods is typically limited to structures in which (a) the main source of nonlinearity is the quasi-static coupling between transverse and in-plane modes (i.e. membrane stretching); and (b) the amount of in-plane displacement is limited. We show that the second requirement arises from the fact that, in existing methods, in-plane kinetic energy is assumed to be negligible. For structures such as thin plates and slender beams with fixed/pinned boundary conditions, this is often reasonable, but in structures with free boundary conditions (e.g. cantilever beams), this assumption is violated. Here, we exploit the concept of nonlinear manifolds to show how the in-plane kinetic energy can be accounted for in the reduced dynamics, without requiring any additional information from the FE model. This new insight enables indirect reduction methods to be applied to a far wider range of structures while maintaining accuracy to higher deflection amplitudes. The accuracy of the proposed method is validated using an FE model of a cantilever beam.

Select to better learn: Fast and accurate deep learning using data selection from nonlinear manifolds

Finding a small subset of data whose linear combination spans other data points, also called column subset selection problem (CSSP), is an important open problem in computer science with many applications in computer vision and deep learning. There are some studies that solve CSSP in a polynomial time complexity w.r.t. the size of the original dataset. A simple and efficient selection algorithm with a linear complexity order, referred to as spectrum pursuit (SP), is proposed that pursuits spectral components of the dataset using available sample points. The proposed non-greedy algorithm aims to iteratively find K data samples whose span is close to that of the first K spectral components of entire data. SP has no parameter to be fine tuned and this desirable property makes it problem-independent. The simplicity of SP enables us to extend the underlying linear model to more complex models such as nonlinear manifolds and graph-based models. The nonlinear extension of SP is introduced as kernel-SP (KSP). The superiority of the proposed algorithms is demonstrated in a wide range of applications.

Select to better learn: Fast and accurate deep learning using data selection from nonlinear manifolds

Finding a small subset of data whose linear combination spans other data points, also called column subset selection problem (CSSP), is an important open problem in computer science with many applications in computer vision and deep learning. There are some studies that solve CSSP in a polynomial time complexity w.r.t. the size of the original dataset. A simple and efficient selection algorithm with a linear complexity order, referred to as spectrum pursuit (SP), is proposed that pursuits spectral components of the dataset using available sample points. The proposed non-greedy algorithm aims to iteratively find K data samples whose span is close to that of the first K spectral components of entire data. SP has no parameter to be fine tuned and this desirable property makes it problem-independent. The simplicity of SP enables us to extend the underlying linear model to more complex models such as nonlinear manifolds and graph-based models. The nonlinear extension of SP is introduced as kernel-SP (KSP). The superiority of the proposed algorithms is demonstrated in a wide range of applications.

Hyper-Reduction Over Nonlinear Manifolds for Large Nonlinear Mechanical Systems

Common trends in model reduction of large nonlinear finite element (FE)-discretized systems involve Galerkin projection of the governing equations onto a low-dimensional linear subspace. Though this reduces the number of unknowns in the system, the computational cost for obtaining the reduced solution could still be high due to the prohibitive computational costs involved in the evaluation of nonlinear terms. Hyper-reduction methods are then used for fast approximation of these nonlinear terms. In the finite element context, the energy conserving sampling and weighing (ECSW) method has emerged as an effective tool for hyper-reduction of Galerkin-projection-based reduced-order models (ROMs). More recent trends in model reduction involve the use of nonlinear manifolds, which involves projection onto the tangent space of the manifold. While there are many methods to identify such nonlinear manifolds, hyper-reduction techniques to accelerate computation in such ROMs are rare. In this work, we propose an extension to ECSW to allow for hyper-reduction using nonlinear mappings, while retaining its desirable stability and structure-preserving properties. As a proof of concept, the proposed hyper-reduction technique is demonstrated over models of a flat plate and a realistic wing structure, whose dynamics have been shown to evolve over a nonlinear (quadratic) manifold. An online speed-up of over one thousand times relative to the full system has been obtained for the wing structure using the proposed method, which is higher than its linear counterpart using the ECSW.

Towards Generalized and Efficient Metric Learning on Riemannian Manifold

Modeling data as points on non-linear Riemannian manifold has attracted increasing attentions in many computer vision tasks, especially visual recognition. Learning an appropriate metric on Riemannian manifold plays a key role in achieving promising performance. For widely used symmetric positive definite (SPD) manifold and Grassmann manifold, most of existing metric learning methods are designed for one manifold, and are not straightforward for the other one. Furthermore, optimizations in previous methods usually rely on computationally expensive iterations. To address above limitations, this paper makes an attempt to propose a generalized and efficient Riemannian manifold metric learning (RMML) method, which can be flexibly adopted to both SPD and Grassmann manifolds. By minimizing the geodesic distance of similar pairs and the interpoint geodesic distance of dissimilar ones on nonlinear manifolds, the proposed RMML is optimized by computing the geodesic mean between inverse of similarity matrix and dissimilarity matrix, benefiting a global closed-form solution and high efficiency. The experiments are conducted on various visual recognition tasks, and the results demonstrate our RMML performs favorably against its counterparts in terms of both accuracy and efficiency.

HYPERSPECTRAL IMAGE KERNEL SPARSE SUBSPACE CLUSTERING WITH SPATIAL MAX POOLING OPERATION

In this paper, we present a kernel sparse subspace clustering with spatial max pooling operation (KSSC-SMP) algorithm for hyperspectral remote sensing imagery. Firstly, the feature points are mapped from the original space into a higher dimensional space with a kernel strategy. In particular, the sparse subspace clustering (SSC) model is extended to nonlinear manifolds, which can better explore the complex nonlinear structure of hyperspectral images (HSIs) and obtain a much more accurate representation coefficient matrix. Secondly, through the spatial max pooling operation, the spatial contextual information is integrated to obtain a smoother clustering result. Through experiments, it is verified that the KSSC-SMP algorithm is a competitive clustering method for HSIs and outperforms the state-of-the-art clustering methods.