Evaluation schemes in the ring of quaternionic polynomials
From MaRDI portal
Publication:1742581
DOI10.1007/S10543-017-0667-8OpenAlexW2669421387MaRDI QIDQ1742581
Fernando Miranda, Ricardo Severino, Maria Joana Soares, Maria Irene Falcão
Publication date: 11 April 2018
Published in: BIT (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/54576
Complexity and performance of numerical algorithms (65Y20) Quaternion and other division algebras: arithmetic, zeta functions (11R52)
Related Items (2)
Factorization and root-finding for polynomials over division quaternion algebras ⋮ The number of zeros of unilateral polynomials over coquaternions revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- Function theory in plane and space
- Algorithms for accurate, validated and fast polynomial evaluation
- Numerical methods for roots of polynomials. Part I
- Rounding error propagation in polynomial evaluation schemes
- On improving the accuracy of Horner's and Goertzel's algorithms
- Improved Error Bounds for Inner Products in Floating-Point Arithmetic
- An Algorithm for the Evaluation of Finite Trigonometric Series
- Error Analysis for Fourier Series Evaluation
- On the Structure of the Set of Zeros of Quaternionic Polynomials
- Accuracy and Stability of Numerical Algorithms
- On the Zeros of Polynomials over Division Rings
- An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
- Equations in Quaternions
- Zeros of quaternion polynomials
- Quaternions and matrices of quaternions
This page was built for publication: Evaluation schemes in the ring of quaternionic polynomials