Approximating inverse FEM matrices on non-uniform meshes with H-matrices

05/11/2020
by   Niklas Angleitner, et al.
0

We consider the approximation of the inverse of the finite element stiffness matrix in the data sparse H-matrix format. For a large class of shape regular but possibly non-uniform meshes including graded meshes, we prove that the inverse of the stiffness matrix can be approximated in the H-matrix format at an exponential rate in the block rank. Since the storage complexity of the hierarchical matrix is logarithmic-linear and only grows linearly in the block-rank, we obtain an efficient approximation that can be used, e.g., as an approximate direct solver or preconditioner for iterative solvers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2020

Approximating inverse FEM matrices on non-uniform meshes with H-matrice

We consider the approximation of the inverse of the finite element stiff...
research
03/18/2022

Exponential meshes and ℋ-matrices

In our previous works, we proved that the inverse of the stiffness matri...
research
03/27/2021

ℋ-matrix approximability of inverses of FEM matrices for the time-harmonic Maxwell equations

The inverse of the stiffness matrix of the time-harmonic Maxwell equatio...
research
09/13/2021

ℋ-inverses for RBF interpolation

We consider the interpolation problem for a class of radial basis functi...
research
11/05/2019

Some comments about measures, Jacobians and Moore-Penrose inverse

Some general problems of Jacobian computations in non-full rank matrices...

Please sign up or login with your details

Forgot password? Click here to reset