A Cartesian treecode for screened Coulomb interactions

DOI10.1016/J.JCP.2009.02.022MaRDI QIDQ1025144zbMATH OpenOpenAlexFDO

Authors Peijun Li, Hans Johnston, Robert Krasny

Publication date 18 June 2009

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcp.2009.02.022

zbMATH Keywords

recurrence relationsYukawa potentialscreened Coulomb potentialCartesian treecodeparticle-cluster interaction

Mathematics Subject Classification ID

Electro- and magnetostatics (78A30) Motion of charged particles (78A35)

Recommendations

• A treecode based on barycentric Hermite interpolation for electrostatic particle interactions
• Treecode algorithms for computing nonbonded particle interactions
• A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap
• A treecode for potentials of the formr^−λ
• Cyclically parallelized treecode for fast computations of electrostatic interactions on molecular surfaces

Cites work

• scientific article; zbMATH DE number 5669486 (Why is no real title available?)
• scientific article; zbMATH DE number 4080996 (Why is no real title available?)
• scientific article; zbMATH DE number 41859 (Why is no real title available?)
• A fast adaptive multipole algorithm for calculating screened Coulomb (Yukawa) interactions
• A fast adaptive multipole algorithm in three dimensions
• A fast algorithm for particle simulations
• A fast algorithm for vortex blob interactions
• A kernel-independent adaptive fast multipole algorithm in two and three dimensions
• A new version of the fast multipole method for screened Coulomb interactions in three dimensions
• A particle method and adaptive treecode for vortex sheet motion in three-dimensional flow
• Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
• Molecular modeling and simulation. An interdisciplinary guide
• Skeletons from the treecode closet
• ``New-version-fast-multipole-method accelerated electrostatic calculations in biomolecular sys\-tems

Cited in

(38)

• A kernel-independent treecode for general Rotne-Prager-Yamakawa tensor
• Relativistic space-charge field calculation by interpolation-based treecode
• Treecode algorithms for computing nonbonded particle interactions
• A treecode algorithm for the Poisson equation in a general domain with unstructured grids
• A kernel-independent treecode based on barycentric Lagrange interpolation
• Method of lines transpose: an implicit solution to the wave equation
• Treecode-accelerated Green iteration for Kohn-Sham density functional theory
• A treecode based on barycentric Hermite interpolation for electrostatic particle interactions
• Variable order revised binary treecode
• A new family of regularized kernels for the harmonic oscillator
• An asymptotic preserving Maxwell solver resulting in the Darwin limit of electrodynamics
• On preconditioning the treecode-accelerated boundary integral (TABI) Poisson-Boltzmann solver
• Fast multipole method for 3-D Poisson-Boltzmann equation in layered electrolyte-dielectric media
• A finite mass based method for Vlasov-Poisson simulations
• The Effect of Global Smoothness on the Accuracy of Treecodes
• Computational Science – ICCS 2005
• A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules
• Parallel higher-order boundary integral electrostatics computation on molecular surfaces with curved triangulation
• A particle method for the homogeneous Landau equation
• An integral equation formulation of the N-body dielectric spheres problem. II: Complexity analysis
• A linear scaling in accuracy numerical method for computing the electrostatic forces in the \(N\)-body dielectric spheres problem
• A boundary integral Poisson-Boltzmann solvers package for solvated bimolecular simulations
• Poisson-Boltzmann model for protein-surface electrostatic interactions and grid-convergence study using the \textsc{PyGBe} code
• A Treecode Algorithm for 3D Stokeslets and Stresslets
• Fast integral equation solver for Maxwell's equations in layered media with FMM for Bessel functions
• A biomolecular electrostatics solver using python, GPUs and boundary elements that can handle solvent-filled cavities and stern layers
• A treecode for potentials of the formr^−λ
• FMM-Yukawa: an adaptive fast multipole method for screened Coulomb interactions
• A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal
• Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems
• Towards an adaptive treecode for \(N\)-body problems
• Fast Barnes-Hut-based algorithm in 2D vortex method of computational hydrodynamics
• A Cartesian FMM-accelerated Galerkin boundary integral Poisson-Boltzmann solver
• A p-adaptive treecode solution of the Poisson equation in the general domain
• Method of lines transpose: an efficient unconditionally stable solver for wave propagation
• A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap
• Cyclically parallelized treecode for fast computations of electrostatic interactions on molecular surfaces
• A fast, robust, and non-stiff immersed boundary method

This page was built for publication: A Cartesian treecode for screened Coulomb interactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025144)