3D mappings by generalized joukowski transformations

The classical Joukowski transformation plays an important role in di erent applications of conformal mappings, in particular in the study of ows around the so-called Joukowski airfoils. In the 1980s H. Haruki and M. Barran studied generalized Joukowski transformations of higher order in the complex plane from the view point of functional equations. The aim of our contribution is to study the analogue of those generalized Joukowski transformations in Euclidean spaces of arbitrary higher dimension by methods of hypercomplex analysis. They reveal new insights in the use of generalized holomorphic functions as tools for quasi-conformal mappings. The computational experiences focus on 3D-mappings of order 2 and their properties and visualizations for di erent geometric con gurations, but our approach is not restricted neither with respect to the dimension nor to the order.Financial support from "Center for Research and Development in Mathematics and Applications" of the University of Aveiro, through the Portuguese Foundation for Science and Technology (FCT), is gratefully acknowledged. The research of the first author was also supported by the FCT under the fellowship SFRH/BD/44999/2008. Moreover, the authors would like to thank the anonymous referees for their helpful comments and suggestions which improved greatly the final manuscript

Numerical experiments with Bergman kernel functions in 2 and 3 dimensional cases

Pub. Int. CMAT, 1 (2003)In this paper we revisit the so-called Bergman kernel method - BKM- for solving conformal mapping problems and propose a generalized BKM-approach to extend the theory to 3-dimensional mapping problems. A special software package for quaternions was developed for the numerical experiments

A note on totally regular variables and Appell sequences in hypercomplex function theory

Series title : Lecture notes in computer science, vol. 7971, ISSN 0302-9743The aim of our contribution is to call attention to the relationship between totally regular variables, introduced by R. Delanghe in 1970, and Appell sequences with respect to the hypercomplex derivative. Under some natural normalization condition the set of all paravector valued totally regular variables defined in the three dimensional Euclidean space will be completely characterized. Together with their integer powers they constitute automatically Appell sequences, since they are isomorphic to the complex variables.Fundação para a Ciência e a Tecnologia (FCT

A 3-dimensional Bergman Kernel method with applications to rectangular domains

In this paper we revisit the so-called Bergman kernel method - BKM - for solving conformal mapping problems and propose a generalized BKM-approach to extend the theory to 3-dimensional mapping problems. A special software package for quaternions was developed for the numerical experiments.Fundação para a Ciência e a Tecnologia (FCT

A matrix recurrence for systems of Clifford algebra-valued orthogonal polynomials

Recently, the authors developed a matrix approach to multivariate polynomial sequences by using methods of Hypercomplex Function Theory ("Matrix representations of a basic polynomial sequence in arbitrary dimension". Comput. Methods Funct. Theory, 12 (2012), no. 2, 371-391). This paper deals with an extension of that approach to a recurrence relation for the construction of a complete system of orthogonal Clifford-algebra valued polynomials of arbitrary degree. At the same time the matrix approach sheds new light on results about systems of Clifford algebra-valued orthogonal polynomials obtained by Guerlebeck, Bock, Lavicka, Delanghe et al. during the last five years. In fact, it allows to prove directly some intrinsic properties of the building blocks essential in the construction process, but not studied so far.Fundação para a Ciência e a Tecnologia (FCT

Three-term recurrence relations for systems of Clifford algebra-valued orthogonal polynomials

Recently, systems of Clifford algebra-valued orthogonal polynomials have been studied from different points of view. We prove in this paper that for their building blocks there exist some three-term recurrence relations, similar to that for orthogonal polynomials of one real variable. As a surprising byproduct of own interest we found out that the whole construction process of Clifford algebra-valued orthogonal polynomials via Gelfand-Tsetlin basis or otherwise relies only on one and the same basic Appell sequence of polynomials.This work was supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications of the University of Aveiro, the CMAT - Research Centre of Mathematics of the University of Minho and the FCT - Portuguese Foundation for Science and Technology (“Fundação para a Ciˆencia e a Tecnologia”), within projects PEst-OE/MAT/UI4106/2014 and PEst-OE/MAT/UI0013/2014.info:eu-repo/semantics/publishedVersio

Matrix representations of a special polynomial sequence in arbitrary dimension

This paper provides an insight into different structures of a special polynomial sequence of binomial type in higher dimensions with values in a Clifford algebra. The elements of the special polynomial sequence are homogeneous hypercomplex differentiable (monogenic) functions of different degrees and their matrix representation allows to prove their recursive construction in analogy to the complex power functions. This property can somehow be considered as a compensation for the loss of multiplicativity caused by the non-commutativity of the underlying algebra.Fundação para a Ciência e a Tecnologia (FCT

Harmonic analysis and hypercomplex function theory in co-dimension one

Fundamentals of a function theory in co-dimension one for Clifford algebra valued functions over ℝn+1 are considered. Special attention is given to their origins in analytic properties of holomorphic functions of one and, by some duality reasons, also of several complex variables. Due to algebraic peculiarities caused by non-commutativity of the Clifford product, generalized holomorphic functions are characterized by two different but equivalent properties: on one side by local derivability (existence of a well defined derivative related to co-dimension one) and on the other side by differentiability (existence of a local approximation by linear mappings related to dimension one). As important applications, sequences of harmonic Appell polynomials are considered whose definition and explicit analytic representations rely essentially on both dual approaches.The work of the first, second and fourth authors was supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications, and the Portuguese Foundation for Science and Technology (“FCT-Fundação para a Ciência e Tecnologia”), within project PEst-OE/MAT/UI4106/2013. The work of the second author was supported by Portuguese funds through the CMAT - Centre of Mathematics and FCT within the Project UID/MAT/00013/2013

On an hypercomplex generalization of Gould-Hopper and related Chebyshev polynomials

An operational approach introduced by Gould and Hopper to the construction of generalized Hermite polynomials is followed in the hypercomplex context to build multidimensional generalized Hermite polynomials by the consideration of an appropriate basic set of monogenic polynomials. Directly related functions, like Chebyshev polynomials of first and second kind are constructed

On numerical aspects of pseudo-complex powers in R^3

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.This work was supported by Portuguese funds through the CIDMA - Center for Research and Development in Mathematics and Applications, the Research Centre of Mathematics of the University of Minho and the Portuguese Foundation for Science and Technology ("FCT - Fundacao para a Ciencia e a Tecnologia"), within projects PEst-OE/MAT/UI4106/2014 and PEstOE/MAT/UI0013/2014