Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/51931

TitleWeierstrass method for quaternionic polynomial root-finding
Author(s)Falcão, M. I.
Miranda, Fernando
Severino, Ricardo
Soares, M. J.
KeywordsQuaternionic polynomials
Root-finding methods
Weierstrass algorithm
Issue date2018
PublisherWiley
JournalMathematical Methods in the Applied Sciences
Abstract(s)Quaternions, introduced by Hamilton in 1843 as a generalization of complex numbers, have found, in more recent years, a wealth of applications in a number of different areas that motivated the design of efficient methods for numerically approximating the zeros of quaternionic polynomials. In fact, one can find in the literature recent contributions to this subject based on the use of complex techniques, but numerical methods relying on quaternion arithmetic remain scarce. In this paper, we propose a Weierstrass-like method for finding simultaneously all the zeros of unilateral quaternionic polynomials. The convergence analysis and several numerical examples illustrating the performance of the method are also presented.
TypeArticle
URIhttp://hdl.handle.net/1822/51931
DOI10.1002/mma.4623
ISSN0170-4214
Peer-Reviewedyes
AccessOpen access
Appears in Collections:CMAT - Artigos em revistas com arbitragem / Papers in peer review journals
DMA - Artigos (Papers)
NIPE - Artigos em Revistas de Circulação Internacional com Arbitragem Científica

Files in This Item:
File Description SizeFormat 
FalcaoMirandaSeverinoSoares2018.pdf432,63 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID