@article{16288,
abstract = {We derive a data-driven method for the approximation of the Koopman generator called gEDMD, which can be regarded as a straightforward extension of EDMD (extended dynamic mode decomposition). This approach is applicable to deterministic and stochastic dynamical systems. It can be used for computing eigenvalues, eigenfunctions, and modes of the generator and for system identification. In addition to learning the governing equations of deterministic systems, which then reduces to SINDy (sparse identification of nonlinear dynamics), it is possible to identify the drift and diffusion terms of stochastic differential equations from data. Moreover, we apply gEDMD to derive coarse-grained models of high-dimensional systems, and also to determine efficient model predictive control strategies. We highlight relationships with other methods and demonstrate the efficacy of the proposed methods using several guiding examples and prototypical molecular dynamics problems.},
author = {Klus, Stefan and Nüske, Feliks and Peitz, Sebastian and Niemann, Jan-Hendrik and Clementi, Cecilia and Schütte, Christof},
issn = {0167-2789},
journal = {Physica D: Nonlinear Phenomena},
title = {{Data-driven approximation of the Koopman generator: Model reduction, system identification, and control}},
doi = {10.1016/j.physd.2020.132416},
volume = {406},
year = {2020},
}
@article{16290,
abstract = {The control of complex systems is of critical importance in many branches of science, engineering, and industry, many of which are governed by nonlinear partial differential equations. Controlling an unsteady fluid flow is particularly important, as flow control is a key enabler for technologies in energy (e.g., wind, tidal, and combustion), transportation (e.g., planes, trains, and automobiles), security (e.g., tracking airborne contamination), and health (e.g., artificial hearts and artificial respiration). However, the high-dimensional, nonlinear, and multi-scale dynamics make real-time feedback control infeasible. Fortunately, these high- dimensional systems exhibit dominant, low-dimensional patterns of activity that can be exploited for effective control in the sense that knowledge of the entire state of a system is not required. Advances in machine learning have the potential to revolutionize flow control given its ability to extract principled, low-rank feature spaces characterizing such complex systems.We present a novel deep learning modelpredictive control framework that exploits low-rank features of the flow in order to achieve considerable improvements to control performance. Instead of predicting the entire fluid state, we use a recurrent neural network (RNN) to accurately predict the control relevant quantities of the system, which are then embedded into an MPC framework to construct a feedback loop. In order to lower the data requirements and to improve the prediction accuracy and thus the control performance, incoming sensor data are used to update the RNN online. The results are validated using varying fluid flow examples of increasing complexity.},
author = {Bieker, Katharina and Peitz, Sebastian and Brunton, Steven L. and Kutz, J. Nathan and Dellnitz, Michael},
issn = {0935-4964},
journal = {Theoretical and Computational Fluid Dynamics},
title = {{Deep model predictive flow control with limited sensor data and online learning}},
doi = {10.1007/s00162-020-00520-4},
year = {2020},
}
@article{16961,
author = {Liebendörfer, Michael and Göller, Robin and Biehler, Rolf and Hochmuth, Reinhard and Kortemeyer, Jörg and Ostsieker, Laura and Rode, Jana and Schaper, Niclas},
issn = {0173-5322},
journal = {Journal für Mathematik-Didaktik},
title = {{LimSt – Ein Fragebogen zur Erhebung von Lernstrategien im mathematikhaltigen Studium}},
doi = {10.1007/s13138-020-00167-y},
year = {2020},
}
@article{10596,
abstract = {Multi-objective optimization is an active field of research that has many applications. Owing to its success and because decision-making processes are becoming more and more complex, there is a recent trend for incorporating many objectives into such problems. The challenge with such problems, however, is that the dimensions of the solution sets—the so-called Pareto sets and fronts—grow with the number of objectives. It is thus no longer possible to compute or to approximate the entire solution set of a given problem that contains many (e.g. more than three) objectives. On the other hand, the computation of single solutions (e.g. via scalarization methods) leads to unsatisfying results in many cases, even if user preferences are incorporated. In this article, the Pareto Explorer tool is presented—a global/local exploration tool for the treatment of many-objective optimization problems (MaOPs). In the first step, a solution of the problem is computed via a global search algorithm that ideally already includes user preferences. In the second step, a local search along the Pareto set/front of the given MaOP is performed in user specified directions. For this, several continuation-like procedures are proposed that can incorporate preferences defined in decision, objective, or in weight space. The applicability and usefulness of Pareto Explorer is demonstrated on benchmark problems as well as on an application from industrial laundry design.},
author = {Schütze, Oliver and Cuate, Oliver and Martín, Adanay and Peitz, Sebastian and Dellnitz, Michael},
issn = {0305-215X},
journal = {Engineering Optimization},
number = {5},
pages = {832--855},
title = {{Pareto Explorer: a global/local exploration tool for many-objective optimization problems}},
doi = {10.1080/0305215x.2019.1617286},
volume = {52},
year = {2020},
}
@inbook{16289,
abstract = {In the development of model predictive controllers for PDE-constrained problems, the use of reduced order models is essential to enable real-time applicability. Besides local linearization approaches, proper orthogonal decomposition (POD) has been most widely used in the past in order to derive such models. Due to the huge advances concerning both theory as well as the numerical approximation, a very promising alternative based on the Koopman operator has recently emerged. In this chapter, we present two control strategies for model predictive control of nonlinear PDEs using data-efficient approximations of the Koopman operator. In the first one, the dynamic control system is replaced by a small number of autonomous systems with different yet constant inputs. The control problem is consequently transformed into a switching problem. In the second approach, a bilinear surrogate model is obtained via a convex combination of these autonomous systems. Using a recent convergence result for extended dynamic mode decomposition (EDMD), convergence of the reduced objective function can be shown. We study the properties of these two strategies with respect to solution quality, data requirements, and complexity of the resulting optimization problem using the 1-dimensional Burgers equation and the 2-dimensional Navier–Stokes equations as examples. Finally, an extension for online adaptivity is presented.},
author = {Peitz, Sebastian and Klus, Stefan},
booktitle = {Lecture Notes in Control and Information Sciences},
isbn = {9783030357122},
issn = {0170-8643},
pages = {257--282},
publisher = {Springer},
title = {{Feedback Control of Nonlinear PDEs Using Data-Efficient Reduced Order Models Based on the Koopman Operator}},
doi = {10.1007/978-3-030-35713-9_10},
volume = {484},
year = {2020},
}
@unpublished{16309,
abstract = {In recent years, the success of the Koopman operator in dynamical systems
analysis has also fueled the development of Koopman operator-based control
frameworks. In order to preserve the relatively low data requirements for an
approximation via Dynamic Mode Decomposition, a quantization approach was
recently proposed in [Peitz & Klus, Automatica 106, 2019]. This way, control
of nonlinear dynamical systems can be realized by means of switched systems
techniques, using only a finite set of autonomous Koopman operator-based
reduced models. These individual systems can be approximated very efficiently
from data. The main idea is to transform a control system into a set of
autonomous systems for which the optimal switching sequence has to be computed.
In this article, we extend these results to continuous control inputs using
relaxation. This way, we combine the advantages of the data efficiency of
approximating a finite set of autonomous systems with continuous controls. We
show that when using the Koopman generator, this relaxation --- realized by
linear interpolation between two operators --- does not introduce any error for
control affine systems. This allows us to control high-dimensional nonlinear
systems using bilinear, low-dimensional surrogate models. The efficiency of the
proposed approach is demonstrated using several examples with increasing
complexity, from the Duffing oscillator to the chaotic fluidic pinball.},
author = {Peitz, Sebastian and Otto, Samuel E. and Rowley, Clarence W.},
booktitle = {arXiv:2003.07094},
title = {{Data-Driven Model Predictive Control using Interpolated Koopman Generators}},
year = {2020},
}
@article{16710,
author = {Gerlach, Raphael and Ziessler, Adrian and Eckhardt, Bruno and Dellnitz, Michael},
issn = {1536-0040},
journal = {SIAM Journal on Applied Dynamical Systems},
pages = {705--723},
title = {{A Set-Oriented Path Following Method for the Approximation of Parameter Dependent Attractors}},
doi = {10.1137/19m1247139},
year = {2020},
}
@unpublished{16297,
abstract = {In real-world problems, uncertainties (e.g., errors in the measurement,
precision errors) often lead to poor performance of numerical algorithms when
not explicitly taken into account. This is also the case for control problems,
where optimal solutions can degrade in quality or even become infeasible. Thus,
there is the need to design methods that can handle uncertainty. In this work,
we consider nonlinear multi-objective optimal control problems with uncertainty
on the initial conditions, and in particular their incorporation into a
feedback loop via model predictive control (MPC). In multi-objective optimal
control, an optimal compromise between multiple conflicting criteria has to be
found. For such problems, not much has been reported in terms of uncertainties.
To address this problem class, we design an offline/online framework to compute
an approximation of efficient control strategies. This approach is closely
related to explicit MPC for nonlinear systems, where the potentially expensive
optimization problem is solved in an offline phase in order to enable fast
solutions in the online phase. In order to reduce the numerical cost of the
offline phase, we exploit symmetries in the control problems. Furthermore, in
order to ensure optimality of the solutions, we include an additional online
optimization step, which is considerably cheaper than the original
multi-objective optimization problem. We test our framework on a car
maneuvering problem where safety and speed are the objectives. The
multi-objective framework allows for online adaptations of the desired
objective. Alternatively, an automatic scalarizing procedure yields very
efficient feedback controls. Our results show that the method is capable of
designing driving strategies that deal better with uncertainties in the initial
conditions, which translates into potentially safer and faster driving
strategies.},
author = {Hernández Castellanos, Carlos Ignacio and Ober-Blöbaum, Sina and Peitz, Sebastian},
booktitle = {arXiv:2002.06006},
title = {{Explicit Multi-objective Model Predictive Control for Nonlinear Systems Under Uncertainty}},
year = {2020},
}
@unpublished{16867,
abstract = {In this article, we present an efficient descent method for locally Lipschitz
continuous multiobjective optimization problems (MOPs). The method is realized
by combining a theoretical result regarding the computation of descent
directions for nonsmooth MOPs with a practical method to approximate the
subdifferentials of the objective functions. We show convergence to points
which satisfy a necessary condition for Pareto optimality. Using a set of test
problems, we compare our method to the multiobjective proximal bundle method by
M\"akel\"a. The results indicate that our method is competitive while being
easier to implement. While the number of objective function evaluations is
larger, the overall number of subgradient evaluations is lower. Finally, we
show that our method can be combined with a subdivision algorithm to compute
entire Pareto sets of nonsmooth MOPs.},
author = {Gebken, Bennet and Peitz, Sebastian},
booktitle = {arXiv:2004.11578},
title = {{An efficient descent method for locally Lipschitz multiobjective optimization problems}},
year = {2020},
}
@inbook{16963,
author = {Kuklinski, Christiane and Leis, Elena and Liebendörfer, Michael and Hochmuth, Reinhard},
booktitle = {Beiträge zum {Mathematikunterricht} 2019 53. {Jahrestagung} der {Gesellschaft} für {Didaktik} der {Mathematik}.},
editor = {Frank, Andreas and Krauss, Stefan and Binder, Karin},
publisher = {WTM-Verlag},
title = {{Erklärung von Mathematikleistung im Ingenieursstudium}},
year = {2020},
}
@article{16964,
author = {Hochmuth, Reinhard and Liebendörfer, Michael and Biehler, Rolf and Eichler, Andreas},
journal = {Neues Handbuch Hochschullehre},
pages = {117--138},
title = {{Das Kompetenzzentrum Hochschuldidaktik Mathematik (khdm)}},
volume = {95},
year = {2020},
}
@article{16965,
author = {Schürmann, Mirko and Schaper, Niclas and Liebendörfer, Michael and Biehler, Rolf and Lankeit, Elisa and Hochmuth, Reinhard and Ruge, Johanna and Kuklinski, Christiane},
journal = {dghd-Newsletter},
pages = {25--29},
title = {{Ein Kurzbericht aus dem Forschungsprojekt WiGeMath-Lernzentren als Unterstützungsmaßnahme für mathematikbezogenes Lernen in der Studieneingangsphase}},
volume = {01/2020},
year = {2020},
}
@article{10595,
abstract = {In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems where only a subset of the set of objective functions is taken into account. If the Pareto critical set is completely described by its boundary (e.g., if we have more objective functions than dimensions in decision space), then this can be used to efficiently solve the MOP by solving a number of MOPs with fewer objective functions. If this is not the case, the results can still give insight into the structure of the Pareto critical set.},
author = {Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael},
issn = {0925-5001},
journal = {Journal of Global Optimization},
number = {4},
pages = {891--913},
title = {{On the hierarchical structure of Pareto critical sets}},
doi = {10.1007/s10898-019-00737-6},
volume = {73},
year = {2019},
}
@inproceedings{13107,
abstract = {In this paper, we first outline a Hypothetical Learning Trajectory (HLT), which aims at a formal understanding of the rules for manipulating integers. The HLT is based on task formats, which promote algebraic thinking in terms of generalizing rules from the analysis of patterns and should be familiar to students from their mathematics education experiences in elementary school. Second, we analyze two students' actual learning process based on Peircean semiotics. The analysis shows that the actual learning process diverges from the hypothesized learning process in that the students do not relate the different levels of the diagrams in a way that allows them to extrapolate the rule for the subtraction of negative numbers. Based on this finding, we point out consequences for the design of the tasks.},
author = {Schumacher, Jan and Rezat, Sebastian},
booktitle = {Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019)},
editor = {Jankvist, Uffe Thomas and Van den Heuvel-Panhuizen, Marja and Veldhuis, Michiel},
keyword = {diagrammatic reasoning, hypothetical learning trajectory, induction extrapolatory method, integers, negative numbers, permanence principle, semiotics},
location = {Utrecht},
publisher = {Freudenthal Group & Freudenthal Institute, Utrecht University and ERME},
title = {{A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers}},
year = {2019},
}
@unpublished{16295,
abstract = {It is a very challenging task to identify the objectives on which a certain
decision was based, in particular if several, potentially conflicting criteria
are equally important and a continuous set of optimal compromise decisions
exists. This task can be understood as the inverse problem of multiobjective
optimization, where the goal is to find the objective vector of a given Pareto
set. To this end, we present a method to construct the objective vector of a
multiobjective optimization problem (MOP) such that the Pareto critical set
contains a given set of data points or decision vectors. The key idea is to
consider the objective vector in the multiobjective KKT conditions as variable
and then search for the objectives that minimize the Euclidean norm of the
resulting system of equations. By expressing the objectives in a
finite-dimensional basis, we transform this problem into a homogeneous, linear
system of equations that can be solved efficiently. There are many important
potential applications of this approach. Besides the identification of
objectives (both from clean and noisy data), the method can be used for the
construction of surrogate models for expensive MOPs, which yields significant
speed-ups. Both applications are illustrated using several examples.},
author = {Gebken, Bennet and Peitz, Sebastian},
booktitle = {arXiv:1901.06141},
title = {{Inverse multiobjective optimization: Inferring decision criteria from data}},
year = {2019},
}
@inbook{16966,
author = {Kuklinski, Christiane and Liebendörfer, Michael and Hochmuth, Reinhard and Biehler, Rolf and Schaper, Niclas and Lankeit, Elisa and Leis, Elena and Schürmann, Mirko},
booktitle = {Proceedings of {CERME} 11},
title = {{Features of innovative lectures that distinguish them from traditional lectures and their evaluation by attending students}},
year = {2019},
}
@book{13139,
editor = {Rezat, Sebastian and Fan, Lianghuo and Hattermann, Mathias and Schumacher, Jan and Wuschke, Holger},
location = {Paderborn},
pages = {392},
publisher = {Universitätsbibliothek Paderborn},
title = {{Proceedings of the Third International Conference on Mathematics Textbook Research and Development: 16-19 September 2019 Paderborn, Germany}},
doi = {10.17619/UNIPB/1-768},
year = {2019},
}
@inbook{13108,
abstract = {Diagrammatisches Schlie{\ss}en wird im Zusammenhang mit dem Lernen von Mathmematik und ihrer Symbolsprache als wesentliche Theorie der Wissenskonstruktion diskutiert. Dabei wird h{\"{a}}ufig davon ausgegangen, dass die Wissenskonstruktion im Sinne diagrammatischen Schlie{\ss}ens erfolgt. Deskriptive Rekonstruktionen diagrammatischen Schlie{\ss}ens bei Lernenden stellen jedoch ein Desiderat der mathematikdidaktischen Forschung dar. Der vorliegende Beitrag befasst sich mit der Fragestellung, wie sich diagrammatisches Schlie{\ss}en bei Lernenden rekonstruieren l{\"{a}}sst. Als m{\"{o}}gliche Werkzeuge f{\"{u}}r eine solche Rekonstruktion werden Toulmins Argumentationsschema und Vergnauds Schema-Begriff exemplarisch angewandt, um das diagrammatische Schlie{\ss}en eines Sch{\"{u}}lerpaars beim Einstieg in die Subtraktion negativer Zahlen zu rekonstruieren. Abschlie{\ss}end wird die tats{\"{a}}chliche Eignung der beiden Ans{\"{a}}tze zur Rekonstruktion diagrammatischen Schlie{\ss}ens diskutiert.},
author = {Schumacher, Jan and Rezat, Sebastian},
booktitle = {Semiotische Perspektiven auf das Lernen von Mathematik II},
editor = {Kadunz, Gert},
publisher = {Springer},
title = {{Rekonstruktion diagrammatischen Schließens beim Erlernen der Subtraktion negativer Zahlen. Vergleich zweier methodischer Zugänge}},
year = {2019},
}
@unpublished{16296,
abstract = {Multiobjective optimization plays an increasingly important role in modern
applications, where several objectives are often of equal importance. The task
in multiobjective optimization and multiobjective optimal control is therefore
to compute the set of optimal compromises (the Pareto set) between the
conflicting objectives. Since the Pareto set generally consists of an infinite
number of solutions, the computational effort can quickly become challenging
which is particularly problematic when the objectives are costly to evaluate as
is the case for models governed by partial differential equations (PDEs). To
decrease the numerical effort to an affordable amount, surrogate models can be
used to replace the expensive PDE evaluations. Existing multiobjective
optimization methods using model reduction are limited either to low parameter
dimensions or to few (ideally two) objectives. In this article, we present a
combination of the reduced basis model reduction method with a continuation
approach using inexact gradients. The resulting approach can handle an
arbitrary number of objectives while yielding a significant reduction in
computing time.},
author = {Banholzer, Stefan and Gebken, Bennet and Dellnitz, Michael and Peitz, Sebastian and Volkwein, Stefan},
booktitle = {arXiv:1906.09075},
title = {{ROM-based multiobjective optimization of elliptic PDEs via numerical continuation}},
year = {2019},
}
@article{16708,
author = {Ziessler, Adrian and Dellnitz, Michael and Gerlach, Raphael},
issn = {1536-0040},
journal = {SIAM Journal on Applied Dynamical Systems},
pages = {1265--1292},
title = {{The Numerical Computation of Unstable Manifolds for Infinite Dimensional Dynamical Systems by Embedding Techniques}},
doi = {10.1137/18m1204395},
year = {2019},
}