A criterion for the solvability of the multiple interpolation problem by simple partial fractions

From MaRDI portal





First of all the author notes that the solution of the Hermite interpolation problem by simple partial fractions (logarithmic derivatives of polynomials) \(R=Q'/Q\) satisfies the relations \( Q(z_j)\neq 0 \) and \( Q^{(s)}(z_j)=Q(z_j)h_{j,s}, \) where \( z_j \) are the interpolation nodes and \( h_{j,s} \) are expressed via given values of \( R^{(s)}(z_j). \) The problem \( Q^{(s)}(z_j)=Q(z_j)h_{j,s} \) is called the generalized interpolation problem and it is studied in the paper. Namely, it is always solvable (under natural restriction that the total multiplicity \( S \) of the interpolation nodes is less or equal to the degree \( n \) of \( Q\), and a criteria for uniqueness of its solution is given in terms of determinants which are useful also for the first (ordinary) Hermite interpolation problem. The author gives unimprovable estimates for \( n \) which guarantee solvability of arbitrary ordinary Hermite interpolation problem by functions \( R\).











This page was built for publication: A criterion for the solvability of the multiple interpolation problem by simple partial fractions

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