Fast parallel solution of boundary integral equations and related problems

[1]  U. Langer,et al.  Efficient preconditioners for boundary element matrices based on grey‐box algebraic multigrid methods , 2003 .

[2]  Sergej Rjasanow,et al.  Adaptive Low-Rank Approximation of Collocation Matrices , 2003, Computing.

[3]  Stefan Kurz,et al.  The adaptive cross-approximation technique for the 3D boundary-element method , 2002 .

[4]  Mario Bebendorf,et al.  Approximation of boundary element matrices , 2000, Numerische Mathematik.

[5]  Eugene E. Tyrtyshnikov,et al.  Incomplete Cross Approximation in the Mosaic-Skeleton Method , 2000, Computing.

[6]  L. Greengard,et al.  Regular Article: A Fast Adaptive Multipole Algorithm in Three Dimensions , 1999 .

[7]  W. Hackbusch.  A Sparse Matrix Arithmetic Based on $\Cal H$-Matrices. Part I: Introduction to ${\Cal H}$-Matrices , 1999, Computing.

[8]  S. Goreinov,et al.  A Theory of Pseudoskeleton Approximations , 1997 .

[9]  L. Greengard,et al.  A new version of the Fast Multipole Method for the Laplace equation in three dimensions , 1997, Acta Numerica.

[10]  E. Tyrtyshnikov.  Mosaic-Skeleton approximations , 1996 .

[11]  Dario Bini,et al.  Toeplitz matrices: Structures, algorithms and applications , 1996 .

[12]  Vladimir Rokhlin,et al.  Sparse Diagonal Forms for Translation Operators for the Helmholtz Equation in Two Dimensions , 1995 .

[13]  Gerhard Goos,et al.  Computer Science Today: Recent Trends and Developments , 1995 .

[14]  Bjørn Olstad,et al.  Efficient Partitioning of Sequences , 1995, IEEE Trans. Computers.

[15]  Tor Sørevik,et al.  Optimal Partitioning of Sequences , 1995, J. Algorithms.

[16]  David R. Butenhof.  Programming with POSIX threads , 1993 .

[17]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[18]  Bai,et al.  LAPACK Working Note 20: A Portable Linear Algebra Library For High-Performance Computers , 1990 .

[19]  W. Hackbusch,et al.  On the fast matrix multiplication in the boundary element method by panel clustering , 1989 .

[20]  V. Rokhlin.  Rapid solution of integral equations of classical potential theory , 1985 .

[21]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[22]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[23]  Mario Bebendorf,et al.  Effiziente numerische Lösung von Randintegralgleichungen unter Verwendung von Niedrigrang-Matrizen , 2001 .

[24]  Boris N. Khoromskij,et al.  A Sparse H-Matrix Arithmetic. Part II: Application to Multi-Dimensional Problems , 2000, Computing.