Julius Reiss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Julius Reiss has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Jörn Sesterhenn
Lehrstuhl für Technische Mechanik und Strömungsmechanik Universität Bayreuth Bayreuth Germany
20 shared publications - Philipp Krah
Institut de Mathématiques de Marseille (I2M), Aix-Marseille Université, Marseille, France
5 shared publications - Kai Schneider
Aix-Marseille Université, CNRS, I2M, UMR 7373, 13331 Marseille, France
3 shared publications Mathias Lemke
ISTA, Technische Universität Berlin, Müller-Breslau Str. 8, 10623 Berlin, Germany
3 shared publications- Mathias Lemke
Numerical Fluid Dynamics Group, Technische Universität Berlin, Müller-Breslau-Straße 15, 10623 Berlin, Germany
3 shared publications - Christian Oliver Paschereit
TU Berlin
2 shared publications
Latest Publications
- 4 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (2) , A633-A656
A Robust Shifted Proper Orthogonal Decomposition: Proximal Methods for Decomposing Flows with Multiple Transports
We present a new methodology for decomposing flows with multiple transports that further extends the shifted proper orthogonal decomposition (sPOD). The sPOD approximates transport-dominated flows by a sum of co-moving data fields. The proposed methods are derived from sPOD but optimize the co-moving fields directly and penalize their nuclear norm to promote a low rank of the individual data in the decomposition. A robustness term is added for handling interpolation errors and data noise. Using convex optimization tools, we derive three proximal algorithms to solve the decomposition problem. We report a numerical comparison with existing methods using synthetic data and then show the separation ability of our methods for incompressible and reactive flows. The resulting methodology is the basis of a new analysis paradigm that provides the same interpretability as POD for the individual co-moving fields.
- 4 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (2) , A633-A656
A Robust Shifted Proper Orthogonal Decomposition: Proximal Methods for Decomposing Flows with Multiple Transports
We present a new methodology for decomposing flows with multiple transports that further extends the shifted proper orthogonal decomposition (sPOD). The sPOD approximates transport-dominated flows by a sum of co-moving data fields. The proposed methods are derived from sPOD but optimize the co-moving fields directly and penalize their nuclear norm to promote a low rank of the individual data in the decomposition. A robustness term is added for handling interpolation errors and data noise. Using convex optimization tools, we derive three proximal algorithms to solve the decomposition problem. We report a numerical comparison with existing methods using synthetic data and then show the separation ability of our methods for incompressible and reactive flows. The resulting methodology is the basis of a new analysis paradigm that provides the same interpretability as POD for the individual co-moving fields.
- Open Access
- 3 February 2025
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 51 (1) , 1-43
Parametric model order reduction for a wildland fire model via the shifted POD-based deep learning method
Parametric model order reduction techniques often struggle to accurately represent transport-dominated phenomena due to a slowly decaying Kolmogorov n-width. To address this challenge, we propose a non-intrusive, data-driven methodology that combines the shifted proper orthogonal decomposition (POD) with deep learning. Specifically, the shifted POD technique is utilized to derive a high-fidelity, low-dimensional model of the flow, which is subsequently utilized as input to a deep learning framework to forecast the flow dynamics under various temporal and parameter conditions. The efficacy of the proposed approach is demonstrated through the analysis of one- and two-dimensional wildland fire models with varying reaction rates, and its error is compared with the error of other similar methods. The results indicate that the proposed approach yields reliable results within the percent range, while also enabling rapid prediction of system states within seconds.
- 3 February 2025
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 51 (1) , 1-43
Open AccessParametric model order reduction for a wildland fire model via the shifted POD-based deep learning method
Parametric model order reduction techniques often struggle to accurately represent transport-dominated phenomena due to a slowly decaying Kolmogorov n-width. To address this challenge, we propose a non-intrusive, data-driven methodology that combines the shifted proper orthogonal decomposition (POD) with deep learning. Specifically, the shifted POD technique is utilized to derive a high-fidelity, low-dimensional model of the flow, which is subsequently utilized as input to a deep learning framework to forecast the flow dynamics under various temporal and parameter conditions. The efficacy of the proposed approach is demonstrated through the analysis of one- and two-dimensional wildland fire models with varying reaction rates, and its error is compared with the error of other similar methods. The results indicate that the proposed approach yields reliable results within the percent range, while also enabling rapid prediction of system states within seconds.
- Open Access
- 3 June 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 96 (1) , 1-34
Front Transport Reduction for Complex Moving Fronts
This work addresses model order reduction for complex moving fronts, which are transported by advection or through a reaction–diffusion process. Such systems are especially challenging for model order reduction since the transport cannot be captured by linear reduction methods. Moreover, topological changes, such as splitting or merging of fronts pose difficulties for many nonlinear reduction methods and the small non-vanishing support of the underlying partial differential equations dynamics makes most nonlinear hyper-reduction methods infeasible. We propose a new decomposition method together with a hyper-reduction scheme that addresses these shortcomings. The decomposition uses a level-set function to parameterize the transport and a nonlinear activation function that captures the structure of the front. This approach is similar to autoencoder artificial neural networks, but additionally provides insights into the system, which can be used for efficient reduced order models. In addition to the presented decomposition method, we outline a tailored hyper-reduction method that is based on the reduced integration domain method. The capability of the approach is illustrated by various numerical examples in one and two spatial dimensions, including an advection–reaction–diffusion system with a Kolmogorov–Petrovsky–Piskunov reaction term and real life application to a two-dimensional Bunsen flame.
- 3 June 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 96 (1) , 1-34
Open AccessFront Transport Reduction for Complex Moving Fronts
This work addresses model order reduction for complex moving fronts, which are transported by advection or through a reaction–diffusion process. Such systems are especially challenging for model order reduction since the transport cannot be captured by linear reduction methods. Moreover, topological changes, such as splitting or merging of fronts pose difficulties for many nonlinear reduction methods and the small non-vanishing support of the underlying partial differential equations dynamics makes most nonlinear hyper-reduction methods infeasible. We propose a new decomposition method together with a hyper-reduction scheme that addresses these shortcomings. The decomposition uses a level-set function to parameterize the transport and a nonlinear activation function that captures the structure of the front. This approach is similar to autoencoder artificial neural networks, but additionally provides insights into the system, which can be used for efficient reduced order models. In addition to the presented decomposition method, we outline a tailored hyper-reduction method that is based on the reduced integration domain method. The capability of the approach is illustrated by various numerical examples in one and two spatial dimensions, including an advection–reaction–diffusion system with a Kolmogorov–Petrovsky–Piskunov reaction term and real life application to a two-dimensional Bunsen flame.
- Open Access
Parametric model order reduction for a wildland fire model via the shifted POD based deep learning method
Parametric model order reduction techniques often struggle to accurately represent transport-dominated phenomena due to a slowly decaying Kolmogorov n-width. To address this challenge, we propose a non-intrusive, data-driven methodology that combines the shifted proper orthogonal decomposition (POD) with deep learning. Specifically, the shifted POD technique is utilized to derive a high-fidelity, low-dimensional model of the flow, which is subsequently utilized as input to a deep learning framework to forecast the flow dynamics under various temporal and parameter conditions. The efficacy of the proposed approach is demonstrated through the analysis of one- and two-dimensional wildland fire models with varying reaction rates, and its performance is evaluated using multiple error measures. The results indicate that the proposed approach yields highly accurate results within the percent range, while also enabling rapid prediction of system states within seconds.
Open AccessParametric model order reduction for a wildland fire model via the shifted POD based deep learning method
Parametric model order reduction techniques often struggle to accurately represent transport-dominated phenomena due to a slowly decaying Kolmogorov n-width. To address this challenge, we propose a non-intrusive, data-driven methodology that combines the shifted proper orthogonal decomposition (POD) with deep learning. Specifically, the shifted POD technique is utilized to derive a high-fidelity, low-dimensional model of the flow, which is subsequently utilized as input to a deep learning framework to forecast the flow dynamics under various temporal and parameter conditions. The efficacy of the proposed approach is demonstrated through the analysis of one- and two-dimensional wildland fire models with varying reaction rates, and its performance is evaluated using multiple error measures. The results indicate that the proposed approach yields highly accurate results within the percent range, while also enabling rapid prediction of system states within seconds.
- Open Access
- 17 February 2022
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 48 (2) , 1-40
Wavelet adaptive proper orthogonal decomposition for large-scale flow data
The proper orthogonal decomposition (POD) is a powerful classical tool in fluid mechanics used, for instance, for model reduction and extraction of coherent flow features. However, its applicability to high-resolution data, as produced by three-dimensional direct numerical simulations, is limited owing to its computational complexity. Here, we propose a wavelet-based adaptive version of the POD (the wPOD), in order to overcome this limitation. The amount of data to be analyzed is reduced by compressing them using biorthogonal wavelets, yielding a sparse representation while conveniently providing control of the compression error. Numerical analysis shows how the distinct error contributions of wavelet compression and POD truncation can be balanced under certain assumptions, allowing us to efficiently process high-resolution data from three-dimensional simulations of flow problems. Using a synthetic academic test case, we compare our algorithm with the randomized singular value decomposition. Furthermore, we demonstrate the ability of our method analyzing data of a two-dimensional wake flow and a three-dimensional flow generated by a flapping insect computed with direct numerical simulation.
- 17 February 2022
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 48 (2) , 1-40
Open AccessWavelet adaptive proper orthogonal decomposition for large-scale flow data
The proper orthogonal decomposition (POD) is a powerful classical tool in fluid mechanics used, for instance, for model reduction and extraction of coherent flow features. However, its applicability to high-resolution data, as produced by three-dimensional direct numerical simulations, is limited owing to its computational complexity. Here, we propose a wavelet-based adaptive version of the POD (the wPOD), in order to overcome this limitation. The amount of data to be analyzed is reduced by compressing them using biorthogonal wavelets, yielding a sparse representation while conveniently providing control of the compression error. Numerical analysis shows how the distinct error contributions of wavelet compression and POD truncation can be balanced under certain assumptions, allowing us to efficiently process high-resolution data from three-dimensional simulations of flow problems. Using a synthetic academic test case, we compare our algorithm with the randomized singular value decomposition. Furthermore, we demonstrate the ability of our method analyzing data of a two-dimensional wake flow and a three-dimensional flow generated by a flapping insect computed with direct numerical simulation.
- Open Access
- 29 January 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (3) , 1-29
Pressure-Tight and Non-stiff Volume Penalization for Compressible Flows
Embedding geometries in structured grids allows a simple treatment of complex objects in fluid simulations. Various methods for embedding geometries are available. The commonly used Brinkman-volume-penalization models geometries as porous media, and approximates a solid object in the limit of vanishing porosity. In its simplest form, the momentum equations are augmented by a term penalizing the fluid velocity, yielding good results in many applications. However, it induces numerical stiffness, especially if high-pressure gradients need to be balanced. Here, we focus on the effect of the reduced effective volume (commonly called porosity) of the porous medium. An approach is derived, which allows reducing the flux through objects to practically zero with little increase of numerical stiffness. Also, non-slip boundary conditions and adiabatic boundary conditions are easily constructed. The porosity terms allow keeping the skew symmetry of the underlying numerical scheme, by which the numerical stability is improved. Furthermore, very good conservation of mass and energy in the non-penalized domain can be achieved, for which the boundary smoothing introduces a small ambiguity in its definition. The scheme is tested for acoustic scenarios, for near incompressible and strongly compressible flows.
- 29 January 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (3) , 1-29
Open AccessPressure-Tight and Non-stiff Volume Penalization for Compressible Flows
Embedding geometries in structured grids allows a simple treatment of complex objects in fluid simulations. Various methods for embedding geometries are available. The commonly used Brinkman-volume-penalization models geometries as porous media, and approximates a solid object in the limit of vanishing porosity. In its simplest form, the momentum equations are augmented by a term penalizing the fluid velocity, yielding good results in many applications. However, it induces numerical stiffness, especially if high-pressure gradients need to be balanced. Here, we focus on the effect of the reduced effective volume (commonly called porosity) of the porous medium. An approach is derived, which allows reducing the flux through objects to practically zero with little increase of numerical stiffness. Also, non-slip boundary conditions and adiabatic boundary conditions are easily constructed. The porosity terms allow keeping the skew symmetry of the underlying numerical scheme, by which the numerical stability is improved. Furthermore, very good conservation of mass and energy in the non-penalized domain can be achieved, for which the boundary smoothing introduces a small ambiguity in its definition. The scheme is tested for acoustic scenarios, for near incompressible and strongly compressible flows.
- Open Access
- 29 December 2021
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 45 (7) , 4035-4055
Finite‐difference‐based simulation and adjoint optimization of gas networks
The stable operation of gas networks is an important optimization target. While for this task commonly finite volume methods are used, we introduce a new finite difference approach. With a summation by part formulation for the spatial discretization, we get well‐defined fluxes between the pipes. This allows a simple and explicit formulation of the coupling conditions at the node. From that, we derive the adjoint equations for the network simply and transparently. The resulting direct and adjoint equations are numerically efficient and easy to implement.
- 29 December 2021
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 45 (7) , 4035-4055
Open AccessFinite‐difference‐based simulation and adjoint optimization of gas networks
The stable operation of gas networks is an important optimization target. While for this task commonly finite volume methods are used, we introduce a new finite difference approach. With a summation by part formulation for the spatial discretization, we get well‐defined fluxes between the pipes. This allows a simple and explicit formulation of the coupling conditions at the node. From that, we derive the adjoint equations for the network simply and transparently. The resulting direct and adjoint equations are numerically efficient and easy to implement.
- Open Access
Pressure-tight and non-stiff volume penalization for compressible flows
Embedding geometries in structured grids allows a simple treatment of complex objects in fluid simulations. Various methods for embedding geometries are available. The commonly used Brinkman-volume-penalization models geometries as porous media, and approximates a solid object in the limit of vanishing porosity. In its simplest form, the momentum equations are augmented by a term penalizing the fluid velocity, yielding good results in many applications. However, it induces numerical stiffness, especially if high-pressure gradients need to be balanced. Here, we focus on the effect of the reduced effective volume (commonly called porosity) of the porous medium. An approach is derived, which allows reducing the flux through objects to practically zero with little increase of numerical stiffness. Also, non-slip boundary conditions and adiabatic boundary conditions are easily constructed. The porosity terms allow keeping the skew symmetry of the underlying numerical scheme, by which the numerical stability is improved. Furthermore, very good conservation of mass and energy in the non-penalized domain can be achieved, for which the boundary smoothing introduces a small ambiguity in its definition. The scheme is tested for acoustic scenarios, for near incompressible and strongly compressible flows.
Open AccessPressure-tight and non-stiff volume penalization for compressible flows
Embedding geometries in structured grids allows a simple treatment of complex objects in fluid simulations. Various methods for embedding geometries are available. The commonly used Brinkman-volume-penalization models geometries as porous media, and approximates a solid object in the limit of vanishing porosity. In its simplest form, the momentum equations are augmented by a term penalizing the fluid velocity, yielding good results in many applications. However, it induces numerical stiffness, especially if high-pressure gradients need to be balanced. Here, we focus on the effect of the reduced effective volume (commonly called porosity) of the porous medium. An approach is derived, which allows reducing the flux through objects to practically zero with little increase of numerical stiffness. Also, non-slip boundary conditions and adiabatic boundary conditions are easily constructed. The porosity terms allow keeping the skew symmetry of the underlying numerical scheme, by which the numerical stability is improved. Furthermore, very good conservation of mass and energy in the non-penalized domain can be achieved, for which the boundary smoothing introduces a small ambiguity in its definition. The scheme is tested for acoustic scenarios, for near incompressible and strongly compressible flows.
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 43 (3) , A2079-A2101
Optimization-Based Modal Decomposition for Systems with Multiple Transports
Mode-based model-reduction is used to reduce the degrees of freedom of high-dimensional systems, often by describing the system state by a linear combination of spatial modes. Transport dominated p...
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 43 (3) , A2079-A2101
Optimization-Based Modal Decomposition for Systems with Multiple Transports
Mode-based model-reduction is used to reduce the degrees of freedom of high-dimensional systems, often by describing the system state by a linear combination of spatial modes. Transport dominated p...
- Open Access
Wavelet Adaptive Proper Orthogonal Decomposition for Large Scale Flow Data
The proper orthogonal decomposition (POD) is a powerful classical tool in fluid mechanics used, for instance, for model reduction and extraction of coherent flow features. However, its applicability to high-resolution data, as produced by three-dimensional direct numerical simulations, is limited owing to its computational complexity. Here, we propose a wavelet-based adaptive version of the POD (the wPOD), in order to overcome this limitation. The amount of data to be analyzed is reduced by compressing them using biorthogonal wavelets, yielding a sparse representation while conveniently providing control of the compression error. Numerical analysis shows how the distinct error contributions of wavelet compression and POD truncation can be balanced under certain assumptions, allowing us to efficiently process high-resolution data from three-dimensional simulations of flow problems. Using a synthetic academic test case, we compare our algorithm with the randomized singular value decomposition. Furthermore, we demonstrate the ability of our method analyzing data of a 2D wake flow and a 3D flow generated by a flapping insect computed with direct numerical simulation.
Open AccessWavelet Adaptive Proper Orthogonal Decomposition for Large Scale Flow Data
The proper orthogonal decomposition (POD) is a powerful classical tool in fluid mechanics used, for instance, for model reduction and extraction of coherent flow features. However, its applicability to high-resolution data, as produced by three-dimensional direct numerical simulations, is limited owing to its computational complexity. Here, we propose a wavelet-based adaptive version of the POD (the wPOD), in order to overcome this limitation. The amount of data to be analyzed is reduced by compressing them using biorthogonal wavelets, yielding a sparse representation while conveniently providing control of the compression error. Numerical analysis shows how the distinct error contributions of wavelet compression and POD truncation can be balanced under certain assumptions, allowing us to efficiently process high-resolution data from three-dimensional simulations of flow problems. Using a synthetic academic test case, we compare our algorithm with the randomized singular value decomposition. Furthermore, we demonstrate the ability of our method analyzing data of a 2D wake flow and a 3D flow generated by a flapping insect computed with direct numerical simulation.