A Direct Adaptive Poisson Solver of Arbitrary Order Accuracy
Journal of Computational PhysicsPublished 1 May 1996Open access
Leslie Greengard, June‐Yub Lee
Citations86
SJR quartileQ1
SJR score1.69
SNIP1.75
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A direct, adaptive solver for the Poisson equation which can achieve any prescribed order of accuracy is presented, based on a domain decomposition approach using local spectral approximation, as well as potential theory and the fast multipole method.
Abstract
We present a direct, adaptive solver for the Poisson equation which can achieve any prescribed order of accuracy. It is based on a domain decomposition approach using local spectral approximation, as well as potential theory and the fast multipole method. In two space dimensions, the algorithm requiresO(NK) work, whereNis the number of discretization points andKis the desired order of accuracy.
Keywords
EngineeringPhysics and Astronomy
Journal of Computational PhysicsA fast algorithm for particle simulations
4,917 Citations1987Leslie Greengard, Vladimir Rokhlin
An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are Coulombic or gravitational in nature, making it considerably more practical for large-scale problems encountered in plasma physics, fluid dynamics, molecular dynamics, and celestial mechanics.
Mathematics of ComputationMulti-level adaptive solutions to boundary-value problems
3,219 Citations1977Achi Brandt
The boundary-value problem is discretized on several grids (or finite-element spaces) of widely different mesh sizes, enabling us to conveniently adapt the discretization to the evolving solution in a nearly optimal way, obtaining "°°-order" approximations and low n, even when singularities are present.
Journal of Computational PhysicsLocal adaptive mesh refinement for shock hydrodynamics
2,530 Citations1989Marsha Berger, Phillip Colella
An automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions and how to organize the algorithm to minimize memory and CPU overhead is developed.
Annual Review of Fluid MechanicsSpectral Methods In Fluid Dynamics
2,365 Citations1987M. Yousuff Hussaini
Adaptive Mesh Refinement for Hyperbolic Partial Differential Equations
1,533 Citations1983Marsha Berger, Joseph Oliger
This work presents an adaptive method based on the idea of multiple, component grids for the solution of hyperbolic partial differential equations using finite difference techniques based upon Richardson-type estimates of the truncation error, which is a mesh refinement algorithm in time and space.
Journal of Computational PhysicsRapid solution of integral equations of classical potential theory
1,398 Citations1985Vladimir Rokhlin
An algorithm is described for rapid solution of classical boundary value problems (Dirichlet an Neumann) for the Laplace equation based on iteratively solving integral equations of potential theory using CPUs proportional to n.
Journal of Computational PhysicsRapid solution of integral equations of scattering theory in two dimensions
825 Citations1990Vladimir Rokhlin
An algorithm for rapid solution of boundary value problems for the Helmholtz equation in two dimensions based on iteratively solving integral equations of scattering theory is described.
Society for Industrial and Applied Mathematics eBooksNumerical Analysis of Spectral Methods
767 Citations1977David Gottlieb, Steven A. Orszag
SIAM Journal on Numerical AnalysisOn Direct Methods for Solving Poisson’s Equations
737 Citations1970B.L. Buzbee, Gene H. Golub +1 more
Some efficient and accurate direct methods are developed for solving certain elliptic partial difference equations over a rectangle with Dirichlet, Neumann or periodic boundary conditions.
SIAM Journal on Scientific and Statistical ComputingA Fast Adaptive Multipole Algorithm for Particle Simulations
614 Citations1988Jean‐François Carrier, Leslie Greengard +1 more
An algorithm for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are described by Coulomb's law, which has an asymptotic CPU time estimate of $O(N)$ and does not depend on the statistics of the distribution for its efficient performance.
Journal of Computational PhysicsComposite overlapping meshes for the solution of partial differential equations
537 Citations1990G. Chesshire, William D. Henshaw
The generation of curvilinear composite overlapping grids and the numerical solution of partial differential equations on them are discussed and some techniques for the solution of elliptic and time-dependent PDEs on composite meshes are described.
Journal of Computational PhysicsAn Adaptively Refined Cartesian Mesh Solver for the Euler Equations
349 Citations1993Darren L. De Zeeuw, Kenneth G. Powell
A method for adaptive refinement of a Cartesian mesh for the solution of the steady Euler equations is presented and the flexibility of this approach and the accuracy attainable by solution-based refinement are shown.
CERN Document Server (European Organization for Nuclear Research)Partial differential equations of mathematical physics and integral equations
325 Citations1996Ronald B. Guenther, John W. Lee
Journal of Computational PhysicsLaplace's Equation and the Dirichlet-Neumann Map in Multiply Connected Domains
160 Citations1993Anne Greenbaum, Leslie Greengard +1 more
Journal of Computational PhysicsA Fast Poisson Solver for Complex Geometries
141 Citations1995A. McKenney, Leslie Greengard +1 more
This paper presents a new fast Poisson solver based on potential theory rather than on direct discretization of the partial differential equation, which combines fast algorithms for computing volume integrals and evaluating layer potentials on a grid with a fast multipole accelerated integral equation solver.
Contemporary mathematics - American Mathematical SocietyDomain decomposition and multigrid algorithms for elliptic problems on unstructured meshes
67 Citations1994Tony F. Chan, Barry Smith
This paper considers the problem of generating a multilevel grid hierarchy when only a fine, unstructured grid is given and generates a sequence of coarser grids by first forming a maximal independent set of the graph of the grid or its dual and then applying a Cavendish type algorithm to form the coarser triangulation.
Journal of Computational PhysicsThe rapid evaluation of volume integrals of potential theory on general regions
60 Citations1992Anita Mayo
Journal of Computational PhysicsFast Triangulated Vortex Methods for the 2D Euler Equations
46 Citations1994Giovanni Russo, John Strain
NASA Technical Reports Server (NASA)Multigrid solution of the Euler equations on unstructured and adaptive meshes
33 Citations1987Dimitri J. Mavriplis, Antony Jameson
An adaptive projection method for the incompressible Euler equations
27 Citations1993Ann Almgren, John B. Bell +2 more
This paper presents a method for solving the time-dependent incompressible Euler equations on an adaptive grid based on a projection formulation in which the method first solve convection equations to predict intermediate velocities, and then project these velocITIES onto a space of approximately divergence-free vector fields.
Two methods for the study of vortex patch evolution on locally refined grids
15 Citations1994Michael L. Minion