Numerical Algorithms of Optimal Complexity for Weakly Singular Volterra Integral Equations

Abstract: In 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.

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
Numerical Algorithms of Optimal Complexity for Weakly Singular Volterra Integral Equations ; volume:6 ; number:4 ; year:2006 ; pages:436-442
Computational methods in applied mathematics ; 6, Heft 4 (2006), 436-442

Creator
Tynda, A.N.

DOI
10.2478/cmam-2006-0027
URN
urn:nbn:de:101:1-2410261622453.098046430417
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:30 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Tynda, A.N.

Other Objects (12)