Subspace Acceleration for the Crawford Number and Related Eigenvalue Optimization Problems
DOI10.1137/17M1127545zbMath1394.65031OpenAlexW2730407774MaRDI QIDQ4569576
Daniel Kressner, Bart Vandereycken, Ding Lu
Publication date: 25 June 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1127545
convergence analysiseigenvalue optimizationCrawford numbercomplex approximationsubspace accelerationcoercivity constant
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A practical guide to splines
- 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.
- On computing the generalized Crawford number of a matrix
- The nearest definite pair for the Hermitian generalized eigenvalue problem
- On eigenvalues of matrices dependent on a parameter
- Distance Problems for Hermitian Matrix Pencils with Eigenvalues of Definite Type
- Restoring Definiteness via Shrinking, with an Application to Correlation Matrices with a Fixed Block
- Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems
- Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
- Hierarchical Matrices: Algorithms and Analysis
- Numerical Estimation of Coercivity Constants for Boundary Integral Operators in Acoustic Scattering
- A Subspace Method for Large-Scale Eigenvalue Optimization
- An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
- Detecting and Solving Hyperbolic Quadratic Eigenvalue Problems
- Spectra of Nearly Hermitian Matrices
- A Stable Generalized Eigenvalue Problem
- Large-Scale Computation of $\mathcal{L}_\infty$-Norms by a Greedy Subspace Method
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- Solving Boundary Integral Problems with BEM++
- Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
This page was built for publication: Subspace Acceleration for the Crawford Number and Related Eigenvalue Optimization Problems