An Efficient Algorithm for Classical Density Functional Theory in Three Dimensions: Ionic Solutions
Matthew G. Knepley, Dmitry A. Karpeev, Seth Davidovits, Robert S., Eisenberg, Dirk Gillespie

TL;DR
This paper introduces an efficient numerical algorithm for three-dimensional classical density functional theory of ionic solutions, utilizing FFTs and iterative methods to significantly reduce computational complexity.
Contribution
The authors develop a scalable $ ext{O}(N ext{log} N)$ algorithm for 3D DFT of ionic fluids, improving computational efficiency over existing methods.
Findings
The FFT/Picard method outperforms real-space and Newton methods in speed.
The algorithm efficiently handles large 3D systems with reduced memory usage.
Two algorithms for electrostatic DFT are presented, with trade-offs in accuracy and computational cost.
Abstract
Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids of charged, hard spheres that uses operations and memory, where is the number of grid points. This system-size scaling is significant because of the very large required for three-dimensional systems. The algorithm uses fast Fourier transforms (FFT) to evaluate the convolutions of the DFT Euler-Lagrange equations and Picard (iterative substitution) iteration with line search to solve the equations. The pros and cons of this FFT/Picard technique are compared to those of alternative solution methods that use real-space integration of the convolutions instead of FFTs and Newton iteration instead of Picard.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
