In this paper, we study the convergence rate of two-dimensional Baakakov operators with Jacobi-weights and the approximation equivalence theorem is obtained, making use of multivariate decompose skills and results of ...In this paper, we study the convergence rate of two-dimensional Baakakov operators with Jacobi-weights and the approximation equivalence theorem is obtained, making use of multivariate decompose skills and results of one-dimensional Baskakov operators.展开更多
By using the theory of coincidence degree, we study a kind of periodic solutions to second order differential equation with a deviating argument such as x″（t） ＋ f（x′（t）） ＋ h（x（t））x′（t） ＋ g（x（t - τ...By using the theory of coincidence degree, we study a kind of periodic solutions to second order differential equation with a deviating argument such as x″（t） ＋ f（x′（t）） ＋ h（x（t））x′（t） ＋ g（x（t - τ（t））） ≈ p（t）, some sufficient conditions on the existence of periodic solutions are obtained.展开更多
Factorization of polynomials is one of the foundations of symbolic computation.Its applications arise in numerous branches of mathematics and other sciences.However,the present advanced programming languages such as C...Factorization of polynomials is one of the foundations of symbolic computation.Its applications arise in numerous branches of mathematics and other sciences.However,the present advanced programming languages such as C++ and J++,do not support symbolic computation directly.Hence,it leads to difficulties in applying factorization in engineering fields.In this paper,the authors present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational coefficients.The proposed method can be directly implemented in efficient programming language such C++ together with the GNU Multiple-Precision Library.In addition,the numerical computation part often only requires double precision and is easily parallelizable.展开更多
Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynom...Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.展开更多
基金Supported by the Scientific Research Fund of Zhejiang Province Education Depart-ment(200700190) Supported by the Science Technique Planed Item of Taizhou City(063KY08)Supported by Major Scientific Research Fund of Taizhou University(09ZD08)
文摘In this paper, we study the convergence rate of two-dimensional Baakakov operators with Jacobi-weights and the approximation equivalence theorem is obtained, making use of multivariate decompose skills and results of one-dimensional Baskakov operators.
基金the Natural Science Foundation of Anhui Province(050460103)the Natural Science Foundation by the Bureau of Education of Anhui Province(2005kj031ZD)
文摘By using the theory of coincidence degree, we study a kind of periodic solutions to second order differential equation with a deviating argument such as x″（t） ＋ f（x′（t）） ＋ h（x（t））x′（t） ＋ g（x（t - τ（t））） ≈ p（t）, some sufficient conditions on the existence of periodic solutions are obtained.
基金partly supported by the National Natural Science Foundation of China under Grant Nos.91118001 and 11170153the National Key Basic Research Project of China under Grant No.2011CB302400Chongqing Science and Technology Commission Project under Grant No.cstc2013jjys40001
文摘Factorization of polynomials is one of the foundations of symbolic computation.Its applications arise in numerous branches of mathematics and other sciences.However,the present advanced programming languages such as C++ and J++,do not support symbolic computation directly.Hence,it leads to difficulties in applying factorization in engineering fields.In this paper,the authors present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational coefficients.The proposed method can be directly implemented in efficient programming language such C++ together with the GNU Multiple-Precision Library.In addition,the numerical computation part often only requires double precision and is easily parallelizable.
基金supported by National Natural Science Foundation of China(GrantNos.91118001 and 11170153)National Key Basic Research Project of China(Grant No.2011CB302400)Chongqing Science and Technology Commission Project(Grant No.cstc2013jjys40001)
文摘Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.
