×

Taylor polynomial solution of high-order nonlinear Volterra-Fredholm integro-differential equations. (English) Zbl 1032.65144

Summary: A Taylor method is developed to find an approximate solution for a high-order nonlinear Volterra-Fredholm integro-differential equation. Numerical examples presented to illustrate the accuracy of the method.

MSC:

65R20 Numerical methods for integral equations
45J05 Integro-ordinary differential equations
45G10 Other nonlinear integral equations
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Delves, L. M.; Mohammed, J. L., Computational Methods for Integral Equations (1983), Cambridge University Press
[2] Kanwal, R. P.; Liu, K. C., A Taylor expansion approach for solving integral equations, J. Math. Educ. Sci. Technol., 20, 3, 411 (1989) · Zbl 0683.45001
[3] Kauthen, J. P., Continuous time collocation methods for Volterra-Fredholm integral equations, Numer. Math., 56, 409 (1989) · Zbl 0662.65116
[4] Sezer, M., A method for the approximate solution of the second-order linear differential equations in terms of Taylor polynomials, Int. J. Math. Educ. Sci. Technol., 27, 6, 821 (1996) · Zbl 0887.65084
[5] Sezer, M., Taylor polynomial solution of Volterra integral equations, Int. J. Math. Educ. Sci. Technol., 25, 5, 625 (1994) · Zbl 0823.45005
[6] Yalcinbas, S., Taylor polynomial solutions of nonlinear Volterra-Fredholm integral equations, Appl. Math. Comp., 127, 195-206 (2002) · Zbl 1025.45003
[7] Yalcinbas, S.; Sezer, M., The approximate solution of high-order linear Volterra-Fredholm integro-differential equations in terms of Taylor polynomials, Appl. Math. Comp., 112, 291-308 (2000) · Zbl 1023.65147
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.