Some new algorithms for the spectral dichotomy methods
The authors present new algoritms for the spectral dichotomy methods. Given a square regular matrix \(A\) and a positively oriented contour \(\gamma\) in the complex plane, the spectral dichotomy methods applied to \(A\) and \(\gamma\) consist in determining whether \(A\) possesses eigenvalues on or in a neighborhood of \(\gamma\). In section 2 they give a detailed description of the spectral dichotomy of a matrix with respect to a circle. The results of this section are used througout the paper. In section 3 they discuss the spectral dichotomy of a matrix \(A\) with respect to the imaginary axis. In section 4 they develop a new computational tool to compute the deflating subspaces of a regular matrix pencil of the form \(\lambda B-A\) corresponding to the eigenvalues inside and outside the unit disk. In section 5 they are interested in computing the projector onto the deflating subspace of \(\lambda B-A\) associated to the eigenvalue inside the ellipse. Each section terminates with an algorithms easily implementable that determines the projector associated with the eigenvalues enclosed by (excluded from) the region of interest and the dichotomy condition number that describes the numerical quality of the computed projector.
- On modifications to the spectral dichotomy algorithm
- Effective algorithms for spectral methods with applications
- scientific article; zbMATH DE number 4020686
- A new approach to spectral approximation
- Spectral algorithms
- Some progress in spectral methods
- Some developments in spectral methods
- The Schwarz Algorithm for Spectral Methods
- A new spectral conjugate gradient method
- scientific article; zbMATH DE number 4156335
- An estimate of the Green matrix and the continuity of the dichotomy parameter
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- Circular dichotomy of the matrix spectrum
- Computation of pseudospectra via spectral projectors
- 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
- Elliptic dichotomy of a matrix spectrum
- scientific article; zbMATH DE number 934864 (Why is no real title available?)
- scientific article; zbMATH DE number 3220353 (Why is no real title available?)
- On Parabolic and Elliptic Spectral Dichotomy
- Parallel algorithm for solving some spectral problems of linear algebra
- Problem of the dichotomy of the spectrum of a matrix
- Using the Matrix Sign Function to Compute Invariant Subspaces
- Estimates from the discrete-time Lyapunov equation
- Binary problems. The spectral approach
- A natural gradient descent algorithm for the solution of discrete algebraic Lyapunov equations based on the geodesic distance
- Algorithm for separating matrix spectrum by an angle
- Norm estimates of the Fourier series coefficients of the matrix resolvent
- On modifications to the spectral dichotomy algorithm
- On Parabolic and Elliptic Spectral Dichotomy
- Extended Hamiltonian algorithm for the solution of discrete algebraic Lyapunov equations
- Spectral division methods for block generalized Schur decompositions
- scientific article; zbMATH DE number 852320 (Why is no real title available?)
- On the strong stability of symplectic matrices
- 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
- A spectral trichotomy method for symplectic matrices
- Efficient computation of the spectral projections of regular matrix pairs
This page was built for publication: Some new algorithms for the spectral dichotomy methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855438)
