اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRegularizing decompositions for matrix pencils and a topological classification of pairs of linear mappings
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions coincide up to permutation of summands and their regular parts coincide up to homeomorphisms of their spaces.
قيم البحث
اقرأ أيضاً
We consider the problem of classifying oriented cycles of linear mappings $F^pto F^qtodotsto F^rto F^p$ over a field $F$ of complex or real numbers up to homeomorphisms in the spaces $F^p,F^q,dots,F^r$. We reduce it to the problem of classifying line
ar operators $F^nto F^n$ up to homeomorphism in $F^n$, which was studied by N.H. Kuiper and J.W. Robbin [Invent. Math. 19 (2) (1973) 83-106] and by other authors.
We study systems of linear and semilinear mappings considering them as representations of a directed graph $G$ with full and dashed arrows: a representation of $G$ is given by assigning to each vertex a complex vector space, to each full arrow a line
ar mapping, and to each dashed arrow a semilinear mapping of the corresponding vector spaces. We extend to such representations the classical theorems by Gabriel about quivers of finite type and by Nazarova, Donovan, and Freislich about quivers of tame types.
V.I. Arnold [Russian Math. Surveys, 26 (no. 2), 1971, pp. 29-43] gave a miniversal deformation of matrices of linear operators; that is, a simple canonical form, to which not only a given square matrix A, but also the family of all matrices close to
A, can be reduced by similarity transformations smoothly depending on the entries of matrices. We study miniversal deformations of quiver representations and obtain a miniversal deformation of matrices of chains of linear mappings.
In this work, we consider symmetric positive definite pencils depending on two parameters. That is, we are concerned with the generalized eigenvalue problem $A(x)-lambda B(x)$, where $A$ and $B$ are symmetric matrix valued functions in ${mathbb R}^{n
times n}$, smoothly depending on parameters $xin Omegasubset {mathbb R}^2$; further, $B$ is also positive definite. In general, the eigenvalues of this multiparameter problem will not be smooth, the lack of smoothness resulting from eigenvalues being equal at some parameter values (conical intersections). We first give general theoretical results on the smoothness of eigenvalues and eigenvectors for the present generalized eigenvalue problem, and hence for the corresponding projections, and then perform a numerical study of the statistical properties of coalescing eigenvalues for pencils where $A$ and $B$ are either full or banded, for several bandwidths. Our numerical study will be performed with respect to a random matrix ensemble which respects the underlying engineering problems motivating our study.
We introduce concepts of essential numerical range for the linear operator pencil $lambdamapsto A-lambda B$. In contrast to the operator essential numerical range, the pencil essential numerical ranges are, in general, neither convex nor even connect
ed. The new concepts allow us to describe the set of spectral pollution when approximating the operator pencil by projection and truncation methods. Moreover, by transforming the operator eigenvalue problem $Tx=lambda x$ into the pencil problem $BTx=lambda Bx$ for suitable choices of $B$, we can obtain non-convex spectral enclosures for $T$ and, in the study of truncation and projection methods, confine spectral pollution to smaller sets than with hitherto known concepts. We apply the results to various block operator matrices. In particular, Theorem 4.12 presents substantial improvements over previously known results for Dirac operators while Theorem 4.5 excludes spectral pollution for a class of non-selfadjoint Schr{o}dinger operators which it has not been possible to treat with existing methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
