A Matrix Rank Problem
نویسنده
چکیده
منابع مشابه
Some rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملHigher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملOn the equivalence between low rank matrix completion and tensor rank
Abstract. The Rank Minimization Problem asks to find a matrix of lowest rank inside a linear variety of the space of n×m matrices. The Low Rank Matrix Completion problem asks to complete a partially filled matrix such that the resulting matrix has smallest possible rank. The Tensor Rank Problem asks to determine the rank of a tensor. We show that these three problems are equivalent: each one of...
متن کاملSpatial Design for Knot Selection in Knot-Based Low-Rank Models
Analysis of large geostatistical data sets, usually, entail the expensive matrix computations. This problem creates challenges in implementing statistical inferences of traditional Bayesian models. In addition,researchers often face with multiple spatial data sets with complex spatial dependence structures that their analysis is difficult. This is a problem for MCMC sampling algorith...
متن کاملA combined evaluation method to rank alternatives based on VIKOR and DEA with BELIEF structure under uncertainty
This paper processes a combined method, based on VIKOR and Data Envelopment Analysis (DEA) to select the units with most efficiency. We utilize the VIKOR as compromise solution method. This research is a two-stage model designed to fully rank the alternatives, where each alternative has multiple inputs and outputs. The problem involves BELIEF parameters in the solution procedure. First, the alt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003