Results 281 to 290 of about 42,588 (304)

The General Matrix Pencil Completion Problem: A Minimal Case

SIAM Journal on Matrix Analysis and Applications, 2019
Let $\mathbb{F}$ be an arbitrary field. Two matrix pencils $A(\lambda)$ and $B(\lambda)$ of the same size over $\mathbb{F}[\lambda]$ are called (strictly) equivalent if there exist invertible matrices $P$ and $Q$ over $\mathbb{F}$ such that $A(\lambda)=PB(\lambda)Q$. In this case we write $A(\lambda)\sim B(\lambda)$. Suppose that the pencil $A(\lambda)$
Marija Dodig, Marko Stosic
openaire   +2 more sources

Matrix completion problems of block type

Mathematical Notes, 2000
Block matrices of dimension \(n\times n\) over a field with characteristic zero are considered which are partitioned into \(2\times 2\)-block matrices such that both blocks in the diagonal are square. The authors consider the cases that one or both blocks in the first row of this block matrix are given. It is shown that completion of such a matrix to a
Ikramov, Kh. D., Chugunov, V. N.
openaire   +2 more sources

Matrix decomposition problem is complete for the average case

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
The first algebraic average-case complete problem is presented. The focus of attention is the modular group, i.e., the multiplicative group SL/sub 2/(Z) of two-by-two integer matrices of determinant 1. By default, in this study matrices are elements of the modular group. The problem is arguably the simplest natural average-case complete problem to date.
openaire   +1 more source

The P-matrix problem is co-NP-complete

Mathematical Programming, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Fast Deterministic Algorithms for Matrix Completion Problems

SIAM Journal on Discrete Mathematics, 2013
Ivanyos, Karpinski, and Saxena [SIAM J. Comput., 39 (2010), pp. 3736--3751] have developed a deterministic polynomial time algorithm for finding scalars $x_1, \dots, x_n$ that maximize the rank of the matrix $B_0 + x_1B_1 + \dots + x_nB_n$ for given matrices $B_0, B_1, \dots, B_n$, where $B_1, \dots, B_n$ are of rank one.
openaire   +1 more source

The problem of completing partial matrix functions as a classical interpolation problem

Journal of Mathematical Sciences, 1995
See the review in Zbl 0758.30033.
openaire   +1 more source

T-product factorization based method for matrix and tensor completion problems

Computational Optimization and Applications, 2022
Quan Yu, Xinzhen Zhang, Zhang Xinzhen
exaly  

A study on (weakly) sign-symmetric $$Q_0$$-matrix completion problems

Afrika Matematika, 2023
Kalyan Sinha
exaly  

A matrix completion problem

2023
openaire   +1 more source

Low-Rank Matrix Completion Theory via Plücker Coordinates

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023
Manolis C Tsakiris
exaly