Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA homotopy method for finding eigenvalues and eigenvectors
201
0
0.0
(
0
)
Authors
Kerry M. Soileau
Ask ChatGPT about the research
No Arabic abstract
Suppose we want to find the eigenvalues and eigenvectors for the linear operator L, and suppose that we have solved this problem for some other nearby operator K. In this paper we show how to represent the eigenvalues and eigenvectors of L in terms of the corresponding properties of K.
rate research
Read More
This article constructs a surface whose Neumann-Poincare (NP) integral operator has infinitely many eigenvalues embedded in its essential spectrum. The surface is a sphere perturbed by smoothly attaching a conical singularity, which imparts essential spectrum. Rotational symmetry allows a decomposition of the operator into Fourier components. Eigenvalues of infinitely many Fourier components are constructed so that they lie within the essential spectrum of other Fourier components and thus within the essential spectrum of the full NP operator. The proof requires the perturbation to be sufficiently small, with controlled curvature, and the conical singularity to be sufficiently flat.
It is a well-known result of T.,Kato that given a continuous path of square matrices of a fixed dimension, the eigenvalues of the path can be chosen continuously. In this paper, we give an infinite-dimensional analogue of this result, which naturally arises in the context of the so-called unitary spectral flow. This provides a new approach to spectral flow, which seems to be missing from the literature. It is the purpose of the present paper to fill in this gap.
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, procedure, and advantages of each method are briefly discussed.
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 the 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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
