Computational Aspects of Quaternionic Polynomials
dx.doi.org/doi:10.3888/tmj.20-5 This article explores the numerical mathematics and visualization capabilities of Mathematica in the framework of quaternion algebra. In this context, we discuss computational aspects of the recently introduced Newton and Weierstrass methods for finding the roots of a quaternionic polynomial. Introduction Since Niven proved in his pioneering work [1] that every nonconstant polynomial of … Continue reading Computational Aspects of Quaternionic Polynomials
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed