Eigenvalue Bounds for Saddle-Point Systems with Singular Leading Blocks

05/30/2022
by   Susanne Bradley, et al.
0

We derive bounds on the eigenvalues of saddle-point matrices with singular leading blocks. The technique of proof is based on augmentation. Our bounds depend on the principal angles between the ranges or kernels of the matrix blocks. Numerical experiments validate our analytical findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2021

Eigenvalue Bounds for Double Saddle-Point Systems

We derive bounds on the eigenvalues of a generic form of double saddle-p...
research
06/27/2022

Augmentation-Based Preconditioners for Saddle-Point Systems with Singular Leading Blocks

We consider the iterative solution of symmetric saddle-point matrices wi...
research
06/16/2022

Generalized Leverage Scores: Geometric Interpretation and Applications

In problems involving matrix computations, the concept of leverage has f...
research
05/22/2023

Analysis of a class of randomized numerical methods for singular matrix pencils

The numerical solution of the generalized eigenvalue problem for a singu...
research
06/08/2023

Chi-square approximation for the distribution of individual eigenvalues of a singular Wishart matrix

This paper discusses the approximate distributions of eigenvalues of a s...
research
12/10/2022

An approach to robust ICP initialization

In this note, we propose an approach to initialize the Iterative Closest...
research
11/09/2022

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations

Randomized subspace approximation with "matrix sketching" is an effectiv...

Please sign up or login with your details

Forgot password? Click here to reset