Orateur: Parisa
Mamooler
Titre: Hierarchical
Matrix (H-matrix)
Résumé:
Numerical analysts avoid whenever possible to work with large dense
matrices. Instead, they try to approximate them with sparse or low rank
matrices. H-matrices are one of these methods which use data-sparse
approximations of non-sparse matrices. In fact, they provide tools to
perform matrix operations in almost linear complexity (of O(n log n)). One
of the important properties of the H-matrices is that they are valid for the
important class of matrices originating from standard discretisations of
elliptic partial differential equations or the related integral equations.
In this talk I’ll give the basic ideas of H-matrices and their application
for solving an integral equation.