The nonsingular matrix completion problem
From MaRDI portal
Recommendations
- The \(N_{0}^{1}\)-matrix completion problem
- The totally non-positive matrix completion problem
- The nonnegative P₀-matrix completion problem
- Matrix completion problems
- The nonnegative Q-matrix completion problem
- N-matrix completion problem.
- On a Class of Matrix Completion Problems
- scientific article; zbMATH DE number 4158856
- A note on matrix completion problems
- Some matrix completion problems
Cited in
(18)- Rank-preserving diagonal completions of a matrix
- Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
- Creation and annihilation in matrix theory
- Almost-nonsingular entry pattern matrices
- A Singular Value Thresholding Algorithm for Matrix Completion
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- An Answer to a Question of M. Newman on Matrix Completion
- Nonsingular ACI-matrices over integral domains
- scientific article; zbMATH DE number 1336312 (Why is no real title available?)
- scientific article; zbMATH DE number 523915 (Why is no real title available?)
- A minimal completion of (0,1)-matrices without total support
- 2n-by-2n symplectic completions of matrices of order 2n-1
- Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
- Matrix completion problems of block type
- Singular, nonsingular, and bounded rank completions of ACI-matrices
- Completion of a partial integral matrix to a unimodular matrix
- Finding all Nash equilibria of a finite game using polynomial algebra
- Matrix completion by singular value thresholding: sharp bounds
This page was built for publication: The nonsingular matrix completion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440073)
