Detalhes bibliográficos
| Resumo: | In this paper we focus on computational aspects associated with polynomial problems in the ring of one-sided quaternionic polynomials. The complexity and error bounds of quaternion arithmetic are considered and several evaluation schemes are analyzed from their complexity point of view. The numerical stability of generalized Horner’s and Goertzel’s algorithms to evaluate polynomials with quaternion floating-point coefficients is addressed. Numerical tests illustrate the behavior of the algorithms from the point of view of performance and accuracy. |
|---|
| Autores principais: | Falcão, M. I. |
|---|
| Outros Autores: | Miranda, Fernando; Severino, Ricardo; Soares, M. J. |
|---|
| Assunto: | Error analysis Polynomial evaluation Quaternions |
|---|
| Ano: | 2018 |
|---|
| País: | Portugal |
|---|
| Tipo de documento: | artigo |
|---|
| Tipo de acesso: | acesso aberto |
|---|
| Instituição associada: | Universidade do Minho |
|---|
| Idioma: | inglês |
|---|
| Origem: | RepositóriUM - Universidade do Minho |
|---|