Combinatorial Conditions for the Unique Completability of Low-Rank Matrices

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/140960098
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

On the Compression of Low Rank Matrices

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2005English

The Inertia of the Symmetric Approximation for Low-Rank Matrices

Linear and Multilinear Algebra
Number TheoryAlgebra
2017English

Uniqueness Conditions for Low-Rank Matrix Recovery

2011English

Why Are Big Data Matrices Approximately Low Rank?

SIAM Journal on Mathematics of Data Science
2019English

Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2014English

The Rank Inequality for Diagonally Magic Matrices

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2015English

Efficient Preconditioning of Hp-Fem Matrices by Hierarchical Low-Rank Approximations

Journal of Scientific Computing
Numerical AnalysisApplied MathematicsComputational TheoryEngineeringComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2017English

The Rank of Sparse Random Matrices

2020English

QR Factorization of Block Low-Rank Matrices With Weak Admissibility Condition

Journal of Information Processing
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy