Results 11 to 20 of about 42,588 (304)
Linear Algebra and its Applications, 2009 In the paper the author gives results about the following two problems over an arbitrary field: Problem 1. Under which conditions does there exist a matrix with prescribed eigenvalues, characteristic polynomials, when some of its entries are prescribed and others vary. Problem 2.
Glória Cravo, Cravo, Glória
openaire +2 more sources
DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS [PDF]
The ANZIAM Journal, 2014 AbstractIn this paper, we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and nonconvex real matrix completion problems. These guidelines are demonstrated by various illustrative examples.
Artacho, Francisco J. Aragón +2 more
core +8 more sources
Nonconvex matrix completion with Nesterov’s acceleration
Big Data Analytics, 2018 Background In matrix completion fields, the traditional convex regularization may fall short of delivering reliable low-rank estimators with good prediction performance. Previous works use the alternation least squares algorithm to optimize the nonconvex
Xiao-Bo Jin +4 more
doaj +2 more sources
Matrix pencils completion problems
Linear Algebra and its Applications, 2008 The paper deals with matrix pencils completion problems. In general, this problem consists in the study of possible Kronecker invariants of a matrix pencil (i.e. its strict equivalence class), when a subpencil is prescribed. Specifically, the author studies and solves the following problem: Let \(F\) be a field.
Dodig, Marija, Marija Dodig
openaire +2 more sources
The Q0-matrix completion problem [PDF]
Arab Journal of Mathematical Sciences, 2020 A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and Q0-matrix completion problem. Finally, a classification of the digraphs of order up to four is done
openaire +2 more sources
Mobile group intelligence aware network log information collection based on Markov prediction
Xi'an Gongcheng Daxue xuebao, 2022 Aiming at the problems of low completion rate and large remaining proportion of collection tasks in traditional information collection methods, the Markov prediction model of multi sensing location is used to dynamically collect the real-time information
CAI Bo
doaj +1 more source
Computing the nearest euclidean distance matrix with low embedding dimensions [PDF]
, 2013 Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate.
Qi, Hou-Duo, Yuan, Xiaoming, Qi, Hou Duo
core +1 more source
Connection Science, 2023 Traffic matrices (TMs) are essential for managing networks. Getting the whole TMs is difficult because of the high measurement cost. Several recent studies propose sparse measurement schemes to reduce the cost, which involve taking measurements on only a
Kai Jin +4 more
doaj +1 more source
The P_0-matrix completion problem
The Electronic Journal of Linear Algebra, 2002 A partial matrix is a rectangular array in which some entries are specified while others are free to be chosen. A completion of a partial matrix is a specific choice of values for the unspecified entries. A pattern for \(n \times n\) matrices is a list of positions of the matrix. An \(n \times n\) matrix is called a \(P_0\)-matrix (respectively, a \(P\)
Choi, Ji Young +4 more
openaire +4 more sources
Binary Matrix Completion With Nonconvex Regularizers
IEEE Access, 2019 Many practical problems involve the recovery of a binary matrix from partial information, so the binary matrix completion (BMC) technique has increasingly been of interest in machine learning. In particular, we consider a special case of the BMC problems,
Chunsheng Liu, Hong Shan
doaj +1 more source