ISSN(Print): 2333-1100
ISSN(Online): 2333-1232

Article Versions

Export Article

Cite this article

- Normal Style
- MLA Style
- APA Style
- Chicago Style

Research Article

Open Access Peer-reviewed

Muhammad Mujtaba Shaikh^{ }

Received May 12, 2019; Revised June 19, 2019; Accepted July 13, 2019

This work aims to compare the polynomial collocation method against the uniformly spaced quadrature methods (Trapezoidal, Simpson’s and Weddle’s rules) to solve the non-homogeneous linear Fredholm integral equations of second kind with non-singular kernel. Nystrom’s interpolation technique is used to attain closed form approximations of the solutions obtained by quadrature methods. The formulation and implementation of the methods along with application on various test problems are presented for comparison. The results obtained, in general, highlight some cases where polynomial collocation yields ill-conditioned systems after discretization with same basis set, and reflects the suitability of quadrature rules. The main focus has been to extract exact closed form solutions by the used methods which can be used as replacement of analytical solutions.

Many problems in applied sciences and mathematical physics can be formulated in terms of both differential and integral equations, but latter are preferred for approximation processes as differentiation increases the error while integration decreases it. This is the reason that various classical problems modeled in terms of differential equations can be dealt with more efficiently using equivalent integral equations. ^{ 1, 2}

Integral equations can be solved by different analytical methods (for detailed discussion, refer to the work of authors ^{ 1, 2, 3, 4, 5, 6}). Due to the complexities and limitations of analytic methods associated with non-linearity and singularities etc, many numerical techniques have been proposed to obtain approximate solutions to different classes of integral equations. There is no specific numerical method to solve all types of integral equations. Due to this, the construction, implementation and comparison of efficient and reliable numerical methods for the solution of integral equations has been a key topic in mathematical research.

In this paper, equation under discussion is the Fredholm integral equation of second kind:

(1) |

where and are known functions and is the unknown function to be determined. The function and the non-zero (real or complex) are kernel and parameter of (1), respectively. It should be noted that all functions appearing in (1) belong to space ^{ 2}.

It is strictly assumed in rest of the paper that in (1), (i.e. the non-homogeneous case), is non-singular, is finite and the unknown function can be treated with by means of linear operations only. Equation (1) with these specifications can be expressed into equivalent operator form as:

(2) |

where

(3) |

is a bounded linear operator for L_{2} functions “k” and “g” ^{ 2}. It should be noted that equation (2) is in scalar form.

Numerous numerical methods have been proposed to solve (1) under specific conditions [7- 9]. One of the important techniques to solve (1) is the polynomial collocation, a projection method, to approximate solution of (1) by a polynomial. This method has been used in ^{ 3} and ^{ 9} to obtain numerical solution of (1). Moreover, polynomial collocation has also been attempted to solve Volterra integral equations ^{ 10}, non-linear integral equations ^{ 11} and also the initial value problems. ^{ 12}

Other important methods for the numerical solution of (1) are *n*-point quadrature schemes. In this work only the uniformly spaced quadrature methods such as, Trapezoidal rule (TR), Simpson’s rule (SR) and Weddel’s rule (WR) are discussed. First two of these have been repeatedly used for the solution of (1) in ^{ 3}, ^{ 13, 14, 15, 16, 17, 18, 19, 20}. These methods have also been adopted for the numerical solution of singular and non-linear cases of (1) ^{ 21, 22, 23}, Volterra integral and integro-differential equations ^{ 24, 25, 26} and weakly singular integral equations ^{ 27}.

In general, TR, SR and WR for the solution of (1) are established by replacing the continuous integral operator “” in (2) by a finite n-point uniformly spaced quadrature formula; thus discretizing (2) to a linear system of “ n ” algebraic equations. The resulting linear system is of higher order and, in general, not easily solvable; there can be variety of complexities, as discussed in ^{ 28}. To approximate solution of the obtained dense system, modified iterative schemes: half sweep and quarter sweep Gauss-Seidel ^{ 14}, Successive over relaxation ^{ 15}, Arithmetic mean ^{ 16, 17, 18} and Geometric mean ^{ 19, 20} methods have been employed in past decade.

Instead of obtaining approximation to the solution of (1) by using methods as in ^{ 14, 15, 16, 17, 18, 19, 20}, in this work the exact solutions to the dense systems are obtained using MATLAB functions in open form. Nystrom’s technique is then used for interpolation at quadrature points to determine closed form approximations to solution of (1) without having lost already achieved accuracy through quadrature discretization. ^{ 29, 30}

The paper has been further organized as: Section-2 presents algorithms of methods being used for comparison with necessary assumptions. Section-3 is deals with numerical experiments and implementation of discussed methods to solve some test problems of type (1). The results are discussed and compared in terms of closed form solutions and error plots in Section-4. Finally conclusions are presented in Section-5.

We introduce the mathematical analysis of polynomial collocation and Newton-Cotes closed quadrature rules for the numerical solution of (1).

Let “*V*” be an *n*-dimensional real linear space of polynomials defined on with the basis set . This method approximates the solution to (1) by a polynomial in *V* which can be expressed as a linear combination of basis polynomials as:

(4) |

where are real constants. To make the approach simpler, all basis polynomials are assumed to be exact polynomials in s, that is:

(5) |

The polynomial collocation approximation of order “n – 1” to solve (1) is:

(6) |

Using (6) in (1) leads to:

(7) |

where is the associated residual depending on s and choice of constants For consistent unique determination of coefficients of , “n” conditions are required. Assuming that the residual “” in (7), vanishes at n arbitrarily chosen points: , called collocation points, (7) evaluated at the collocation points gives following set of n-equations to determine :

(8) |

Employing integration in (8), a square system of order n is obtained which can be solved for to finally give (*n*-1)^{th} order polynomial collocation approximation from (6).

The *n*-point uniformly-spaced quadrature methods: Trapezoidal rule (TR), Simpson’s rule (SR) and Weddel’s rule (WR) discretize (1) by replacing the bounded linear operator in (2) through a weighted sum as:

(9) |

where is set of weight for the quadrature method being used. Using (9) in (1) leads to:

(10) |

Consider *n* uniformly-spaced points , called quadrature points, defined aswhere and , which partition [*a*, *b*] into *n - *1 sub-intervals ^{ 31}. The weights in TR, SR and WR, are respectively, defined as:

The number of sub-intervals “*n*-1” in TR, SR and WR has to be an odd number, an even number and a multiple of six, respectively. The approximations by TR and SR in each sub-interval are respectively linear and quadratic. However, Weddle’s Rule, being a sixth order quadrature method approximates integral in (1) by a sixth order polynomial in each sub-interval, hence is assumed to provide closer approximation for solution of (1) than lower order quadrature rules.

Using (10) with respective weights defined for TR, SR and WR and evaluating it at *n* equally-spaced quadrature points, gives:

(11) |

Let and , where and are vectors of order *n*, D is a diagonal matrix of order *n* having the weights ’s on leading diagonal, M is an *n*^{th} order square matrix of kernels and *K* is product of *D* and *M*. System (11), likewise (2), in associated matrix form for the approximate solution becomes:

(12) |

The coefficient matrix “” in (12) is usually invertible when the parameter is not very close to an eigen value of (1) ^{ 29}. Finally (12) gives:

(13) |

Equation (13) provides open solution to (1) at n quadrature points. However, to attain solution of (1) in closed form, simple polynomial interpolation is not preferred at all, as it destroys the accuracy so obtained ^{ 29}. In fact Nystrom’s Interpolation method is applied which utilizes (10) as an interpolation formula to obtain closed form solutions without losing the obtained accuracy.

**Remark 1.** It is important to mention that theory of construction, existence and uniqueness along with the analysis of convergence, stability and error bounds to solution of equations of type (1) by the polynomial collocation and the presented uniformly-spaced quadrature methods are well developed. For details refer ^{ 2, 5, 7, 8, 9}.

In this work performance of discussed methods to solve (1) and necessary comparisons are generated using MATLAB (R2011). For this graphing tools and several built in functions have been modified accordingly and much help is sought from ^{ 32}.

The methods discussed in preceding section have been employed on following test problems of type (1) in this section:

**Example 1. **.

