Algebraic structures in generalized Clifford analysis and applications to boundary value problems
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2015, Vol 3, Issue 2
Abstract
The present article has a threefold purpose: First it is a survey of the algebraic structures of generalized Clifford-type algebras and shows the main results of the corresponding Clifford-type analysis and its application to boundary value problems known so far. Second it is aimed to implement algorithms to provide the fast and accurate computation of boundary value problems for inhomogeneous equations in the framework of the generalized Clifford analysis. Finally it is also aimed to encourage the development of a generalized discrete Clifford analysis.
Authors and Affiliations
José Játem, Judith Vanegas
Keywords
Related Articles
- EP ID EP240522
- DOI -
- Views 119
- Downloads 0
Transitivity of parametric family of cardinality-based fuzzy similarity measures using Lukasiewicz t-norm
In fuzzy logic, where members of a set might be linguistic terms, the degree of reflexivity might be in unit interval [0,1] instead of {0,1}. This behaviour of a fuzzy set plays an important role especially in the field...
Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
To achieve the good features of the linear conjugate gradient algorithm in a recent extension of the Dai-Liao method, two adaptive choices for parameter of the extended method are proposed based on a penalization approac...
Stability and square integrability of solutions of nonlinear fourth order differential equations
The aim of the present paper is to establish a new result, which guarantees the asymptotic stability of zero solution and square integrability of solutions and their derivatives to nonlinear differential equations of fou...
Total dominator chromatic number of some operations on a graph
Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominat...
Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
Inexact restoration (IR) is a well established technique for continuous minimization problems with constraints that can be applied to constrained optimization problems with specific structures. When some variables are re...