A Newton-like iterative method implemented in the DelPhi for solving the nonlinear Poisson-Boltzmann equation

DelPhi is a popular scientific program which numerically solves the Poisson-Boltzmann equation (PBE) for electrostatic potentials and energies of biomolecules immersed in water via finite difference method. It is well known for its accuracy, reliability, flexibility, and efficiency. In this work, a new edition of DelPhi that uses a novel Newton-like method to solve the nonlinear PBE, in addition to the already implemented Successive Over Relaxation (SOR) algorithm, is introduced. Our tests on various examples have shown that this new method is superior to the SOR method in terms of stability when solving the nonlinear PBE, being able to converge even for problems involving very strong nonlinearity.


Introduction
Electrostatic interaction is a major factor which is commonly taken into account when studying numerous biological phenomena [1,2], such as macromolecular binding and recognition [3][4][5][6], pH-dependent folding and binding [7][8][9][10][11], nonspecific ion binding [12][13][14], pKa calculations [15][16][17], and salt-dependent effects [18,19], etc.. Existing models of calculating electrostatic potentials and corresponding energies developed in the past couple of decades can be roughly classified into two categories. Explicit solvent models treat mobile water and ions explicitly and thus capture all molecular details but are computationally costly in terms of CPU time and memory usage. Implicit solvent models, such as the Generalized Born [20] and Poisson-Boltzmann (PB) models [21][22][23][24][25][26], treat surrounding water as a continuum media, and can be solved with relatively low computational costs. Because of that, implicit solvent models are usually preferred when modeling electrostatics of macromolecules at genome-scale applications.
Among all existing implicit solvent models, the Poisson-Boltzmann equation (PBE), is one of the most popular models utilized by many researchers. A lot of efforts have been devoted to developing scientific software to solve the PBE. For instance, DelPhi [27,28] utilizes the finite difference and Successive Over Relaxation (SOR) methods to iteratively solve the PBE until a prescribed tolerance is satisfied, PBSA [29] adopts the Finite Volume/ Periodic Conjugate Gradient (FV/PCG) and the Immersed Interface/Fast Fourier Transform (IIM/FFT) methods to solve the PBE, MIBPB [30] develops a unique matched interface and boundary (MIB) method to explicitly enforce the jump conditions on the interfaces (molecular surfaces) in the finite difference formulations, resulting in a method capable of capturing sharp jumps of the potentials at the molecular surfaces, APBS [31] is an adaptive PBE solver which solves the PBE by a specifically designed finite element method, and many others [32,33].
As one of the most popular PBE solvers, DelPhi has been continuously maintained and developed for improved performance. Many new features were added in DelPhi in recent years [34]. This work reports a newly developed Newton-like method which was introduced into DelPhi recently. This new method has been tested extensively, including some purposely created "crashing" cases with strong nonlinearity. In particular, this method has been shown to be incredibly stable and is capable of delivering reliable numerical results in all tested cases, making this newly developed method a valuable add-on to DelPhi for solving problems with strong nonlinearity.
The rest of this work is organized as follows. The PBE and the finite difference methods are presented in section 2. Benchmarks of selected examples are shown section 3 to numerically compare the two methods implemented in DelPhi, followed by Conclusions and Acknowledgements in section 4 and 5, respectively.

