Adaptive Recompression of-Matrices for BEM

Grasedyck, L.
May 2005
Computing;2005, Vol. 74 Issue 3, p205
Academic Journal
The efficient treatment of dense matrices arising, e.g., from the finite element discretisation of integral operators requires special compression techniques. In this article, we use a hierarchical low-rank approximation, the so-called-matrix, that approximates the dense stiffness matrix in admissible blocks (corresponding to subdomains where the underlying kernel function is smooth) by low rank matrices. The low rank matrices are assembled by the ACA+ algorithm, an improved variant of the well-known ACA method. We present an algorithm that can determine a coarser block structure that minimises the storage requirements (enhanced compression) and speeds up the arithmetic (e.g., inversion) in the-matrix format. This coarse approximation is done adaptively and on-the-fly to a given accuracy such that the matrix is assembled with minimal storage requirements while keeping the desired approximation quality. The benefits of this new recompression technique are demonstrated by numerical examples.


Related Articles

  • Hierarchical LU Decomposition-based Preconditioners for BEM. Bebendorf, M. // Computing;2005, Vol. 74 Issue 3, p225 

    The adaptive cross approximation method can be used to efficiently approximate stiffness matrices arising from boundary element applications by hierarchical matrices. In this article an approximativeLUdecomposition in the same format is presented which can be used for preconditioning the...

  • Application of the adaptive cross approximation technique for the coupled BE-FE solution of symmetric electromagnetic problems. Kurz, S.; Rain, O.; Rjasanow, S. // Computational Mechanics;Dec2003, Vol. 32 Issue 4-6, p423 

    Electromagnetic devices can be analysed by the coupled BE-FE method, where the conducting and magnetic parts are discretized by finite elements. In contrast, the surrounding space is described with the help of the boundary element method (BEM). This discretization scheme is well suited...

  • Adaptive Cross Approximation for Scattering by Periodic Surfaces. Poirier, Jean-René; Perrussel, Ronan // Progress in Electromagnetics Research M;2014, Vol. 35, p97 

    The adaptive cross approximation is applied to boundary element matrices coming from 2D scattering problems by an infinite periodic surface. This compression technique has the advantage to be applied before the assembly of the matrix. As a result, the computational times for both assembly and...

  • Approximation of Integral Operators by-Matrices with Adaptive Bases. B�rm, S. // Computing;2005, Vol. 74 Issue 3, p249 

    -matrices can be used to construct efficient approximations of discretized integral operators. The-matrix approximation can be constructed efficiently by interpolation, Taylor or multipole expansion of the integral kernel function, but the resulting representation requires a large amount of...

  • Adaptive hp-versions of boundary element methods for elastic contact problems. Maischak, Matthias; Stephan, Ernst // Computational Mechanics;May2007, Vol. 39 Issue 5, p597 

    The variational formulation of elastic contact problems leads to variational inequalities on convex subsets. These variational inequalities are solved with the boundary element method (BEM) by making use of the Poincar�Steklov operator. This operator can be represented in its discretized...

  • Evaluation of In-Boundary Stress in 2D BEM for Isotropic Elasticity. A Comparative Study. Calzado, F. J.; Mantic, V.; Paris, F. // Computational Mechanics;Dec2003, Vol. 32 Issue 4-6, p445 

    The present work deals with the recovery of the in-boundary stress on smooth boundary parts in Boundary Element Method (BEM) in two dimensions. First, two Boundary Integral Representations (BIRs) of tangential derivative of boundary displacements, whose integral kernels multiplying either...

  • Hierarchical Tensor-Product Approximation to the Inverse and Related Operators for High-Dimensional Elliptic Problems. Gavrilyuk, Ivan P.; Hackbusch, Wolfgang; Khoromskij, Boris N. // Computing;Mar2005, Vol. 74 Issue 2, p131 

    The class of-matrices allows an approximate matrix arithmetic with almost linear complexity. In the present paper, we apply the-matrix technique combined with the Kronecker tensor-product approximation (cf. [2, 20]) to represent the inverse of a discrete elliptic operator in a hypercube (0, 1)...

  • Spectral inclusion and spectral exactness for PDEs on exterior domains. BROWN, B. M.; MARLETTA, M. // IMA Journal of Numerical Analysis;Jan2004, Vol. 24 Issue 1, p21 

    Using the Dirichlet to Newmann map on the inner boundary, we give a method to identify spurious computed eigenvalues of elliptic PDEs on exterior domains. Numerical examples illustrate its effectiveness.

  • Error bounds for complementarity problems with tridiagonal nonlinear functions. Alefeld, G.; Wang, Z. // Computing;Dec2008, Vol. 83 Issue 4, p175 

    In this paper we consider the complementarity problem NCP( f) with f( x) = Mx + φ( x), where M ∈ R n× n is a real matrix and φ is a so-called tridiagonal (nonlinear) mapping. This problem occurs, for example, if certain classes of free boundary problems are discretized. We...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics