Search

This article introduces the idea of bicomplex valued S-metric space and deduces some of its features. Additionally, for bicomplex valued S-metric spaces, some fixed point results of contraction maps are shown to meet various categories of rational inequalities. Moreover, these results generalize certain significant, well-known results. An example is provided to highlight our major result. Furthermore, a theorem guaranteeing the existence of the one and only solution to the linear system of equations was developed using our main result.

This article presents the results of an investigation into the construction of knowledge. We areparticularly interested in studying the processes involved in the articulation of conceptualmathematics systems which we have called processes of convention and mathematical articulation(Martínez-Sierra, 2005). More specifically, this work looks further into which alternatives may befeasible for the construction of the meaning of complex numbers in schools, under the hypothesisthat meaning can be built through the process of mathematical convention. The analysis of thestudents’ production, while working on a sequence of activities designed by us based on the abovehypothesis, provides evidence that in spite of the students’ insistence that “square roots of negativenumbers do not exist,” our sequence induced them to operate with them and in this way build ameaning on the operative plane.

Cet article décrit un algorithme de transformation de Fourier rapide proposé récemment, qui présente des avantages en complexité de calcul, occupation mémoire et régularité de structure. Après avoir brièvement décrit l'algorithme à double base dans le cas de signaux complexes, l'application aux cas de signaux réels et réels symétriques est examinée, ainsi que le lien avec un algorithme optimal quant au nombre de multiplications complexes non triviales. A detailed description of a recent algorithm for the fast computation of the discrete Fourier transform is presented. This algorithm has some advantages when considering computational complexity, « in place» computation, and regularity of its implementation. After briefly recalling the split-radix algorithm in the case of complex data, we show how it can be adapted to real and real symmetrical data. Finally, we enlight the relationship between split-radix algorithm, and an algorithm with minimum number of non-trivial complex multiplication. [ABSTRACT FROM AUTHOR]