Combinatorial algorithms for computing column space bases that have sparse inverses (Q871171)
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 5134437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial algorithms for computing column space bases that have sparse inverses |
scientific article; zbMATH DE number 5134437 |
Statements
Combinatorial algorithms for computing column space bases that have sparse inverses (English)
0 references
16 March 2007
0 references
sparse column space basis
0 references
sparse null space basis
0 references
block angular matrix
0 references
block diagonal matrix
0 references
matching
0 references
hypergraph partitioning
0 references
, inverse of a basis
0 references
greedy algorithms
0 references
divide and conquer strategy
0 references
0.7969453930854797
0 references
0.793891191482544
0 references
0.7850539088249207
0 references
0.780511200428009
0 references
