A Deterministic Algorithm for Eigenvalue Separation in Tridiagonal Matrices
From MaRDI portal
Cites work
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization
- Adaptive Sampling for Convex Regression
- Avoiding discretization issues for nonlinear eigenvalue problems
- Convergence and Near-optimal Sampling for Multivariate Function Approximations in Irregular Domains via Vandermonde with Arnoldi
- Convex Analysis on the Hermitian Matrices
- Derivatives of Spectral Functions
- Detecting localization in an invariant subspace
- Deterministic complexity analysis of Hermitian eigenproblems
- Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- FEAST for differential eigenvalue problems
- Global Optimality Characterizations and Algorithms for Minimizing Quartically-Regularized Third-Order Taylor Polynomials
- Invariant subspaces for tightly clustered eigenvalues of tridiagonals
- Local fluctuation of the spectrum of a multidimensional Anderson tight binding model
- Lower Bounds for the Partitioning of Graphs
- Numerical instability of algebraic rootfinders
- On close eigenvalues of tridiagonal matrices
- On Eigenvalue Optimization
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Open problems
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Rigorous data‐driven computation of spectral properties of Koopman operators for dynamical systems
- Sum of Squares and Non Sum of Squares Regimes for the Toeplitz Bottcher Wenzel Form
- Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications
- Twice differentiable spectral functions
- Variational analysis of spectral functions simplified
- When is Polynomial Optimization SoS-Exact? Sufficient Regularization and Strict Gram Representations
This page was built for publication: A Deterministic Algorithm for Eigenvalue Separation in Tridiagonal Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7452315)