论文信息 - Some new algorithms for the spectral dichotomy methods

Some new algorithms for the spectral dichotomy methods

Abstract Given a regular matrix pencil λB−A having no eigenvalues on the circle Cr of center 0and radius r, we describe a new algorithm to compute iteratively the deflating subspaces ofλB−A corresponding to the eigenvalues inside and outside Cr along with “a spectral condition number” that indicates the numerical quality of the computed deflating subspaces. We then generalize the proposed algorithm to the case where Cr is replaced by a straight line or an ellipse.

M. Sadkane | S. K. Godunov

[1] M. Sadkane,et al. Computation of pseudospectra via spectral projectors , 1998 .

[2] Miloud Sadkane,et al. ELLIPTIC DICHOTOMY OF A MATRIX SPECTRUM , 1996 .

[3] S. Godunov. Modern Aspects of Linear Algebra , 1998 .

[4] A. Malyshev. Computing invariant subspaces of a regular linear pencil of matrices , 1989 .

[5] J. Demmel,et al. Using the Matrix Sign Function to Compute Invariant Subspaces , 1998, SIAM J. Matrix Anal. Appl..

[6] F. Gantmakher,et al. Théorie des matrices , 1990 .

[7] S. Godunov. Problem of the dichotomy of the spectrum of a matrix , 1986 .

[8] An estimate of the Green matrix and the continuity of the dichotomy parameter , 1989 .

[9] Bo Kågström,et al. Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: theory, algorithms and software , 1996, Numerical Algorithms.

[10] A. Malyshev. Parallel Algorithm for Solving Some Spectral Problems of Linear Algebra , 1993 .

[11] Miloud Sadkane,et al. On Parabolic and Elliptic Spectral Dichotomy , 1997 .

[12] J. Demmel,et al. Inverse Free Parallel Spectral Divide and Conquer Algorithms for Nonsymmetric Eigenproblems , 1994 .

[13] S. Godunov,et al. Circular dichotomy of the spectrum of a matrix , 1988 .

[14] BO K Agstr,et al. A GENERALIZED STATE-SPACE APPROACH FOR THE ADDITIVE DECOMPOSITION OF A TRANSFER MATRIX , 1992 .