On modifications to the spectral dichotomy algorithm
From MaRDI portal
Recommendations
Cites work
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- Computing eigenspaces with specified eigenvalues of a regular matrix pair (A,B) and condition estimation: Theory, algorithms and software
- Computing invariant subspaces of a regular linear pencil of matrices
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1166153 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- Large-scale computation of pseudospectra using ARPACK and eigs
- Parallel algorithm for solving some spectral problems of linear algebra
- Problem of the dichotomy of the spectrum of a matrix
- Some new algorithms for the spectral dichotomy methods
Cited in
(7)- Some new algorithms for the spectral dichotomy methods
- scientific article; zbMATH DE number 1899860 (Why is no real title available?)
- Circular trichotomy of the spectrum of regular matrix pencils
- METHOD OF SPECTRAL DICHOTOMY OF A MATRIX WITH RESPECT TO A CIRCLE OR AN ELLIPSE NOT CENTERED AT THE ORIGIN
- Localization of the matrix spectrum and Lyapunov type equations
- Location of the spectrum of a matrix in a domain bounded by a parabola
- Efficient computation of the spectral projections of regular matrix pairs
This page was built for publication: On modifications to the spectral dichotomy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854325)