Analytic solution of Example 1 is: . ^{ 9}

**Example 2. ** and the exact solution is: . ^{ 14, 16}

**Example 3. **. Exact solution is: . ^{ 14, 16}

**Example 4**. .

Analytic solution is: . ^{ 2}, ^{ 9}

**Example 5. **. Exact solution is: . ^{ 3}

Polynomial collocation method has been used with *n* = 3 to approximate solution of Examples 1-5 by means of polynomials of order at most 2 using (6) in the form:

(14) |

through (7), assuming that the associated residual term vanishes at three collocation points *s* = -1, *s* = 0 and *s* = 1 (arbitrarily chosen). The corresponding coefficients and in collocations approximations for these test problems 1-5 are summarized in Table 1.

Implementation of TR, SR and WR is made using corresponding weights through (11) for Examples 1-5 at seven quadrature points (i.e. with *n* = 7), in fact, dividing corresponding intervals of integration in into six sub-intervals of same length. It should be noted that increasing quadrature points was necessary here, as with even *n* =7, the exact solutions have been recovered in few examples and the over-all accuracy is found satisfactory. This is the main feature of proposed Nystrom’s procedure to extract closed form solutions. The resulting square system (12) is then solved by analytical methods as described in (13). The closed form approximations by TR, SR and WR for Problems 1-5 using Nystrom’s Interpolation formula (10) along with Polynomial Collocation approximations of order at most 2 are summarized in Table 2 along with exact solutions.

Finally, Table 3 exhibits comparison of absolute errors among the solutions by TR, SR, WR, Col methods versus the exact solutions for all test problems at seven quadrature points. Figure 1 – Figure 5 present error plots associated with used methods with errors highlighted at seven quadrature points for Problems 1-5, respectively.

Different sort of integral equations of type (1) in Examples 1-5 have been presented in detail in previous section along with their solution in closed forms using the discussed methods with error plots between exact and approximated solutions for illustrations. Examples 1-5 were intentionally selected to indulge equations of type (1) whose exact solutions are either polynomials of order one (Example 1), two (Examples 2, 4), six (Example 3) or even involving exponential function (Example 5); to better testify and compare the efficiency of discussed methods.

Examples show that the approximate solution by Polynomial collocation method coincides with the exact solution in cases where exact solution itself is a polynomial of order at most 2 (refer Examples 1, 4). But errors associated with Collocation method for Example-2 through Figure 2 do not tend to zero, which reflects that the quadratic approximation by collocation method may not provide satisfactory accuracy even when the exact solution is quadratic. The method has worked better than or equivalent to TR in some cases (see Table 3: Examples-1, 4 and 5). The solution by collocation was better than that of SR solution only for Example-4 (see Table 3: Example-4). An important result to be noticed is that for Examples 2, 3 and 5 the collocation solution is not well-conditioned as solution doesn’t converge to the exact at selected quadrature points. In view of Figure 2, Figure 3 and Figure 5 it is evident that the inefficient solutions are resulted due to ill-conditioned systems of algebraic equations caused while collocation discretization of the example problems. Thus, for the same basis set used, collocation method doesn’t provide well-conditioned discretization.

On the other hand, uniformly-spaced quadrature methods: SR and WR have shown better results as compared to TR for all test problems (see Figure 1 – Figure 5 and Table 3). The closed form solutions by SR for Examples 1-2 coincide with, and approximate well the exact solutions for rest of the problems (refer Table 2 and Figure 1 – Figure 5). It is very important to note that the WR has resulted in zero discrepancy in all examples because closed form solutions by WR (see Table 2) are simply the exact solutions, except in Example-3. The exact solution of Example-3 is a sixth order polynomial and WR has yielded an approximate solution with smaller errors compared to other methods (Table 3). In particular, SR for Example-3 has resulted errors of order 10^{-2} which with WR are of order 10^{-4} at most of the quadrature points, suggesting better approximation than SR. So, WR results in exact closed form solutions using Nystrom’s Interpolation in most of the cases and gives better results than other discussed methods when the exact solution is a higher degree polynomial.

Consequently except the TR, which is a linear approximation, higher order quadrature methods SR and WR provide well-conditioned systems through discretization and hence are better than the collocation method under the similar conditions to solve Integral equations of type (1).

