Value distributions of the general differential monomials is discussed.The following theorem is obtained:Let f be a transcendental meromorphic function in the plane,F=f n 0 (f (i) ) n i …(f (k) ) ...Value distributions of the general differential monomials is discussed.The following theorem is obtained:Let f be a transcendental meromorphic function in the plane,F=f n 0 (f (i) ) n i …(f (k) ) n k -c,n i≥1,c≠0 be a constant then (n 0-2)T(r,f)≤(r,1F)+S(r,f) when n 0】2;T(r,f)≤7(i+1)i( i) (r,1f)+(r,1F))+S(r,f) when n 0=1;T(r,f)≤7(N(r,1f)+(r,1F))+S(r,f) when n 0=0.展开更多
In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an o...In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.展开更多
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.展开更多
文摘Value distributions of the general differential monomials is discussed.The following theorem is obtained:Let f be a transcendental meromorphic function in the plane,F=f n 0 (f (i) ) n i …(f (k) ) n k -c,n i≥1,c≠0 be a constant then (n 0-2)T(r,f)≤(r,1F)+S(r,f) when n 0】2;T(r,f)≤7(i+1)i( i) (r,1f)+(r,1F))+S(r,f) when n 0=1;T(r,f)≤7(N(r,1f)+(r,1F))+S(r,f) when n 0=0.
文摘In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.
基金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.
