Results 271 to 280 of about 42,588 (304)
Some of the next articles are maybe not open access.
On a Class of Matrix Completion Problems
Mathematische Nachrichten, 1989The paper contains a unified treatment of special classes of matrix extension problems (``Schur analysis''). It is characterized as a combination of methods developed by V. P. Potapov and his collaborators in the study of the so-called fundamental matrix inequalities and of methods used by the last two authors.
Dubovoj, Vladimir K. +2 more
openaire +2 more sources
Some Remarks on Matrix Completion Problems
IFAC Postprint Volumes IPPV / International Federation of Automatic Control, 2001 The matrix completion problem introduced in (Loiseau et al.,1998) is reconsidered and the latest results achieved in that field are ...
Jean Jacques Loiseau +2 more
exaly +1 more source
The Euclidian Distance Matrix Completion Problem
SIAM Journal on Matrix Analysis and Applications, 1995Motivated by the molecular mapping (or ``conformation'') problem, i.e., the problem of deducing the possible shapes of a molecule from partial (or inaccurate) information about interatomic distances, the authors study the completions of partial Euclidean distance matrices, i.e., the choice of values for each of the unspecified entries, resulting in a ...
Mihály Bakonyi, Charles R. Johnson
openaire +2 more sources
The positive Q-matrix completion problem
Discrete Mathematics, Algorithms and Applications, 2015A real [Formula: see text] matrix is a [Formula: see text]-matrix if for [Formula: see text] the sum of all [Formula: see text] principal minors is positive. A digraph [Formula: see text] is said to have positive [Formula: see text]-completion if every partial positive [Formula: see text]-matrix specifying [Formula: see text] can be completed to a ...
Bhaba Kumar Sarma, Kalyan Sinha
openaire +1 more source
A Note on Matrix Completion Problems
Algebra Colloquium, 2012Matrix completion problems are an important subclass of problems in matrix theory. An important question in matrix completion problems was posed by Oliveira in 1975, where the author proposed the description of the characteristic polynomial of a partitioned matrix of the form A = [Ai,j], i, j ∈ {1,2} (whose entries are in a field and A1,1, A2,2 are ...
openaire +2 more sources
Matrix completion problems in multidimensional systems
ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349), 2003A ring with identity is Hermite if every unimodular row vector over the ring can be completed to form a unimodular square matrix over the ring. This paper constructs examples and counter-examples of Hermite rings and formulates several open problems, which have potential applications in multidimensional systems.
Lawton, Wayne M., Lin, Zhiping
openaire +1 more source
Euclidean distance matrix completion problems
Optimization Methods and Software, 2012Our experiments show that the method easily solves the artificial problems introduced by More and Wu. It also solves the 12 much more difficult protein fragment problems introduced by Hendrickson, and the six larger protein problems introduced by Grooms, Lewis and Trosset.
Haw-ren Fang, Dianne P. O'Leary
openaire +1 more source
State covariances and the matrix completion problem
52nd IEEE Conference on Decision and Control, 2013State statistics of a linear system obey certain structural constraints that arise from the underlying dynamics and the directionality of input disturbances. Herein, we formulate completion problems of partially known state statistics with the added freedom of identifying disturbance dynamics.
Yongxin Chen 0002 +2 more
openaire +1 more source
2000
In the matrix completion problem we are given a partial symmetric real matrix A with certain elements specified or fixed and the rest are unspecified or free; and, we are asked whether A can be completed to satisfy a given property (P) by assigning certain values to its free elements.
Abdo Alfakih, Henry Wolkowicz
openaire +1 more source
In the matrix completion problem we are given a partial symmetric real matrix A with certain elements specified or fixed and the rest are unspecified or free; and, we are asked whether A can be completed to satisfy a given property (P) by assigning certain values to its free elements.
Abdo Alfakih, Henry Wolkowicz
openaire +1 more source
Randomized Robust matrix Completion for the Community Detection Problem
2018 52nd Asilomar Conference on Signals, Systems, and Computers, 2018This paper focuses on the unsupervised clustering of large partially observed graphs. We propose a provable randomized framework in which a clustering algorithm is applied to a graph’s adjacency matrix generated from a stochastic block model. A sub-matrix is constructed using random sampling, and the low rank component is found using a convex ...
Adel Karimian +3 more
openaire +2 more sources