Numerical solution of non-homogeneous linear Fredholm integral equation of second kind for the case of non-singular kernel is presented by polynomial collocation and uniformly spaced quadrature rules. Results obtained by implementation of discussed method on various sort of test problems have been compared. Nystrom’s Interpolation method has also been used to provide closed form solutions by quadrature methods. It is observed from through obtained results that the polynomial collocation method with *n* = 3 has shown good results for some problems whose exact solution is a polynomial of at most second order. However, in some problems, collocation method yields ill-conditioned systems through discretization even with the same basis set. Under similar conditions, quadrature methods: SR and WR have shown better results as compared to TR and Col. in all cases. The WR approximation versus the exact solution resulted in zero discrepancy for almost all test problems and otherwise has shown smaller errors compared to SR. It can be concluded that the WR results in exact closed form solutions using Nystrom’s Interpolation and gives better results than other methods when the exact solution is a higher degree polynomial.

This work is dedicated to Prof. Manzoor Ahmed Memon (Late), Associate Professor, IMCS, University of Sindh, Jamshoro, Pakistan who initially motivated the author for research on these methods. Author is also thankful to Dr. Ayaz Keerio, PhD, University of Sussex, UK, for going through the work to make its current version more readable. Finally, author is thankful to Prof. Dr. Ingr. Karem Boubker from Tunisia for reviewing this work before, and a few months later he left this world.

[1] | C. Corduneanu, “Integral Equations and Applications”, Cambridge University Press, New York, 1991. | ||

In article | View Article | ||

[2] | R. P. Kanwal, “Linear Integral Equations”, Academic Press, Inc. California, 1971. | ||

In article | View Article | ||

[3] | A. D. Polyanin, A. V. Manzhirov, “Handbook of Integral Equations”, 2nd Edition, Chapman & Hall/CRC, Taylor & Francis Group, Boca Raton, 2008. | ||

In article | View Article | ||

[4] | P. J. Collins, “Differential and Integral Equations”, Oxford University Press, Inc. New York, 2006. | ||

In article | |||

[5] | F. G. Tricomi, “Integral Equations”, Interscience Publishers, Inc. New York, 1957. | ||

In article | |||

[6] | M. Masujim, “Applied Mathematical Methods in Theoretical Physics”, WILEY VCH Verlag GmbH & Co. KGa Weinheim, 2005. | ||

In article | |||

[7] | A. T. Lonseth, “Approximate Solutions of Fredholm-Type Integral Equations”, An address delivered before the Missoula meeting of the Society on invitation of the Committee to Select Hour Speakers for Far Western Sectional Meetings, June 20, 1953. | ||

In article | |||

[8] | K. E. Atkinson, “The Numerical Solution of Integral Equations of the Second Kind”, Cambridge University Press, 1997. | ||

In article | View Article | ||

[9] | I. S. Kotsireas, “A Survey on Solution Methods for Integral Equations”, 3rd European Support Framework, 2008. | ||

In article | |||

[10] | K. Maleknejad, M. Alizadeh, “Volterra Type Integral Equation by the Whittaker Cardinal Expansion”, The Open Cybernetics and Systemics Journal, 3 (2009), 1-4. | ||

In article | View Article | ||

[11] | K. E. Atkinson, “A Survey of Numerical Methods for Solving Nonlinear Integral Equations”, Journal of Integral Equations and Applications, 4 (1992). | ||

In article | View Article | ||

[12] | L. W. Johnson, R. D. Riess, “Numerical Analysis”, 2nd Edition, Addison-Wesley Publishing Company, 1982. | ||

In article | |||

[13] | S. Richardson, “Integral Equations”, The Mathematica Journal 9 (2004), 460-482. | ||

In article | |||

[14] | M. S. Muthuvalu, J. Sulaiman, “Numerical Solution of Second Kind Linear Fredholm Integral Equations using QSGS Iterative Method with High-Order Newton-Cotes Quadrature Schemes”, Malaysian Journal of Mathematical Sciences, 5 (2011), 85-100. | ||

In article | |||

