AbstractAn efficient algorithm for the direct solution of a linear system associated with the discretization of boundary integral equations (in two dimensions) is described without having to compute the complete matrix of the linear system. This algorithm is based on the unitary-weight representation, for which a new construction based on adaptive cross approximation is proposed. This low rank approximation uses only a small part of the entries to construct the adaptive cross representation, and therefore the linear system can be solved efficiently
Approximating integral operators by a standard Galerkin discretisation typically leads to dense matr...
We consider the solution of systems of linear matrix equations in two or three unknown matrices. For...
We present a fast direct solver for boundary integral equations on complex surfaces in three dimensi...
AbstractAn efficient algorithm for the direct solution of a linear system associated with the discre...
Integral equations of the first kind with a smooth kernel and perturbed right-hand side, which repre...
Abstract. A new fast algebraic method for obtaining an H2-approximation of a matrix from its entries...
1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HOD...
The adaptive cross approximation (ACA) algorithm [2, 3] provides a means to com-pute data-sparse app...
This article deals with the solution of integral equations using collocation methods with almost lin...
AbstractWe describe an algorithm for the rapid direct solution of linear algebraic systems arising f...
This article deals with the adaptive and approximative computation of the Lam\'e equations. The equa...
Although some preconditioners are available for solving dense linear systems, there are still many m...
The matrices resulting from the discretisation of non-local operators occurring in the boundary elem...
Discretizing an integral operator by a standard finite element or boundary element method typically ...
This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The...
Approximating integral operators by a standard Galerkin discretisation typically leads to dense matr...
We consider the solution of systems of linear matrix equations in two or three unknown matrices. For...
We present a fast direct solver for boundary integral equations on complex surfaces in three dimensi...
AbstractAn efficient algorithm for the direct solution of a linear system associated with the discre...
Integral equations of the first kind with a smooth kernel and perturbed right-hand side, which repre...
Abstract. A new fast algebraic method for obtaining an H2-approximation of a matrix from its entries...
1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HOD...
The adaptive cross approximation (ACA) algorithm [2, 3] provides a means to com-pute data-sparse app...
This article deals with the solution of integral equations using collocation methods with almost lin...
AbstractWe describe an algorithm for the rapid direct solution of linear algebraic systems arising f...
This article deals with the adaptive and approximative computation of the Lam\'e equations. The equa...
Although some preconditioners are available for solving dense linear systems, there are still many m...
The matrices resulting from the discretisation of non-local operators occurring in the boundary elem...
Discretizing an integral operator by a standard finite element or boundary element method typically ...
This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The...
Approximating integral operators by a standard Galerkin discretisation typically leads to dense matr...
We consider the solution of systems of linear matrix equations in two or three unknown matrices. For...
We present a fast direct solver for boundary integral equations on complex surfaces in three dimensi...