These are the lecture notes for a winter school on the subject of hierarchical matrices. They give an introduction both to the basic theory of H-matrices, including complexity estimates and error estimates, and to the practice, i.e., the efficient implementation of the construction of cluster trees and block cluster trees, the approximation of finite element and boundary element matrices and the H-matrix arithmetic operations. A program library containing all the routines from these notes and many extensions for more sophisticated applications can be obtained from the authors.
%0 Report
%1 citeulike:14025340
%A Börm, Steffen
%A Grasedyck, Lars
%A Hackbusch, Wolfgang
%C Leipzig
%D 2003
%K hierarchical-matrices 65n38-boundary-element-methods 65f05-direct-methods-for-linear-systems-and-matrix-inversion 65f35-matrix-norms-conditioning-scaling 65f30-other-matrix-algorithms
%N 21
%T Hierarchical Matrices
%U http://www.mis.mpg.de/publications/other-series/ln/lecturenote-2103.html
%X These are the lecture notes for a winter school on the subject of hierarchical matrices. They give an introduction both to the basic theory of H-matrices, including complexity estimates and error estimates, and to the practice, i.e., the efficient implementation of the construction of cluster trees and block cluster trees, the approximation of finite element and boundary element matrices and the H-matrix arithmetic operations. A program library containing all the routines from these notes and many extensions for more sophisticated applications can be obtained from the authors.
@techreport{citeulike:14025340,
abstract = {{These are the lecture notes for a winter school on the subject of hierarchical matrices. They give an introduction both to the basic theory of H-matrices, including complexity estimates and error estimates, and to the practice, i.e., the efficient implementation of the construction of cluster trees and block cluster trees, the approximation of finite element and boundary element matrices and the H-matrix arithmetic operations. A program library containing all the routines from these notes and many extensions for more sophisticated applications can be obtained from the authors.}},
added-at = {2017-06-29T07:13:07.000+0200},
address = {Leipzig},
author = {B\"{o}rm, Steffen and Grasedyck, Lars and Hackbusch, Wolfgang},
biburl = {https://www.bibsonomy.org/bibtex/299ff18596d7b8e02a66cd548100a48c4/gdmcbain},
citeulike-article-id = {14025340},
citeulike-attachment-1 = {boerm_06_hierarchical.pdf; /pdf/user/gdmcbain/article/14025340/1066474/boerm_06_hierarchical.pdf; 104be45188269a1011ec47cce2c4e6c36ae18d7c},
citeulike-linkout-0 = {http://www.mis.mpg.de/publications/other-series/ln/lecturenote-2103.html},
file = {boerm_06_hierarchical.pdf},
institution = {Max Planck Institute for Mathematics in the Sciences},
interhash = {32cb6c6c3dc9f43df7eb44c717747e42},
intrahash = {99ff18596d7b8e02a66cd548100a48c4},
keywords = {hierarchical-matrices 65n38-boundary-element-methods 65f05-direct-methods-for-linear-systems-and-matrix-inversion 65f35-matrix-norms-conditioning-scaling 65f30-other-matrix-algorithms},
number = 21,
posted-at = {2016-05-01 05:55:29},
priority = {4},
timestamp = {2019-04-17T01:25:41.000+0200},
title = {{Hierarchical Matrices}},
url = {http://www.mis.mpg.de/publications/other-series/ln/lecturenote-2103.html},
year = 2003
}