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

Jan Heiland, Yongho Kim
1/19/2024
cs.LGcs.CVmath.DS

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{heiland2024polytopic,
  title  = {Polytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows},
  author = {Jan Heiland and Yongho Kim},
  year   = {2024},
  eprint = {2401.10620},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.10620v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.10620.svg)](https://codeofpaper.com/paper/2401.10620)

Discussion