On the Relation Between Matrices and the Greatest Common Divisor of Polynomials

被引：0
|
作者：
Manev, Nikolai L. [1 ,2 ]
机构：
[1] Univ Struct Engn & Architecture Lyuben Karavelov, Sofia, Bulgaria
[2] BAS, Inst Math & Informat, Sofia, Bulgaria
来源：
LARGE-SCALE SCIENTIFIC COMPUTING, LSSC 2015 | 2015年 / 9374卷
关键词：
Greatest common divisor of polynomials; Reduced row echelon form; Gauss elimination;
D O I：
10.1007/978-3-319-26520-9_20
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Following the Barnett's approach to gcd(a(x), b(x)) based on the use of companion matrix we develop an extended algorithm that gives effectively d(x), u(x), v(x), a(1)(x) and b(1)(x), where a(1)(x) = a(x)/d(x), b(1)(x) = b(x)/d(x) and d(x) = u(x)a(x) + v(x)b(x). The algorithm is suitable for parallel realization on GPU, FPGA, and smart cards.
引用
收藏
页码：191 / 199
页数：9
相关论文
共 50 条
12345