A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations

被引：25
|
作者：
Sadkane, Miloud [1 ]
机构：
[1] Univ Brest, Math Lab, CNRS UMR 6205, F-29238 Brest 3, France
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 2012年 / 436卷 / 08期
关键词：
Discrete-time Lyapunov equation; Squared Smith method; Low-rank approximation; Block-Arnoldi method; ADI iteration; FOM; ITERATIVE METHODS;
D O I：
10.1016/j.laa.2011.07.021
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The squared Smith method is adapted to solve large-scale discrete-time Lyapunov matrix equations. The adaptation uses a Krylov subspace to generate the squared Smith iteration in a low-rank form. A restarting mechanism is employed to cope with the increase of memory storage of the Krylov basis. Theoretical aspects of the algorithm are presented. Several numerical illustrations are reported. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码：2807 / 2827
页数：21
相关论文
共 50 条
  • [21] Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations
    Kressner, Daniel
    2008 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER-AIDED CONTROL SYSTEM DESIGN, 2008, : 207 - 212
  • [22] Inexact methods for the low rank solution to large scale Lyapunov equations
    Patrick Kürschner
    Melina A. Freitag
    BIT Numerical Mathematics, 2020, 60 : 1221 - 1259
  • [23] Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers
    Yao, Quanming
    Kwok, James T.
    Wang, Taifeng
    Liu, Tie-Yan
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (11) : 2628 - 2643
  • [24] Low-rank variance estimation in large-scale GMRF models
    Malioutov, Dmitry M.
    Johnson, Jason K.
    Willsky, Alan S.
    2006 IEEE International Conference on Acoustics, Speech and Signal Processing, Vols 1-13, 2006, : 3127 - 3130
  • [25] Inexact methods for the low rank solution to large scale Lyapunov equations
    Kurschner, Patrick
    Freitag, Melina A.
    BIT NUMERICAL MATHEMATICS, 2020, 60 (04) : 1221 - 1259
  • [26] PARAMETRIC IDENTIFICATION OF LARGE-SCALE DISCRETE-TIME SYSTEMS
    KAMOUN, M
    TITLI, A
    INFORMATION AND DECISION TECHNOLOGIES, 1988, 14 (04): : 289 - 306
  • [27] Lyapunov formulation of the large-scale, ISS cyclic-small-gain theorem: The discrete-time case
    Liu, Tengfei
    Hill, David J.
    Jiang, Zhong-Ping
    SYSTEMS & CONTROL LETTERS, 2012, 61 (01) : 266 - 272
  • [28] Laguerre-Based Low-Rank Balanced Truncation of Discrete-Time Systems
    Xiao, Zhi-Hua
    Fang, Ya-Xin
    Jiang, Yao-Lin
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2023, 70 (08) : 3014 - 3018
  • [29] Nonlinear multigrid for the solution of large-scale Riccati equations in low-rank and H-matrix format
    Grasedyck, L.
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2008, 15 (09) : 779 - 807
  • [30] Low-rank approximation of large-scale matrices via randomized methods
    Hatamirad, Sarvenaz
    Pedram, Mir Mohsen
    JOURNAL OF SUPERCOMPUTING, 2018, 74 (02): : 830 - 844
12345