Jens Saak

Dr. Jens Saak

1. Max Planck Institute for Dynamics of Complex Technical Systems, Sandtorstraße 1, 39106 Magdeburg, Germany
+1
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 January 2016 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
PBPeter Benner
Peter Benner
PKPatrick Kürschner
Patrick Kürschner
Jens SaakJens Saak
Jens Saak
In this article we investigate model order reduction of large-scale systems using frequency-limited balanced truncation, which restricts the well known balanced truncation framework to prescribed frequency regions. The main emphasis is put on the efficient numerical realization of this model reduction approach. We discuss numerical methods to take care of the involved matrix-valued functions. The occurring large-scale Lyapunov equations are solved for low-rank approximations for which we also establish results regarding the eigenvalues of their solutions. These results, and also numerical experiments, will show that the eigenvalues of the Lyapunov solutions in frequency-limited balanced truncation often decay faster than those in standard balanced truncation. Moreover, we show in further numerical examples that frequency-limited balanced truncation generates reduced order models which are significantly more accurate in the considered frequency region.

15 April 2012 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
PBPeter Benner
Peter Benner
PKPatrick Kürschner
Patrick Kürschner
Jens SaakJens Saak
Jens Saak

24 July 2017 in Numerische Mathematik
Verified
Journal Article
Open access
PDF file
PBPeter Benner
Peter Benner
ZBZvonimir Bujanović
Zvonimir Bujanović
PKPatrick Kürschner
Patrick Kürschner
Jens SaakJens Saak
Jens Saak
This paper introduces a new algorithm for solving large-scale continuous-time algebraic Riccati equations (CARE). The advantage of the new algorithm is in its immediate and efficient low-rank formulation, which is a generalization of the Cholesky-factored variant of the Lyapunov ADI method. We discuss important implementation aspects of the algorithm, such as reducing the use of complex arithmetic and shift selection strategies. We show that there is a very tight relation between the new algorithm and three other algorithms for CARE previously known in the literature—all of these seemingly different methods in fact produce exactly the same iterates when used with the same parameters: they are algorithmically different descriptions of the same approximation sequence to the Riccati solution.

1 September 2015 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
NLNorman Lang
Norman Lang
HMHermann Mena
Hermann Mena
Jens SaakJens Saak
Jens Saak

1 January 2020 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
PBPeter Benner
Peter Benner
ZBZvonimir Bujanović
Zvonimir Bujanović
PKPatrick Kürschner
Patrick Kürschner
Jens SaakJens Saak
Jens Saak
In this paper, we discuss numerical methods for solving large-scale continuous-time algebraic Riccati equations. These methods have been the focus of intensive research in recent years, and signifi...