Combinatorial algorithms for computing column space bases that have sparse inverses (Q871171): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Ali Pınar / rank | |||
| Property / author | |||
| Property / author: Ali Pınar / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:26, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial algorithms for computing column space bases that have sparse inverses |
scientific article |
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