The Poisson-Boltzmann Equation (PBE)
The PBE [35] is an elliptic-type Partial Differential Equation (PDE) given by ∇°⋅ ε x ∇ϕ x − κ x 2 sinh ϕ x = − 4πρ x , (1) where ϕ x is the electrostatic potential, ε x is a spatial dielectric function, κ x is a modified Debye-Huckel parameter, and ρ x is the charge distribution function. Eqn. (1) is usually referred to as the Nonlinear Poisson-Boltzmann Equation (NLPBE) due to the presence of the hyperbolic sine function, sinh ϕ x , in eqn. (1). If the potential ϕ x is known to be small, eqn. (1) can be linearized by an approximation, sinh ϕ x ≈ ϕ x , yielding a simplified model commonly referred to as the Linearized Poisson-Boltzmann Equation (LPBE). It is known that exact solutions to eqn. (1) -(2) only exist for a few simplified cases [27]. In practice, they must be solved numerically via certain numerical treatments for real bio-objects due to their irregular shapes. The numerical approaches for handling the nonlinearity of the PBE can be classified into two categories. In the most commonly used approach, the PBE is discretized by using finite difference or finite element methods, resulting a nonlinear algebraic system. Then a nonlinear algebraic method, such as nonlinear relaxation method [36,37], nonlinear conjugate gradient method [38] or inexact Newton method [39], can be employed to solve the nonlinear system efficiently. A comprehensive assessment of various algebra-based nonlinear PBE solvers can be found in [40]. A pseudo-time approach has also been developed [41][42][43], in which a time-dependent PBE is introduced by adding a pseudo-time derivative, and the PBE solution is recovered by a steady-state integration. The pseudo-time approach is usually less efficient than the nonlinear algebraic approach, because a long-time integration is needed for the steady state. But the pseudo-time approach could be more stable, especially when an analytical treatment to the nonlinear term is applied [43]. The method proposed in this work belongs to the first category. In the following subsections, implemented numerical methods in the DelPhi program will be introduced.

The Successive Over Relaxation (SOR) method
DelPhi solves eqn. (1) -(2) in a cubic domain Ω containing the interested molecule. Boundary conditions are imposed on the six faces of Ω. Domain Ω is discretized by a uniform mesh size ℎ = Δx = Δy = Δz in all x-, y-, and zdirections. Approximations to the exact solutions of eqn. (1) -(2) are to be found at all grids.
In DelPhi, potentials ϕ 0 n + 1 and ϕ 0 n in eqn. (5) - (6) are used in the SOR method ϕ 0 n + 1 = ωϕ 0 n + 1 + 1 − ω ϕ 0 n for improved efficiency or stability in the nth iteration as well. Here the relaxation parameter ω is selected to be 0 < ω < 2. When a value 0 < ω < 1 is used, the iteration process converges slower but more stably (under relaxation). When a value 1 < ω < 2 is used, the iteration process converges in a faster pace but could be less stable (over relaxation). DelPhi uses ω = 1 as the default value, yielding a method commonly known as the Gauss-Seidel (GS) method. DelPhi users can either manually set the value of ω, or let the program automatically calculate the optimized values of ω, for either faster convergence rates or stronger stability.
Eqn. (5) provides a numerical formula to solve the NLPBE iteratively but its convergence rate is not fast enough to solve problems in three dimensions [44]. DelPhi utilizes a special technique to accelerate the convergent rate. To this end, eqn. (1) is "linearized" and rewritten as where the nonlinear term, κ x 2 sinh ϕ x − ϕ x , acts as an "excess charge" added to the regular charge term on the right-hand side of eqn.
is derived in place of eqn. (5) for solving the NLPBE. In eqn. (9), the excess charge term is multiplied by a second relaxation (strength) parameter χ which is initially small, χ = 0.05. This parameter is slowly increased as iteration moves forward until χ = 1 is reached. Then "full" nonlinear iterations start with χ = 1 along the way.
In DelPhi, eqn. (6) and (7) are coupled for solving the LPBE, and eqn. (7) and (9) are coupled for solving the NLPBE. The iteration process is terminated, for instance, when ϕ 0 n + 1 − ϕ 0 n < TOL at all grids for a prescribed tolerance TOL. These methods, together with additional computational techniques, such as the "checkerboard" ordering, stripping, and contiguous memory mapping 35 , have been proven to be able to effectively deliver accurate numerical solutions to the LPBE and NLPBE for many three-dimensional problems.
However, it is known that the aforementioned "excess charge" treatment is merely a computational technique which could lead to undesired divergences caused by potentials at grids in water passing certain threshold, the grid spacing, and other factors [44]. One such "bizarre" example in which the SOR method fails to converge is given in the next section. It calls for a new addition to DelPhi's capabilities, namely a Newton-like method, primarily focusing on solving the NLPBE for problems with strong nonlinearity. This method is described in the next subsection.

