Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

A Numerical Comparison of Different Solvers for Large-Scale, Continuous-Time Algebraic Riccati Equations and LQR Problems

MPG-Autoren
/persons/resource/persons86253

Benner,  Peter
Computational Methods in Systems and Control Theory, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

/persons/resource/persons86377

Kürschner,  Patrick
Computational Methods in Systems and Control Theory, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

/persons/resource/persons86459

Saak,  Jens
Computational Methods in Systems and Control Theory, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)

1811.00850.pdf
(Preprint), 615KB

3007052.pdf
(Verlagsversion), 672KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Benner, P., Bujanović, Z., Kürschner, P., & Saak, J. (2020). A Numerical Comparison of Different Solvers for Large-Scale, Continuous-Time Algebraic Riccati Equations and LQR Problems. SIAM Journal on Scientific Computing, 42(2), A957-A996. doi:10.1137/18M1220960.


Zitierlink: https://hdl.handle.net/21.11116/0000-0002-6DC7-4
Zusammenfassung
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 significant progress has been made
in both the theoretical understanding and efficient implementation of various
competing algorithms. There are several goals of this manuscript: first, to
gather in one place an overview of different approaches for solving large-scale
Riccati equations, and to point to the recent advances in each of them. Second,
to analyze and compare the main computational ingredients of these algorithms,
to detect their strong points and their potential bottlenecks. And finally, to
compare the effective implementations of all methods on a set of relevant
benchmark examples, giving an indication of their relative performance.