Polytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Heiland, Jan, Kim, Yongho
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929565667950592
author Heiland, Jan
Kim, Yongho
author_facet Heiland, Jan
Kim, Yongho
contents With the advancement of neural networks, there has been a notable increase, both in terms of quantity and variety, in research publications concerning the application of autoencoders to reduced-order models. We propose a polytopic autoencoder architecture that includes a lightweight nonlinear encoder, a convex combination decoder, and a smooth clustering network. Supported by several proofs, the model architecture ensures that all reconstructed states lie within a polytope, accompanied by a metric indicating the quality of the constructed polytopes, referred to as polytope error. Additionally, it offers a minimal number of convex coordinates for polytopic linear-parameter varying systems while achieving acceptable reconstruction errors compared to proper orthogonal decomposition (POD). To validate our proposed model, we conduct simulations involving two flow scenarios with the incompressible Navier-Stokes equation. Numerical results demonstrate the guaranteed properties of the model, low reconstruction errors compared to POD, and the improvement in error using a clustering network.
format Preprint
id arxiv_https___arxiv_org_abs_2401_10620
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Polytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows
Heiland, Jan
Kim, Yongho
Machine Learning
Computer Vision and Pattern Recognition
Dynamical Systems
With the advancement of neural networks, there has been a notable increase, both in terms of quantity and variety, in research publications concerning the application of autoencoders to reduced-order models. We propose a polytopic autoencoder architecture that includes a lightweight nonlinear encoder, a convex combination decoder, and a smooth clustering network. Supported by several proofs, the model architecture ensures that all reconstructed states lie within a polytope, accompanied by a metric indicating the quality of the constructed polytopes, referred to as polytope error. Additionally, it offers a minimal number of convex coordinates for polytopic linear-parameter varying systems while achieving acceptable reconstruction errors compared to proper orthogonal decomposition (POD). To validate our proposed model, we conduct simulations involving two flow scenarios with the incompressible Navier-Stokes equation. Numerical results demonstrate the guaranteed properties of the model, low reconstruction errors compared to POD, and the improvement in error using a clustering network.
title Polytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows
topic Machine Learning
Computer Vision and Pattern Recognition
Dynamical Systems
url https://arxiv.org/abs/2401.10620