Maximum rank matrix completion (Q1300879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1331343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum rank matrix completion |
scientific article; zbMATH DE number 1331343 |
Statements
Maximum rank matrix completion (English)
0 references
11 November 1999
0 references
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.
0 references
inverse problem
0 references
maximum rank matrix completion
0 references
algorithm
0 references
maximum cardinality matching
0 references
0.8294240236282349
0 references
0.8004094958305359
0 references
0.792495608329773
0 references
0.7884403467178345
0 references
