Parallel computation of determinants of matrices with multivariate polynomial entries
- 238 Downloads
In this paper we present an extension to the work of Björck 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.
Keywordsdeterminant interpolation parallel algorithm
Unable to display preview. Download preview PDF.
- 7.Chen L. Study on Several Parallel Algorithms of Symbolic Computation. Dissertation for the Doctoral Degree. Shanghai: East China Normal University. 2008Google Scholar
- 15.Yang K, Fu S, Hu H, et al. Real solution number of the nonlinear equations in the SHEPWM technology. In: Proceedings of International Conference on Intelligent Control and Information Processing (ICICIP). Dalian: IEEE Press, 2010. 446–450Google Scholar
- 16.Ben-Or M, Tiwari P. A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proceedings of the 20th Annual ACM Symposium of Theory of Computing. New York: ACM Press, 1988. 301–309Google Scholar