arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.04935math.NAcs.NA
收藏

魏尔斯特拉斯方法用于四元数多项式根寻找

Weierstrass method for quaternionic polynomial root-finding

University of Minho(米尼奥大学)

M. Irene Falcão, Fernando Miranda, Ricardo Severino, M. Joana Soares

AI总结:

本文提出一种基于魏尔斯特拉斯方法的四元数多项式求根算法,用于同时求解单侧四元数多项式的全部零点,并通过收敛性分析和数值实验验证方法有效性。

摘要:

四元数由哈密顿于1843年提出,作为复数的推广,近年来在多个领域中得到了广泛应用,推动了对四元数多项式零点数值逼近方法的研究。事实上,文献中已有基于复数技术的最新贡献,但依赖四元数算术的数值方法仍然较少。本文提出了一种类似于魏尔斯特拉斯的方法,用于同时求解单侧四元数多项式的全部零点。还展示了收敛性分析和多个数值例子,以说明该方法的性能。

英文摘要:

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 which 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 {\sl all} the zeros of unilateral quaternionic polynomials. The convergence analysis and several numerical examples illustrating the performance of the method are also presented.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