Maximum rank matrix completion
type: Item
instance of: scholarly article
title: Maximum rank matrix completion
zbMATH Open document ID: 0933.15026
DOI: 10.1016/S0024-3795(98)10210-0
author: James F. Geelen
published in: Linear Algebra and its Applications
publication date: 1999-11-11T00:00:00Z
review text: An algorithm is proposed to find a maximum rank matrix completion. The algorithm is based on an algebraic algorithm for maximum cardinality matching. The problem, i.e. filling in the unknown entries of the matrix in such a way as to maximize the rank, is attained by perturbing an arbitrary completion in a greedy way.
Mathematics Subject Classification ID: 15A29
Mathematics Subject Classification ID: 15A03
zbMATH DE Number: 1331343
zbMATH Keywords: inverse problem
zbMATH Keywords: maximum rank matrix completion
zbMATH Keywords: algorithm
zbMATH Keywords: maximum cardinality matching
MaRDI profile type: Publication
cites work: Q4281309
cites work: A determinantal version of the frobenius-könig theorem
cites work: An algebraic matching algorithm
cites work: Q3266932
description: scientific article; zbMATH DE number 1331343