Name
Abstract | ||
|---|---|---|
Let $A$ be a $k \by n$ underdetermined matrix. The sparse basis problem for the row space $W$ of $A$ is to find a basis of $W$ with the fewest number of nonzeros. Suppose that all the entries of $A$ are nonzero, and that they are algebraically independent ... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1137/S089547989121793X | SIAM J. Matrix Analysis Applications |
Keywords | Field | DocType |
lattice rules,smith normal form,row space,fewest number,sparse basis problem,underdetermined matrix | Abelian group,Combinatorics,Generator matrix,Lattice model (physics),Smith normal form,Canonical form,Integer matrix,Integer lattice,Mathematics,Reciprocal lattice | Journal |
Volume | Issue | ISSN |
16 | 1 | 0895-4798 |
Citations | PageRank | References |
2 | 0.77 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. N. Lyness | 1 | 155 | 73.78 |
| Patrick Keast | 2 | 109 | 34.29 |