A Newton-like (NWT) method
The NWT method was developed to improve the stability of the numerical procedure when solving the NLPBE for problems with strong nonlinearity. To this end, we reconsider the left-hand side of eqn.
(3) as a function of ϕ 0 and write In order to find the root(s) of the equation F ϕ 0 = 0 via the Newton's algorithm, the derivate of F ϕ 0 is calculated first Then eqn.
Eqn. (12) can be treated as a new updating formula to evolve ϕ 0 n to ϕ 0 n + 1 . Moreover, one can see that there is no difficulty to couple eqn. (7) and (12) and embrace all techniques already implemented in DelPhi to solve the NPBE.

Author Manuscript
Author Manuscript

Author Manuscript
Author Manuscript Defining one can calculate G′ ϕ 0 as Substituting eqn. (14) - (15) in the Newton's algorithm yields for solving the LPBE.
Eqn. (16) is actually the same as eqn. (6). That is, both SOR and NWT methods utilize the same numerical formula to solve the LPBE. Thus, it is expected that these two methods are equally accurate and efficient for solving the LPBE. An example is provided in the supplementary material to numerically verify that implementations of these two methods in DelPhi are indeed equally accurate and efficient. Therefore, we will concentrate on comparing their performance when different formulas are actually used to solve the NLPBE in the remaining of this work.
The novelty of the NWT method is two-fold. First, eqn. (12) is derived by applying the Newton algorithm on discretized equations obtained from the original PBE, while other Newton-type PBE solvers in the literature, to our best knowledge, are obtained by applying the Newton's algorithm directly on the original PBE. Secondly, this NWT method is implemented in a way to inherit all unique computational techniques, except the "excess charge", already implemented in the DelPhi solver. One can view this new NWT method as a DelPhi-specialized Newton-like method which is not seen elsewhere.

