A rapid finite difference algorithm, utilizing successive over‐relaxation to solve the Poisson–Boltzmann equation
- 1 May 1991
- journal article
- research article
- Published by Wiley in Journal of Computational Chemistry
- Vol. 12 (4) , 435-445
- https://doi.org/10.1002/jcc.540120405
Abstract
An efficient algorithm is presented for the numerical solution of the Poisson–Boltzmann equation by the finite difference method of successive over‐relaxation. Improvements include the rapid estimation of the optimum relaxation parameter, reduction in number of operations per iteration, and vector‐oriented array mapping. The algorithm has been incorporated into the electrostatic program DelPhi, reducing the required computing time by between one and two orders of magnitude. As a result the estimation of electrostatic effects such as solvent screening, ion distributions, and solvation energies of small solutes and biological macromolecules in solution, can be performed rapidly, and with minimal computing facilities.This publication has 6 references indexed in Scilit:
- Electrostatic Interactions in Macromolecules: Theory and ApplicationsAnnual Review of Biophysics, 1990
- The electrostatic potential of B‐DNABiopolymers, 1989
- Solving the finite difference linearized Poisson‐Boltzmann equation: A comparison of relaxation and conjugate gradient methodsJournal of Computational Chemistry, 1989
- Connected moments expansion: A new tool for quantum many-body theoryPhysical Review Letters, 1987
- Focusing of electric fields in the active site of Cu‐Zn superoxide dismutase: Effects of ionic strength and amino‐acid modificationProteins-Structure Function and Bioinformatics, 1986
- Introduction to Numerical AnalysisPublished by Springer Nature ,1980