[15] | M. S. Muthuvalu, J. Sulaiman, “Numerical Solutions of First Kind Linear Fredholm Integral Equations by Using Quarter-Sweep SOR With Piecewise Linear Collocation Method QSSOR With Piecewise Linear Collocation Method for Fredholm Equations”, Aust. J. Basic & Appl. Sci., 5 (2011), 18-24. | ||

In article | |||

[16] | M. S. Muthuvalu, J. Sulaiman, “Comparisons of Quadrature Schemes with Arithmetic Mean Iterative Method for Second Kind Linear Fredholm Integral Equations”, The Journal of Mathematics and Computer Science 1 (2010), 174-186. | ||

In article | View Article | ||

[17] | M. S. Muthuvalu, J. Sulaiman, “Half-Sweep Arithmetic Mean method with high-order Newton-Cotes quadrature schemes to solve linear second kind Fredholm equations”, Journal of Fundamental Sciences, 5 (2009), 7-16. | ||

In article | |||

[18] | M. S. Muthuvalu, J. Sulaiman, “Half-Sweep Arithmetic Mean method with composite trapezoidal scheme for solving linear Fredholm integral equations”, Appl. Math. Comput., In Press. (2011). | ||

In article | View Article | ||

[19] | M. S. Muthuvalu, J. Sulaiman, “Half-Sweep Geometric Mean method for solution of linear Fredholm equations”, Matematika, 24 (2008), 75-84. | ||

In article | |||

[20] | M. S. Muthuvalu, J. Sulaiman, “Numerical solutions of second kind Fredholm integral equations using Half-Sweep Geometric Mean method”, Proceedings of the International Symposium on Information Technology: 1927-1934 (2008). | ||

In article | View Article | ||

[21] | K. E. Atkinson, “The Numerical Solution of Fredholm Integral Equations of Second Kind with Singular Kernals”, Numer. Math., 19, (1972), 248-259. | ||

In article | View Article | ||

[22] | M. J. Emamzadeh, M. T. Kajani, “Nonlinear Fredholm Integral Equation of the Second Kind with Quadrature Methods”, Journal of Mathematical Extension, 4 (2010), 51-58. | ||

In article | |||

[23] | S. S. Sastry, “Numerical Solution of Non-Singular Fredholm Integral Equations of the Second Kind”. Applied Mathematics Division, 6 (1973). | ||

In article | |||

[24] | B. Raftari, “Numerical Solutions of the Linear Volterra Integro-differential Equations: Homotopy Perturbation Method and Finite Difference Method”, World Applied Sciences Journal 9 (2010), 07-12. | ||

In article | |||

[25] | M. Nadir, A. Rahmoune, “Modified Method for Solving Linear Volterra Integral Equations of the Second Kind Using Simpson’s Rule”, International Journal: Mathematical Manuscripts, 1 (2007), 141-146. | ||

In article | |||

[26] | A. S. H. AL-Nufaie , “On Some Methods for Solving the Volterra Integral Equation”, A Thesis Submitted in Partial Fulfillment of the Requirements of Master's Degree in Applied Mathematics (Integ. Eqs. and Numer. Anal.), Umm AL-Qura University, Saudi Arabia, 2006. | ||

In article | |||

[27] | C. Schneider, “Product Integration for Weakly Singular Integral Equations”, Mathematics of Computation, 36 (1981). | ||

In article | View Article | ||

[28] | G. E. Forsythe, “Solving linear equations can be interesting”, Bull. Amer. Math. Soc., 59 (1953), 299-329. | ||

In article | View Article | ||

[29] | “Numerical Recipes in FORTRAN 77”, Cambridge University Press, New York. | ||

In article | |||

[30] | K. E. Atkinson, L. F. Shampine, “Solving Fredholm Integral Equations of the Second Kind in Matlab”, 2007. | ||

In article | |||

[31] | M. M. Shaikh, M. S. Chandio, A. S. Soomro, “A Modified Four-point Closed Mid-point Derivative Based Quadrature Rule for Numerical Integration”, Sindh University Research Journal-SURJ (Science Series) 48.2 (2016). | ||

In article | |||

[32] | S. T. Karris, “Numerical Analysis using MATLAB® and Excel®”, Third Edition, Orchard Publications, 2007. | ||

