New lower bounds on the minimum singular value of a matrix

被引:4
作者
Kaur, Avleen [1 ]
Lui, S. H. [1 ]
机构
[1] Univ Manitoba, Dept Math, Winnipeg, MB R3T 2N2, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Block matrix; Eigenvalue; Lower bound; Friedrichs angle; Real symmetric matrices; Singular value; SUBSPACES; ANGLES; PRODUCT; EIGENVALUES;
D O I
10.1016/j.laa.2023.02.013
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The study of constraining the eigenvalues of the sum of two symmetric matrices, say P + Q, in terms of the eigenvalues of P and Q, has a long tradition. It is closely related to estimating a lower bound on the minimum singular value of a matrix, which has been discussed by a great number of authors. To our knowledge, no study has yielded a positive lower bound on the minimum eigenvalue, Amin(P + Q), when P + Q is symmetric positive definite with P and Q singular positive semi-definite. We derive two new lower bounds on Amin(P + Q) in terms of the minimum positive eigenvalues of P and Q. The bounds take into account geometric information by utilizing the Friedrichs angles between certain subspaces. The basic result is when P and Q are two non-zero singular positive semi-definite matrices such that P+Q is non-singular, then Amin(P + Q) i (1 -cos theta F) min{Amin(P), Amin(Q)}, where Amin represents the minimum positive eigenvalue of the matrix, and theta F is the Friedrichs angle between the range spaces of P and Q. Such estimates lead to new lower bounds on the minimum singular value of full rank 1 x 2, 2 x 1, and 2 x 2 block matrices. Some examples provided in this paper further highlight the simplicity of applying the results in comparison to some existing lower bounds.(c) 2023 Elsevier Inc. All rights reserved.
引用
收藏
页码:62 / 95
页数:34
相关论文
共 50 条
[1]  
[Anonymous], 2001, Notices Amer. Math. Soc.
[2]   Eigenvalue estimates for preconditioned saddle point matrices [J].
Axelsson, O ;
Neytcheva, M .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2006, 13 (04) :339-360
[3]   Unified analysis of preconditioning methods for saddle point matrices [J].
Axelsson, Owe .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2015, 22 (02) :233-253
[4]   Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks [J].
Bai, Zhong-Zhi .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2013, 237 (01) :295-306
[5]  
Barber David, 2012, Bayesian reasoning and machine learning, DOI DOI 10.1017/CBO9780511804779
[6]   On the eigenvalues of a class of saddle point matrices [J].
Benzi, M ;
Simoncini, V .
NUMERISCHE MATHEMATIK, 2006, 103 (02) :173-196
[7]  
Benzi M, 2005, ACTA NUMER, V14, P1, DOI 10.1017/S0962492904000212
[8]   On eigenvalue distribution of constraint-preconditioned symmetric saddle point matrices [J].
Bergamaschi, Luca .
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2012, 19 (04) :754-772
[9]  
Bernstein D. S., 2018, Scalar, vector, and matrix mathematics, DOI 10.1515/9781400888252
[10]   ON THE SINGULAR-VALUES OF A PRODUCT OF OPERATORS [J].
BHATIA, R ;
KITTANEH, F .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1990, 11 (02) :272-277