Add to ORKGThe aim of this paper is a short introduction to a fundamental algorithm for the fast multiplication of vectors with fully populated, special matrices arising in various applications. The basic idea is known as fast multipole method, fast multiplication by H-matrices or by mosaic-skeleton matrices. We prefer a linear algebraic approach which may serve as a basis for student seminars in Mathematics, Computer Science or Engineering. Our introduction is accompanied by a broad, but far away from complete, list of references, where the reader may find more sophisticated material
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
This thesis describes the Fast Multipole Method (FMM). The method reduces the complexity of the Coul...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...
Abstract. We present a matrix interpretation of the three-dimensional fast multipole method (FMM). T...
Many problems in mathematical physics and engineering involve solving linear systems Ax = b which ar...
The fast multipole method (FMM) is an efficient method for evaluating matrix-vector products related...
We study integral methods applied to the resolution of the Maxwell equations where the linear system...
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when...
A combination of hierarchical tree-like data structures and data access patterns from fast mul-tipol...
Matrix multiplication is an operation that produces a matrix from two matrices and its applications...
AbstractThe method of trilinear aggregating with implicit canceling for the design of fast matrix mu...
Matrix multiplication is a core building block for numerous scientific computing and, more recently,...
The solution of many problems in engineering and science is enabled by the availability of a fast al...
Les techniques avancées pour l’approximation de rang faible des matrices sont des outils de réductio...
AbstractThe main purpose of this paper is to present a fast matrix multiplication algorithm taken fr...
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
This thesis describes the Fast Multipole Method (FMM). The method reduces the complexity of the Coul...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...
Abstract. We present a matrix interpretation of the three-dimensional fast multipole method (FMM). T...
Many problems in mathematical physics and engineering involve solving linear systems Ax = b which ar...
The fast multipole method (FMM) is an efficient method for evaluating matrix-vector products related...
We study integral methods applied to the resolution of the Maxwell equations where the linear system...
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when...
A combination of hierarchical tree-like data structures and data access patterns from fast mul-tipol...
Matrix multiplication is an operation that produces a matrix from two matrices and its applications...
AbstractThe method of trilinear aggregating with implicit canceling for the design of fast matrix mu...
Matrix multiplication is a core building block for numerous scientific computing and, more recently,...
The solution of many problems in engineering and science is enabled by the availability of a fast al...
Les techniques avancées pour l’approximation de rang faible des matrices sont des outils de réductio...
AbstractThe main purpose of this paper is to present a fast matrix multiplication algorithm taken fr...
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
This thesis describes the Fast Multipole Method (FMM). The method reduces the complexity of the Coul...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...