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

DOI10.1007/S40065-018-0212-XMaRDI QIDQ1734992zbMATH OpenOpenAlexFDO

Authors Frank Klinker, Christoph Reineke

Publication date 27 March 2019

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

Copyright license Creative Commons Attribution 4.0 International

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)

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.

Cites work

• scientific article; zbMATH DE number 3516003 (Why is no real title available?)
• scientific article; zbMATH DE number 1865611 (Why is no real title available?)
• Advanced determinant calculus
• Advanced determinant calculus: a complement
• Generalised Vandermonde Determinants and Schur Functions
• On the regularity of matrices with uniform polynomial entries
• Polynomials arising in factoring generalized Vandermonde determinants: An algorithm for computing their coefficients
• Schur functions through Lagrange polynomials

Cited in

(2)

• Combinatorial algorithms for the interpolation of polynomials in dimension \(\geq 2\)
• scientific article; zbMATH DE number 1529464 (Why is no real title available?)

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)