On the Newton bivariate polynomial interpolation with applications
The main purpose of this work is to provide recursive algorithms for the computation of the Newton interpolation polynomial of a given two-variable function. The special case where the interpolation polynomial has known upper bounds on the degree of each indeterminate is studied and applied to the computation of the inverse of a two-variable polynomial matrix.
KeywordsBivariate polynomials Newton bivariate interpolation Inverse polynomial matrix
Unable to display preview. Download preview PDF.
- Ben-Israel A., Greville T. N. (2003) Generalized inverses: Theory and applications (2nd ed.). Springer, New YorkGoogle Scholar
- Fausett L. V. (2002) Numerical methods: Algorithms and applications. Prentice Hall, Englewood CliffsGoogle Scholar
- Hromcik, M., & Sebek, M. (2001). Fast fourier transform and linear polynomial matrix equations. In Proceedings of the 1rst IFAC workshop on systems structure and control, Prague, Czech Republic.Google Scholar
- Lipson, J. D. (1976). The fast fourier transform, its role as an algebraic algorithm. In Proceedings of the ACM annual conference/annual meeting, pp. 436–441.Google Scholar
- Lobo, R. G., Bitzer, D. L., & Vouk, M. A. (2006). Locally invertible multivariate polynomial matrices, Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), Vol. 3969.Google Scholar
- Neidinger, R. D. (2009). Multivariable interpolating polynomials in newton forms. In Joint mathematics meetings 2009, Washington, DC, January 5–8.Google Scholar
- Varsamis, D. N., & Karampetakis, N. P. (2011). On the newton multivariate polynomial interpolation with applications. In 2011 7th international workshop on multidimensional (nD) systems (nDs), Poitiers, France. doi:10.1109/nDS.2011.6076875.