Michael Schlegel
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
Michael Schlegel has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Bernd R. Noack
Institut PPRIME, CNRS – Université de Poitiers – ENSMA, UPR 3346, Département Fluides, Thermique, Combustion, CEAT, 43 Rue de l’Aérodrome, 86036 Poitiers CEDEX, France
1 shared publication- Markus Abel
Ambrosys GmbH, 14469 Potsdam, Germany
1 shared publication - Robert K. Niven
School of Engineering and Technology, The University of New South Wales, Canberra, ACT 2600, Australia
1 shared publication - Steven H. Waldrip
School of Engineering and Information Technology, The University of New South Wales, Northcott Drive, Canberra, ACT 2600, Australia
1 shared publication
Latest Publications
- Open Access
Maximum Entropy Analysis of Flow Networks: Theoretical Foundation and Applications
The concept of a “flow network”—a set of nodes and links which carries one or more flows—unites many different disciplines, including pipe flow, fluid flow, electrical, chemical reaction, ecological, epidemiological, neurological, communications, transportation, financial, economic and human social networks. This Feature Paper presents a generalized maximum entropy framework to infer the state of a flow network, including its flow rates and other properties, in probabilistic form. In this method, the network uncertainty is represented by a joint probability function over its unknowns, subject to all that is known. This gives a relative entropy function which is maximized, subject to the constraints, to determine the most probable or most representative state of the network. The constraints can include “observable” constraints on various parameters, “physical” constraints such as conservation laws and frictional properties, and “graphical” constraints arising from uncertainty in the network structure itself. Since the method is probabilistic, it enables the prediction of network properties when there is insufficient information to obtain a deterministic solution. The derived framework can incorporate nonlinear constraints or nonlinear interdependencies between variables, at the cost of requiring numerical solution. The theoretical foundations of the method are first presented, followed by its application to a variety of flow networks.
Open AccessMaximum Entropy Analysis of Flow Networks: Theoretical Foundation and Applications
The concept of a “flow network”—a set of nodes and links which carries one or more flows—unites many different disciplines, including pipe flow, fluid flow, electrical, chemical reaction, ecological, epidemiological, neurological, communications, transportation, financial, economic and human social networks. This Feature Paper presents a generalized maximum entropy framework to infer the state of a flow network, including its flow rates and other properties, in probabilistic form. In this method, the network uncertainty is represented by a joint probability function over its unknowns, subject to all that is known. This gives a relative entropy function which is maximized, subject to the constraints, to determine the most probable or most representative state of the network. The constraints can include “observable” constraints on various parameters, “physical” constraints such as conservation laws and frictional properties, and “graphical” constraints arising from uncertainty in the network structure itself. Since the method is probabilistic, it enables the prediction of network properties when there is insufficient information to obtain a deterministic solution. The derived framework can incorporate nonlinear constraints or nonlinear interdependencies between variables, at the cost of requiring numerical solution. The theoretical foundations of the method are first presented, followed by its application to a variety of flow networks.
- 21 January 2015
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 765, 325-352
On long-term boundedness of Galerkin models
We investigate linear–quadratic dynamical systems with energy-preserving quadratic terms. These systems arise for instance as Galerkin systems of incompressible flows. A criterion is presented to ensure long-term boundedness of the system dynamics. If the criterion is violated, a globally stable attractor cannot exist for an effective nonlinearity. Thus, the criterion can be considered a minimum requirement for control-oriented Galerkin models of viscous fluid flows. The criterion is exemplified, for example, for Galerkin systems of two-dimensional cylinder wake flow models in the transient and the post-transient regime, for the Lorenz system and for wall-bounded shear flows. There are numerous potential applications of the criterion, for instance, system reduction and control of strongly nonlinear dynamical systems.
- 21 January 2015
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 765, 325-352
On long-term boundedness of Galerkin models
We investigate linear–quadratic dynamical systems with energy-preserving quadratic terms. These systems arise for instance as Galerkin systems of incompressible flows. A criterion is presented to ensure long-term boundedness of the system dynamics. If the criterion is violated, a globally stable attractor cannot exist for an effective nonlinearity. Thus, the criterion can be considered a minimum requirement for control-oriented Galerkin models of viscous fluid flows. The criterion is exemplified, for example, for Galerkin systems of two-dimensional cylinder wake flow models in the transient and the post-transient regime, for the Lorenz system and for wall-bounded shear flows. There are numerous potential applications of the criterion, for instance, system reduction and control of strongly nonlinear dynamical systems.