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 116
- Downloads 0
Numerical solution of mixed Volterra-Fredholm integral equations using iterative method via two-variables Bernstein polynomials
This paper is concerned with the numerical solution of mixed Volterra-Fredholm integral equations, based on iterative method and two variable Bernstein polynomials. In the main result, this method has several benefits in...
Derivative-free method for bound constrained nonlinear monotone equations and its application in solving steady state reaction-diffusion problems
We present a derivative-free algorithm for solving bound constrained systems of nonlinear monotone equations. The algorithm generates feasible iterates using in a systematic way the residual as search direction and a sui...
Fitting of parameters for a temperature control model by means of continuous derivative-free optimization: a case study in a broiler house
Intensive broiler production requires of accurate control systems aimed to maintain ideal conditions inside the facilities. The achievement of an appropriate environment guarantees good performance and sustainability of...
Complex Neutrosophic Graphs
In this research article, we introduce the notion of complex neutrosophic graphs (cn-graphs, for short) and discuss some basic operations related to cn-graphs. We describe these operations with some examples. We also pr...
A convex optimization approach for solving large scale linear systems
The well-known Conjugate Gradient (CG) method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this wo...