GREATEST COMMON DIVISOR OF GENERALIZED POLYNOMIALS AND POLYNOMIAL MATRICES

被引:10
|
作者
MAROULAS, J
BARNETT, S
机构
关键词
D O I
10.1016/0024-3795(78)90071-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:195 / 210
页数:16
相关论文
共 50 条
  • [41] Numerical Matrix Methods in the Computation of the Greatest Common Divisor (GCD) of Polynomials
    Isa, Siti Nor Asiah Binti
    Aris, Nor'aini
    Puzi, Shazirawati Mohd
    INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2016 (ICOMEIA2016), 2016, 1775
  • [42] Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
    Halikias, G.
    Galanis, G.
    Karcanias, N.
    Milonidis, E.
    IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 2013, 30 (04) : 423 - 442
  • [43] Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
    Diaz-Toca, GM
    Gonzalez-Vega, L
    JOURNAL OF SYMBOLIC COMPUTATION, 2002, 34 (01) : 59 - 81
  • [44] A GREATEST COMMON DIVISOR IDENTITY
    Zhi, Yuanhong
    TEACHING OF MATHEMATICS, 2018, 21 (02): : 73 - 79
  • [45] A greatest common divisor algorithm
    Belenkiy, A
    Vidunas, R
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 1998, 8 (05) : 617 - 623
  • [46] An ODE-based method for computing the approximate greatest common divisor of polynomials
    Antonio Fazzi
    Nicola Guglielmi
    Ivan Markovsky
    Numerical Algorithms, 2019, 81 : 719 - 740
  • [47] Two resultant based methods computing the greatest common divisor of two polynomials
    Triantafyllou, D
    Mitrouli, A
    NUMERICAL ANALYSIS AND ITS APPLICATIONS, 2005, 3401 : 519 - 526
  • [48] Rings with the greatest common divisor
    Koryukin A.N.
    Sebeldin A.M.
    Sylla A.L.
    Journal of Mathematical Sciences, 2012, 183 (3) : 319 - 322
  • [49] AN ITERATIVE ALGORITHM FOR DETERMINING THE GREATEST COMMON DIVISOR OF TWO OR MORE UNIVARIATE POLYNOMIALS
    Milutinovic, Verica
    MATHEMATICS AND INFORMATICS, 2024, 67 (04): : 392 - 405
  • [50] An ODE-based method for computing the approximate greatest common divisor of polynomials
    Fazzi, Antonio
    Guglielmi, Nicola
    Markovsky, Ivan
    NUMERICAL ALGORITHMS, 2019, 81 (02) : 719 - 740