Skip to main content
main-content
Top

Hint

Swipe to navigate through the articles of this issue

01-12-2020 | Issue 4/2020

Calcolo 4/2020

Discrete projection methods for Hammerstein integral equations on the half-line

Journal:
Calcolo > Issue 4/2020
Authors:
Nilofar Nahid, Gnaneshwar Nelakanti
Important notes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Abstract

In this paper, we study discrete projection methods for solving the Hammerstein integral equations on the half-line with a smooth kernel using piecewise polynomial basis functions. We show that discrete Galerkin/discrete collocation methods converge to the exact solution with order \({\mathcal {O}}(n^{-min\{r, d\}}),\) whereas iterated discrete Galerkin/iterated discrete collocation methods converge to the exact solution with order \({\mathcal {O}}(n^{-min\{2r, d\}}),\) where \(n^{-1}\) is the maximum norm of the graded mesh and r denotes the order of the piecewise polynomial employed and \(d-1\) is the degree of precision of quadrature formula. We also show that iterated discrete multi-Galerkin/iterated discrete multi-collocation methods converge to the exact solution with order \({\mathcal {O}}(n^{-min\{4r, d\}})\). Hence by choosing sufficiently accurate numerical quadrature rule, we show that the convergence rates in discrete projection and discrete multi-projection methods are preserved. Numerical examples are given to uphold the theoretical results.

Please log in to get access to this content

Literature
About this article

Other articles of this Issue 4/2020

Calcolo 4/2020 Go to the issue

Premium Partner

    Image Credits