• Tidak ada hasil yang ditemukan

abs_vol18_pp302-316. 22KB Jun 04 2011 12:05:47 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol18_pp302-316. 22KB Jun 04 2011 12:05:47 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

ON LOW RANK PERTURBATIONS OF COMPLEX MATRICES AND

SOME DISCRETE METRIC SPACES

LEV GLEBSKY† AND LUIS MANUEL RIVERA

Abstract. In this article, several theorems on perturbations of a complex matrix by a matrix of a given rank are presented. These theorems may be divided into two groups. The first group is about spectral properties of a matrix under such perturbations; the second is about almost-near relations with respect to the rank distance.

Key words. Complex matrices, Rank, Perturbations.

AMS subject classifications.15A03, 15A18.

Received by the editors September 17, 2008. Accepted for publication June 8, 2009. Handling

Editor: Roger A. Horn.

IICO, Universidad Autonoma de San Luis Potosi, Mexico, ([email protected]).

Universidad Autonoma de Zacatecas, Mexico, ([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 18, pp. 302-316, June 2009

Referensi

Dokumen terkait

The fourteen complex nilpotent Lie algebras with a small derived quotient are realized here using 7x7 matrices..

The problem of finding the minimum rank (maximum nullity) of edge subdivisions of a given graph G is investigated.. Is is shown that if an edge is adjacent to a vertex of degree 1 or

In this paper, by using majorization inequalities, upper bounds on summations of eigenvalues (including the trace) of the solution for the Lyapunov matrix differential equation

Some applications of this factorization are given; in particular some matrix partial orderings and the relationship between the canonical angles and various classes of matrices

In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative matrix, the graph of whose specified entries is G , has a totally

Banachiewicz-Schur form, Generalized inverse, Generalized Schur complement, Idempotent matrix, Matrix rank method, Maximal rank, Minimal rank, Moore-Penrose inverse,

The minimum rank problem is the problem of finding the smallest rank of a matrix in the set of symmetric matrices having the zero-nonzero pattern of off-diagonal entries described by

This result implies almost sure convergence of empirical periodograms, almost sure convergence of spectral distribution of circulant and reverse circulant matrices, and almost