Obtaining exact interpolation multivariate polynomial by approximation

DOI10.1007/S11424-011-8312-0MaRDI QIDQ1937782zbMATH OpenOpenAlexFDO

Authors Yong Feng, Xiaolin Qin, Xun Yuan, Jingzhong 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 examplescontinued fractionmultivariate interpolationsymbolic-numerical computationVandermonde determinantexact interpolation polynomialnumerical approximate computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Abstract: In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exactly interpolating methods are often proposed for the exact results and approximate interpolating methods for the approximate ones. In this paper, we study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.

Recommendations

• Obtaining exact value by approximate computations
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Finding exact minimal polynomial by approximations
• scientific article; zbMATH DE number 4136664
• Symbolic-numeric sparse interpolation of multivariate polynomials

Cites work

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1253987 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 749840 (Why is no real title available?)
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Analysis of approximate factorization algorithm. I
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Approximate multivariate polynomial factorization based on zero-sum relations
• Efficient Algorithms for MultiPolynomial Resultant
• From an approximate to an exact absolute polynomial factorization
• Kronecker products and matrix calculus in system theory
• Obtaining exact value by approximate computations
• Parallel computation of determinants of matrices with polynomial entries
• Pseudofactors of multivariate polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Towards factoring bivariate approximate polynomials
• When are two numerical polynomials relatively prime?

Cited in

(4)

• Complexity of constructing Dixon resultant matrix
• Accurate polynomial interpolation by using the Bernstein basis
• Computing the determinant of a matrix with polynomial entries by approximation
• Obtaining exact value by approximate computations

This page was built for publication: Obtaining exact interpolation multivariate polynomial by approximation

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