Steffen W. R. Werner
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
Steffen W. R. Werner has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, D-39106 Magdeburg, Germany
20 shared publications - Serkan Gugercin
Department of Mathematics and Division of Computational Modeling and Data Analytics, Academy of Data Science, Virginia Tech, Blacksburg, USA
12 shared publications - Benjamin Peherstorfer
Courant Institute of Mathematical Sciences New York University 10012 New York NY USA
8 shared publications - Jan Heiland
Institute of Mathematics TU Ilmenau Ilmenau Germany
6 shared publications - Ion Victor Gosea
Max Planck Institute for Dynamics of Complex Technical Systems Magdeburg Germany
4 shared publications - Ines Dorschky
Institute of Mathematics Hamburg University of Technology Am Schwarzenberg-Campus 3 Gebäude E 21073 Hamburg Germany
3 shared publications
Latest Publications
- Open Access
- 26 October 2026
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 13 (4) , 82
A refined nonlinear least-squares method for the rational approximation problem
The adaptive Antoulas–Anderson (AAA) algorithm for rational approximation is a widely used method for the efficient construction of highly accurate rational approximations to given data. While AAA can often produce rational approximations accurate to any prescribed tolerance, these approximations may have degrees larger than what is actually required to meet the given tolerance. In this work, we consider the adaptive construction of interpolating rational approximations while aiming for the smallest feasible degree to satisfy a given error tolerance. To this end, we introduce refinement approaches to the linear least-squares step of the classical AAA algorithm that aim to minimize the true nonlinear least-squares error with respect to the given data using the Sanathanan–Koerner and Whitefield’s iterations. Furthermore, we theoretically analyze the derived approaches in terms of the corresponding gradients from the resulting minimization problems and use these insights to propose a new greedy framework that ensures monotonic error convergence. Numerical examples from function approximation and model order reduction verify the effectiveness of the proposed algorithm to construct accurate rational approximations of small degrees.
- 26 October 2026
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 13 (4) , 82
Open AccessA refined nonlinear least-squares method for the rational approximation problem
The adaptive Antoulas–Anderson (AAA) algorithm for rational approximation is a widely used method for the efficient construction of highly accurate rational approximations to given data. While AAA can often produce rational approximations accurate to any prescribed tolerance, these approximations may have degrees larger than what is actually required to meet the given tolerance. In this work, we consider the adaptive construction of interpolating rational approximations while aiming for the smallest feasible degree to satisfy a given error tolerance. To this end, we introduce refinement approaches to the linear least-squares step of the classical AAA algorithm that aim to minimize the true nonlinear least-squares error with respect to the given data using the Sanathanan–Koerner and Whitefield’s iterations. Furthermore, we theoretically analyze the derived approaches in terms of the corresponding gradients from the resulting minimization problems and use these insights to propose a new greedy framework that ensures monotonic error convergence. Numerical examples from function approximation and model order reduction verify the effectiveness of the proposed algorithm to construct accurate rational approximations of small degrees.
- Open Access
- 27 August 2026
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 26 (4)
Symmetric Hermite Quadrature‐Based Balanced Truncation for Learning Linear Dynamical Systems From Derivative Data
Data‐driven reduced‐order modeling is an essential component in the computer‐aided design of control systems. In this work, we present a novel symmetric Hermite formulation of the quadrature‐based balanced truncation algorithm that constructs linear reduced‐order models from evaluations of the full‐order system's transfer function and its derivative. Significantly, the Hermite formulation preserves desirable qualitative properties of the system used to generate the data, such as state‐space Hermiticity and, consequently, asymptotic stability.
- 27 August 2026
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 26 (4)
Open AccessSymmetric Hermite Quadrature‐Based Balanced Truncation for Learning Linear Dynamical Systems From Derivative Data
Data‐driven reduced‐order modeling is an essential component in the computer‐aided design of control systems. In this work, we present a novel symmetric Hermite formulation of the quadrature‐based balanced truncation algorithm that constructs linear reduced‐order models from evaluations of the full‐order system's transfer function and its derivative. Significantly, the Hermite formulation preserves desirable qualitative properties of the system used to generate the data, such as state‐space Hermiticity and, consequently, asymptotic stability.
- Open Access
- 26 August 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (5) , 76
Second-order AAA algorithms for structured data-driven modeling
The data-driven modeling of dynamical systems has become an essential tool for the construction of accurate computational models from real-world data. In this process, the inherent differential structures underlying the considered physical phenomena are often neglected making the reinterpretation of the learned models in a physically meaningful sense very challenging. In this work, we present three data-driven modeling approaches for the construction of dynamical systems with second-order differential structure directly from frequency domain data. Based on the second-order structured barycentric form, we extend the well-known Adaptive Antoulas-Anderson algorithm to the case of second-order systems. Depending on the available computational resources, we propose variations of the proposed method that prioritize either higher computation speed or greater modeling accuracy, and we present a theoretical analysis for the expected accuracy and performance of the proposed methods. Three numerical examples demonstrate the effectiveness of our new structured approaches in comparison to classical unstructured data-driven modeling.
- 26 August 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (5) , 76
Open AccessSecond-order AAA algorithms for structured data-driven modeling
The data-driven modeling of dynamical systems has become an essential tool for the construction of accurate computational models from real-world data. In this process, the inherent differential structures underlying the considered physical phenomena are often neglected making the reinterpretation of the learned models in a physically meaningful sense very challenging. In this work, we present three data-driven modeling approaches for the construction of dynamical systems with second-order differential structure directly from frequency domain data. Based on the second-order structured barycentric form, we extend the well-known Adaptive Antoulas-Anderson algorithm to the case of second-order systems. Depending on the available computational resources, we propose variations of the proposed method that prioritize either higher computation speed or greater modeling accuracy, and we present a theoretical analysis for the expected accuracy and performance of the proposed methods. Three numerical examples demonstrate the effectiveness of our new structured approaches in comparison to classical unstructured data-driven modeling.
- 14 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (4) , C736-C761
An Adaptive Data Sampling Strategy for Stabilizing Dynamical Systems via Controller Inference
Learning stabilizing controllers from data is an important task in engineering applications; however, collecting informative data is challenging because unstable systems often lead to rapidly growing or erratic trajectories. In this work, we propose an adaptive sampling scheme that generates data while simultaneously stabilizing the system to avoid instabilities during the data collection. Under mild assumptions, the approach provably generates data sets that are informative for stabilization and have minimal size. The numerical experiments demonstrate that controller inference with the novel adaptive sampling approach learns controllers with up to one order of magnitude fewer data samples than unguided data generation. The results show that the proposed approach opens the door to stabilizing systems in edge cases and limit states where instabilities often occur and data collection is inherently difficult. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://www.doi.org/10.5281/zenodo.8183173 . [Formula: see text]
- 14 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (4) , C736-C761
An Adaptive Data Sampling Strategy for Stabilizing Dynamical Systems via Controller Inference
Learning stabilizing controllers from data is an important task in engineering applications; however, collecting informative data is challenging because unstable systems often lead to rapidly growing or erratic trajectories. In this work, we propose an adaptive sampling scheme that generates data while simultaneously stabilizing the system to avoid instabilities during the data collection. Under mild assumptions, the approach provably generates data sets that are informative for stabilization and have minimal size. The numerical experiments demonstrate that controller inference with the novel adaptive sampling approach learns controllers with up to one order of magnitude fewer data samples than unguided data generation. The results show that the proposed approach opens the door to stabilizing systems in edge cases and limit states where instabilities often occur and data collection is inherently difficult. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://www.doi.org/10.5281/zenodo.8183173 . [Formula: see text]
- 4 June 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (3) , C526-C552
Data-Driven Balanced Truncation for Second-Order Systems with Generalized Proportional Damping
Structured reduced-order modeling is a central component in the computer-aided design of control systems in which cheap-to-evaluate low-dimensional models with physically meaningful internal structures are computed. In this work, we develop a new approach for the structured data-driven surrogate modeling of linear dynamical systems described by second-order time derivatives via balanced truncation model-order reduction. The proposed method is a data-driven reformulation of position-velocity balanced truncation for second-order systems and generalizes the quadrature-based balanced truncation for unstructured first-order systems to the second-order case. The computed surrogates encode a generalized proportional damping structure, and we propose a computational procedure for inferring the damping coefficients from data by minimizing a least-squares error over the coefficients. Several numerical examples demonstrate the effectiveness of the proposed method. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zenodo.org/records/18148591 . [Formula: see text]
- 4 June 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (3) , C526-C552
Data-Driven Balanced Truncation for Second-Order Systems with Generalized Proportional Damping
Structured reduced-order modeling is a central component in the computer-aided design of control systems in which cheap-to-evaluate low-dimensional models with physically meaningful internal structures are computed. In this work, we develop a new approach for the structured data-driven surrogate modeling of linear dynamical systems described by second-order time derivatives via balanced truncation model-order reduction. The proposed method is a data-driven reformulation of position-velocity balanced truncation for second-order systems and generalizes the quadrature-based balanced truncation for unstructured first-order systems to the second-order case. The computed surrogates encode a generalized proportional damping structure, and we propose a computational procedure for inferring the damping coefficients from data by minimizing a least-squares error over the coefficients. Several numerical examples demonstrate the effectiveness of the proposed method. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zenodo.org/records/18148591 . [Formula: see text]
- Open Access
A refined nonlinear least-squares method for the rational approximation problem
The adaptive Antoulas-Anderson (AAA) algorithm for rational approximation is a widely used method for the efficient construction of highly accurate rational approximations to given data. While AAA can often produce rational approximations accurate to any prescribed tolerance, these approximations may have degrees larger than what is actually required to meet the given tolerance. In this work, we consider the adaptive construction of interpolating rational approximations while aiming for the smallest feasible degree to satisfy a given error tolerance. To this end, we introduce refinement approaches to the linear least-squares step of the classical AAA algorithm that aim to minimize the true nonlinear least-squares error with respect to the given data. Furthermore, we theoretically analyze the derived approaches in terms of the corresponding gradients from the resulting minimization problems and use these insights to propose a new greedy framework that ensures monotonic error convergence. Numerical examples from function approximation and model order reduction verify the effectiveness of the proposed algorithm to construct accurate rational approximations of small degrees.
Open AccessA refined nonlinear least-squares method for the rational approximation problem
The adaptive Antoulas-Anderson (AAA) algorithm for rational approximation is a widely used method for the efficient construction of highly accurate rational approximations to given data. While AAA can often produce rational approximations accurate to any prescribed tolerance, these approximations may have degrees larger than what is actually required to meet the given tolerance. In this work, we consider the adaptive construction of interpolating rational approximations while aiming for the smallest feasible degree to satisfy a given error tolerance. To this end, we introduce refinement approaches to the linear least-squares step of the classical AAA algorithm that aim to minimize the true nonlinear least-squares error with respect to the given data. Furthermore, we theoretically analyze the derived approaches in terms of the corresponding gradients from the resulting minimization problems and use these insights to propose a new greedy framework that ensures monotonic error convergence. Numerical examples from function approximation and model order reduction verify the effectiveness of the proposed algorithm to construct accurate rational approximations of small degrees.
- Open Access
A tangential low-rank ADI method for solving indefinite Lyapunov equations
Continuous-time algebraic Lyapunov equations have become an essential tool in various applications. In the case of large-scale sparse coefficient matrices and indefinite constant terms, indefinite low-rank factorizations have successfully been used to allow methods like the alternating direction implicit (ADI) iteration to efficiently compute accurate approximations to the solution of the Lyapunov equation. However, classical block-type approaches quickly increase in computational costs when the rank of the constant term grows. In this paper, we propose a novel tangential reformulation of the ADI iteration that allows for the efficient construction of low-rank approximations to the solution of Lyapunov equations with indefinite right-hand sides even in the case of constant terms with higher ranks. We provide adaptive methods for the selection of the corresponding ADI parameters, namely shifts and tangential directions, which allow for the automatic application of the method to any relevant problem setting. The effectiveness of the developed algorithms is illustrated by several numerical examples.
Open AccessA tangential low-rank ADI method for solving indefinite Lyapunov equations
Continuous-time algebraic Lyapunov equations have become an essential tool in various applications. In the case of large-scale sparse coefficient matrices and indefinite constant terms, indefinite low-rank factorizations have successfully been used to allow methods like the alternating direction implicit (ADI) iteration to efficiently compute accurate approximations to the solution of the Lyapunov equation. However, classical block-type approaches quickly increase in computational costs when the rank of the constant term grows. In this paper, we propose a novel tangential reformulation of the ADI iteration that allows for the efficient construction of low-rank approximations to the solution of Lyapunov equations with indefinite right-hand sides even in the case of constant terms with higher ranks. We provide adaptive methods for the selection of the corresponding ADI parameters, namely shifts and tangential directions, which allow for the automatic application of the method to any relevant problem setting. The effectiveness of the developed algorithms is illustrated by several numerical examples.
- Open Access
- 1 December 2025
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 51 (6) , 55
Deep polytopic autoencoders for low-dimensional linear parameter-varying approximations and nonlinear feedback controller design
Polytopic autoencoders provide low-dimensional parametrizations of states in a polytope. For nonlinear partial differential equations (PDEs), this is readily applied to low-dimensional linear parameter-varying (LPV) approximations as they have been exploited for efficient nonlinear controller design via series expansions of the solution to the state-dependent Riccati equation. In this work, we develop a polytopic autoencoder for control applications and show how it improves on standard linear approaches in view of LPV approximations of nonlinear systems. We discuss how the particular architecture enables exact representations of target states and higher-order series expansions of the nonlinear feedback law at little extra computational effort in the online phase. In the offline phase, a system of linear though high-dimensional and nonstandard Lyapunov equations has to be solved. Here, we expand on how to adapt state-of-the-art methods for the efficient numerical treatment. In a numerical study, we illustrate the procedure and how this approach can reliably outperform the standard linear-quadratic regulator design.
- 1 December 2025
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 51 (6) , 55
Open AccessDeep polytopic autoencoders for low-dimensional linear parameter-varying approximations and nonlinear feedback controller design
Polytopic autoencoders provide low-dimensional parametrizations of states in a polytope. For nonlinear partial differential equations (PDEs), this is readily applied to low-dimensional linear parameter-varying (LPV) approximations as they have been exploited for efficient nonlinear controller design via series expansions of the solution to the state-dependent Riccati equation. In this work, we develop a polytopic autoencoder for control applications and show how it improves on standard linear approaches in view of LPV approximations of nonlinear systems. We discuss how the particular architecture enables exact representations of target states and higher-order series expansions of the nonlinear feedback law at little extra computational effort in the online phase. In the offline phase, a system of linear though high-dimensional and nonstandard Lyapunov equations has to be solved. Here, we expand on how to adapt state-of-the-art methods for the efficient numerical treatment. In a numerical study, we illustrate the procedure and how this approach can reliably outperform the standard linear-quadratic regulator design.
- Open Access
Data-driven balanced truncation for second-order systems with generalized proportional damping
Structured reduced-order modeling is a central component in the computer-aided design of control systems in which cheap-to-evaluate low-dimensional models with physically meaningful internal structures are computed. In this work, we develop a new approach for the structured data-driven surrogate modeling of linear dynamical systems described by second-order time derivatives via balanced truncation model-order reduction. The proposed method is a data-driven reformulation of position-velocity balanced truncation for second-order systems and generalizes the quadrature-based balanced truncation for unstructured first-order systems to the second-order case. The computed surrogates encode a generalized proportional damping structure, and the damping coefficients are inferred solely from data by minimizing a least-squares error over the coefficients. Several numerical examples demonstrate the effectiveness of the proposed method.
Open AccessData-driven balanced truncation for second-order systems with generalized proportional damping
Structured reduced-order modeling is a central component in the computer-aided design of control systems in which cheap-to-evaluate low-dimensional models with physically meaningful internal structures are computed. In this work, we develop a new approach for the structured data-driven surrogate modeling of linear dynamical systems described by second-order time derivatives via balanced truncation model-order reduction. The proposed method is a data-driven reformulation of position-velocity balanced truncation for second-order systems and generalizes the quadrature-based balanced truncation for unstructured first-order systems to the second-order case. The computed surrogates encode a generalized proportional damping structure, and the damping coefficients are inferred solely from data by minimizing a least-squares error over the coefficients. Several numerical examples demonstrate the effectiveness of the proposed method.
- Open Access
Second-order AAA algorithms for structured data-driven modeling
The data-driven modeling of dynamical systems has become an essential tool for the construction of accurate computational models from real-world data. In this process, the inherent differential structures underlying the considered physical phenomena are often neglected making the reinterpretation of the learned models in a physically meaningful sense very challenging. In this work, we present three data-driven modeling approaches for the construction of dynamical systems with second-order differential structure directly from frequency domain data. Based on the second-order structured barycentric form, we extend the well-known Adaptive Antoulas-Anderson algorithm to the case of second-order systems. Depending on the available computational resources, we propose variations of the proposed method that prioritize either higher computation speed or greater modeling accuracy, and we present a theoretical analysis for the expected accuracy and performance of the proposed methods. Three numerical examples demonstrate the effectiveness of our new structured approaches in comparison to classical unstructured data-driven modeling.
Open AccessSecond-order AAA algorithms for structured data-driven modeling
The data-driven modeling of dynamical systems has become an essential tool for the construction of accurate computational models from real-world data. In this process, the inherent differential structures underlying the considered physical phenomena are often neglected making the reinterpretation of the learned models in a physically meaningful sense very challenging. In this work, we present three data-driven modeling approaches for the construction of dynamical systems with second-order differential structure directly from frequency domain data. Based on the second-order structured barycentric form, we extend the well-known Adaptive Antoulas-Anderson algorithm to the case of second-order systems. Depending on the available computational resources, we propose variations of the proposed method that prioritize either higher computation speed or greater modeling accuracy, and we present a theoretical analysis for the expected accuracy and performance of the proposed methods. Three numerical examples demonstrate the effectiveness of our new structured approaches in comparison to classical unstructured data-driven modeling.