Within the setting of the categorical approach to total functional programming, we introduce a \many-in-one" recursion scheme that neatly uniies a variety of seemingly diverging strengthenings of the basic recursion scheme of iteration. The new scheme is doubly generic: in addition to being parametric in a functor capturing the signature of an inductive type, it is also parametric in a comonad ...

This paper demonstrates a study on some significant latest innovations in the approximated techniques to find the approximate solutions of Caputo fractional Volterra-Fredholm integro-differential equations. To this aim, the study uses the modified Adomian decomposition method (MADM) and the modified variational iteration method (MVIM). A wider applicability of these techniques are based on thei...

In this paper, we draw upon connections between bilinear programming and the process of computing (post) fixed points in abstract interpretation. It is well-known that the data flow constraints for numerical domains are expressed in terms of bilinear constraints. Algorithms such as policy and strategy iteration have been proposed for the special case of bilinear constraints that arise from temp...

This paper addresses the design of an observer-based fault diagnosis scheme, which is applied to some of the sensors and actuators of a wind turbine benchmark model. The methodology is based on a modified sliding mode observer (SMO) that allows accurate reconstruction of multiple sensor or actuator faults occurring simultaneously. The faults are reconstructed using the equivalent output err...

This paper presents an iterative learning controller using neural network (NN) for the robot trajectory tracking control. Basic control configuration is briefly presented and a new weight-tuning algorithm of NN is proposed with a dead-zone technique. Theoretical proof is given which shows that our modified algorithm guarantees the convergence of NN estimation error in the presence of disturbanc...

In the article a new approach for solving Markovian linear systems is presented. It is the inverse iteration with the use of the WZ factorization. The paper contains the theoretical base of the method and numerical experiment results where the accuracy and the performance time were investigated. A modified (with the use of the SBLAS library and the Harwell-Boeing sparse matrix storage scheme) m...

Multiprocessor architectures with few but powerful processors gain more and more popularity. In this paper we describe a parallel iterative algorithm to perform randomization for a continuous time Markov chain with a Kronecker representation on a shared memory architecture. The Kronecker representation is modified for a parallel matrixvector multiplication with a fast multiplication scheme and ...

This paper presents an algorithm for Positron Emission Tomography reconstruction running on a GPU cluster. The most computation intensive part of the reconstruction process, the forward projection, is re-interpreted as a geometric problem, that can efficiently be solved by the graphics hardware. We also investigate the possibilities to further increase the speed and to sidestep the texture memo...

number of iterationsrequired to meet the convergencecriterion. the converged solutions from the previous step. This significantly reduces the interfacial boundaries, the initial estimates for the interfacial flux is given from scheme. Outside of the first time step where zero initial flux is assumed on all between subdomains are satisfied using a Schwarz Neumann-Neumam iteration method which is...