Obtaining exact interpolation multivariate polynomial by approximation

DOI10.1007/s11424-011-8312-0zbMath1259.65012arXiv0809.1476MaRDI QIDQ1937782

Yong Feng, Xun Yuan, Xiaolin Qin, Jing-Zhong Zhang

Publication date: 31 January 2013

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

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

zbMATH Keywords

numerical examples; multivariate interpolation; continued fraction; Vandermonde determinant; symbolic-numerical computation; exact interpolation polynomial; numerical approximate computation

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

65D05: Numerical interpolation

41A05: Interpolation in approximation theory

Related Items

Computing the determinant of a matrix with polynomial entries by approximation, Complexity of constructing Dixon resultant matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Analysis of approximate factorization algorithm. I
• When are two numerical polynomials relatively prime?
• From an approximate to an exact absolute polynomial factorization
• Obtaining exact value by approximate computations
• Parallel computation of determinants of matrices with polynomial entries
• Towards factoring bivariate approximate polynomials
• Approximate multivariate polynomial factorization based on zero-sum relations
• Efficient Algorithms for MultiPolynomial Resultant
• Pseudofactors of multivariate polynomials
• Kronecker products and matrix calculus in system theory
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials