In this paper an error in[4]is pointed out and a method for constructingsurface interpolating scattered data points is presented.The main feature of the methodin this paper is that the surface so constructed is polyno...In this paper an error in[4]is pointed out and a method for constructingsurface interpolating scattered data points is presented.The main feature of the methodin this paper is that the surface so constructed is polynomial,which makes the construction simple and the calculation easy.展开更多
This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer ...This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer terms. Actually, all interpolations are eventually reduced to the interpolation of a list of polynomials with less terms than that of the original polynomial. Extensive experiments show that the new algorithm is much faster than the original algorithm.展开更多
This paper studies the minimal monomial basis of the n-variable Birkhoff interpolation problem. First, the authors give a fast B-Lex algorithm which has an explicit geometric interpretation to compute the minimal mono...This paper studies the minimal monomial basis of the n-variable Birkhoff interpolation problem. First, the authors give a fast B-Lex algorithm which has an explicit geometric interpretation to compute the minimal monomial interpolation basis under lexieographie order and the algorithm is in fact a generalization of lex game algorithm. In practice, people usually desire the lowest degree interpolation polynomial, so the interpolation problems need to be solved under, for example, graded monomial order instead of lexicographie order. However, there barely exist fast algorithms for the non- lexicographic order problem. Hence, the authors in addition provide a criterion to determine whether an n-variable Birkhoff interpolation problem has unique minimal monomial basis, which means it owns the same minimal monomial basis w.r.t, arbitrary monomial order. Thus, for problems in this case, the authors can easily get the minimal monomial basis with little computation cost w.r.t, arbitrary monomial order by using our fast B-Lex algorithm.展开更多
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. This paper proposes an effective algorithm to compute...Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. This paper proposes an effective algorithm to compute the determinant of a matrix with polynomial entries using hybrid symbolic and numerical computation. The algorithm relies on the Newton＇s interpolation method with error control for solving Vandermonde systems. The authors also present the degree matrix to estimate the degree of variables in a matrix with polynomial entries, and the degree homomorphism method for dimension reduction. Furthermore, the parallelization of the method arises naturally.展开更多
文摘In this paper an error in[4]is pointed out and a method for constructingsurface interpolating scattered data points is presented.The main feature of the methodin this paper is that the surface so constructed is polynomial,which makes the construction simple and the calculation easy.
基金supported by the National Natural Science Foundation of China under Grant No.11688101
文摘This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer terms. Actually, all interpolations are eventually reduced to the interpolation of a list of polynomials with less terms than that of the original polynomial. Extensive experiments show that the new algorithm is much faster than the original algorithm.
基金supported by the National Natural Science Foundation of China under Grant No.11271156Science and Technology Development Plan of Jilin Province under Grant No.20130101179JCPublic Computing Platform in Jilin Province
文摘This paper studies the minimal monomial basis of the n-variable Birkhoff interpolation problem. First, the authors give a fast B-Lex algorithm which has an explicit geometric interpretation to compute the minimal monomial interpolation basis under lexieographie order and the algorithm is in fact a generalization of lex game algorithm. In practice, people usually desire the lowest degree interpolation polynomial, so the interpolation problems need to be solved under, for example, graded monomial order instead of lexicographie order. However, there barely exist fast algorithms for the non- lexicographic order problem. Hence, the authors in addition provide a criterion to determine whether an n-variable Birkhoff interpolation problem has unique minimal monomial basis, which means it owns the same minimal monomial basis w.r.t, arbitrary monomial order. Thus, for problems in this case, the authors can easily get the minimal monomial basis with little computation cost w.r.t, arbitrary monomial order by using our fast B-Lex algorithm.
基金supported by China 973 Project under Grant No.2011CB302402the National Natural Science Foundation of China under Grant Nos.61402537,11671377,91118001China Postdoctoral Science Foundation funded project under Grant No.2012M521692
文摘Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. This paper proposes an effective algorithm to compute the determinant of a matrix with polynomial entries using hybrid symbolic and numerical computation. The algorithm relies on the Newton＇s interpolation method with error control for solving Vandermonde systems. The authors also present the degree matrix to estimate the degree of variables in a matrix with polynomial entries, and the degree homomorphism method for dimension reduction. Furthermore, the parallelization of the method arises naturally.
