Author:
Greengard Leslie,Gueyffier Denis,Martinsson Per-Gunnar,Rokhlin Vladimir
Abstract
Methods for the solution of boundary integral equations have changed significantly during the last two decades. This is due, in part, to improvements in computer hardware, but more importantly, to the development of fast algorithms which scale linearly or nearly linearly with the number of degrees of freedom required. These methods are typically iterative, based on coupling fast matrix-vector multiplication routines with conjugate-gradient-type schemes. Here, we discuss methods that are currently under development for the fast, direct solution of boundary integral equations in three dimensions. After reviewing the mathematical foundations of such schemes, we illustrate their performance with some numerical examples, and discuss the potential impact of the overall approach in a variety of settings.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Numerical Analysis
Reference60 articles.
1. Ying L. , Biros G. , Zorin D. and Langston M. H. (2003), ‘A new parallel kernel-independent fast multipole method’, in Proc. ACM/IEEE Conf. on Supercomp., p. 14.
2. On the numerical solution of two-point boundary value problems II
3. Electrostatic Interactions in Macromolecules: Theory and Applications
4. Woodbury M. A. (1950), Inverting modified matrices. Memorandum Report 42, Statistical Research Group, Princeton University.
5. GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Cited by
135 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献