Please use this identifier to cite or link to this item:

TitleOn numerical aspects of pseudo-complex powers in R^3
Author(s)Cruz, Carla
Falcão, M. I.
Malonek, H. R.
KeywordsPseudo-complex powers
Monogenic polynomials
Vandermonde matrix
monogenic polynomails
Issue date2014
PublisherSpringer International Publishing
JournalLecture Notes in Computer Science
Abstract(s)In this paper we consider a particularly important case of 3D monogenic polynomials that are isomorphic to the integer powers of one complex variable (called pseudo-complex powers or pseudo-complex polynomials, PCP). The construction of bases for spaces of monogenic polynomials in the framework of Clifford Analysis has been discussed by several authors and from different points of view. Here our main concern are numerical aspects of the implementation of PCP as bases of monogenic polynomials of homogeneous degree k. The representation of the well known Fueter polynomial basis by a particular PCP-basis is subject to a detailed analysis for showing the numerical effciency of the use of PCP. In this context a modiffcation of the Eisinberg-Fedele algorithm for inverting a Vandermonde matrix is presented.
TypeConference paper
Publisher version
AccessOpen access
Appears in Collections:CMAT - Artigos em atas de conferências e capítulos de livros com arbitragem / Papers in proceedings of conferences and book chapters with peer review

Files in This Item:
File Description SizeFormat 
Falcao2014cRepositorio.pdfDocumento principal2,42 MBAdobe 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