Comparison
Three iteration formulas, eqn. (5), (9), and (12), have been presented in this section for solving the NLPBE. It will be interesting to compare them side by side and provide our understanding of these iteration formulas. In order to simplify the discussions, we assume that a mesh size h is fixed and ℎ ≪ 1. We focus on just one iteration step, the nth iteration, in which the potential ϕ 0 n at an arbitrary grid is evolved to ϕ 0 n + 1 by one of these three formulas.
Moreover, we assume all potentials on the right-hand side of three equations all take on the same values in the nth iteration step. Noticing that the three formulas become identical at grids inside the molecule/protein because the modified Debye-Huckel parameter κ x = 0 in this case. Therefore, performance differences can only be observed at grids immersed in water. We thus limit our analysis to the solvent domain, where the potential function is smooth and bounded because no point charges locate there. Thus, in the water, it is reasonable to assume ϕ i n ≈ ϕ 0 n , i = 1, …, 6 in these formulas for a small but fixed h. When being stable, these three formulas will converge to the same solution as n goes to infinity.
Such a solution will be called the algebraic solution, which satisfies the finite difference discretization of the NLPBE, i.e., eqn. (3).
We will investigate these three formulas in two aspects, i.e., compare their convergence rates and analyze their stabilities when the potential is large. Eqn. (5) is considered first. When  where the first term on the right-hand side is the same as the right-hand side of eqn. (6), and the second term can be viewed as a "correction" added to the first term for improved convergence rate. When ϕ 0 n is small, sinh ϕ 0 n ≈ ϕ 0 n so that the correction term does not contribute much to ϕ 0 n + 1 . In this case eqn. (9) converges in a similar rate as that of eqn.
(5) and (6). When ϕ 0 n is large, sinh ϕ 0 n − ϕ 0 n ≫ 1 and sinh ϕ 0 n − ϕ 0 n /ℎ is even larger provided ℎ ≪ 1 so that the correction term becomes a significant portion in ϕ 0 n + 1 and drives ϕ 0 n + 1 in an accelerated pace towards the algebraic solution of the discretized NLPBE. However, the correction term could also introduce additional issues. When ϕ 0 n ≫ 1, the value of sinh ϕ 0 n − ϕ 0 n /ℎ could drive ϕ 0 n + 1 stride to be overshot the solution. Assuming ϕ i n ≈ ϕ 0 n and neglecting constants, the dominate term of eqn. (6) takes a form of a sinℎ(ϕ 0 n ) − bϕ 0 n for some constants a and b. Consequently, the potential could grow exponentially, and the whole iteration process quickly diverges. DelPhi utilizes a couple of relaxations parameters, ω in eqn. (7) and χ in eqn. (9), in order to pull ϕ 0 n + 1 back to the range of the solution in the overshot situation. These relaxation techniques work in most situations, but there is no guarantee that they are always effective. For instance, one "crashing" example is demonstrated in the next section that the SOR method faces severe difficulties to converge.
Eqn. (9) has been proven to cope with most cases in practice and it has other advantages over eqn. (5). First of all, it allows the same computational and programming techniques flawlessly shared between solving the LPBE and NLPBE. Secondly, the denominator on the right-hand side of eqn. (9) is unchanged in all iterations so that it can be calculated once, saved and then reused in all iterations. It is very computationally economical. Third, eqn. (9) can collaborate with other advanced techniques in DelPhi, resulting in one of the best PBE solvers in the world. Overall, we believe the SOR method implemented in DelPhi is an effective method to solve the NLPBE for three-dimensional problems.
The newly developed NWT method utilizes eqn. (12) in order to maintain stability when solving the NLPBE for problems with strong nonlinearity, while it is still able to converge in a rate faster than the method using eqn. (5). To see this, we rewrite eqn. (12) where the first term on the right-hand side is similar to that of eqn. (17) with one additional cosh ϕ 0 n in the denominator, and the second term, which is still called the correction term, is new in the NWT method. When ϕ 0 n is small, the first term is practically the same as that of eqn. (17) because cosh ϕ 0 n ≈ 1, and the second term vanishes because tanh ϕ 0 n ≈ ϕ 0 n . In this case eqn. (12) converges in a similar rate as that of eqn. (5), (6) and (9). When ϕ 0 n s large but still on track, sinh ϕ 0 n ≈ cosh ϕ 0 n ≫ ϕ 0 n > 1 so that the first term on the right-hand side of eqn. (18) is smaller than the right-hand side of eqn. (5). Together with the second term, this will drive the potential convergent to the algebraic solution of the discretized NLPBE in a faster pace than that of eqn. (5). When ϕ 0 n is large and far apart from the algebraic solution, the dominate term of eqn. (12) behaves like aϕ 0 n + btanh ϕ 0 n + cϕ 0 n /cosh ϕ 0 n for some constants a, b, and c by assuming ϕ i n ≈ ϕ 0 n and neglecting constants. This iteration only grows linearly as ϕ 0 n increases. This is essentially why the NWT method is more stable than the SOR method.
In summary, we believe that eqn. (5) could provide a stable method to solve the NLPBE. However, its relatively low convergence rate makes it unsuitable to solve the NLPBE for three-dimensional problems. The SOR method improves the convergence rate by an "exponential" correction term. This correction term allows the iterations progress in a fast pace, but it could lead to unexpected divergence for problems with high nonlinearity. The NWT method substitutes the correction term with a moderate one to balance the needs for both efficiency and stability, and we expect it to be a useful alternative of the SOR method in DelPhi to solve problems with high nonlinearity.

Results
Benchmarks are presented to compare the SOR and NWT methods in this section. Both methods have been implemented in DelPhi using the same computational and programing techniques. A wide selection of examples was tested, and three examples are chosen to demonstrate due to the limited length of this work.