In article | |||

Published with license by Science and Education Publishing, Copyright © 2019 Muhammad Mujtaba Shaikh

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Muhammad Mujtaba Shaikh. Analysis of Polynomial Collocation and Uniformly Spaced Quadrature Methods for Second Kind Linear Fredholm Integral Equations – A Comparison. *Turkish Journal of Analysis and Number Theory*. Vol. 7, No. 4, 2019, pp 91-97. http://pubs.sciepub.com/tjant/7/4/1

Shaikh, Muhammad Mujtaba. "Analysis of Polynomial Collocation and Uniformly Spaced Quadrature Methods for Second Kind Linear Fredholm Integral Equations – A Comparison." *Turkish Journal of Analysis and Number Theory* 7.4 (2019): 91-97.

Shaikh, M. M. (2019). Analysis of Polynomial Collocation and Uniformly Spaced Quadrature Methods for Second Kind Linear Fredholm Integral Equations – A Comparison. *Turkish Journal of Analysis and Number Theory*, *7*(4), 91-97.

Shaikh, Muhammad Mujtaba. "Analysis of Polynomial Collocation and Uniformly Spaced Quadrature Methods for Second Kind Linear Fredholm Integral Equations – A Comparison." *Turkish Journal of Analysis and Number Theory* 7, no. 4 (2019): 91-97.

Share

[1] | C. Corduneanu, “Integral Equations and Applications”, Cambridge University Press, New York, 1991. | ||

In article | View Article | ||

[2] | R. P. Kanwal, “Linear Integral Equations”, Academic Press, Inc. California, 1971. | ||

In article | View Article | ||

[3] | A. D. Polyanin, A. V. Manzhirov, “Handbook of Integral Equations”, 2nd Edition, Chapman & Hall/CRC, Taylor & Francis Group, Boca Raton, 2008. | ||

In article | View Article | ||

[4] | P. J. Collins, “Differential and Integral Equations”, Oxford University Press, Inc. New York, 2006. | ||

In article | |||

[5] | F. G. Tricomi, “Integral Equations”, Interscience Publishers, Inc. New York, 1957. | ||

In article | |||

[6] | M. Masujim, “Applied Mathematical Methods in Theoretical Physics”, WILEY VCH Verlag GmbH & Co. KGa Weinheim, 2005. | ||

In article | |||

[7] | A. T. Lonseth, “Approximate Solutions of Fredholm-Type Integral Equations”, An address delivered before the Missoula meeting of the Society on invitation of the Committee to Select Hour Speakers for Far Western Sectional Meetings, June 20, 1953. | ||

In article | |||

[8] | K. E. Atkinson, “The Numerical Solution of Integral Equations of the Second Kind”, Cambridge University Press, 1997. | ||

In article | View Article | ||

[9] | I. S. Kotsireas, “A Survey on Solution Methods for Integral Equations”, 3rd European Support Framework, 2008. | ||

In article | |||

[10] | K. Maleknejad, M. Alizadeh, “Volterra Type Integral Equation by the Whittaker Cardinal Expansion”, The Open Cybernetics and Systemics Journal, 3 (2009), 1-4. | ||

In article | View Article | ||

[11] | K. E. Atkinson, “A Survey of Numerical Methods for Solving Nonlinear Integral Equations”, Journal of Integral Equations and Applications, 4 (1992). | ||

In article | View Article | ||

[12] | L. W. Johnson, R. D. Riess, “Numerical Analysis”, 2nd Edition, Addison-Wesley Publishing Company, 1982. | ||

In article | |||

[13] | S. Richardson, “Integral Equations”, The Mathematica Journal 9 (2004), 460-482. | ||

In article | |||

[14] | M. S. Muthuvalu, J. Sulaiman, “Numerical Solution of Second Kind Linear Fredholm Integral Equations using QSGS Iterative Method with High-Order Newton-Cotes Quadrature Schemes”, Malaysian Journal of Mathematical Sciences, 5 (2011), 85-100. | ||

In article | |||

