Subresultants, Sylvester sums and the rational interpolation problem
From MaRDI portal
Publication:480645
DOI10.1016/j.jsc.2014.08.008zbMath1303.41003arXiv1211.6895OpenAlexW2026237562WikidataQ57437819 ScholiaQ57437819MaRDI QIDQ480645
Carlos D'Andrea, Agnes Szanto, Teresa Krick
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6895
rational interpolationsubresultantsrational Hermite interpolationCauchy interpolationosculatory interpolationSylvester sums
Approximation by rational functions (41A20) Numerical interpolation (65D05) Interpolation in approximation theory (41A05)
Related Items (4)
Subresultants in multiple roots: an extremal case ⋮ The set of unattainable points for the rational Hermite interpolation problem ⋮ Symmetric interpolation, Exchange Lemma and Sylvester sums ⋮ Minimal solutions of the rational interpolation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sylvester's double sums: an inductive proof of the general case
- Sylvester double sums and subresultants
- Sylvester's double sums: the general case
- Rational interpolation and the Euclidean algorithm
- Double Sylvester sums for subresultants and multi-Schur functions.
- Newton-Thiele's rational interpolants
- Subresultants in multiple roots
- An elementary proof of Sylvester's double sums for subresultants
- Su una formula d'interpolazione per le funzioni razionali
- Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
- The Generalized Vandermonde Matrix
- On the Osculatory Rational Interpolation Problem
- Subresultants and Reduced Polynomial Remainder Sequences
- Note on Osculatory Rational Interpolation
- Osculatory Interpolation
- On Euclid's Algorithm and the Theory of Subresultants
This page was built for publication: Subresultants, Sylvester sums and the rational interpolation problem