ترغب بنشر مسار تعليمي؟ اضغط هنا

First-order Perturbation Theory for Eigenvalues and Eigenvectors

116   0   0.0 ( 0 )
 نشر من قبل Michael Overton
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

We present first-order perturbation analysis of a simple eigenvalue and the corresponding right and left eigenvectors of a general square matrix, not assumed to be Hermitian or normal. The eigenvalue result is well known to a broad scientific community. The treatment of eigenvectors is more complicated, with a perturbation theory that is not so well known outside a community of specialists. We give two different proofs of the main eigenvector perturbation theorem. The first, a block-diagonalization technique inspired by the numerical linear algebra research community and based on the implicit function theorem, has apparently not appeared in the literature in this form. The second, based on complex function theory and on eigenprojectors, as is standard in analytic perturbation theory, is a simplified version of well-known results in the literature. The second derivation uses a convenient normalization of the right and left eigenvectors defined in terms of the associated eigenprojector, but although this dates back to the 1950s, it is rarely discussed in the literature. We then show how the eigenvector perturbation theory is easily extended to handle other normalizations that are often used in practice. We also explain how to verify the perturbation results computationally. We conclude with some remarks about difficulties introduced by multiple eigenvalues and give references to work on perturbation of invariant subspaces corresponding to multiple or clustered eigenvalues. Throughout the paper we give extensive bibliographic commentary and references for further reading.



قيم البحث

اقرأ أيضاً

This paper presents a posteriori error estimates for conforming numerical approximations of eigenvalue clusters of second-order self-adjoint elliptic linear operators with compact resolvent. Given a cluster of eigenvalues, we estimate the error in th e sum of the eigenvalues, as well as the error in the eigenvectors represented through the density matrix, i.e., the orthogonal projector on the associated eigenspace. This allows us to deal with degenerate (multiple) eigenvalues within the framework. All the bounds are valid under the only assumption that the cluster is separated from the surrounding smaller and larger eigenvalues; we show how this assumption can be numerically checked. Our bounds are guaranteed and converge with the same speed as the exact errors. They can be turned into fully computable bounds as soon as an estimate on the dual norm of the residual is available, which is presented in two particular cases: the Laplace eigenvalue problem discretized with conforming finite elements, and a Schr{o}dinger operator with periodic boundary conditions of the form $--$Delta$ + V$ discretized with planewaves. For these two cases, numerical illustrations are provided on a set of test problems.
236 - Maysum Panju 2011
We examine some numerical iterative methods for computing the eigenvalues and eigenvectors of real matrices. The five methods examined here range from the simple power iteration method to the more complicated QR iteration method. The derivations, pro cedure, and advantages of each method are briefly discussed.
172 - Limin Ma , Shudan Tian 2021
In this paper, we propose and analyze the extrapolation methods and asymptotically exact a posterior error estimates for eigenvalues of the Morley element. We establish an asymptotic expansion of eigenvalues, and prove an optimal result for this expa nsion and the corresponding extrapolation method. We also design an asymptotically exact a posterior error estimate and propose new approximate eigenvalues with higher accuracy by utilizing this a posteriori error estimate. Finally, several numerical experiments are considered to confirm the theoretical results and compare the performance of the proposed methods.
A Morley-Wang-Xu (MWX) element method with a simply modified right hand side is proposed for a fourth order elliptic singular perturbation problem, in which the discrete bilinear form is standard as usual nonconforming finite element methods. The sha rp error analysis is given for this MWX element method. And the Nitsches technique is applied to the MXW element method to achieve the optimal convergence rate in the case of the boundary layers. An important feature of the MWX element method is solver-friendly. Based on a discrete Stokes complex in two dimensions, the MWX element method is decoupled into one Lagrange element method of Poisson equation, two Morley element methods of Poisson equation and one nonconforming $P_1$-$P_0$ element method of Brinkman problem, which implies efficient and robust solvers for the MWX element method. Some numerical examples are provided to verify the theoretical results.
In this paper, we propose a direct parallel-in-time (PinT) algorithm for time-dependent problems with first- or second-order derivative. We use a second-order boundary value method as the time integrator that leads to a tridiagonal time discretizatio n matrix. Instead of solving the corresponding all-at-once system iteratively, we diagonalize the time discretization matrix, which yields a direct parallel implementation across all time levels. A crucial issue on this methodology is how the condition number of the eigenvector matrix $V$ grows as $n$ is increased, where $n$ is the number of time levels. A large condition number leads to large roundoff error in the diagonalization procedure, which could seriously pollute the numerical accuracy. Based on a novel connection between the characteristic equation and the Chebyshev polynomials, we present explicit formulas for computing $V$ and $V^{-1}$, by which we prove that $mathrm{Cond}_2(V)=mathcal{O}(n^{2})$. This implies that the diagonalization process is well-conditioned and the roundoff error only increases moderately as $n$ grows and thus, compared to other direct PinT algorithms, a much larger $n$ can be used to yield satisfactory parallelism. Numerical results on parallel machine are given to support our findings, where over 60 times speedup is achieved with 256 cores.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا