Functional networks and the lagrange polynomial interpolation

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new approach is presented for the approximation of a scalar function defined on a discrete set of points. The method is based on the application of functional networks and the Lagrange interpolation formula. The interpolation mechanism of the separable functional networks when the neuron functions are approximated by Lagrange polynomials, is explored. The coefficients of the Lagrange interpolation formula are estimated during the learning of the functional network by simply solving a linear system of equations. Finally, several examples show the effectiveness of the proposed interpolation method. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Solares, C., Vieira, E. W., & Mínguez, R. (2006). Functional networks and the lagrange polynomial interpolation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4224 LNCS, pp. 394–401). Springer Verlag. https://doi.org/10.1007/11875581_48

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