Nearest southeast submatrix that makes multiple an eigenvalue of the normal northwest submatrix
نویسندگان
چکیده
منابع مشابه
Computational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کاملcomputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
given four complex matrices a, b, c and d where a 2 cnn and d 2 cmm andlet the matrix(a bc d)be a normal matrix and assume that is a given complex number that is not eigenvalue of matrix a. we present a method to calculate the distance norm (with respect to 2-norm) from d to the set of matrices x 2 cmm such that, be a multiple eigenvalue of matrix(a bc x). we also nd the nearest matrix ...
متن کاملOn the Remarkable Formula for Spectral Distance of Block Southeast Submatrix
This paper presents a remarkable formula for spectral distance of a given block normal matrix $G_{D_0} = begin{pmatrix} A & B \ C & D_0 end{pmatrix} $ to set of block normal matrix $G_{D}$ (as same as $G_{D_0}$ except block $D$ which is replaced by block $D_0$), in which $A in mathbb{C}^{ntimes n}$ is invertible, $ B in mathbb{C}^{ntimes m}, C in mathbb{C}^{mti...
متن کاملThe common-submatrix Laplace expansion
We state and prove a classical version of the Laplace expansion theorem where all submatrices in the expansion are restricted to contain a speci ed common submatrix (CSM). The result states that (accounting for signs) this restricted expansion equals the determinant of the original matrix times the determinant of the CSM. This result (Muir [Mui60], p.132) is one of many such results contained i...
متن کاملSubmatrix localization via message passing
The principal submatrix localization problem deals with recovering a K ×K principal submatrix of elevated mean μ in a large n × n symmetric matrix subject to additive standard Gaussian noise. This problem serves as a prototypical example for community detection, in which the community corresponds to the support of the submatrix. The main result of this paper is that in the regime Ω( √ n) ≤ K ≤ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operators and Matrices
سال: 2012
ISSN: 1846-3886
DOI: 10.7153/oam-06-01