Computer Physics Communications Program LibraryPrograms in Physics & Physical Chemistry |

[Licence| Download | New Version Template] aegb_v1_0.tar.gz(8559 Kbytes) | ||
---|---|---|

Manuscript Title: AFMPB: An Adaptive Fast Multipole Poisson-Boltzmann Solver for
Calculating Electrostatics in Biomolecular Systems | ||

Authors: Benzhuo Lu, Xiaolin Cheng, Jingfang Huang, J. Andrew McCammon | ||

Program title: AFMPB: Adaptive Fast Multipole Poisson-Boltzmann Solver | ||

Catalogue identifier: AEGB_v1_0Distribution format: tar.gz | ||

Journal reference: Comput. Phys. Commun. 181(2010)1150 | ||

Programming language: Fortran. | ||

Computer: Any. | ||

Operating system: Any. | ||

RAM: Depends on the size of the discretized biomolecular system. | ||

Keywords: Poisson-Boltzmann Equation, Boundary Integral Equation, Node-patch Method, Krylov Subspace Methods, Fast Multipole Methods, Diagonal Translations. | ||

PACS: 02.30.Rz, 02.70.Ns, 24.10.Cn. | ||

Classification: 3. | ||

External routines: Pre- and post-processing tools are required for generating the
boundary elements and for visualization. Users can use MSMS
(http://www.scripps.edu/~sanner/html/msms_home.html) for pre-processing, and
VMD (http://www.ks.uiuc.edu/Research/vmd/) for visualization. Sub-programs included: An iterative Krylov subspace solvers package from SPARSKIT by Yousef Saad (http://www-users.cs.umn.edu/~saad/software/SPARSKIT/sparskit.html), and the fast multipole methods subroutines from FMMSuite (http://www.fastmultipole.org/). | ||

Nature of problem:Numerical solution of the linearized Poisson-Boltzmann equation that describes electrostatic interactions of molecular systems in ionic solutions. | ||

Solution method:A novel node-patch scheme is used to discretize the well-conditioned boundary integral equation formulation of the linearized Poisson-Boltzmann equation. Various Krylov subspace solvers can be subsequently applied to solve the resulting linear system, with a bounded number of iterations independent of the number of discretized unknowns. The matrixvector multiplication at each iteration is accelerated by the adaptive new versions of fast multipole methods. The AFMPB solver requires other stand-alone pre-processing tools for boundary mesh generation, post-processing tools for data analysis and visualization, and can be conveniently coupled with different time stepping methods for dynamics simulation. | ||

Restrictions:Only three or six significant digits options are provided in this version. | ||

Unusual features:Most of the codes are in Fortran77 style. Memory allocation functions from Fortran90 and above are used in a few subroutines. | ||

Additional comments:The current version of the codes is designed and written for single core/processor desktop machines. Check http://lsec.cc.ac.cn/~lubz/afmpb.html and http://mccammon.ucsd.edu/ for updates and changes. | ||

Running time:The running time varies with the number of discretized elements ( N) in the system and their distributions. In most cases, it
scales linearly as a function of N. |

Disclaimer | ScienceDirect | CPC Journal | CPC | QUB |