Logarithmically Completely Monotonic Rational Functions

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Taghavian, Hamed, Drummond, Ross, Johansson, Mikael
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908435083165696
author Taghavian, Hamed
Drummond, Ross
Johansson, Mikael
author_facet Taghavian, Hamed
Drummond, Ross
Johansson, Mikael
contents This paper studies the class of logarithmically completely monotonic (LCM) functions. These functions play an important role in characterising externally positive linear systems which find applications in important control problems such as non-overshooting reference tracking. Conditions are proposed to ensure a rational function is LCM, a result that enables the known space of linear continuous-time externally positive systems to be enlarged and an efficient and optimal pole-placement procedure for the monotonic tracking controller synthesis problem to be developed. The presented conditions are shown to be less conservative than existing approaches whilst being computationally tractable.
format Preprint
id arxiv_https___arxiv_org_abs_2302_08773
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Logarithmically Completely Monotonic Rational Functions
Taghavian, Hamed
Drummond, Ross
Johansson, Mikael
Optimization and Control
Systems and Control
This paper studies the class of logarithmically completely monotonic (LCM) functions. These functions play an important role in characterising externally positive linear systems which find applications in important control problems such as non-overshooting reference tracking. Conditions are proposed to ensure a rational function is LCM, a result that enables the known space of linear continuous-time externally positive systems to be enlarged and an efficient and optimal pole-placement procedure for the monotonic tracking controller synthesis problem to be developed. The presented conditions are shown to be less conservative than existing approaches whilst being computationally tractable.
title Logarithmically Completely Monotonic Rational Functions
topic Optimization and Control
Systems and Control
url https://arxiv.org/abs/2302.08773