Skip to main content
Conference Proceedings

Bounds for approximate solutions of Fredholm integral equations using kernel networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6791 LNCS(PART 1) 126-133
DOI: 10.1007/978-3-642-21735-7_16
4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Approximation of solutions of integral equations by networks with kernel units is investigated theoretically. There are derived upper bounds on speed of decrease of errors in approximation of solutions of Fredholm integral equations by kernel networks with increasing numbers of units. The estimates are obtained for Gaussian and degenerate kernels. © 2011 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Gnecco, G., Kůrková, V., & Sanguineti, M. (2011). Bounds for approximate solutions of Fredholm integral equations using kernel networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6791 LNCS, pp. 126–133). https://doi.org/10.1007/978-3-642-21735-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free