Results 31 to 40 of about 42,588 (304)
Some remarks on matrix pencil completion problems [PDF]
, 2004 summary:The matrix pencil completion problem introduced in [J. J. Loiseau, S. Mondié, I. Zaballa, and P. Zagalak: Assigning the Kronecker invariants to a matrix pencil by row or column completions. Linear Algebra Appl. 278 (1998)] is reconsidered and the
Mondié, Sabine +2 more
core +1 more source
Moving target detection method based on CUR‐RPCA for missing array elements
IET Radar, Sonar & Navigation, 2022 Moving target detection performance is seriously affected by missing array elements for multichannel synthetic aperture radar (Multi‐SAR) systems. Meanwhile, there is a contradiction between the accuracy of data recovery and the computational burden in ...
Jianli Shi +4 more
doaj +1 more source
Doubly constrained totally positive line insertion
Special Matrices, 2020 It is shown that in any TP matrix, a line (row or column) with two speci˝ed entries in any positions (and the others appropriately chosen) may be inserted in any position, as long as the two entries are consistent with total positivity.
Johnson Charles R., Allen David W.
doaj +1 more source
Graph theoretic methods for matrix completion problems
, 2001 A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of Π-matrices asks whether every partial Π-matrix whose specified entries are exactly the positions of the pattern can be completed to a Π-matrix. We survey
Leslie Hogben, Hogben, Leslie
core +1 more source
Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion
Sensors, 2016 To obtain efficient data gathering methods for wireless sensor networks (WSNs), a novel graph based transform regularized (GBTR) matrix completion algorithm is proposed.
Donghao Wang +4 more
doaj +1 more source
Kubik, 2021 Linear programming is a way to solve the problemof allocating limiter resources optimally. One of the methods used in solving the simplex method for mixed constraints is the two-phase method.
Elfira Safitri +3 more
doaj +1 more source
The symmetric N-matrix completion problem
Linear Algebra and its Applications, 2005 A real \(n\times n\) matrix is called an \(N\)-matrix if all its principal minors are negative. Consider a partial symmetric matrix \(A\) where some entries are unspecified. The problem under consideration is whether it is possible to determine these unspecified entries in such a way that the resulting fully specified symmetric matrix is an \(N ...
Araújo, C. Mendes +2 more
openaire +2 more sources
Wide and Deep Model of Multi-Source Information-Aware Recommender System
IEEE Access, 2018 Collaborative filtering recommendation suffers from the problems of high data sparsity, poor expansibility, cold start, and the difficulty of modeling user preferences, among which data sparsity is the greatest issue. Although our previous work on matrix
Weihua Yuan +4 more
doaj +1 more source
Mathematics, 2022 We consider a variant of the online semi-definite programming problem (OSDP). Specifically, in our problem, the setting of the decision space is a set of positive semi-definite matrices constrained by two norms in parallel: the L∞ norm to the diagonal ...
Yaxiong Liu +3 more
doaj +1 more source
The nonnegative Q−matrix completion problem
Journal of Algebra Combinatorics Discrete Structures and Applications, 2017 Summary: In this paper, the nonnegative \(Q\)-matrix completion problem is studied. A real \(n\times n\) matrix is a \(Q\)-matrix if for \(k\in \{1,\dots, n\}\), the sum of all \(k \times k\) principal minors is positive. A digraph \(D\) is said to have nonnegative \(Q\)-completion if every partial nonnegative \(Q\)-matrix specifying \(D\) can be ...
SARMA, Bhaba Kumar, SİNHA, Kalyan
openaire +4 more sources