The set of unattainable points for the rational Hermite interpolation problem

DOI10.1016/J.LAA.2017.09.034MaRDI QIDQ1680295zbMATH OpenOpenAlexFDO

Authors T. Cortadellas, Carlos D'Andrea, Eulàlia Montoro

Publication date 15 November 2017

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

complete intersectionsequidimensional varietiesrational Hermite interpolationrational varietiesstructured matricesunattainable points

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Computational aspects of higher-dimensional varieties (14Q15) Interpolation in approximation theory (41A05) Symbolic computation and algebraic computation (68W30)

Abstract: We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional complete intersection varieties of odd codimension, the number of them being equal to the minimum between the degrees of the numerator and denominator of the problem. Each of these equidimensional varieties can be further decomposed as a union of as many rational (irreducible) varieties as input data points. We exhibit algorithms and equations defining all these objects.

Review text

This article describes the set of points for which the Rational Hermite Interpolation Problem (RHIP) does not have a solution. This is done by studying a weaker version of the problem (basically a denominator-free version) and relating both. An algorithm is provided to verify the solvability of a given RHIP via that relation; the authors compare it to the classical Extended Euclidean Method approach. Later, a description of the unsolvable region is given as a union of open irreducible rational varieties; this is done constructively, and finally a decision algorithm is given base on this rather than by solving the weaker version and performing more checks.

Recommendations

• Unattainable points in multivariate rational interpolation
• scientific article; zbMATH DE number 65764
• Study of rational interpolation functions with unattainable points
• scientific article; zbMATH DE number 3979678
• The rational interpolation problem revisited

Cites work

• A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
• A new formal approach to the rational interpolation problem
• An Osculatory Extension of Cauchy's Rational Interpolation Formula
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Geometric methods in rational interpolation theory
• Hermite interpolation: The barycentric approach
• scientific article; zbMATH DE number 2038300 (Why is no real title available?)
• Ideals, Varieties, and Algorithms
• Modern computer algebra
• Note on Osculatory Rational Interpolation
• On the Osculatory Rational Interpolation Problem
• Osculatory Interpolation
• Rational interpolation and the Euclidean algorithm
• Rational interpolation via orthogonal plynomials
• Some New Aspects of Rational Interpolation
• Subresultants, Sylvester sums and the rational interpolation problem

Cited in

(7)

• Unattainable points in multivariate rational interpolation
• Rational interpolation and open-up mappings
• Study of rational interpolation functions with unattainable points
• scientific article; zbMATH DE number 3979678 (Why is no real title available?)
• Minimal solutions of the rational interpolation problem
• Оскуляторний інтерполяційний ланцюговий дріб Тіле
• Barycentric rational Hermite interpolation based on Lebesgue constant minimum level preserving asymptote

This page was built for publication: The set of unattainable points for the rational Hermite interpolation problem

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