Abstract
We introduce modifications of an existing spectral dichotomy algorithm [6] with respect to a circle for general regular matrix pencils. The modifications result in a cost-effective algorithm, mathematically equivalent to the original one, but six times less expensive. The algorithm approximates iteratively the spectral projector onto the right deflating subspace associated with the eigenvalues inside/outside the circle as well as a criterion to ascertain its numerical quality. We also show how to approximate the left projector from the algorithm without any extra work. Effective stopping criteria for the algorithm are discussed. Numerical examples which illustrate the theory are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
