ABSTRACT
This chapter focuses on an efficient solutions of algebraic Lyapunov equations which arise from large-scale continuous-time LTI systems. We discuss the low-rank alternating direction implicit (LR-ADI) iterations to compute the low-rank approximate Gramian factors. The method is is efficient in terms of computational time and storage requirements. Numerical experiments are performed to show the efficiency of the method.
