Low-Rank Perturbation of Regular Matrix Pencils with Symmetry Structures
نویسندگان
چکیده
منابع مشابه
Eigenvalue Placement for Regular Matrix Pencils with Rank One Perturbations
A regular matrix pencil sE − A and its rank one perturbations are considered. We determine the sets in C ∪ {∞} which are the eigenvalues of the perturbed pencil. We show that the largest Jordan chains at each eigenvalue of sE − A may disappear and the sum of the length of all destroyed Jordan chains is the number of eigenvalues (counted with multiplicities) which can be placed arbitrarily in C∪...
متن کاملBalancing Regular Matrix Pencils
In this paper we present a new diagonal balancing technique for regular matrix pencils λB − A, which aims at reducing the sensitivity of the corresponding generalized eigenvalues. It is inspired from the balancing technique of a square matrix A and has a comparable complexity. Upon convergence, the diagonally scaled pencil has row and column norms that are balanced in a precise sense. We also s...
متن کاملGeneric Change of the Partial Multiplicities of Regular Matrix Pencils under Low-Rank Perturbations
We describe the generic change of the partial multiplicities at a given eigenvalue λ0 of a regular matrix pencil A0 + λA1 under perturbations with low normal rank. More precisely, if the pencil A0 + λA1 has exactly g nonzero partial multiplicities at λ0, then for most perturbations B0 + λB1 with normal rank r < g the perturbed pencil A0 + B0 + λ(A1 + B1) has exactly g − r nonzero partial multip...
متن کاملPerturbation Theory for Rectangular Matrix Pencils Perturbation Theory for Rectangular Matrix Pencils
abstract The theory of eigenvalues and eigenvectors of rectangular matrix pencils is complicated by the fact that arbitrarily small perturbations of the pencil can cause them disappear. However, there are applications in which the properties of the pencil ensure the existence of eigen-values and eigenvectors. In this paper it is shown how to develop a perturbation theory for such pencils. ABSTR...
متن کاملPerturbation of Eigenvalues of Matrix Pencils and Optimal Assignment Problem
We consider a matrix pencil whose coefficients depend on a positive parameter ǫ, and have asymptotic equivalents of the form aǫ when ǫ goes to zero, where the leading coefficient a is complex, and the leading exponent A is real. We show that the asymptotic equivalent of every eigenvalue of the pencil can be determined generically from the asymptotic equivalents of the coefficients of the pencil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2021
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-021-09500-4