Optimal Hankel norm model reduction for discrete-time descriptor systems

2019 ◽  
Vol 356 (7) ◽  
pp. 4124-4143 ◽  
Author(s):  
X. Cao ◽  
M.B. Saltik ◽  
S. Weiland
1990 ◽  
Vol 35 (3) ◽  
pp. 373-377 ◽  
Author(s):  
Y.S. Hung ◽  
M.A. Muzlifah

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Mohammad-Sahadet Hossain ◽  
M. Monir Uddin

We have presented the efficient techniques for the solutions of large-scale sparse projected periodic discrete-time Lyapunov equations in lifted form. These types of problems arise in model reduction and state feedback problems of periodic descriptor systems. Two most popular techniques to solve such Lyapunov equations iteratively are the low-rank alternating direction implicit (LR-ADI) method and the low-rank Smith method. The main contribution of this paper is to update the LR-ADI method by exploiting the ideas of the adaptive shift parameters computation and the efficient handling of complex shift parameters. These approaches efficiently reduce the computational cost with respect to time and memory. We also apply these iterative Lyapunov solvers in balanced truncation model reduction of periodic discrete-time descriptor systems. We illustrate numerical results to show the performance and accuracy of the proposed methods.


2019 ◽  
Vol 1218 ◽  
pp. 012050
Author(s):  
Didik Khusnul Arif ◽  
Dieky Adzkiya ◽  
Mohammad Khoirul Roziq ◽  
Prima Aditya ◽  
Helisyah Nur Fadhilah

2019 ◽  
Vol 22 (5) ◽  
pp. 2106-2118
Author(s):  
Deepak Kumar ◽  
Victor Sreeram

Sign in / Sign up

Export Citation Format

Share Document