Sparse approximate inverses and target matrices
If P has a prescribed sparsity and minimizes the Frobenius norm |I - PA||F, it is called a sparse approximate inverse of A. It is well known that the computation of such a matrix P is via the solution of independent linear least squares problems for the rows separately (and therefore in parallel). I...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2005
|