Content deleted Content added
Shadowjams (talk | contribs) m Reverted edits by 188.222.200.64 (talk) to last revision by 176.198.1.225 (HG) |
|||
Line 54:
If <math>k</math> is not too large, the storage requirements are reduced significantly.
In order to approximate the entire matrix <math>G</math>, it is split into a family of submatrices.
Large submatrices are stored in factorized representation, while small submatrices are stored in standard representation
in order to improve the efficiency.
Low-rank matrices are closely related to degenerate expansions used in [[panel clustering]] and the [[fast multipole method]]
to approximate integral operators.
In this sense, hierarchical matrices can be considered the algebraic counterparts of these techniques.
== Application to integral operators ==
| |||