Peter Giesl
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
Peter Giesl has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Sigurdur Hafstein
University of Iceland
44 shared publications - Holger Wendland
Chair of Applied and Numerical Analysis, Department of Mathematics, University of Bayreuth, 95440 Bayreuth, Germany
8 shared publications - Carlos Argáez
University of Iceland
7 shared publications - Martin Rasmussen
Department of Mathematics, Imperial College London 10 , London
5 shared publications - Christoph Kawan
Institute of Informatics, LMU Munich, 80538 München, Germany
4 shared publications - Heiko Wagner
Department of Movement Science, University of Münster, Horstmarer Landweg 62B, 48149 Münster, Germany
4 shared publications
Latest Publications
- Open Access
- 4 September 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 568
Kernel methods for the construction of certified lyapunov functions via approximate koopman eigenfunctions
- 4 September 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 568
Open AccessKernel methods for the construction of certified lyapunov functions via approximate koopman eigenfunctions
- 15 April 2026
- Published by Springer Nature
- p. 131-150
On Deciding Constant Runtime of Linear Loops
- Open Access
On Deciding Constant Runtime of Linear Loops
We consider linear single-path loops of the form \[ \textbf{while} \quad \varphi \quad \textbf{do} \quad \vec{x} \gets A \vec{x} + \vec{b} \quad \textbf{end} \] where $\vec{x}$ is a vector of variables, the loop guard $\varphi$ is a conjunction of linear inequations over the variables $\vec{x}$, and the update of the loop is represented by the matrix $A$ and the vector $\vec{b}$. It is already known that termination of such loops is decidable. In this work, we consider loops where $A$ has real eigenvalues, and prove that it is decidable whether the loop's runtime (for all inputs) is bounded by a constant if the variables range over $\mathbb R$ or $\mathbb Q$. This is an important problem in automatic program verification, since safety of linear while-programs is decidable if all loops have constant runtime, and it is closely connected to the existence of multiphase-linear ranking functions, which are often used for termination and complexity analysis. To evaluate its practical applicability, we also present an implementation of our decision procedure.Open AccessOn Deciding Constant Runtime of Linear Loops
We consider linear single-path loops of the form \[ \textbf{while} \quad \varphi \quad \textbf{do} \quad \vec{x} \gets A \vec{x} + \vec{b} \quad \textbf{end} \] where $\vec{x}$ is a vector of variables, the loop guard $\varphi$ is a conjunction of linear inequations over the variables $\vec{x}$, and the update of the loop is represented by the matrix $A$ and the vector $\vec{b}$. It is already known that termination of such loops is decidable. In this work, we consider loops where $A$ has real eigenvalues, and prove that it is decidable whether the loop's runtime (for all inputs) is bounded by a constant if the variables range over $\mathbb R$ or $\mathbb Q$. This is an important problem in automatic program verification, since safety of linear while-programs is decidable if all loops have constant runtime, and it is closely connected to the existence of multiphase-linear ranking functions, which are often used for termination and complexity analysis. To evaluate its practical applicability, we also present an implementation of our decision procedure. - 2 November 2025
- Published by Springer Nature
- p. 43-68
Positively Invariant Sets for ODEs and Predictor-Corrector Multi-step Numerical Solvers
- 2 November 2025
- Published by Springer Nature
- p. 43-68
Positively Invariant Sets for ODEs and Predictor-Corrector Multi-step Numerical Solvers
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 12 (3) , 393-417
CPA Lyapunov functions for time-periodic systems in one spatial dimension
Continuous piecewise affine (CPA) functions have been successfully used to construct Lyapunov functions for autonomous ordinary differential equations with an exponentially stable equilibrium. However, for time-periodic systems this method cannot be used. In this paper, we develop a method to compute a Lyapunov function for a time-periodic ordinary differential equation with a (known) exponentially stable periodic solution. While the usual approach with a triangulation works away from the periodic solution, a new approach is required in a neighborhood of the periodic solution. We derive sufficient conditions for a Lyapunov function and, moreover, we prove a converse theorem, showing that these conditions can always be satisfied if the triangulation is sufficiently fine. Finally, we formulate the construction problem as a linear programming problem and apply it to two examples. This paper deals with the case of one spatial dimension, but we believe that the method can be generalised to any dimension, which will be done in a subsequent paper.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 12 (3) , 393-417
CPA Lyapunov functions for time-periodic systems in one spatial dimension
Continuous piecewise affine (CPA) functions have been successfully used to construct Lyapunov functions for autonomous ordinary differential equations with an exponentially stable equilibrium. However, for time-periodic systems this method cannot be used. In this paper, we develop a method to compute a Lyapunov function for a time-periodic ordinary differential equation with a (known) exponentially stable periodic solution. While the usual approach with a triangulation works away from the periodic solution, a new approach is required in a neighborhood of the periodic solution. We derive sufficient conditions for a Lyapunov function and, moreover, we prove a converse theorem, showing that these conditions can always be satisfied if the triangulation is sufficiently fine. Finally, we formulate the construction problem as a linear programming problem and apply it to two examples. This paper deals with the case of one spatial dimension, but we believe that the method can be generalised to any dimension, which will be done in a subsequent paper.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 1903-1929
Construction of a contraction metric for non-smooth time-periodic systems
We consider a general non-smooth ordinary differential equation of the form $ \dot{x} = f(t, x) $, where $ x\in\mathbb{R} $, $ f $ is $ t $-periodic and smooth except at $ x = 0 $. The existence, uniqueness and exponential stability of a periodic orbit is equivalent to the existence of a contraction metric. In this paper, we develop a method to numerically construct a contraction metric. In more detail, we discretise the conditions and use quadratic programming to determine a solution. We show that the method always succeeds if it employs sufficiently many discretisation points, and we apply the method to several examples.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 1903-1929
Construction of a contraction metric for non-smooth time-periodic systems
We consider a general non-smooth ordinary differential equation of the form $ \dot{x} = f(t, x) $, where $ x\in\mathbb{R} $, $ f $ is $ t $-periodic and smooth except at $ x = 0 $. The existence, uniqueness and exponential stability of a periodic orbit is equivalent to the existence of a contraction metric. In this paper, we develop a method to numerically construct a contraction metric. In more detail, we discretise the conditions and use quadratic programming to determine a solution. We show that the method always succeeds if it employs sufficiently many discretisation points, and we apply the method to several examples.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 2027-2050
Piecewise quadratic Lyapunov functions for stochastic differential equations by linear programming
We develop an algorithm to parameterize continuous and piecewise quadratic (CPQ) Lyapunov functions for stochastic differential equations (SDEs) using linear programming (LP). The algorithm is a non-trivial extension of algorithms to parameterize continuous and piecewise linear (CPA) Lyapunov functions for ordinary differential equations (ODEs), but since the conditions for a Lyapunov function for a stochastic system involve second order derivatives, CPA Lyapunov functions cannot exist for stochastic systems and hence CPQ Lyapunov functions are needed. We demonstrate our algorithm on two examples from the literature.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 2027-2050
Piecewise quadratic Lyapunov functions for stochastic differential equations by linear programming
We develop an algorithm to parameterize continuous and piecewise quadratic (CPQ) Lyapunov functions for stochastic differential equations (SDEs) using linear programming (LP). The algorithm is a non-trivial extension of algorithms to parameterize continuous and piecewise linear (CPA) Lyapunov functions for ordinary differential equations (ODEs), but since the conditions for a Lyapunov function for a stochastic system involve second order derivatives, CPA Lyapunov functions cannot exist for stochastic systems and hence CPQ Lyapunov functions are needed. We demonstrate our algorithm on two examples from the literature.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (2) , 449-473
Minimization with differential inequality and equality constraints applied to complete Lyapunov functions
Meshfree collocation in reproducing kernel Hilbert spaces is an established method to solve generalized interpolation problems such as PDEs. It can be formulated as an optimization problem with equality constraints. In this paper, we consider optimization problems with both inequality and equality constraints for general linear operators, and develop a general theory of discretizing such problems. The unique solution of these discretized problems is obtained using quadratic optimization, and we show that the solutions of the discretized problems strongly converge to the unique solution of the original problem. The general theory is applied to compute complete Lyapunov functions for autonomous ordinary differential equations.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (2) , 449-473
Minimization with differential inequality and equality constraints applied to complete Lyapunov functions
Meshfree collocation in reproducing kernel Hilbert spaces is an established method to solve generalized interpolation problems such as PDEs. It can be formulated as an optimization problem with equality constraints. In this paper, we consider optimization problems with both inequality and equality constraints for general linear operators, and develop a general theory of discretizing such problems. The unique solution of these discretized problems is obtained using quadratic optimization, and we show that the solutions of the discretized problems strongly converge to the unique solution of the original problem. The general theory is applied to compute complete Lyapunov functions for autonomous ordinary differential equations.
- 22 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 772-777
Construction of a Contraction Metric for Time-Periodic Systems Using Meshless Collocation
The existence and stability of a periodic orbit for time-periodic systems as well as its basin of attraction can be determined using a contraction metric. In this paper, we will present a numerical construction method based on meshless collocation with radial basis functions. We will first show the existence of a contraction metric satisfying a partial differential equation and then use meshless collocation to approximately solve it, which results in a contraction metric, if the fill distance is sufficiently small.
- 22 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 772-777
Construction of a Contraction Metric for Time-Periodic Systems Using Meshless Collocation
The existence and stability of a periodic orbit for time-periodic systems as well as its basin of attraction can be determined using a contraction metric. In this paper, we will present a numerical construction method based on meshless collocation with radial basis functions. We will first show the existence of a contraction metric satisfying a partial differential equation and then use meshless collocation to approximately solve it, which results in a contraction metric, if the fill distance is sufficiently small.
- 12 March 2024
- Published by Springer Nature
- p. 205-227
Lyapunov Functions by Interpolating Numerical Quadrature: Proof of Convergence
- 12 March 2024
- Published by Springer Nature
- p. 205-227
Lyapunov Functions by Interpolating Numerical Quadrature: Proof of Convergence