arrow
返回

An effective hybrid algorithm for computing symbolic determinants

delete2009-12-01
delete5
PRE
AI
Y
Yi Li *
DOI:10.1016/j.amc.2009.08.056delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
A hybrid algorithm for computing the determinant of a matrix whose entries are polynomials is presented. It is based on the dimension-decreasing algorithm [22] and the parallel algorithm for computing a symbolic determinant of [19]. First, through the dimension-decreasing algorithm, a given multivariate matrix can be converted to a bivariate matrix. Then, the parallel algorithm can be applied to effectively compute the determinant of the bivariate matrix. Experimental results show that the new algorithm can not only reduce enormously the intermediate expression swell in the process of symbolic computation, but also achieve higher degree of parallelism, compared with the single parallel algorithm given in [19]. (C) 2009 Elsevier Inc. All rights reserved.
Keyword:
Symbolic determinants
Dimension-decreasing algorithm
Parallel computation
Resultant computation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Mathematics and Computation 封面图
Applied Mathematics and Computation
IF:
3.4
论文数:
2.3W
被引数:
3.3W

机构

暂无机构信息
引用论文

引用论文

err2003-01-01
err0
PREAI
errErich H. Loewy
err分享
err收藏
Interaction of Native and Apo-carbonic Anhydrase with Hydrophobic Adsorbents: A Comparative Structure-function Study
err2006-09-30
err0
errOAAI
errZahra Salemi; Saman Hosseinkhani; Bijan Ranjbar; Mohsen Nemat-Gorgani
err分享
err收藏
没有更多内容