Randomized block Krylov subspace algorithms for low-rank quaternion matrix approximations

被引:4
|
作者
Li, Chaoqian [1 ]
Liu, Yonghe [1 ]
Wu, Fengsheng [1 ]
Che, Maolin [2 ]
机构
[1] Yunnan Univ, Sch Math & Stat, Kunming 650091, Peoples R China
[2] Southwestern Univ Finance & Econ, Sch Math, Chengdu 611130, Peoples R China
关键词
Low-rank quaternion matrix approximation; Quaternion singular value decomposition; Randomized quaternion singular value decomposition; Block Krylov iteration; SINGULAR-VALUE DECOMPOSITION; COLOR IMAGES; COMPLETION;
D O I
10.1007/s11075-023-01662-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A randomized quaternion singular value decomposition algorithm based on block Krylov iteration (RQSVD-BKI) is presented to solve the low-rank quaternion matrix approximation problem. The upper bounds of deterministic approximation error and expected approximation error for the RQSVD-BKI algorithm are also given. It is shown by numerical experiments that the running time of the RQSVD-BKI algorithm is smaller than that of the quaternion singular value decomposition, and the relative errors of the RQSVD-BKI algorithm are smaller than those of the randomized quaternion singular value decomposition algorithm in Liu et al. (SIAM J. Sci. Comput., 44(2): A870-A900 (2022)) in some cases. In order to further illustrate the feasibility and effectiveness of the RQSVD-BKI algorithm, we use it to deal with the problem of color image inpainting.
引用
收藏
页码:687 / 717
页数:31
相关论文
共 50 条
  • [1] Randomized block Krylov subspace algorithms for low-rank quaternion matrix approximations
    Chaoqian Li
    Yonghe Liu
    Fengsheng Wu
    Maolin Che
    Numerical Algorithms, 2024, 96 : 687 - 717
  • [2] Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
    Kaloorazi, Maboud Farzaneh
    de lamare, Rodrigo C.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (16) : 4409 - 4424
  • [3] Dominant subspace and low-rank approximations from block Krylov subspaces without a prescribed gap
    Massey, Pedro
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2025, 708 : 112 - 149
  • [4] Computing low-rank approximations of the Frechet derivative of a matrix function using Krylov subspace methods
    Kandolf, Peter
    Koskela, Antti
    Relton, Samuel D.
    Schweitzer, Marcel
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2021, 28 (06)
  • [5] Subspace-Orbit Randomized-Based Decomposition for Low-Rank Matrix Approximations
    Kaloorazi, Maboud F.
    de lamare, Rodrigo C.
    2018 26TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2018, : 2618 - 2622
  • [6] Fixed-precision randomized quaternion singular value decomposition algorithm for low-rank quaternion matrix approximations
    Liu, Yonghe
    Wu, Fengsheng
    Che, Maolin
    Li, Chaoqian
    NEUROCOMPUTING, 2024, 580
  • [7] Quaternion Matrix Factorization for Low-Rank Quaternion Matrix Completion
    Chen, Jiang-Feng
    Wang, Qing-Wen
    Song, Guang-Jing
    Li, Tao
    MATHEMATICS, 2023, 11 (09)
  • [8] Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations
    Kaloorazi, Maboud F.
    de Lamare, Rodrigo C.
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2018, 12 (06) : 1155 - 1169
  • [9] Fast Parallel Randomized QR with Column Pivoting Algorithms for Reliable Low-rank Matrix Approximations
    Xiao, Jianwei
    Gu, Ming
    Langou, Julien
    2017 IEEE 24TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2017, : 233 - 242
  • [10] Two Rank Approximations for Low-Rank Based Subspace Clustering
    Xu, Fei
    Peng, Chong
    Hu, Yunhong
    He, Guoping
    2017 10TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI), 2017,