In this paper, a high performance solver is presented to solve the large scale sparse linear systems from black oil model of 3-D oil reservoir simulation. The results of this algorithm applied to the simulation show t...In this paper, a high performance solver is presented to solve the large scale sparse linear systems from black oil model of 3-D oil reservoir simulation. The results of this algorithm applied to the simulation show that it is about 16% faster than the original algorithm, and it also improves the precision of the algorithm.展开更多
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.展开更多
文摘In this paper, a high performance solver is presented to solve the large scale sparse linear systems from black oil model of 3-D oil reservoir simulation. The results of this algorithm applied to the simulation show that it is about 16% faster than the original algorithm, and it also improves the precision of the algorithm.
基金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.
