Optimal Hankel norm approximation for continuous-time descriptor systems

X. Cao; M.B. Saltik; S. Weiland

doi:10.23919/ACC.2018.8431684

Optimal Hankel norm approximation for continuous-time descriptor systems

X. Cao, M.B. Saltik, S. Weiland

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

1 Downloads (Pure)

Abstract

This paper discusses optimal Hankel norm approximations (HNA) of continuous-time descriptor systems. The main results are based on the fact that the system can be decomposed into a slow subsystem and a fast subsystem. We mainly stress the reduction for the subsystems. In this sense, the novelty is two-fold. First, by exploring the structure of the Hankel matrix associated with the fast subsystem, a connection between reachability, observability and the system index is discovered. Second, an index reduction technique is proposed by reducing the system in the optimal Hankel norm manner. Numerical examples are tested to demonstrate the theoretical aspects of the article.

Original language	English
Title of host publication	2018 Annual American Control Conference, ACC 2018
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	6409-6414
ISBN (Print)	978-1-5386-5428-6
DOIs	https://doi.org/10.23919/ACC.2018.8431684
Publication status	Published - 9 Aug 2018
Event	2018 American Control Conference (ACC 2018) - Hilton Milwaukee City Center Hotel, Milwaukee, Wisconsin, United States Duration: 27 Jun 2018 → 29 Jun 2018 http://acc2018.a2c2.org/

Conference

Conference	2018 American Control Conference (ACC 2018)
Abbreviated title	ACC 2018
Country/Territory	United States
City	Milwaukee, Wisconsin
Period	27/06/18 → 29/06/18
Internet address	http://acc2018.a2c2.org/

Access to Document

10.23919/ACC.2018.8431684

Cite this

@inproceedings{1828200d367e4d0991fe7310a8b44227,

title = "Optimal Hankel norm approximation for continuous-time descriptor systems",

abstract = "This paper discusses optimal Hankel norm approximations (HNA) of continuous-time descriptor systems. The main results are based on the fact that the system can be decomposed into a slow subsystem and a fast subsystem. We mainly stress the reduction for the subsystems. In this sense, the novelty is two-fold. First, by exploring the structure of the Hankel matrix associated with the fast subsystem, a connection between reachability, observability and the system index is discovered. Second, an index reduction technique is proposed by reducing the system in the optimal Hankel norm manner. Numerical examples are tested to demonstrate the theoretical aspects of the article.",

author = "X. Cao and M.B. Saltik and S. Weiland",

year = "2018",

month = aug,

day = "9",

doi = "10.23919/ACC.2018.8431684",

language = "English",

isbn = "978-1-5386-5428-6",

pages = "6409--6414",

booktitle = "2018 Annual American Control Conference, ACC 2018",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2018 American Control Conference (ACC 2018), ACC 2018 ; Conference date: 27-06-2018 Through 29-06-2018",

url = "http://acc2018.a2c2.org/",

}

Cao, X, Saltik, MB & Weiland, S 2018, Optimal Hankel norm approximation for continuous-time descriptor systems. in 2018 Annual American Control Conference, ACC 2018., 8431684, Institute of Electrical and Electronics Engineers, Piscataway, pp. 6409-6414, 2018 American Control Conference (ACC 2018), Milwaukee, Wisconsin, United States, 27/06/18. https://doi.org/10.23919/ACC.2018.8431684

Optimal Hankel norm approximation for continuous-time descriptor systems. / Cao, X.; Saltik, M.B.; Weiland, S.

2018 Annual American Control Conference, ACC 2018. Piscataway : Institute of Electrical and Electronics Engineers, 2018. p. 6409-6414 8431684.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Optimal Hankel norm approximation for continuous-time descriptor systems

AU - Cao, X.

AU - Saltik, M.B.

AU - Weiland, S.

PY - 2018/8/9

Y1 - 2018/8/9

N2 - This paper discusses optimal Hankel norm approximations (HNA) of continuous-time descriptor systems. The main results are based on the fact that the system can be decomposed into a slow subsystem and a fast subsystem. We mainly stress the reduction for the subsystems. In this sense, the novelty is two-fold. First, by exploring the structure of the Hankel matrix associated with the fast subsystem, a connection between reachability, observability and the system index is discovered. Second, an index reduction technique is proposed by reducing the system in the optimal Hankel norm manner. Numerical examples are tested to demonstrate the theoretical aspects of the article.

AB - This paper discusses optimal Hankel norm approximations (HNA) of continuous-time descriptor systems. The main results are based on the fact that the system can be decomposed into a slow subsystem and a fast subsystem. We mainly stress the reduction for the subsystems. In this sense, the novelty is two-fold. First, by exploring the structure of the Hankel matrix associated with the fast subsystem, a connection between reachability, observability and the system index is discovered. Second, an index reduction technique is proposed by reducing the system in the optimal Hankel norm manner. Numerical examples are tested to demonstrate the theoretical aspects of the article.

UR - http://www.scopus.com/inward/record.url?scp=85052570079&partnerID=8YFLogxK

U2 - 10.23919/ACC.2018.8431684

DO - 10.23919/ACC.2018.8431684

M3 - Conference contribution

AN - SCOPUS:85052570079

SN - 978-1-5386-5428-6

SP - 6409

EP - 6414

BT - 2018 Annual American Control Conference, ACC 2018

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2018 American Control Conference (ACC 2018)

Y2 - 27 June 2018 through 29 June 2018

ER -

Optimal Hankel norm approximation for continuous-time descriptor systems

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this