The first release of the new H2Lib package has been released to
It is closely related to HLib,
but differs in a number of important points:
- H2Lib is published as free and open source software under
the GNU lesser public license.
It can be obtained free of charge at
- The library offers matrix arithmetic operations
(multiplication, inversion, factorization) both for
hierarchical matrices and H²-matrices.
- Integral equations are supported by a wide range of
optimized approximation algorithms.
- Dense matrices and vectors are represented by separate
data types, allowing the library to perform, e.g., bounds
- Although the library's performance benefits significantly
from additional packages like
packages are not required.
- Online documentation is available at the
Bug in HLib: Incorrect array operations when
writing to a file.
The function write_supermatrix used to write a hierarchical
matrix to a file computed an index with the wrong leading dimension.
The problem is solved by a patch available at the
HLib patches page.
Winterschool on hierarchical matrices.
The next winterschool on hierarchical matrices will take place at the
Max Planck Institute for Mathematics
in the Sciences from the 11th to the 15th of March, 2013. The
deadline for registrations is the 29th of February, 2013.
The winterschool will focus on the theoretical foundation of hierarchical
matrix techniques and on the practical implementation of the corresponding
algorithms and data structures in the context of the
HLib package. Details can be found on the
New Book on H²-Matrices.
The first book on H²-matrix
methods is now available.
It offers a comprehensive introduction into the relevant algorithms,
the techniques for the corresponding complexity and error analysis,
and a collection of numerical examples illustrating the properties
of the H²-matrix method.
All algorithms presented in the book will be included in the
next release HLib.
Big Book on Hierarchical Matrices.
The big book on
hierarchical matrix techniques has been published.
If offers an overview of the current state of the art in the field
of hierarchical matrix techniques and covers topics like algebraic
and analytic low-rank approximations, matrix arithmetic operations
and applications to integral operators, matrix equations and
preconditioning of elliptic partial differential equations.
Bug in HLib: Incorrect quadrature for two-dimensional
The singular quadrature routines in quadrature1d used for
discretizing integral operators in curvebem relied on invalid
symmetry assumptions, and the logarithmic kernel function used in
curvebem was treated incorrectly in the computation of the
diagonal entries of the single layer potential matrix.
Both problems are solved by a patch available at the
HLib patches page.
New Paper: Adaptive variable-rank approximation
of general dense matrices.
The paper [Börm2005b]
introduces a modification of the standard H2-matrix
recompression algorithm presented in
that allows it to reduce the storage requirements by using techniques
introduced in the context of variable-order approximation schemes
Lecture notes of the winterschool on hierarchical
The lecture notes
of the winterschool on hierarchical matrices have been updated.
The current version covers the application of hierarchical matrices to
integral and partial differential equations, approximative arithmetics,
complexity estimates and H2-matrices.
HLib 1.3 released.
The new version 1.3 of the HLib
package is now available.
Important new features include hybrid cross approximation of boundary
element operators, improved orthogonalization and recompression
routines for H2-matrices, new (and hopefully more
accessible) example programs, and H2-matrix
arithmetics in linear complexity.
New paper: Hybrid cross approximation of
A popular approach to constructing low-rank approximations of discretized
integral operators is based on the application of cross approximation
to entries of the discrete matrix. This has the advantage that a complete
H-matrix approximation can be created based only on a routine for
evaluating integrals and some geometric information.
Unfortunately, this approach can be shown to fail in a number of important
situations, e.g., for the classical double layer operator on polygonal
domains. This is due to the fact that too much information is lost in the
transition from the continuous to the discrete problem.
[Börm/Grasedyck2004] proposes a different approach: the cross
approximation is applied to the original kernel function, and the resulting
kernel expansion is then discretized. Numerical experiments indicate that
this hybrid technique is both faster and more reliable than previous methods.