A rapid finite difference algorithm, utilizing successive over‐relaxation to solve the Poisson–Boltzmann equation
Anthony O. Nicholls, Barry H. Honig · Journal of Computational Chemistry · 1991
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.
Cited by 1,263 works. doi:10.1002/jcc.540120405
Authors
References
- Introduction to Numerical Analysis.
- Introduction to Numerical Analysis
- Electrostatic Interactions in Macromolecules: Theory and Applications
- Focusing of electric fields in the active site of Cu‐Zn superoxide dismutase: Effects of ionic strength and amino‐acid modification
- Solving the finite difference linearized Poisson‐Boltzmann equation: A comparison of relaxation and conjugate gradient methods
- The electrostatic potential of B‐DNA
- Connected moments expansion: A new tool for quantum many-body theory