A class of hierarchical matrices (H-matrices) allows the data-sparse approximation to integral and more general nonlocal operators (say, the Poincaré-Steklov operators) with almost linear cost. We consider the H-matrix-based approximation to the Schur complement on the interface [2] corresponding to the FEM discretisation of an elliptic operator L with jumping coefficients in Rd. As with the standard Schur complement domain decomposition methods, we split the elliptic inverse L−1 as a sum of local inverses associated with subdomains (this can be implemented in parallel), and the corresponding Poincaré-Steklov operator on the interface. Using the hierarchical formats based on either standard or weakened admissibility criteria (cf. [1]) we ...
We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complemen...
We consider additive two-level preconditioners, with a local and a global component, for the Schur c...
International audienceMatrices coming from elliptic Partial Differential Equations (PDEs) have been ...
The class of H-matrices allows an approximate matrix arithmetic with almost linear complexity. In th...
summary:We give a short introduction to a method for the data-sparse approximation of matrices resul...
We present numerical methods for solving systems of linear equations originated from the discretisat...
In this paper we develop asymptotically optimal algorithms for fast computations with the discrete h...
AbstractMany of today’s most efficient numerical methods are based on multilevel decompositions: The...
AbstractIn a preceding paper (Hackbusch, Computing 62 (1999) 89–108), a class of matrices (H-matrice...
International audienceIn this talk we will describe how H-matrix data sparse techniques can be imple...
The Schur complement method, also known as substructuring technique, was widely used in structural m...
We present a new approach for preconditioning the interface Schur complement arising in the domain d...
1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HOD...
Hierarchical matrices provide a data-sparse way to approximate fully populated matrices. In this pap...
H 2-matrices can be used to construct efficient approximations of discretized integral operators. Th...
We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complemen...
We consider additive two-level preconditioners, with a local and a global component, for the Schur c...
International audienceMatrices coming from elliptic Partial Differential Equations (PDEs) have been ...
The class of H-matrices allows an approximate matrix arithmetic with almost linear complexity. In th...
summary:We give a short introduction to a method for the data-sparse approximation of matrices resul...
We present numerical methods for solving systems of linear equations originated from the discretisat...
In this paper we develop asymptotically optimal algorithms for fast computations with the discrete h...
AbstractMany of today’s most efficient numerical methods are based on multilevel decompositions: The...
AbstractIn a preceding paper (Hackbusch, Computing 62 (1999) 89–108), a class of matrices (H-matrice...
International audienceIn this talk we will describe how H-matrix data sparse techniques can be imple...
The Schur complement method, also known as substructuring technique, was widely used in structural m...
We present a new approach for preconditioning the interface Schur complement arising in the domain d...
1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HOD...
Hierarchical matrices provide a data-sparse way to approximate fully populated matrices. In this pap...
H 2-matrices can be used to construct efficient approximations of discretized integral operators. Th...
We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complemen...
We consider additive two-level preconditioners, with a local and a global component, for the Schur c...
International audienceMatrices coming from elliptic Partial Differential Equations (PDEs) have been ...