Example 1.
In the first example, we show that both methods are capable of producing close numerical approximations to the algebraic solution of the discretized NLPBE at a given mesh size h. To this end, a basic example of barnase-barstar complex (subfigure in figure   2(b)) is borrowed from DelPhi's online example repository http://compbio.clemson.edu/ delphi and the NLPBE is solved for this complex. Two potential-dependent energies, the total grid energy G g and the corrected reaction field (RXN) energy G r , are used to compare the accuracy of the two methods.
The first series of benchmarks is conducted to show that both methods produce closer approximations as the mesh size h diminishes. In DelPhi the mesh size h is controlled by a parameter scale, defined to be the number of grids per angstrom. The mesh size h decreases as the scale increases. In this series of benchmarks, the tolerance is fixed, TOL = 1.0E-4, and the scale is varied from scale = 0.5 (29 grids per direction) to scale = 5.0 (293 grids per direction). Energies obtained by the SOR and NWT methods are denoted by G g SOR , G r SOR , G g NW T and G r NW T , respectively. Results are shown in Figure 2.
Obtained energies are shown in Figure 2(a) -(b) first. In both subfigures, it is noticed that energies obtained by the SOR method are always slightly larger than their comparative partners obtained by the NWT method at all tested scales. It shall be pointed out that it may not be the case for other molecules and proteins. It could just be caused by, for instance, the parameter values used in the tests, the initial values used for the iterations, and other factors. Nevertheless, close energies obtained by the two methods at all tested scales evidently demonstrate that they are converging to the exact energies. More detailed comparisons were performed and reported in Figure 2(c) -(d). In these subfigures, the differences, defined as G g SOR − G g NW T and so on, and the relative differences, defined as G g SOR − G g NW T /G g SOR × 100% and so on, are shown. The differences, except those at a low scale = 1.0, are seen to approach to a value as small as < 5 KT as the scale increases (Figure 2(c)), while the relative differences, starting with an already low percentage ≈ 1.7%, consistently converge to zero as the scale increases (Figure 2(d)).
In the light that both methods acquire close approximations at all tested scales, and the approximations are getting closer as the scale increases, we conclude that both methods are obtaining close approximations to the same algebraic solutions of the NLPBE at all tested mesh sizes in this example.
Corresponding execution time of the DelPhi program is demonstrated in Figure 2(e) to compare the efficiency of these two methods. One can see that the SOR method costs less time, and therefore is more efficient, at all tested scales. It is primarily due to two reasons. First, the SOR method starts off the nonlinear iterations with better initial values achieved by solving the LPBE for a few dozens of iterations. This numerical treatment significantly reduces the numbers of more costly nonlinear iterations. On the other hand, the NWT method merely uses the default initial values (zeros on all grids) without additional treatments. Secondly, by reusing the saved denominator, each iteration of the SOR method is computationally cheaper than that of the NWT method. As a consequence, the SOR method is found to be more computationally efficient than the NWT method for solving the NLPBE in this example, and it is believed to be the case for many other problems as well.
It has been shown that both methods are capable of achieving close approximations at all scales. We are also interested to see that how fast, in terms of the number of iterations, these two methods can achieve their best approximations at a given scale. To this end, the second series of benchmarks is performed by fixing the scale = 3.0 (175 grids per direction) and varying the tolerance from 1.0E-1 to 1.0E-7. It is naturally expected that both methods will take more iterations, and therefore produce more accurate energies, when smaller tolerance is used. The results shown in Figure 3 match our expectation. Semi-log plots (the horizontal axis is the logarithm of the tolerance) are used in Figure 3 that the scale decreases from the right to left.
Energies, G g and G r , obtained by the two methods are presented in Figure 3(a) -(b). One can see that the SOR method shows its stunning efficiency in this example. The obtained curves for the SOR method (pink curves) are almost flat in both subfigures, implying that the SOR method achieves its best approximations without requiring many iterations. In contrast, the NWT method (blue curves) behaves differently: it takes less iterations and achieves coarser approximations when the tolerance is large, and it takes more iterations and obtains finer approximations as the tolerance is smaller. The observed different convergent trends of these two methods can be explained using eqn. (17) - (18). The SOR method tends to add a "big" correction in each iteration to pull ϕ 0 n + 1 into the range of its best approximation as quickly as possible, so that it does not take too many iterations to attain its best approximation despite which tolerance is actually used. On the contrary, the NWT method adds a moderate correction in each iteration so that it takes more iterations to attain its best, and the approximations are observed to gradually approach to the best as the tolerance decreases. Another important observation on Figure 3(a) -(b) is that G r NW T is larger than G r SOR at tolerance = 1.0E-1 in Figure 3(b). Thus, it is not true that the NWT method always obtains smaller energies.
Differences and relative differences are presented in Figure 3(c) -(d). In both subfigures, all differences and relative differences are found to converge as the tolerance decreases. At the smallest tolerance = 1.0E-7, the differences of G g and G r are found to be as close as < 5 KT in Figure 3(c), and the relative differences are found to be as close as < 0.005% in Figure  3(d). CPU times of this series of benchmarks are omitted because they are consistent to what shown in Figure 2(e) -the SOR method is more time consuming than the SOR method in all tested cases.

