Distance Problems for Hermitian Matrix Pencils with Eigenvalues of Definite Type
From MaRDI portal
Publication:2790064
DOI10.1137/140963364zbMath1382.15018OpenAlexW2232927601MaRDI QIDQ2790064
Ravi K. Srivastava, Shreemayee Bora
Publication date: 2 March 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140963364
perturbation theoryeigenvalue problemsCrawford numberHermitian pencilsdefinite pencilsdefinitizable pencilsdistance problems for Hermitian pencils with eigenvalues of definite type
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hermitian matrix polynomials with real eigenvalues of definite type. I: Classification
- Structured eigenvalue condition numbers and linearizations for matrix polynomials
- Finding a positive definite linear combination of two Hermitian matrices
- The perturbation bounds for eigenspaces of a definite matrix-pair
- A perturbation bound for definite pencils
- Numerical range of a matrix: Some effective criteria
- Perturbation bounds for the definite generalized eigenvalue problem
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- Perturbation theory for linear operators.
- A note on Stewart's theorem for definite matrix pairs
- On computing the generalized Crawford number of a matrix
- The nearest definite pair for the Hermitian generalized eigenvalue problem
- On Pseudospectra, Critical Points, and Multiple Eigenvalues of Matrix Pencils
- Perturbation Theory for Hamiltonian Matrices and the Distance to Bounded-Realness
- Distances from a Hermitian Pair to Diagonalizable and Nondiagonalizable Hermitian Pairs
- Definite Matrix Polynomials and their Linearization by Definite Pencils
- An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
- Numerical Determination of the Field of Values of a General Complex Matrix
- Algorithm 646
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- On pseudospectra of matrix polynomials and their boundaries
This page was built for publication: Distance Problems for Hermitian Matrix Pencils with Eigenvalues of Definite Type
