Computing the zeros of quaternion polynomials

被引：43
|
作者：
Serôdio, R [1 ]
Pereira, E
Vitória, J
机构：
[1] Univ Beira Interior, Dept Matemat, P-6200 Covilha, Portugal
[2] Univ Coimbra, Dept Matemat, P-3000 Coimbra, Portugal
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2001年 / 42卷 / 8-9期
关键词：
right (and left) quaternionic eigenvalues; quaternionic polynomials; companion quaternionic matrix;
D O I：
10.1016/S0898-1221(01)00235-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A method is developed to compute the zeros of a quaternion polynomial with all terms of the form q(k) X-k. This method is based essentially in Niven's algorithm [1], which consists of dividing the polynomial by a characteristic polynomial associated to a zero. The information about the trace and the norm of the zero is obtained by an original idea which requires the companion matrix associated to the polynomial. The companion matrix is represented by a matrix with complex entries. Three numerical examples using Mathematica 2.2 version are given. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：1229 / 1237
页数：9
相关论文
共 50 条
  • [1] Zeros of quaternion polynomials
    Serôdio, R
    Siu, LS
    APPLIED MATHEMATICS LETTERS, 2001, 14 (02) : 237 - 239
  • [2] Zeros, factorizations and least common multiples of quaternion polynomials
    Bolotnikov, Vladimir
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2017, 16 (10)
  • [3] Zeros of Two-Sided Quadratic Quaternion Polynomials
    Xu, Wei
    Feng, Lianggui
    Yao, Bo
    ADVANCES IN APPLIED CLIFFORD ALGEBRAS, 2014, 24 (03) : 883 - 902
  • [4] Zeros of Two-Sided Quadratic Quaternion Polynomials
    Wei Xu
    Lianggui Feng
    Bo Yao
    Advances in Applied Clifford Algebras, 2014, 24 : 883 - 902
  • [5] On computing the zeros of Laguerre-Sobolev polynomials
    Laudadio, T.
    Mastronardi, N.
    Espanol, F. J. Marcellan
    Van Buggenhout, N.
    Van Dooren, P.
    NUMERICAL ALGORITHMS, 2025,
  • [6] COMPUTING THE MOMENTS OF THE DENSITY OF ZEROS FOR ORTHOGONAL POLYNOMIALS
    GERMANO, B
    NATALINI, P
    RICCI, PE
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1995, 30 (3-6) : 69 - 81
  • [7] Fast and reliable algorithms for computing the zeros of Althammer polynomials
    Laudadio, Teresa
    Mastronardi, Nicola
    Van Dooren, Paul
    APPLIED NUMERICAL MATHEMATICS, 2025, 207 : 210 - 221
  • [8] An unconditionally convergent method for computing zeros of splines and polynomials
    Morken, Knut
    Reimers, Martin
    MATHEMATICS OF COMPUTATION, 2007, 76 (258) : 845 - 865
  • [9] Localization Theorems for Matrices and Bounds for the Zeros of Polynomials over Quaternion Division Algebra
    Ahmad, Sk Safique
    Ali, Istkhar
    FILOMAT, 2018, 32 (02) : 553 - 573
  • [10] CLASSIFYING ZEROS OF TWO-SIDED QUATERNIONIC POLYNOMIALS AND COMPUTING ZEROS OF TWO-SIDED POLYNOMIALS WITH COMPLEX COEFFICIENTS
    Feng Lianggui
    Zhao Kaiming
    PACIFIC JOURNAL OF MATHEMATICS, 2013, 262 (02) : 317 - 337
12345