Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver

Lyapunov equations are key mathematical objects in systems theory, analysis and design of control systems, and in many applications, including balanced realization algorithms, procedures for reduced order models, Newton methods for algebraic Riccati equations, or stabilization algorithms. A new iter...

Full description

Bibliographic Details
Main Author: Vasile Sima
Format: Article
Language:English
Published: MDPI AG 2019-06-01
Series:Information
Subjects:
Online Access:https://www.mdpi.com/2078-2489/10/6/215
id doaj-e22c7264bda5497bab33f1d329f4534f
record_format Article
spelling doaj-e22c7264bda5497bab33f1d329f4534f2020-11-25T00:25:38ZengMDPI AGInformation2078-24892019-06-0110621510.3390/info10060215info10060215Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov SolverVasile Sima0National Institute for Research & Development in Informatics, 011455 Bucharest, RomaniaLyapunov equations are key mathematical objects in systems theory, analysis and design of control systems, and in many applications, including balanced realization algorithms, procedures for reduced order models, Newton methods for algebraic Riccati equations, or stabilization algorithms. A new iterative accuracy-enhancing solver for both standard and generalized continuous- and discrete-time Lyapunov equations is proposed and investigated in this paper. The underlying algorithm and some technical details are summarized. At each iteration, the computed solution of a reduced Lyapunov equation serves as a correction term to refine the current solution of the initial equation. The best available algorithms for solving Lyapunov equations with dense matrices, employing the real Schur(-triangular) form of the coefficient matrices, are used. The reduction to Schur(-triangular) form has to be done only once, before starting the iterative process. The algorithm converges in very few iterations. The results obtained by solving series of numerically difficult examples derived from the SLICOT benchmark collections for Lyapunov equations are compared to the solutions returned by the MATLAB and SLICOT solvers. The new solver can be more accurate than these state-of-the-art solvers and requires little additional computational effort.https://www.mdpi.com/2078-2489/10/6/215linear multivariable systemsLyapunov equationnumerical algorithmssoftwarestability
collection DOAJ
language English
format Article
sources DOAJ
author Vasile Sima
spellingShingle Vasile Sima
Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver
Information
linear multivariable systems
Lyapunov equation
numerical algorithms
software
stability
author_facet Vasile Sima
author_sort Vasile Sima
title Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver
title_short Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver
title_full Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver
title_fullStr Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver
title_full_unstemmed Comparative Performance Evaluation of an Accuracy-Enhancing Lyapunov Solver
title_sort comparative performance evaluation of an accuracy-enhancing lyapunov solver
publisher MDPI AG
series Information
issn 2078-2489
publishDate 2019-06-01
description Lyapunov equations are key mathematical objects in systems theory, analysis and design of control systems, and in many applications, including balanced realization algorithms, procedures for reduced order models, Newton methods for algebraic Riccati equations, or stabilization algorithms. A new iterative accuracy-enhancing solver for both standard and generalized continuous- and discrete-time Lyapunov equations is proposed and investigated in this paper. The underlying algorithm and some technical details are summarized. At each iteration, the computed solution of a reduced Lyapunov equation serves as a correction term to refine the current solution of the initial equation. The best available algorithms for solving Lyapunov equations with dense matrices, employing the real Schur(-triangular) form of the coefficient matrices, are used. The reduction to Schur(-triangular) form has to be done only once, before starting the iterative process. The algorithm converges in very few iterations. The results obtained by solving series of numerically difficult examples derived from the SLICOT benchmark collections for Lyapunov equations are compared to the solutions returned by the MATLAB and SLICOT solvers. The new solver can be more accurate than these state-of-the-art solvers and requires little additional computational effort.
topic linear multivariable systems
Lyapunov equation
numerical algorithms
software
stability
url https://www.mdpi.com/2078-2489/10/6/215
work_keys_str_mv AT vasilesima comparativeperformanceevaluationofanaccuracyenhancinglyapunovsolver
_version_ 1725347845103419392