Hierarchical matrix approximability of inverse of convection dominated finite element matrices

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Saunier, Arthur, Agelas, Leo, Sedrakian, Ani Anciaux, Gharbia, Ibtihel Ben, Claeys, Xavier
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911302057721856
author Saunier, Arthur
Agelas, Leo
Sedrakian, Ani Anciaux
Gharbia, Ibtihel Ben
Claeys, Xavier
author_facet Saunier, Arthur
Agelas, Leo
Sedrakian, Ani Anciaux
Gharbia, Ibtihel Ben
Claeys, Xavier
contents Several researchers have developed a rich toolbox of matrix compression techniques that exploit structure and redundancy in large matrices. Classical methods such as the block low-rank format and the Fast Multipole Method make it possible to manipulate very large systems by representing them in a reduced form. Among the most sophisticated tools in this area are hierarchical matrices (H-matrices), which exploit local properties of the underlying kernel or operator to approximate matrix blocks by low-rank factors, organized in a recursive hierarchy. H-matrices offer a flexible and scalable framework, yielding nearly linear complexity in both storage and computation. Hierarchical matrix techniques, originally developed for boundary integral equations, have recently been applied to matrices stemming from the discretization of advection-dominated problems. However, their effectiveness is limited by the loss of coercivity induced by convection phenomena, where traditional methods fail. Initial work by Le Borne addressed this by modifying the admissibility criterion for structured grids with constant convection, but challenges remain for more general grids and advection fields. In this work, we propose a novel partitioning strategy based on "convection tubes", clusters aligned with the convection vector field. This method does not require a structured grid or constant convection, overcoming the limitations of previous approaches. We present both theoretical analyses and numerical experiments, that demonstrate the efficiency and robustness of our method for convection-dominated PDEs on unstructured grids. The approach builds on a Péclet-robust Caccioppoli inequality, crucial for handling convection-dominated problems.
format Preprint
id arxiv_https___arxiv_org_abs_2512_04824
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Hierarchical matrix approximability of inverse of convection dominated finite element matrices
Saunier, Arthur
Agelas, Leo
Sedrakian, Ani Anciaux
Gharbia, Ibtihel Ben
Claeys, Xavier
Numerical Analysis
Analysis of PDEs
Several researchers have developed a rich toolbox of matrix compression techniques that exploit structure and redundancy in large matrices. Classical methods such as the block low-rank format and the Fast Multipole Method make it possible to manipulate very large systems by representing them in a reduced form. Among the most sophisticated tools in this area are hierarchical matrices (H-matrices), which exploit local properties of the underlying kernel or operator to approximate matrix blocks by low-rank factors, organized in a recursive hierarchy. H-matrices offer a flexible and scalable framework, yielding nearly linear complexity in both storage and computation. Hierarchical matrix techniques, originally developed for boundary integral equations, have recently been applied to matrices stemming from the discretization of advection-dominated problems. However, their effectiveness is limited by the loss of coercivity induced by convection phenomena, where traditional methods fail. Initial work by Le Borne addressed this by modifying the admissibility criterion for structured grids with constant convection, but challenges remain for more general grids and advection fields. In this work, we propose a novel partitioning strategy based on "convection tubes", clusters aligned with the convection vector field. This method does not require a structured grid or constant convection, overcoming the limitations of previous approaches. We present both theoretical analyses and numerical experiments, that demonstrate the efficiency and robustness of our method for convection-dominated PDEs on unstructured grids. The approach builds on a Péclet-robust Caccioppoli inequality, crucial for handling convection-dominated problems.
title Hierarchical matrix approximability of inverse of convection dominated finite element matrices
topic Numerical Analysis
Analysis of PDEs
url https://arxiv.org/abs/2512.04824