Graphical abstract
Method name: Finite Element Method, MSC: 92D25, 35K57 (primary), 35K61, 37N25
Keywords: Complex differential equations, Taylor polynomials, Galerkin method, Residual error correction
Abstract
The Galerkin approach for numerically resolving higher-order Complex Differential Equations (CDEs) in a rectangular domain in the complex plane is presented in this work. Taylor polynomial functions are used in this method as basis or weighted functions. The CDE is converted into a matrix equation by employing the proposed method. A system of linear and nonlinear equations with unknown Taylor coefficients for linear and nonlinear CDEs, respectively, is represented by the resultant matrix equation. Results pertaining to this method’s error analysis are discussed. The existing Taylor and Bessel Collocation methods are compared with the numerical results of the proposed method for linear CDEs, and the existing exact solutions and numerical results of the proposed method for nonlinear CDEs are also compared. The comparative results are displayed graphically for the real () and imaginary () parts, respectively, as well as in tabular form containing absolute error and maximum absolute error . The methodology of this study focused on the Galerkin integral domain which is a rectangle shape in the complex plane and Taylor polynomial is the shape function. Matrix formulation procedure and iterative technique are implemented to find out the undetermined Taylor coefficients.
Specifications table
| Subject area: | Mathematics and Statistics |
| More specific subject area: | Describe narrower subject area |
| Name of your method: | Finite Element Method |
| Name and reference of original method: | Galerkin method using Taylor Polynomial |
| Resource availability: | N.A. |
Background
CDEs are prominent in quantum research and engineering. When a model based on mathematics is created to address a real-world physical phenomenon, it takes the shape of CDEs. By way of illustration, differential equations with a complex dependent variable are commonly used to explain the vibrations of a one-mass system with two degrees of freedom [1], [2]. In [2], [3], provides an overview of the various applications for complex dependent variables of differential equations. However, analytic techniques alone cannot provide a perfect solution. To overcome this challenge, numerical methods must be applied.
In the last few years, extensive research has been conducted on CDEs. Some of these studies include a geometric method in any domain that is based on meromorphic functions [4], a topological explanation of certain CDE solutions involving multi-valued coefficients [5], the complex oscillation of some linear CDE [6], the growth estimates of linear CDE [7], analytic functions in the complex plane: the polynomial and rational approximations [8], [9], the linear differential equations’ meromorphic solutions [10], -order linear differential equations in the complex plane [11], a higher-order periodic linear differential equation problem [12], on complex domain the solution of IVP for retarded differential equations [13], an analytic method for the non-linear CDEs [14], the solution growth of algebraic systems of nonlinear CDEs [15], and also on meromorphic solutions and entire solutions by julia limiting directions and some function spaces solutions for the nonlinear CDEs have been studied in [16], [17], [18], [20], [21]. The following equation is a representation of the generalized order CDE with complex variable coefficients.
| (1) |
where is the complex variable, and are the analytic functions in the following rectangular domain of the complex plane
Eq. (1) is a general CDE written down in derivative form given [6], [7], [8], [9], [19], [22], [23], with the following mixed conditions
| (2) |
where and are suitable real or complex constants;
Recently, solutions of CDEs have been estimated using numerous numerical techniques. For instance, Taylor Collocation approach for operational matrix method [22], [23], [24], Bessel polynomials method [25], Legendre polynomial method [26], [27], Euler polynomials method [28], orthogonal Bernstein polynomials method [29], Fibonacci polynomials method [30], Bernoulli polynomials method [31], and Hermite polynomials method [32], [33].
One of the most renowned weighted residual numerical methods for solving differential equations is the Galerkin method, which performs a significant role in the solution of differential equations numerically. For instance, the Galerkin method of Wavelet, Chebyshev, Taylor, Petrov, Legendre, Hermite, Bernstein, Exponential B-splines, and Bernoulli has been used to solve differential equations [34], [35], [36], [37], [38], [39], [40], integral and integro-differential equations [41], Volterra integro-differential equations [42], Fredholm integro-differential equations [43], eigenvalue problems [44], delay differential equations [45], [46], [47], Burger’s differential equations [48], KdV equations [49], nonlinear partial differential equations [50], [51], [52], and perturbed partial differential equations [53].
It has come to our attention that the previous research has not applied the Galerkin method for the numerical solution of CDEs. Since there is a research gap in this field, we presented a new technique for solving CDEs called the Taylor Galerkin Method (TGM). TGM uses Taylor series expansions for discretization, resulting in higher-order precision in temporal integration. This is especially useful for applications needing precise temporal resolution. TGM may successfully address nonlinear differential equations by adding Taylor expansions, which better represent nonlinear term behavior. While TGM can achieve high accuracy, it may incur additional computational costs due to the necessity for higher-order derivatives and the complexity of the numerical implementation. The collocation method is directly evaluating the governing equations at specific collocation points. The method can have lower computational overhead and cost for certain problems, especially when using fewer basis functions. However, this method can struggle with problems that involve sharp gradients or discontinuities, as the collocation points may not adequately capture local behavior. Poorly chosen points can lead to suboptimal convergence and inaccuracies. It can produce non-unique solutions, particularly when dealing with ill-posed problems or insufficiently defined basis functions. Both methods may encounter difficulties with boundary conditions, particularly for complicated geometries or where exact enforcement is required. However, TGM can be applied to a variety of spatial discretization techniques, including both structured and unstructured domains, increasing its application to a wide range of issues.
When dealing with complex shapes or domains, the TGM uses finite element discretization, which is highly flexible in terms of geometry. The domain (shape) is subdivided into smaller elements, and the method solves the problem over these elements using basis functions that are defined locally on each element. In this method, boundary conditions must be incorporated into both the time-stepping scheme (via the Taylor expansion) and the spatial discretization (Galerkin method).
The immediate and a sample error analysis results are focused on Fig. 1. For a particular problem and the same number of basis functions, under those conditions TGM achieves higher-order accuracy by incorporating derivatives of the solution, which can significantly reduce error in the approximation, especially in smooth regions of the solution. On the other hand, since the Collocation method directly evaluates the governing equations at specific collocation points and the number of points is insufficient or poorly distributed, particularly near discontinuities or sharp gradients, it leads to larger errors.
Fig. 1.
Visual depiction of the absolute error analysis for ( part).
The objective we set in the present research is to obtain an approximate solution of equation (1) and subject to the condition Eq. (2), and want to express in terms of degree Taylor polynomial in the following form; at the point ,
| (3) |
where the unidentified Taylor coefficients are to be determined. We will find out the unknown coefficients of the Eq. (3) by the proposed approach TGM. Since the proposed method is based on a Taylor series expansion, it may inherently handle higher-order derivatives more naturally than some other methods. This could lead to increased accuracy when approximating solutions that involve high spatial or temporal gradients. Computational complexity for the present method can grow rapidly, especially for multi-dimensional problems or when higher-order derivatives need to be accounted for. This could lead to a significant increase in memory allocation and high process time requirements, making TGM less efficient for very large-scale or real-time applications.
TGM needs to carefully handle boundary conditions (e.g., Dirichlet, Neumann, or mixed) for CDEs. Since the solution is complex-valued, both the real () and imaginary () parts must satisfy the boundary conditions.
Method details: Phase 1
At first, we consider the approximate solution and its derivative in the following form [22], [24],
| (4) |
and
| (5) |
where are considering the basis function for TGM.
We first gather every term in the CDE (1) on the left side to get the residual function [34], [35]. Now we substitute the relation (5) into the Eq. (1), then we obtain the corresponding residual function of as follows,
| (6) |
We have to do to get a weighted residual is multiply the integral over the residual’s domain by a weighting function ,
By choosing weight functions, for ; and to find out the unknown coefficients of Eq. (3), we have to solve equations that result from putting these weighted residuals to zero.
The weighted residual for is defined as follows
| (7) |
Since the weighted residual method requires [36], [39], [40], [45]
That implies
| (8) |
The main task of the TGM is to match the weight functions to the basis functions of the approximate solution . That is,
| (9) |
Now, by substituting the Eq. (6) and (9) into the Eq. (8), then the Galerkin weighted residual equations or simply the Galerkin equations are [37], [43]
| (10) |
The Eq. (10) can be written in conventional matrix form as follows,
| (11) |
where
| (12) |
and
| (13) |
and
| (14) |
The appropriate matrix configuration for the mixed conditions (2) can be obtained in the following manner [23], [25],
| (15) |
The Eq. (15) can be written in conventional matrix form as follows,
| (16) |
where
| (17) |
Method details: Phase 2
The augmented matrix form of Eq. (11) becomes [22], [24]
| (18) |
which contains rows.
The augmented matrix form of Eq. (16) yields
| (19) |
which contains rows.
Thus, it is possible to determine the unidentified Taylor coefficients , associated with the equivalent solution of the problem (1), which is composed of Eq. (11) and conditions (16), by swapping the row matrices (19) out the last rows of the augmented matrix (18). We have the new augmented matrix form as follows [23], [25],
| (20) |
or, the equivalent matrix equation
| (21) |
If we can rewrite the Eq. (21) as
| (22) |
and it is unique to determining the column matrix which is the unknown coefficient of the Taylor polynomial (3).
Therefore, there exists a unique solution to the order linear CDE with variable coefficients under the given conditions. For nonlinear CDE, we construct a nonlinear system of equations with undetermined Taylor coefficients. We can solve this nonlinear system of equations numerically by well-known iterative techniques such as Newton’s Method, Levenberg-Marquardt, and Broyden’s Method [54], [55]. For a better approximation, we have to increase the degree of polynomial (3).
Method validation: based on error analysis
In this section, by using the residual function of the order CDE provided by Eq. (1), we estimate the error for the proposed method. Next, we demonstrate how to use this estimation to improve the approximate solution of the equation, known as the corrected solution. Finally, the Taylor theorem is utilized to determine an error bound on the corrected solution’s error [45], [46], [47]. Let us consider the residual function of Eq. (1) as follows:
| (23) |
Now substitute the approximate solution in place of to the Eq. (23), we get
| (24) |
as the residual function of . Subtracting Eq. (23) from Eq. (24), we obtain
| (25) |
which is just as Eq. (1) with non-homogeneous term instead of and is restored by . Since the approximate solution also assure the mixed condition (2), we obtain the corresponding homogeneous condition
| (26) |
This is the mixed condition of the Eq. (25). Now using the solution method described in Method details: Phase 1 and Method details: Phase 2 section to obtain an approximation solution to Eq. (25), where is any positive integer. Lastly, we apply this approximation to obtain the approximate corrected solution for Eq. (1), which is given by
| (27) |
where the actual error of is given by .
In the following theorem, the truncation error of the Taylor expansion for the exact solution of Eq. (1) is used to evaluate the error bound for the approximate solution .
Theorem 1
Letbe the approximate solution andbe the exact solutions ofEq. (1). Ifhastimes continuous derivative, then the error bound for the absolute error is given by
Wheredenotes thedegree Taylor polynomial ofaround the pointandrepresents its Cauchy form remainder term[46].
Proof
The Taylor series can be rewritten with reminder term of around the point as
Where
is the Cauchy form reminder term of the Taylor expansion of and this contour integral is evaluated around the circle which centered at , such that [19]. Consequently, . By using this in conjunction with the triangle inequality, we get
As a result, we have located an upper bound for the absolute error based on the Taylor truncation error of the exact solution. □
Method validation: based on numerical data
This section will demonstrate the numerical solution of three linear and two nonlinear CDEs by applying the proposed method. Nonlinear CDEs often involve terms like products of the unknown solution or its derivatives, which complicate both the iterative solution and error correction. The Newton-Raphson or Picard iteration methods are used to decouple these nonlinear terms at each iteration. All results are presented numerically, along with the exact solution and comparison. Since the degree polynomial (3) is an approximate solution of Eq. (1), when the approximation solutions and exact solution are substituted in the following equation, we can evaluate the absolute errors at the subsequent particular points within the specified domain; that is, for
| (28) |
The absolute error diminishes when grows to a significant size.
We can also evaluate the maximum absolute error as follows:
| (29) |
Example 1
Let us examine the second-order non-homogeneous CDE that is linear and has variable coefficients [24], [25],
(30) Where and subject to the initial conditions are
(31) The corresponding transcendental entire solution of Eq. (30) is and now consider an approximate solution by the degree Taylor polynomial at in the following form
(32) Thus, we have and
Assume the Galerkin integral domain . From Eq. (18), we obtain the augmented matrix by using Eq. (12) and (13) as follows:
.
From Eq. (19), the augmented matrix form for the initial condition (31) is
From Eq. (20), we obtain the new augmented matrix form by applying the initial condition as follows:
.
Here, and so by solving the linear system of equations , the unknown Taylor coefficients become
Therefore, the approximate solution (32) of Eq. (30) is
Similarly, we can also calculate the approximate solution of Eq. (30) for That is
For the tabular comparison and for the graphical comparison, the absolute error produced by the present method is compared with the outcomes generated by the Taylor Collocation method [24] and the Bessel Collocation method [25] are shown in Table 1 and in Fig. 2 for part, and in Table 2 and in Fig. 3 for part.
Example 2
Let us examine the second-order non-homogeneous CDE that is linear and has variable coefficients [24], [25],
(33) Where and subject to the initial conditions are
(34) The corresponding transcendental entire solution of Eq. (33) is Assume the Galerkin integral domain . For , by applying the proposed method discussed in Method details: Phase 1 and Method details: Phase 2 section, we obtain the approximate solution of the problem (33) is
Table 1.
Absolute error analysis of Example 1 ( part) for .
Fig. 2.
Visual depiction of the absolute error analysis of Example 1 for ( part).
Table 2.
Absolute error analysis of Example 1 ( part) for .
Fig. 3.
Visual depiction of the absolute error analysis of Example 1 for ( part).
Similarly, we can also calculate the approximate solution of Eq. (33), we have
For the tabular comparison and for the graphical comparison, the absolute error produced by the present method is compared with the outcomes generated by the Taylor Collocation method [24] and the Bessel Collocation method [25] are shown in Table 3 and in Fig. 4 for part, and in Table 4 and in Fig. 5 for part. From the above discussion, the tables and the figures claim more approximation accuracy of the proposed method than the mentioned methods.
Example 3
Let us examine the fourth-order non-homogeneous CDE that is linear and has variable coefficients [25],
(35) Where and subject to the conditions are
(36) The corresponding exact solution is a fourth-degree polynomial that is .
Assume the Galerkin integral domain .
Table 3.
Absolute error analysis of Example 2 ( part) for .
Fig. 4.
Visual depiction of the absolute error analysis of Example 2 for ( part).
Table 4.
Absolute error analysis of Example 2 ( part) for .
Fig. 5.
Visual depiction of the absolute error analysis of Example 2 for ( part).
For , by applying the proposed method discussed in Method details: Phase 1 and Method details: Phase 2 section, we obtain the required augmented matrix as follows:
By solving the above matrix for unknown coefficients, then the coefficients become
Therefore, the approximate solution of the Eq. (35) becomes
Example 3 demonstrates how the approximate outcomes generated by the proposed method match perfectly the exact solution of the CDE if the exact solution of the CDE is in the degree or less than degree polynomial form.
Example 4
Let us examine the second-order non-linear non-homogeneous CDE [18],
(37) where subject to the initial conditions are
(38)
Corresponding exact transcendental entire solution is .
Now consider an approximate solution by the degree Taylor polynomial at in the following form
| (39) |
Thus, we have and .
Assume the Galerkin integral domain,
Since the problem (37) is a non-linear CDE, from Eq. (11) we obtain the corresponding system of a nonlinear equation in the matrix equation as
| (40) |
where
and
By applying the initial condition (38) on the Eq. (40) with the help of Eq. (16), we obtain
| (41) |
where
and
By solving the system of nonlinear Eq. (41), the unknown Taylor coefficients become
Therefore, the approximate solution (39) of Eq. (37) is
Similarly, we can also calculate the approximation solution of Eq. (37) for These are
and
For the absolute error generated by the present method are shown in Table 5 and in Fig. 6 for part, and in Table 6 and in Fig. 7 for part.
Example 5
Let us examine the second-order non-linear non-homogeneous CDE [16],
(42) where subject to the initial conditions are
(43)
Table 5.
Absolute error analysis of Example 4 ( part) for .
| Absolute error analysis ( part) |
|||
|---|---|---|---|
| part) | part) | part) | |
| -1.00-1.00i | 9.12210175 | 4.31795313 | 1.94703639 |
| -0.90-0.90i | 8.80103073 | 4.08792338 | 1.70246213 |
| -0.80-0.80i | 8.10764674 | 3.61981716 | 1.58242201 |
| -0.70-0.70i | 7.11610504 | 3.01161415 | 1.43632273 |
| -0.60-0.60i | 5.91154570 | 2.34654142 | 1.19582451 |
| -0.50-0.50i | 4.58883571 | 1.69319919 | 8.75903101 |
| -0.40-0.40i | 3.25096110 | 1.10572163 | 5.40924242 |
| -0.30-0.30i | 2.00733527 | 6.23946022 | 2.62331769 |
| -0.20-0.20i | 9.72194476 | 2.73573224 | 8.50546983 |
| -0.10-0.10i | 2.63162954 | 6.63111334 | 1.08762437 |
| 0.00+0.00i | 0.00000 | 0.00000 | 0.00000 |
| 0.10+0.10i | 3.03492628 | 5.87231509 | 1.28267091 |
| 0.20+0.20i | 1.29442785 | 2.12909765 | 9.42271958 |
| 0.30+0.30i | 3.09256497 | 4.19437644 | 2.88109773 |
| 0.40+0.40i | 5.81552821 | 6.21743947 | 5.99544406 |
| 0.50+0.50i | 9.57755383 | 7.49950482 | 9.93196530 |
| 0.60+0.60i | 1.44880552 | 7.21007195 | 1.40995803 |
| 0.70+0.70i | 2.06500185 | 4.38852617 | 1.80054017 |
| 0.80+0.80i | 2.81583105 | 2.05416962 | 2.16778545 |
| 0.90+0.90i | 3.70980714 | 1.33338671 | 2.60059321 |
| 1.00+1.00i | 4.75434564 | 3.07919747 | 3.27285753 |
| 4.75434564 | 4.31795313 | 3.27285753 | |
Fig. 6.
Visual depiction of the absolute error functions with the present method of Example 4 for ( part).
Table 6.
Absolute error analysis of Example 4 ( part) for .
| Absolute error analysis ( part) |
|||
|---|---|---|---|
| part) | part) | part) | |
| -1.00-1.00i | 7.27147628 | 5.58946462 | 7.43492113 |
| -0.90-0.90i | 9.01205576 | 3.82972581 | 6.96983381 |
| -0.80-0.80i | 9.57821070 | 2.49380915 | 6.54712150 |
| -0.70-0.70i | 9.20556334 | 1.51678245 | 5.70944575 |
| -0.60-0.60i | 8.13112453 | 8.36991376 | 4.47654187 |
| -0.50-0.50i | 6.59110889 | 3.96277885 | 3.08486537 |
| -0.40-0.40i | 4.81954325 | 1.40119408 | 1.80656303 |
| -0.30-0.30i | 3.04760098 | 1.76954077 | 8.41035673 |
| -0.20-0.20i | 1.50353289 | 1.81057099 | 2.66155254 |
| -0.10-0.10i | 4.13047212 | 1.07245975 | 3.43966990 |
| 0.00+0.00i | 1.72234447 | 6.49808461 | 1.18191659 |
| 0.10+0.10i | 4.87276214 | 2.22568680 | 3.47874091 |
| 0.20+0.20i | 2.09776082 | 1.10403465 | 2.64474268 |
| 0.30+0.30i | 5.05530986 | 2.94028477 | 8.25089107 |
| 0.40+0.40i | 9.58563157 | 5.99489123 | 1.74793787 |
| 0.50+0.50i | 1.59169768 | 1.04998019 | 2.93244181 |
| 0.60+0.60i | 2.42805188 | 1.66557203 | 4.15000569 |
| 0.70+0.70i | 3.49102846 | 2.46320368 | 5.09280062 |
| 0.80+0.80i | 4.80424886 | 3.45661622 | 5.48220135 |
| 0.90+0.90i | 6.39141418 | 4.65621372 | 5.24981520 |
| 1.00+1.00i | 8.27608664 | 6.06884467 | 4.79783556 |
| 8.27608664 | 6.06884467 | 7.43492113 | |
Fig. 7.
Visual depiction of the absolute error functions with the present method of Example 4 for ( part).
Corresponding exact transcendental entire solution is . Assume the Galerkin integral domain,
Since all the left terms of the problem (42) are non-linear, for better approximation we have to apply a higher degree Taylor polynomial (3). By applying the proposed method and working like the previous problem Example 4, we obtain the approximate outcomes for various values of as follows,
and
Now for the absolute error generated by the present method are shown in Table 7 and in Fig. 8 for part, and in Table 8 and in Fig. 9 for part.
Table 7.
Absolute error analysis of Example 5 ( part) for .
| Absolute error analysis ( part) |
|||
|---|---|---|---|
| part) | part) | part) | |
| -1.00-1.00i | 4.04211484 | 5.46973308 | 8.17365239 |
| -0.90-0.90i | 2.43011014 | 5.13235575 | 7.10864263 |
| -0.80-0.80i | 1.27495547 | 4.47224516 | 5.91143240 |
| -0.70-0.70i | 5.00375561 | 3.64450535 | 4.52687224 |
| -0.60-0.60i | 3.26081238 | 2.77220908 | 3.11176527 |
| -0.50-0.50i | 1.99062140 | 1.94813171 | 1.86293963 |
| -0.40-0.40i | 2.61718651 | 1.23699396 | 9.21692603 |
| -0.30-0.30i | 2.18178852 | 6.78196884 | 3.35881162 |
| -0.20-0.20i | 1.26314005 | 2.89017748 | 6.23900354 |
| -0.10-0.10i | 3.83277158 | 6.82186967 | 5.58258273 |
| 0.00+0.00i | 0.000000 | 0.0000000 | 0.0000000 |
| 0.10+0.10i | 4.99059643 | 5.82071389 | 3.95317573 |
| 0.20+0.20i | 2.18620755 | 2.10675218 | 1.99906117 |
| 0.30+0.30i | 5.27925309 | 4.23565379 | 4.98925287 |
| 0.40+0.40i | 9.90030631 | 6.65515886 | 8.98798595 |
| 0.50+0.50i | 1.60684186 | 9.11395386 | 1.32493224 |
| 0.60+0.60i | 2.36928720 | 1.14540761 | 1.69648901 |
| 0.70+0.70i | 3.25674085 | 1.36325560 | 1.95991325 |
| 0.80+0.80i | 4.23657367 | 1.57302960 | 2.11223200 |
| 0.90+0.90i | 5.26386952 | 1.79443689 | 2.19632988 |
| 1.00+1.00i | 6.28135051 | 2.05594357 | 2.24560538 |
| 6.28135051 | 5.46973308 | 8.17365239 | |
Fig. 8.
Visual depiction of the absolute error functions with the present method of Example 5 for ( part).
Table 8.
Absolute error analysis of Example 5 ( part) for .
| Absolute error analysis ( part) |
|||
|---|---|---|---|
| part) | part) | part) | |
| -1.00-1.00i | 1.03611560 | 6.01045938 | 1.41528255 |
| -0.90-0.90i | 8.06736405 | 4.54161578 | 2.00690619 |
| -0.80-0.80i | 6.12934359 | 3.20963001 | 2.70031006 |
| -0.70-0.70i | 4.51415193 | 2.09823648 | 3.04581051 |
| -0.60-0.60i | 3.19141665 | 1.24304057 | 2.93049274 |
| -0.50-0.50i | 2.13331451 | 6.42316081 | 2.43897582 |
| -0.40-0.40i | 1.31448920 | 2.67192486 | 1.74573442 |
| -0.30-0.30i | 7.11896499 | 7.11149655 | 1.03758386 |
| -0.20-0.20i | 3.04564010 | 1.54952933 | 4.63952780 |
| -0.10-0.10i | 7.32518528 | 7.89612721 | 1.11648744 |
| 0.00+0.00i | 1.35958319 | 1.36716890 | 1.92160585 |
| 0.10+0.10i | 6.75470769 | 1.97194680 | 9.15710610 |
| 0.20+0.20i | 2.58605042 | 9.49403187 | 3.13146474 |
| 0.30+0.30i | 5.54973870 | 2.37420107 | 5.81407275 |
| 0.40+0.40i | 9.36480383 | 4.42390989 | 8.27745943 |
| 0.50+0.50i | 1.37972574 | 6.90075890 | 1.01704221 |
| 0.60+0.60i | 1.85662695 | 9.49264756 | 1.15602408 |
| 0.70+0.70i | 2.33273893 | 1.18308464 | 1.28814242 |
| 0.80+0.80i | 2.76534578 | 1.35707846 | 1.47377576 |
| 0.90+0.90i | 3.10131223 | 1.44968166 | 1.75714220 |
| 1.00+1.00i | 3.27468967 | 1.46515281 | 2.12461960 |
| 1.03611560 | 6.01045938 | 3.04581051 | |
Fig. 9.
Visual depiction of the absolute error functions with the present method of Example 5 for ( part).
Conclusion
To solve the high-order linear and nonlinear CDEs analytically, is a challenging task. To solve numerically, we provide the TGM in a rectangular domain, and based on the Taylor polynomials. A fascinating feature of the suggested method is its ability to yield precise results in instances when the linear CDE has an exact solution that is represented by a polynomial of degree or less than . For the linear CDE, the tabular and graphical comparisons reveal that the method we suggested is more accurate and stable than the existing Collocation method. For the nonlinear CDE, our proposed method goes to the accurate solution when is sufficiently large enough. Those reveal the validity of our proposed method but it comes with greater computational complexity due to the need to compute higher-order terms.
In the future, we will demonstrate the practical use of the TGM for solving CDEs in real-life problems. For example, the well-known Schrödinger equation in quantum mechanics is a CDE used to describe the behavior of particles at the atomic level.
Present work can also be completed utilizing the Haar Wavelet, Petrov-Galerkin, finite difference, and compact finite difference computations. With a few adjustments, the suggested method can be applied to fractional order CDEs and the system of CDEs with variable coefficients.
Ethics statements
This article does not contain any studies with human or animal participants.
CRediT author statement
The author reviewed the results and approved the final version of the manuscript.
Funding
This research received no external funding.
Declaration of competing interest
The author declares that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Acknowledgments
The author M. Shafiqul Islam acknowledged the University Grants Commission (UGC), and the University of Dhaka, Bangladesh for supplementary support of this research.
Data Availability
Data will be made available on request.
References
- 1.Cveticanin L. Free vibration of a strong non-linear system described with complex functions. J. Sound Vibr. 2004;277:815–824. [Google Scholar]
- 2.Cveticanin L. Approximate solution of a strongly nonlinear complex differential equation. J. Sound Vibr. 2005;284:503–512. [Google Scholar]
- 3.A.K. Joohy, Ordinary complex differential equations with applications in science and engineering, 2018. ArXiv preprint arXiv:1805.03201.
- 4.Barsegian G. Taylor & Francis; New York, NY, USA.: 2002. Gamma Lines: On the Geometry of Real and Complex Functions. Asian Mathematics Series. [Google Scholar]
- 5.Barsegian G., Le D.T. On a topological description of solutions of complex differential equations. Complex Var. 2005;50:307–318. [Google Scholar]
- 6.Ishisaki K., Tohge K. On the complex oscillation of some linear differential equations. J. Math. Anal. Appl. 1997;206:503–517. [Google Scholar]
- 7.Heittokangas J., Korhonen R., Rattya J. Growth estimates for solutions of linear complex differential equations. Ann. Acad. Sci. Fenn. Math. 2004;29:233–246. [Google Scholar]
- 8.Andrievskii V. Polynomial approximation of analytic functions on a finite number of continua in the complex plane. J. Approx Theory. 2005;133:238–244. [Google Scholar]
- 9.Prokhorov V.A. On best rational approximation of analytic functions. J. Approx. Theory. 2005;133:284–296. [Google Scholar]
- 10.Cao T.B., Xu J.F., Chen Z.X. On the meromorphic solutions of linear differential equations on the complex plane. J. Math. Anal. Appl. 2010;364:130–142. [Google Scholar]
- 11.Liu J., Tub J., Shi L.Z. Linear differential equations with entire coefficients of [p,q]-order in the complex plane. J. Math. Anal. Appl. 2010;372:55–67. [Google Scholar]
- 12.Lipeng X., Zongxuan C. On a problem in complex oscillation theory of periodic higher order linear differential equations. Acta Math. Sci. 2010;30B(4):1291–1300. [Google Scholar]
- 13.Rizk M.M. Approximate solution of initial-value problem for retarded differential equations on complex domain. Comput. Math. Appl. 1995;30(8):19–27. [Google Scholar]
- 14.Cveticanin L. Analytic approach for the solution of the complex-valued strong non-linear differential equation of duffing type. Phys. A. 2001;297:348–360. [Google Scholar]
- 15.Lingyun G. The growth of solutions of systems of complex nonlinear algebraic differential equations. Acta Math. Sci. 2010;30B(3):932–938. [Google Scholar]
- 16.Chen J.F., Feng Y.Y. On meromorphic solutions of nonlinear complex differential equations. Anal. Math. 2023;49(3):699–719. [Google Scholar]
- 17.Wang J., Yao X., Zhang C. Julia limiting directions of entire solutions of complex differential equations. Acta. Math. Sci. 2021;41B(4):1275–1286. [Google Scholar]
- 18.Sun Y., Long J., Hu G. Nonlinear complex differential equations with solutions in some function spaces. Complex Var. Elliptic Equ. 2018:300–314. [Google Scholar]
- 19.Speigel M.R. McGraw-Hill; New York: 1972. Theory and Problems of Complex Variables. [Google Scholar]
- 20.Lima S.A., Islam M.S., Ali H., Kamrujjaman M. Numerical method to solve generalized nonlinear system of second order boundary value problems: Galerkin approach. Adv. Theory Nonlinear Anal. Appl. 2023;7(2):280–291. [Google Scholar]
- 21.Lima S.A., Kamrujjaman M., Islam M.S. Numerical solution of convection-diffusion-reaction equations by a finite element method with error correlation. AIP Adv. 2021;11(8) [Google Scholar]
- 22.Sezer M., Gülsu M., Tanay B. A taylor collocation method for the numerical solution of complex differential equations with mixed conditions in elliptic domains. Appl. Math. Comput. 2006;182:498–508. [Google Scholar]
- 23.Sezer M., Gülsu M. Approximate solution of complex differential equations for a rectangular domain with taylor collocation method. Appl. Math. Comput. 2006;177:844–851. [Google Scholar]
- 24.Sezer M., Yalcinbas S. A collocation method to solve higher order linear complex differential equations in rectangular domains. Numer. Methods Partial Differ. Equ. 2009;26(3):596–611. [Google Scholar]
- 25.Sezer M., Yuzbasi S. A collocation method to find solutions of linear complex differential equations in circular domains. Appl. Math. Comput. 2013;219:10610–10626. [Google Scholar]
- 26.Dusunceli F., Celik E. Numerical solution for high-order linear complex differential equations with variable coefficients. Numer. Methods Part. Differ. Equ. 2018;34:1645–1658. [Google Scholar]
- 27.Dusunceli F., Celik E. An effective tool: numerical solutions by legendre polynomials for high-order linear complex differential equations. Br. J. Appl. Sci. Technol. 2015;8(4):348–355. [Google Scholar]
- 28.Mirzaee F., Bimesl S., Tohidi E. A new complex-valued method and its applications in solving differential equations. Sci. Iran. 2015;22:2424–2431. [Google Scholar]
- 29.Mirzaee F., Samadyar N., Alipour S. Numerical solution of high order linear complex differential equations via complex operational matrix method. SeMA. 2019;76:1–13. [Google Scholar]
- 30.Dusunceli F., Celik E. Fibonacci matrix polynomial method for linear complex differential equations. Asian J. Math. Comput. Res. 2017;15:229–238. [Google Scholar]
- 31.Faezeh T., Emran T., Stanford S. A collocation method based on the bernoulli operational matrix for solving high-order linear complex differential equations in a rectangular domain. Abstr. Appl. Anal. 2013;2013 [Google Scholar]; Article ID 823098
- 32.Bagherpoorfard M., Ghassabzade F.A. Hermite matrix polynomial collocation method for linear complex differential equations and some comparisons. J. Appl. Math. Phys. 2013;1:58–64. [Google Scholar]
- 33.Dusunceli F., Celik E. Numerical solution for high-order linear complex differential equations by hermite polynomials. Igdr Univ. J. Inst. Sci. Technol. 2017;7(4):189–201. [Google Scholar]
- 34.Lewis P.E., Ward J.P. Addison-Wesley; 1991. The Finite Element Method: Principles and Application. [Google Scholar]
- 35.David V.H. McGraw-Hill Inc; New York: 2004. Fundamentals of Finite Element Analysis. [Google Scholar]
- 36.Hatami M. Academic Press; 2018. Weighted Residual Methods, Principles, Modifications and Applications. [Google Scholar]
- 37.Fletcher C.A.J. Computational Galerkin methods. Springer Series in Computational Physics. Springer; Berlin, Heidelberg: 1984. Traditional Galerkin methods. [Google Scholar]
- 38.Cecilia J.E. Solution of weighted residual problems by using Galerkin’s method. Indian J. Sci. Technol. 2014;7(3):52–54. [Google Scholar]
- 39.Iweobod D.C., Njoseh I.N., Apanapudor J.S. A new wavelet-based Galerkin method of weighted residual function for the numerical solution of one-dimensional differential equations. Math. Stat. 2023;11(6):910–916. [Google Scholar]
- 40.Ebiwareme L., Godwin M., Science V. The comparison of weighted residual methods of solving boundary value problems in science and engineering. Afr. Scholars J. Pure Appl. 2020:19–32. [Google Scholar]; 18 NO. 9, ISSN: 2278-1897
- 41.Darania P., Ebadian A. Development of the taylor expansion approach for nonlinear integro-differential equations. Int. J. Contemp. Math. Sci. 2006;1:1–10. [Google Scholar]
- 42.Omotayo A.T., Liman K.A., Olutunde S.O., Olatayo O.A. Galerkin method for numerical solution of volterra integro-differential equations with certain orthogonal basis function. Int. J. Mod. Nonlinear Theory Appl. 2023;12:68–80. [Google Scholar]
- 43.Maleknejad K., Arzhang A. Numerical solution of the fredholm singular integro-differential equation with cauchy kernel by using Taylor-series expansion and Galerkin method. Appl. Math. Comput. 2006;182:888–897. [Google Scholar]
- 44.Humaira F., Bhowmik S.K., Islam M.S. Orthonormal bernstein Galerkin technique for computations of higher order eigenvalue problems. MethodsX. 2023;10:1–15. doi: 10.1016/j.mex.2023.102006. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 45.Kayelvizhi C., Pushpam A.E.K. Solving neutral delay differential equations using Galerkin weighted residual method based on successive integration technique and its residual error correction. Indian J. Sci. Technol. 2024;17(8):732–740. [Google Scholar]
- 46.Suayip Y., Murat K. A Galerkin-like method for solving linear functional differential equations under initial conditions. Turk. J. Math. 2020;44:85–97. [Google Scholar]
- 47.Suayip Y., Murat K. A Galerkin-like approach to solve multi-pantograph type delay differential equations. Filomat. 2018;32(2):409–422. [Google Scholar]
- 48.M.Z. Gorgulu, I. Dag, D. Irk, Galerkin method for the numerical solution of the burgers’ equation by using exponential b-splines, 2016. ArXiv preprint arXiv:1604.04266.
- 49.Villegas J., Buitrago L., Castano J. Taylor-Petrov-Galerkin method for the numerical solution of kdv equation. Appl. Math. Sci. 2016;10(4):197–204. [Google Scholar]
- 50.Woo S.B., L. -F. Liu P. A Petrov-Galerkin finite element model for one-dimensional fully non-linear and weakly dispersive wave propagation. Int. J. Numer. Methods Fluids. 2001;37(5):541–575. [Google Scholar]
- 51.Ali H., Kamrujjaman M., Islam M.S. An advanced Galerkin approach to solve the nonlinear reaction-diffusion equations with different boundary conditions. J. Math. Res. 2022;14(1):30–45. [Google Scholar]
- 52.Ali H., Kamrujjaman M., Shirin A. Numerical solution of a fractional-order bagley-torvik equation by quadratic finite element method. J. Appl. Math. Comput. 2021;66:351–367. [Google Scholar]
- 53.Kumar S., Kumar B.R. A domain decomposition taylor Galerkin finite element approximation of a parabolic singularly perturbed differential equation. Appl. Math. Comput. 2017;293:508–522. [Google Scholar]
- 54.Moré J.J. Numerical Analysis: Proceedings of the Biennial Conference Held at Dundee. Springer Berlin Heidelberg; Berlin, Heidelberg: 2006. The levenberg-marquardt algorithm: implementation and theory; pp. 105–116. [Google Scholar]; June 28-July 1, 1977
- 55.Remani C. Lakehead University Thunder Bay. volume 77. 2013. Numerical methods for solving systems of nonlinear equations. [Google Scholar]; Ontario, Canada
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
Data will be made available on request.










