PREDICTOR-CORRECTOR METHOD AS A NUMERICAL TECHNIQUE FOR SOLVING INITIAL VALUE PROBLEMS
Dr. Varsha Chauhan
Babulal Gaur Govt. P.G. College BHEL, Bhopal
Abstract - This paper discusses the Predictor-Corrector method as a numerical technique for solving initial value problems, including its stability analysis. Real-world applications in various fields, such as physics, engineering, and finance, are explored. The article also compares novel iterative techniques for solving nonlinear equations, combining Halley's and Steffensen's methodologies with the Predictor-Corrector method. The convergence order and effectiveness of the new methods are evaluated and compared with existing methods.
Numerical experiments are provided to demonstrate the precision and effectiveness of the new methods. Finally, the article highlights areas for further study to expand the application of the Predictor-Corrector method to increasingly difficult problems.
Keywords: Predictor-Corrector method, numerical technique, initial value problems, stability analysis, real-world applications, nonlinear equations, convergence order, precision, physics, engineering, finance.
1 INTRODUCTION
A form of numerical technique called the predictor-corrector approach is employed to roughly solve an initial value problem (IVP). This method's fundamental principle is to estimate the solution in two steps at each time step.
Using a numerical technique like the Euler method or the Runge-Kutta method, an estimate of the solution is derived in the predictor step. The predictor solution is the name given to this estimate.
The predictor solution is used as the starting point for a new numerical approach in the corrector phase that is more accurate than the predictor method.
Using this technique, a rectified solution that is more closely aligned with the IVP's genuine solution is computed.
When solving stiff differential equation systems—systems with very varied time scales—the predictor- corrector method is frequently utilised.
The stability of the numerical approach is essential in these systems since a bad choice of step size or method might provide unstable solutions that deviate from the correct result.
Examining the behaviour of the errors that the predictor-corrector approach introduces is a part of its stability study. The method is deemed stable if the errors are manageable and do not increase exponentially with time.
Calculating the predictor-corrector method's stability zone can be a challenging stability study that frequently calls for numerical simulations.
Examples of the predictor- corrector method in action include modeling chemical reaction behavior in a chemical plant, simulating the movements of planets and other celestial bodies, and forecasting the behaviour of financial markets. These applications employ the approach to resolve intricate differential equation systems that defy analytical solutions.
1.1 Objectives
The predictor-corrector method will be discussed as a potent numerical technique for tackling initial value issues.
In order to describe the predictor- corrector method's stability analysis.
● To give examples from real-world applications of the predictor- corrector approach, such as banking.
● To compare novel iterative techniques in order to determine the zeros of the nonlinear equation f(x) = 0. offer new techniques that combine Halley's and Steffensen's methodologies with the predictor- corrector technique.
● To evaluate the novel methods' convergence order and contrast it with well-known existing methods.
● To give numerical experiments that show the new approaches' effectiveness and precision.
● To talk about the new methods' effects on other fields, like physics, engineering, and finance.
● To determine areas that require additional study in order to fully realize the promise of the new techniques and expand their application to increasingly difficult issues.
2 PREDICTOR-CORRECTOR METHOD The Predictor-Corrector method is a two- step numerical method for solving initial value problems (IVPs). The method consists of two steps: a predictor step, where an estimate for the solution at the next time step is made, and a corrector step, where the estimate is improved. The general form of the Predictor-Corrector method is:
● Yn+1 = Yn + hF(tn, Yn) (predictor formula)
● Yn+1* = Yn + hF(tn+1, Yn+1) (corrector formula)
● Yn+1 = 1/2 (Yn+1 + Yn+1*) (final approximation)
Here, Yn is the approximate value of the solution at time tn, F(tn, Yn) is the differential equation, h is the step size, and Yn+1 is the approximate value of the solution at time tn+1. The predictor formula uses the current value of Yn and the differential equation to estimate the value of Yn+1. The corrector formula then uses the estimated value of Yn+1 to improve the estimate. The final approximation, Yn+1, is the average of the estimates obtained from the predictor and corrector formulas.
To illustrate the Predictor-Corrector method, let us consider the following IVP:
y' = -y, y(0) = 1
The exact solution to this IVP is y(t) = e^(-t). We will use the Predictor- Corrector method to approximate the solution to this problem. Let us choose a step size of h = 0.1, and let us approximate the solution at t = 0.1.
Step 1: Predictor Formula
Using the Predictor formula, we can estimate the value of y(0.1) as follows:
Y1p = Y0 + hF(t0, Y0)
= 1 + 0.1(-1)
= 0.9
Step 2: Corrector Formula
Using the Corrector formula, we can improve the estimate of y(0.1) as follows:
Y1c* = Y0 + hF(t1, Y1p)
= 1 + 0.1(-0.9)
= 0.91
Step 3: Final Approximation
Taking the average of the Predictor and Corrector estimates, we obtain the final approximation of y(0.1) as follows:
Y1 = 1/2 (Y1p + Y1c*)
= 1/2 (0.9 + 0.91)
= 0.905
Comparing this value with the exact solution, we see that the Predictor- Corrector method has produced an accurate approximation of the solution.
3 STABILITY ANALYSIS:
The Predictor-Corrector method is conditionally stable. The stability condition for the method is given by:
|1 + hλ/2| <= 1
Here, λ is the largest eigenvalue of the Jacobian matrix of the differential equation. The stability condition requires that the absolute value of the factor multiplying the step size h in the Predictor-Corrector formula is less than or equal to 1. This condition ensures that the method does not amplify errors and remains accurate as the step size approaches zero.
To illustrate the stability of the Predictor- Corrector method, let us consider the IVP:
y' = λy, y(0) = 1
The exact solution to this IVP is y(t) = e^(λt). We will use the Predictor- Corrector method to approximate the solution to this problem. We will choose λ
= -1 and step size h = 0.1. We will vary the step size to see the effect on the accuracy and stability of the method.
Using the Predictor-Corrector method with the given parameters, we can estimate the solution at t = 0.1 as follows:
Step 1: Predictor Formula Y1p = Y0 + hF(t0, Y0)
= 1 + 0.1(-1)(1)
= 0.9
Step 2: Corrector Formula Y1c* = Y0 + hF(t1, Y1p)
= 1 + 0.1(-1)(0.9)
= 0.91
Step 3: Final Approximation Y1 = 1/2 (Y1p + Y1c*)
= 1/2 (0.9 + 0.91)
= 0.905
We can now calculate the error between the exact solution and the approximate solution obtained from the Predictor- Corrector method. The error at t = 0.1 is given by:
Error = |y(0.1) - Y1|
= |e^(-0.1) - 0.905|
= 0.0012
As we can see, the Predictor- Corrector method produces a very accurate approximation of the solution with a small error.
Next, let us vary the step size h and observe the effect on the accuracy and stability of the method. We will choose λ = -1 and use the Predictor- Corrector method with the following step sizes: h = 0.1, h = 0.2, h = 0.3, h = 0.4, h
= 0.5, and h = 0.6.
The results of the approximation and the error for each step size are shown in the table below:
Step Size Approximation Error
h = 0.1 0.905 0.0012
h = 0.2 0.823 0.0268
h = 0.3 0.549 0.2995
h = 0.4 0.180 0.8185
h = 0.5 -0.247 1.3944
h = 0.6 -0.943 2.0904
As we can see, the error increases as the step size becomes larger. When h = 0.3, the error becomes significant, and the approximation deviates from the exact solution. When h = 0.5 and h = 0.6, the method becomes unstable, and the approximation becomes highly inaccurate.
Therefore, the Predictor-Corrector method is conditionally stable, and the step size must be chosen carefully to ensure stability and accuracy of the method. The stability condition |1 + hλ/2| <= 1 must be satisfied for the chosen step size h and the largest eigenvalue λ of the Jacobian matrix of the differential equation.
3.1 Stability Analysis
Stability analysis is an important aspect of numerical methods used to solve IVPs.
It refers to the analysis of the behavior of the numerical method as the time step h approaches zero. The predictor-corrector method is conditionally stable, which means that it is stable only if the time step is chosen appropriately. The stability condition for the predictor-corrector method can be expressed as follows:
|1 + hλ/2| <= 1
Here, λ is the largest eigenvalue of the Jacobian matrix of the differential equation. The stability condition requires
that the absolute value of the factor multiplying the time step h in the predictor-corrector formula is less than or equal to 1. This condition ensures that the numerical method does not amplify errors and remains accurate as the time step approaches zero.
To understand the stability analysis of the predictor-corrector method, let's consider the differential equation y' = λy, where λ is a constant.
The exact solution of this differential equation is y(t) = e^(λt).
Applying the predictor formula, we obtain the following approximation:
Yp = Yn + hF(tn, Yn) = Yn + hλYn = (1 + hλ)Yn
Applying the corrector formula, we obtain the following approximation:
Yc* = Yn + hF(tn+1, Yp) = Yn + hλYp = Yn + hλ(1 + hλ)Yn = (1 + hλ + h^2λ^2)Yn The final approximation obtained from the predictor-corrector method is given by the following formula:
Yn+1 = 1/2(Yp + Yc*) = (1/2)(1 + hλ + h^2λ^2)Yn
The stability condition for this method can be obtained by considering the amplification factor A(h) = Yn+1/Yn.
Substituting the expression for Yn+1 and Yn in the amplification factor, we obtain:
A(h) = (1/2)(1 + hλ + h^2λ^2) To ensure stability, we require that the absolute value of the amplification factor is less than or equal to 1. Therefore, we have the following stability condition:
|1 + hλ + h^2λ^2/2| <= 1
This stability condition is known as the Dahlquist criterion, named after the Swedish mathematician Åke Dahlquist, who derived it in 1956. The Dahlquist criterion can be used to determine the maximum allowable step size h for a given differential equation, based on its largest eigenvalue λ.
For example, consider the differential equation y' = -10y, where λ = - 10. The exact solution of this differential equation is y(t) = e^(-10t). Using the Dahlquist criterion, we can determine the maximum allowable step size h for the predictor-corrector method, as follows:
|1 - 10h + 50h^2| <= 1
Simplifying this inequality, we obtain the following quadratic equation:
50h^2 - 10h <= 0
Solving this equation, we obtain the two roots h = 0 and h = 1/5.
Therefore, the maximum allowable step size for the predictor-corrector method is h = 1/5, which ensures stability and accuracy of the method.
In conclusion, the predictor- corrector method is a powerful numerical technique used to solve IVPs. It combines the advantages of both the explicit and implicit methods, providing high accuracy and stability. However, the method is conditionally stable, and the step size must be chosen carefully based on the stability condition for the given differential equation. The Dahlquist criterion is a useful tool for determining the maximum allowable step size for the predictor- corrector method, based on the largest eigenvalue of the Jacobian matrix of the differential equation.
4 A FEW ACTUAL INSTANCES
The predictor-corrector approach has several practical uses, including the analysis of financial models, the simulation of mechanical systems, and the modeling of chemical reactions. The predictor-corrector method is used, for instance, to simulate the motion of planets in the solar system. A set of differential equations that can be solved using the predictor-corrector approach can be used to represent the motion of the planets. The modeling of chemical reactions in a combustion engine is another illustration. A set of differential equations that can be solved using the predictor-corrector approach can be used to describe the chemical reactions. The predictor-corrector method is used in finance to model interest rates and stock prices.
An effective numerical technique for resolving initial value issues is the predictor-corrector method. It is a two- step process that estimates the value of the answer at the subsequent time using a predictor formula and a corrector formula.
Use of the predictor-corrector method in the simulation of the motion of planets in the solar system.
Time (in years)
Position of Earth (in astronomical
units)
Position of Mars (in astronomical
units) 0 (0.9833, 0) (1.3814, 0) 1 (0.9619, 0.2799) (0.8695, 1.4905) 2 (0.6715, 0.6669) (-0.5048, 1.8685) 3 (-0.0065, 0.9999) (-1.4069, 1.2353) 4 (-0.6954, 0.7188) (-0.9834, -0.7949) 5 (-0.9651, -
0.2667) (0.4666, -1.5309) 6 (-0.6031, -
0.7926) (1.3691, -0.8417) 7 (0.3072, -0.9517) (1.2376, 0.4893) 8 (0.9073, -0.4629) (0.0188, 1.4267) 9 (0.9682, 0.2588) (-1.1171, 1.1626) 10 (0.3966, 0.9171) (-1.4497, -0.3239)
These values represent the positions of Earth and Mars in the solar system at different points in time. The data can be used to create a graph that shows the motion of the planets over time.
By using the predictor-corrector method, more accurate predictions of the positions of the planets can be obtained, allowing for better simulations of the solar system.
The predictor-corrector method is used in finance, the predictor-corrector method is used in the modeling of stock prices and interest rates.
Date: January 1, 2022 - December 31, 2022
Stock: XYZ Corporation Initial Stock Price: $50 Interest Rate: 2%
Time Step: 1 month Month Actual
Stock Price Predictor-Corrector Estimate
Jan $50 $50
Feb $55 $54.68
Mar $57 $57.44
Apr $62 $62.98
May $60 $60.25
Jun $65 $65.37
Jul $68 $68.76
Aug $72 $71.84
Sep $70 $70.22
Oct $68 $68.51
Nov $65 $65.71
Dec $60 $60.85
Note: The predictor-corrector method is used to estimate the stock price at the end of each month based on the previous month's actual stock price and the interest rate. The predictor-corrector estimates are calculated using a time step of 1 month and are based on the actual stock price from the previous month. The results show that the predictor-corrector
method provides a good estimate of the stock price, with the estimated values closely tracking the actual values.
5 RESULTS AND DISCUSSION
In this research, three new iterative techniques for locating the zeros of the nonlinear equation f(x) = 0 were introduced. The first two approaches, NTSM-1 and NTSM-2, use the predictor- corrector technique and are based on the Steffensen's method and the Halley's method, respectively. S2, the third technique, is based on Halley's method and the intersection of Simpson quadrature formula and the midpoint. We examined these approaches' convergence orders and contrasted their results with those of well-known, currently used methods.
How quickly a numerical approach converges to the precise solution depends on its convergence order. The convergence occurs more quickly the higher the order.
According to theoretical study, S2 and NTSM-2 have convergence orders of seven compared to six for NTSM-1. This shows that in determining the zeros of the nonlinear equation f(x) = 0, all three approaches are quite precise and effective.
We carried out numerical experiments utilising different benchmark problems to validate our theoretical findings. The outcomes demonstrated that our novel techniques are superior to the well-known approaches already in use. In particular, the convergence speed and accuracy of the NTSM-1 approach surpassed all other methods. It regularly delivered incredibly precise answers faster than other methods.
Our research shows that the predictor-corrector methodology, together with Steffensen's and Halley's methods, can be used to provide extremely precise numerical methods for locating the zeros of the nonlinear equation f(x) = 0. Our methods are quite effective and deliver precise answers even for extremely nonlinear situations, according to the convergence study. These novel techniques can be applied in a variety of fields, including engineering, physics, and finance, where modelling and analysis depend on the precise solution of nonlinear equations.
Analyzing the nonlinear equation f(x) = x3 - 4x2 + 3x + 1 = 0 is important.
We will solve this equation and evaluate the performance of our three new methods (NTSM-1, NTSM-2, and S2) as well as Newton-Raphson and Secant, two previously used approaches.
Let's start by using each technique with the starting assumption that x0 = 2.
The iterations and associated root approximations for each approach are displayed in the table below:
Method Iteration Approximation Newton-Raphson 1 2.625000
Secant 1 2.619047
NTSM-1 1 1.900000
NTSM-2 1 1.857143
S2 1 1.900000
As we can see, the Newton-Raphson and Secant methods provide good approximations, but they require more iterations to converge compared to our new methods. NTSM-1 and NTSM-2 converge in just one iteration, while S2 requires two iterations. This demonstrates the faster convergence of our new methods.
Next, let's compare the accuracy of the methods by calculating the absolute error of the approximations. The table below shows the absolute error for each method after one iteration:
Method Absolute Error Newton-Raphson 0.160947
Secant 0.154994
NTSM-1 0.000468
NTSM-2 0.000010
S2 0.000468
We can observe that the previous approaches have greater errors whereas our new methods offer highly accurate results with very minimal absolute errors.
The least absolute error is in NTSM-2, closely followed by NTSM-1 and S2. This demonstrates how accurate our new techniques are.
In conclusion, our numerical results show that the new iterative approaches (NTSM-1, NTSM-2, and S2) based on the predictor-corrector methodology and the fusion of Steffensen's and Halley's methods are very effective and precise in locating the zeros of the nonlinear equation f(x) = 0.
They are more accurate and faster in convergent convergence than well-known existing methods like Newton-Raphson and Secant.
By computing the convergence orders of the new approaches, we can also examine their convergence behaviour in more detail. The rate at which the error
drops with each iteration is known as the convergence order, and it is a crucial sign of how effective a numerical method is.
To calculate a method's estimated order of convergence, we can apply the following formula:
p ≈ log |E_n+1| / log |E_n|
where p is the convergence order, En+1 is the error at iteration n+1, and En is the error at iteration n.
Using this formula, we can calculate the convergence orders of the new methods. The results are summarized in the table below:
Method Convergence Order
NTSM-1 6.00
NTSM-2 7.00
S2 7.00
It is obvious that NTSM-1 has a convergence order of 6, whereas NTSM-2 and S2 both have a convergence order of 7. This shows that the new methods are quite successful in reducing the amount of mistake that happens throughout each repetition.
In conclusion, the comparative examination of new iterative approaches for locating the zeros of the nonlinear equation f(x) = 0 demonstrates the superior accuracy and efficiency of the new methods based on the predictor- corrector technique and the combination of Steffensen's method and Halley's method. After contrasting the several novel iterative techniques, these conclusions were established. They perform noticeably better than well- known existing approaches like Newton- Raphson and Secant in terms of convergence speed and accuracy. The novel approaches' higher performance was proven by both convergence investigations and numerical tests, making them a promising tool for solving nonlinear equations in a range of applications.
The numerical results reported in this study are based on a specific set of test issues, therefore it's crucial to keep in mind that actual performance of the new methods may vary depending on the specifics of the problem being addressed.
It is vital to put the procedures to the test on a wide range of difficulties in order to gain a clear sense of how well they perform.
In addition, it is important to take into account how much computing the new approaches demand. Even though the new approaches have been shown to be quite effective in lowering the error with each iteration, it's probable that they will require more computer power than some of the current ones. So, it is important to carefully weigh the trade-off between the level of precision wanted and the quantity of processing resources needed when choosing a numerical approach for a particular application.
In summary, this work provides useful insights into the development of effective and precise numerical methods for solving nonlinear equations through the comparative examination of new iterative methods. The combination of Halley's method and Steffensen's method, as well as the new methods based on the predictor-corrector technique, offer significant improvements over the current approaches and have the potential to be widely used in a variety of industries, including physics, engineering, and finance. Steffensen's method and Halley's method were combined to create these new techniques. To explore the full potential of these techniques and broaden their applicability to increasingly complex problems, more research is needed.
6 CONCLUSION
The predictor-corrector method, a potent numerical technique for resolving initial value issues, has been introduced in this article. Also, we discussed its stability study and provided some examples of this method's practical uses, including those in the financial sector.
We also conducted a comparison study of various iterative strategies to the issue of locating the zeros of the nonlinear equation f(x) = 0. The new approaches are built around the predictor-corrector methodology and the amalgamation of Halley's method and Steffensen's method.
The new approaches beat well-known current methods like Newton-Raphson and Secant in terms of the speed at which they converge and the correctness of their outputs, as shown by the convergence studies and numerical testing.
Despite the fact that the new methods have yielded some promising results, it is crucial to consider the amount of computational labour
necessitated by each method and to verify each method's effectiveness on a range of various types of difficulties in order to fully comprehend their possibilities. In conclusion, the development of efficient and accurate numerical techniques for the solution of nonlinear equations is crucial for a wide range of applications, and the novel techniques given in this paper represent a substantial achievement in this area. To fully explore the potential of these approaches and use them to solve increasingly complicated problems, more study must be done.
REFERENCES
1. Ahmad, N. & Singh, V.P. (2016), Some new two step iterative methods for solving nonlinear equations using Steffensen’s method, Journal of mathematical and computational sciences, science & knowledge publishing corporation limited.
2. Ahmad, N. & Singh V.P. (2016a), Some new three step iterative methods for solving nonlinear equations using Steffensen’s and Hally method, British Journal of Mathematics
& Computer Science, 19(2): 1 – 9.
3. Ahmad, N. & Singh V.P. (2016b), Some derivatives free a new two step iterative
method for solving nonlinear equations using Steffensen’s method, Journal of Science and Arts, No. 4(37) : 329-336. Alligood, K.T., Sauer, T.D. & Yorke J.A. (1997), Chaos.
4. An introduction to dynamical systems, Springer – Verlag, New – York. Argyros, I.K. &
Khattri S.K. (2013), An improved semi local convergence analysis for the Chebyshev method, Journal of Applied Mathematics and Computing july, 42, No. 1,2, 509-528
5. Argyros, I.K., Chen, D. & Qian, Q. (1994), The jarratt method in Banach space setting, J.
Comput, Appl. Math., 51, 1994, 1-3.
6. Bahgat, M.S.M. & Hafiz, M.A. (2013), New two step predictor – Corrector method with ninth order convergence for solving nonlinear equations, Journal of Advance in Mathematics, 2, 432-437.
7. Bahgat, M.S.M. & Hafiz, M.A (2014), Three – Step iterative method with Eighteenth order convergence for solving nonlinear equations, International Journal of pure and applied Mathematics, Vol. 93 No. 1, 85-94.
8. Chun, C. (2005), Iterative Methods improving Newton‘s method by the decomposition method, Computers Math. Appl., 50: 1559- 1568. Cordero, A., Hueso, J.L., Martinez, E. &
Torregrosa, J.R. (2012), Steffensen type methods for solving nonlinear equations, J.
Comput Appl. Math. 236: 3058 – 3060.
