New characterizations of row sufficient matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New characterizations of row sufficient matrices

Article history: Received 29 September 2008 Accepted 6 January 2009 Available online 14 February 2009 Submitted by R.A. Brualdi Dedicated to the memory of a great scholar and a valued friend, Professor David Gale. AMS classification: 90C20 90C33 15A39 15A63

متن کامل

Row Products of Random Matrices

Let ∆1, . . . ,∆K be d × n matrices. We define the row product of these matrices as a d × n matrix, whose rows are entry-wise products of rows of ∆1, . . . ,∆K . This construction arises in certain computer science problems. We study the question, to which extent the spectral and geometric properties of the row product of independent random matrices resemble those properties for a d × n matrix ...

متن کامل

Combinatorial Characterizations of K-matrices

We present a number of combinatorial characterizations of Kmatrices. This extends a theorem of Fiedler and Pták on linearalgebraic characterizations of K-matrices to the setting of oriented matroids. Our proof is elementary and simplifies the original proof substantially by exploiting the duality of oriented matroids. As an application, we show that a simple principal pivot method applied to th...

متن کامل

Some new sufficient conditions for generalized strictly diagonally dominant matrices

Generalized strictly diagonally dominant matrices have wide applications in science and engineering, but it is very difficult to determine whether a given matrix is a generalized strictly diagonally dominant matrix or not in practice. In this paper, we give several practical conditions for generalized strictly diagonally dominant matrices by constructing different positive diagonal matrix and a...

متن کامل

Estimation of matrices with row sparsity

An increasing number of applications is concerned with recovering a sparsity can be defined in terms of lq balls for q 2 [0, 2), defined as Bq(s) = { v = (vi) 2 R2 : n2 ∑

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2009

ISSN: 0024-3795

DOI: 10.1016/j.laa.2009.01.010