Example 2.
Results obtained in the first example have provided some insights on the performance of the two methods. We continue to study these two methods for a blindly selected group of proteins. This group of proteins is composed of 15 dimers, and each of them consists of two monomers, namely monomer A and B. More energies, in addition to G g and G r , returned by DelPhi will be reported in this example. In particular, they will be used to calculate the binding energy, denoted by ΔG(bind), in this example. Two approaches were suggested in the work [34] to calculate the binding energy. The first approach (approach 1) calculates the electrostatic component of the binding energy from the total nonlinear grid energies of the complex, monomer A and B by ΔG 1 bind = G g complex − G g A − G g B , (19) and the second approach (approach 2) calculates the binding energy from partitioned energies by ΔG 2 bind = ΔG r + ΔG ρ + ΔG o + ΔG i + ΔG c . (20) where G g and G r again denote the total grid energy and the corrected reaction field energy, respectively, G ρ denotes the ρ ϕ * 2 term in solution, G 0 denotes the osmotic pressure term, G i denotes the direct ionic contribution inside the box, G c denotes the Coulombic energy, and ΔG ■ with the subscript ■ = r, ρ, o, i, c denotes corresponding partitioned energy similar to that defined in eqn. (19). Even though ΔG 1 bind and ΔG 2 bind are both used to approximate the exact binding energy ΔG bind , it has been pointed out in the work [34] that they are actually slightly different due to the fact that approach 1 does not fully cancel "artificial grid energy" arising from real charges partitioning onto the grids. respectively, and demonstrated in Figure 4. A couple of observations can be made on Figure 4. First of all, the two binding energies have the same trend as those obtained by the SOR method that ΔG 1 NWT bind (solid green curve) is always slightly larger than to ΔG 2 bind , as the scale increases. It is also interesting to point out another important observation, which is not shown in Figure 4. In the benchmarks of dimer 1fle, we observed that the SOR method is faster than the NWT method in most tested cases. However, there are a few cases in which the NWT method uses the default ω = 1.0 and converges without any issue, while the SOR method needs a smaller relaxation parameter, ω = 0.5, in order to converge. When it occurs, the SOR method takes significantly more iterations and becomes slower than the NWT method.
The next series of benchmarks was performed to calculate the binding energies at a fixed scale = 2.0 (the most commonly used scale in practice) for all 15 dimers. Results are presented in Figure 5.
In Figure 5( NWT bind ) are demonstrated on the right panel. By comparing each blue bar to its paired orange bar on both panels, one can see that the binding energies obtained by approach 1 are always larger than those obtained by approach 2 for all 15 proteins. It is the case for both SOR and NWT methods. Next, by comparing bars in the same color for each dimer on the left and right panels, one can see visible differences on the SOR-and NWT-generated binding energies. However, given the experiences achieved for dimer 1fle, it is reasonable to expect that these differences are going to diminish if a larger scale is used.
We are interested in seeing how much each individual partitioned energy contributes in the calculated binding energies. Taking ΔG 2 bind calculated by eqn. (20) in approach 2 as an example, the percentages of partitioned energies in the binding energy, defined as ΔG ■ /ΔG 2 bind × 100%, are shown in 5(b) for the SOR method, and Figure 5(c) for the NWT method, respectively. Percentages of two partitioned energies, ΔG r and ΔG c , are found to be significantly larger than those of other partitioned energies. Therefore, they are presented on the left panel and others are presented on the right panel in both Figure 5(b) -(c). In these subfigures, one can see that ΔG r and ΔG c are always in opposite signs for all 15 dimers, and their sum, ΔG r + ΔG c , contributes more than 90% of ΔG 2 bind , while the sum of the remaining three, ΔG ρ + ΔG o + ΔG i , contributes less than 10% of ΔG 2 bind , for all 15 dimers.
Moreover, by comparing corresponding energies, it is easy to see that the two methods, SOR and NWT, not only produce similar binding energy ΔG 2 bind as a sum of 5 partitioned energies, but also produce similar individual partitioned energy. These partitioned energies, except the partitioned Coulombic energy ΔG c , all depend on the potentials calculated via the SOR and NWT methods. It suggests that the two methods indeed produce close potentials for all 15 dimers.
Above experiments at scale = 2.0 were repeated at a doubled scale, scale = 4.0, and the differences shown in Figure (5) are found to be consistently smaller for all 15 dimers. It evidently shows that one can confidently relies on the energies produced by DelPhi using either method when the iteration process converges at the end. Moreover, we have observed more cases in which the SOR method requires smaller relaxation parameter to converge, while the NWT method has no such issue at all, in the cases tested at scale = 4.0. It inspires us to perform more tests to examine the stability of the two methods.

