Numerical Algorithms of Optimal Complexity for Weakly Singular Volterra Integral Equations

2006 ◽  
Vol 6 (4) ◽  
pp. 436-442 ◽  
Author(s):  
A.N. Tynda

AbstractIn this paper we construct complexity order optimal numerical methods for Volterra integral equations with different types of weakly singular kernels. We show that for Volterra equations (in contrast to Fredholm integral equations) using the ”block-by-block” technique it is not necessary to employ the additional iterations to construct complexity optimal methods.

2009 ◽  
Vol 14 (1) ◽  
pp. 79-89 ◽  
Author(s):  
Marek Kolk ◽  
Arvet Pedas

We propose a piecewise polynomial collocation method for solving linear Volterra integral equations of the second kind with kernels which, in addition to a weak diagonal singularity, may have a weak boundary singularity. Global convergence estimates are derived and a collection of numerical results is given.


1998 ◽  
Vol 3 (1) ◽  
pp. 104-113
Author(s):  
Kristiina Hakk ◽  
Arvet Pedas

The piecewise polynomial collocation method is discussed to solve second kind Fredholm integral equations with weakly singular kernels K (t, s) which may be discontinuous at s = d, d = const. The main result is given in Theorem 4.1. Using special collocation points, error estimates at the collocation points are derived showing a more rapid convergence than the global uniform convergence in the interval of integration available by piecewise polynomials.


Sign in / Sign up

Export Citation Format

Share Document