Computing the zeros of quaternion polynomials

Citation
R. Serodio et al., Computing the zeros of quaternion polynomials, COMPUT MATH, 42(8-9), 2001, pp. 1229-1237
Citations number
9
Categorie Soggetti
Computer Science & Engineering
Journal title
COMPUTERS & MATHEMATICS WITH APPLICATIONS
ISSN journal
08981221 → ACNP
Volume
42
Issue
8-9
Year of publication
2001
Pages
1229 - 1237
Database
ISI
SICI code
0898-1221(200110/11)42:8-9<1229:CTZOQP>2.0.ZU;2-5
Abstract
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 characterist ic 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 compan ion matrix associated to the polynomial. The companion matrix is represente d by a matrix with complex entries. Three numerical examples using Mathemat ica 2.2 version are given. (C) 2001 Elsevier Science Ltd. All rights reserv ed.