Parallel computation of determinants of matrices with multivariate polynomial entries  

作　　者：CHEN LiangYu ZENG ZhenBing 

机构地区：[1]Shanghai Key Laboratory of Trustworthy Computing, East China Normal University

出　　处：《Science China(Information Sciences)》2013年第11期154-169,共16页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant No.61021004);Specialized Research Fund for the Doctoral Program of Higher Education(Grant Nos.20110076110010,20110076120015);Shanghai Municipal Natural Science Foundation(Grant No.11ZR1411500);Innovation Program of Shanghai Municipal Education Commission(Grant No.11ZZ37);Shanghai Leading Academic Discipline Project(Grant No.B412);Fundamental Research Funds for the Central Universities(Grant No.78210152)

摘　　要：In this paper we present an extension to the work of Bjorck et al. for computing the determinants of matrices with univariate or bivariate polynomials as entries to multivariate case. The algorithm supports parallel computation and has been implemented on a multi-core cluster computer system. We show how to use our approach to calculate two unsolved problems, which arise from computational geometry optimization and electric power engineering, and analyze the time complexity as well as bits complexity.In this paper we present an extension to the work of Bjorck et al. for computing the determinants of matrices with univariate or bivariate polynomials as entries to multivariate case. The algorithm supports parallel computation and has been implemented on a multi-core cluster computer system. We show how to use our approach to calculate two unsolved problems, which arise from computational geometry optimization and electric power engineering, and analyze the time complexity as well as bits complexity.

关 键 词：DETERMINANT INTERPOLATION parallel algorithm 

分 类 号：TP338.6[自动化与计算机技术—计算机系统结构] O174.14[自动化与计算机技术—计算机科学与技术]