[15] | M. S. Muthuvalu, J. Sulaiman, “Numerical Solutions of First Kind Linear Fredholm Integral Equations by Using Quarter-Sweep SOR With Piecewise Linear Collocation Method QSSOR With Piecewise Linear Collocation Method for Fredholm Equations”, Aust. J. Basic & Appl. Sci., 5 (2011), 18-24. | ||

In article | |||

[16] | M. S. Muthuvalu, J. Sulaiman, “Comparisons of Quadrature Schemes with Arithmetic Mean Iterative Method for Second Kind Linear Fredholm Integral Equations”, The Journal of Mathematics and Computer Science 1 (2010), 174-186. | ||

In article | View Article | ||

[17] | M. S. Muthuvalu, J. Sulaiman, “Half-Sweep Arithmetic Mean method with high-order Newton-Cotes quadrature schemes to solve linear second kind Fredholm equations”, Journal of Fundamental Sciences, 5 (2009), 7-16. | ||

In article | |||

[18] | M. S. Muthuvalu, J. Sulaiman, “Half-Sweep Arithmetic Mean method with composite trapezoidal scheme for solving linear Fredholm integral equations”, Appl. Math. Comput., In Press. (2011). | ||

In article | View Article | ||

[19] | M. S. Muthuvalu, J. Sulaiman, “Half-Sweep Geometric Mean method for solution of linear Fredholm equations”, Matematika, 24 (2008), 75-84. | ||

In article | |||

[20] | M. S. Muthuvalu, J. Sulaiman, “Numerical solutions of second kind Fredholm integral equations using Half-Sweep Geometric Mean method”, Proceedings of the International Symposium on Information Technology: 1927-1934 (2008). | ||

In article | View Article | ||

[21] | K. E. Atkinson, “The Numerical Solution of Fredholm Integral Equations of Second Kind with Singular Kernals”, Numer. Math., 19, (1972), 248-259. | ||

In article | View Article | ||

[22] | M. J. Emamzadeh, M. T. Kajani, “Nonlinear Fredholm Integral Equation of the Second Kind with Quadrature Methods”, Journal of Mathematical Extension, 4 (2010), 51-58. | ||

In article | |||

[23] | S. S. Sastry, “Numerical Solution of Non-Singular Fredholm Integral Equations of the Second Kind”. Applied Mathematics Division, 6 (1973). | ||

In article | |||

[24] | B. Raftari, “Numerical Solutions of the Linear Volterra Integro-differential Equations: Homotopy Perturbation Method and Finite Difference Method”, World Applied Sciences Journal 9 (2010), 07-12. | ||

In article | |||

[25] | M. Nadir, A. Rahmoune, “Modified Method for Solving Linear Volterra Integral Equations of the Second Kind Using Simpson’s Rule”, International Journal: Mathematical Manuscripts, 1 (2007), 141-146. | ||

In article | |||

[26] | A. S. H. AL-Nufaie , “On Some Methods for Solving the Volterra Integral Equation”, A Thesis Submitted in Partial Fulfillment of the Requirements of Master's Degree in Applied Mathematics (Integ. Eqs. and Numer. Anal.), Umm AL-Qura University, Saudi Arabia, 2006. | ||

In article | |||

[27] | C. Schneider, “Product Integration for Weakly Singular Integral Equations”, Mathematics of Computation, 36 (1981). | ||

In article | View Article | ||

[28] | G. E. Forsythe, “Solving linear equations can be interesting”, Bull. Amer. Math. Soc., 59 (1953), 299-329. | ||

In article | View Article | ||

[29] | “Numerical Recipes in FORTRAN 77”, Cambridge University Press, New York. | ||

In article | |||

[30] | K. E. Atkinson, L. F. Shampine, “Solving Fredholm Integral Equations of the Second Kind in Matlab”, 2007. | ||

In article | |||

[31] | M. M. Shaikh, M. S. Chandio, A. S. Soomro, “A Modified Four-point Closed Mid-point Derivative Based Quadrature Rule for Numerical Integration”, Sindh University Research Journal-SURJ (Science Series) 48.2 (2016). | ||

In article | |||

[32] | S. T. Karris, “Numerical Analysis using MATLAB® and Excel®”, Third Edition, Orchard Publications, 2007. | ||

In article | |||