On the optimality and sharpness of Laguerre's lower bound on the smallest eigenvalue of a symmetric positive definite matrix

02/01/2017
by   Yusaku Yamamoto, et al.
0

Lower bounds on the smallest eigenvalue of a symmetric positive definite matrices A∈R^m× m play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the bounds based on Tr(A^-1) and Tr(A^-2) attract attention recently because they can be computed in O(m) work when A is tridiagonal. In this paper, we focus on these bounds and investigate their properties in detail. First, we consider the problem of finding the optimal bound that can be computed solely from Tr(A^-1) and Tr(A^-2) and show that so called Laguerre's lower bound is the optimal one in terms of sharpness. Next, we study the gap between the Laguerre bound and the smallest eigenvalue. We characterize the situation in which the gap becomes largest in terms of the eigenvalue distribution of A and show that the gap becomes smallest when Tr(A^-2)/{ Tr(A^-1)}^2 approaches 1 or 1/m. These results will be useful, for example, in designing efficient shift strategies for singular value computation algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2021

Two new lower bounds for the smallest singular value

In this paper, we obtain two new lower bounds for the smallest singular ...
research
10/16/2022

A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph

In this paper, we obtain a lower bound for the smallest eigenvalue of a ...
research
09/29/2022

The behaviour of the Gauss-Radau upper bound of the error norm in CG

Consider the problem of solving systems of linear algebraic equations Ax...
research
10/18/2019

On the shift-invert Lanczos method for the buckling eigenvalue problem

We consider the problem of extracting a few desired eigenpairs of the bu...
research
12/21/2020

Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks

A recent line of work has analyzed the theoretical properties of deep ne...
research
06/06/2022

The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix

This paper is concerned with the distance of a symmetric tridiagonal Toe...
research
03/31/2022

A visualisation for conveying the dynamics of iterative eigenvalue algorithms over PSD matrices

We propose a new way of visualising the dynamics of iterative eigenvalue...

Please sign up or login with your details

Forgot password? Click here to reset