Example 3.
It has been observed in Example 2 that the SOR method may require smaller relaxation parameter in order to successfully converge in some cases, while the NWT method never has such issue. Out of abundance of caution, a "crashing" example is purposely created and examined to numerically verify that the NWT method is still able to converge even in some rare and extreme scenarios before we claim that the NWT is a strongly stable method for solving the NLPBE.
This example was tested with a fixed tolerance, TOL = 1.0E-4, and numerous scales ranging from 1.0 to 5.0. This example is believed to be "bizarre" that the iteration process of the SOR method can never be terminated by meeting the desired tolerance at all tested scales. The iteration process is hindered only after a few iterations when the differences of calculated potentials in two successive iterations are large at some grids, causing the SOR method relentlessly seek for smaller relaxation parameter ω to reduce these differences before moving forward to the next iteration. This effort repeats many times in each of the first several iterations and prevents the iterations progress properly towards the end. As a consequence, the SOR method fails to produce any energies in this example after waiting for a long time.
It is a completely different story for the NWT method. The NWT method merely uses the default ω = 1.0 and converges successfully in all tested cases. Energies produced by DelPhi running the NWT method are presented by a semi-log plot (the vertical axis is the logarithms of the absolute values of the energies) in Figure 6. One can see that all energies behave normally without any unanticipated outcomes.
Additional examples beside Example 3 have been tested as well and we have not seen one case that the NWT method fails to converge. The experiences we earned make us confidently claim that the newly developed NWT method is a reliable alternative to solve the NLPBE for problems with high nonlinearity. Meanwhile, bearing in mind that the SOR method is still more efficient in many cases, the SOR method is still recommended to solve the LPBE/NLPBE when no divergence issue takes place. In the cases that the SOR method has troubles to converge, one can immediately observe in DelPhi's outputs that the iteration stops progressing forward, the relaxation parameter becomes smaller, and the calculated tolerances get larger. It will be enough to tell that the SOR method is having troubles to converge, and it is advised to stop the program and switch to the NWT method.

Discussion and Conclusion
In this work, a newly developed Newton-like method is proposed. It has been implemented in the DelPhi program to solve the PBE for electrostatic potentials. It has been demonstrated that the NWT method is relatively slower, equally accurate, and more stable compared to the SOR method for solving the NLPBE. The merits of the new NWT method make it a valuable add-on to the DelPhi program. The NWT method is recommended to the computational molecular society to solve the NLPBE for problems with strong nonlinearity when other solvers have trouble to converge and deliver reliable solutions. Developments to improve the efficiency of the NWT method will be carried out and reported in the future.     DelPhi returned energies obtained by solving the NLPBE via the NWT method with a fixed tolerance = 1.0E-4 in Example 3.
Li et al.

Page 22
Math Biosci Eng. Author manuscript; available in PMC 2023 January 28.