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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Castillo, E.: Functional networks. Neural Processing Letters 7, 151–159 (1998)
Castillo, E., Cobo, A., Guti´errez, J.M., Pruneda, R.E.: An introduction to functional networks with applications. Kluwer Academic Publishers, Dordrecht (1999)
Castillo, E., Cobo, A., Jubete, F., Pruneda, R.E.: Orthogonal sets and polar methods in linear algebra. In: Applications to matrix calculations, systems of equations and inequalities, and linear programming. John Wiley, New York (1999)
Davis, P.J.: Interpolation & approximation. Dover Publications, Inc. (1975)
Hughes, T.J.R.: The Finite Element Method: Linear static and dynamic finite element analysis. John Wiley & Sons, Chichester (1987)
Ottosen, N., Petersson, H.: Introduction to the finite element method. Prentice-Hall, Englewood Cliffs (1992)
Thompson, E.G.: Introduction to the finite element method. John Wiley & Sons, Chichester (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solares, C., Vieira, E.W., Mínguez, R. (2006). Functional Networks and the Lagrange Polynomial Interpolation. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2006. IDEAL 2006. Lecture Notes in Computer Science, vol 4224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875581_48
Download citation
DOI: https://doi.org/10.1007/11875581_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45485-4
Online ISBN: 978-3-540-45487-8
eBook Packages: Computer ScienceComputer Science (R0)