Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems (Q5955656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems |
scientific article; zbMATH DE number 1705651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems |
scientific article; zbMATH DE number 1705651 |
Statements
Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems (English)
0 references
25 September 2002
0 references
noncommutative Gröbner bases
0 references
matrix inverse completion
0 references
matrix completion
0 references
0 references
The author investigates the use of noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems. The author describes a general method by which all block matrix completion problems may be analyzed if sufficient computational power is available. The method is demonstrated with an analysis of all \(3\times 3\) block matrix inverse completion problems with 11 blocks known and 7 unknown. The solutions to all such problems are of a relatively simple form.NEWLINENEWLINENEWLINEA more detailed analysis of a particular problem from the 31824 \(3\times 3\) block matrix completion problems with 11 blocks known and 7 unknown is also performed. A solution to this problem is presented.
0 references
0.74614417552948
0 references
0.7258113622665405
0 references
0.7258113622665405
0 references
0.7255560755729675
0 references
0.7245614528656006
0 references
