ویراساینس.
سند علمی

Backward Perturbation Analysis And Residual-based Error Bounds for the Linear Response Eigenvalue Problem

Lei-Hong Zhang, Wen-Wei Lin, Ren-Cang Li

چکیده

The numerical solution of a large scale linear response eigenvalue problem is often accomplished by computing a pair of deflating subspaces associated with the interested part of the spectrum. This paper is concerned with the backward perturbation analysis for a given pair of approximate deflating subspaces or an approximate eigenquaternary. Various optimal backward perturbation bounds are obtained, as well as bounds for approximate eigenvalues computed through the pair of approximate deflating subspaces or approximate eigen-quaternary. These results are reminiscent of many existing classical ones for the standard eigenvalue problem.

اسناد مشابه

  • Perturbation of Partitioned Linear Response Eigenvalue Problems

    سند علمی۲۰۱۵Zhongming Teng, Linzhang Lu, Ren-Cang Li

    This paper is concerned with bounds for the linear response eigenvalue problem for H = [ 0 K M 0 ] , where K and M admits a 2 × 2 block partitioning. Bounds on how the changes of its eigenvalues are obtained when K and M are perturbed. They are of linear order with respect to the

  • Linear Response Eigenvalue Problem Solved by Extended Locally Optimal Preconditioned Conjugate Gradient Methods

    سند علمی۲۰۱۵Zhaojun Bai, Ren-Cang Li, Wen-Wei Lin

    The locally optimal block preconditioned 4-d conjugate gradient method (LOBP4dCG) for the linear response eigenvalue problem was proposed in [SIAM J. Matrix Anal. Appl., 34(2):392–416, 2013] and later was extended to the generalized linear response eigenvalue problem in [BIT Nume

  • Rayleigh-Ritz Approximation For the Linear Response Eigenvalue Problem

    سند علمی۲۰۱۴SIAM J. Matrix Analysis ApplicationsLei-Hong Zhang, Jungong Xue, Ren-Cang Li

    Large scale eigenvalue computation is about approximating certain invariant subspaces associated with the interested part of the spectrum, and the interested eigenvalues are then extracted from projecting the problem by approximate invariant subspaces into a much smaller eigenval

  • Minimization Principles for the Linear Response Eigenvalue Problem III: General Case

    سند علمی۲۰۱۳Zhaojun Bai, Ren-Cang Li

    Previously a minimization principle for the sum of the first few smallest eigenvalues with the positive sign and Cauchy-like interlacing inequalities for the standard linear response eigenvalue problem for the 2n×2n matrix [ 0 K M 0 ] were obtained by the authors, where K and M a

  • Minimization Principles for the Linear Response Eigenvalue Problem I: Theory

    سند علمی۲۰۱۲SIAM J. Matrix Analysis ApplicationsZhaojun Bai, Ren-Cang Li

    We present two theoretical results for the linear response eigenvalue problem. The first result is a minimization principle for the sum of the smallest eigenvalues with the positive sign. The second result is Cauchy-like interlacing inequalities. Although the linear response eige

  • A block Chebyshev-Davidson method for linear response eigenvalue problems

    سند علمی۲۰۱۶Adv. Comput. Math.Zhongming Teng, Yunkai Zhou, Ren-Cang Li

    We present a Chebyshev-Davidson method to compute a few smallest positive eigenvalues and corresponding eigenvectors of the linear response eigenvalue problem. The method is actually applicable to the slightly more general linear response eigenvalue problem where purely imaginary