On the characterization of the degree of interpolation polynomials in terms of certain combinatorical matrices

DOI10.1007/S40065-018-0212-XzbMATH Open1490.41002arXiv1806.05801OpenAlexW3100449090MaRDI QIDQ1734992FDOQ1734992

Authors: Frank Klinker, Christoph Reineke 

Publication date: 27 March 2019

Published in: Arabian Journal of Mathematics (Search for Journal in Brave)

Abstract: In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.

Full work available at URL: https://arxiv.org/abs/1806.05801

Mathematics Subject Classification ID

Numerical interpolation (65D05) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)

Cites Work

• Title not available (Why is that?)
• Advanced determinant calculus
• Schur functions through Lagrange polynomials
• Advanced determinant calculus: a complement
• Title not available (Why is that?)
• Polynomials arising in factoring generalized Vandermonde determinants: An algorithm for computing their coefficients
• On the regularity of matrices with uniform polynomial entries
• Generalised Vandermonde Determinants and Schur Functions

Cited In (2)

• Combinatorial algorithms for the interpolation of polynomials in dimension \(\geq 2\)
• Title not available (Why is that?)

This page was built for publication: On the characterization of the degree of interpolation polynomials in terms of certain combinatorical matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734992)