The recursive projection schemes used in most existing recursive methods for solid deformable structure dynamic problems in precision manufacturing systems lead to dense coefficient matrices in the acceleration equations and consequently there is a strong dynamic coupling between the joint and elastic coordinates. When the number of elastic degrees of freedom in engineering materials increases,...

We present our work in progress concerning the logical foundations of the analysis of termination for imperative recursive programs. The analysis is based on forward symbolic execution [12] and functional semantics. The distinctive feature of our approach is the formulation of the termination condition as an induction principle developed from the structure of the program with respect to iterati...

One method to account for parameters errors in the Kalman filter is to ‘consider’ their effect in the so-called Schmidt-Kalman filter. This paper addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU Schmidt-...

Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilities-e.g., finding the smallest number in a list-implies the capacity for certain others-findin...

In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine factorization techniques of both implicit and explicit type, recursive combinatorial algorithms, multilevel mechanisms and overlapping strategies to maximize...

We derive a formal link between temporally weighted frame differences, or disturbance fields, which carry limited information commonly used for motion detection, and the optic flow, which carries rich information on local image motion. We use this to formulate a novel, simple, near-recursive optic flow algorithm based on a recursive-filter formulation. Most quantities involved are computed recu...

Hyperbolic discounting of future outcomes is widely observed to underlie choice behavior in animals. Additionally, recent studies (Kobayashi & Schultz, 2008) have reported that hyperbolic discounting is observed even in neural systems underlying choice. However, the most prevalent models of temporal discounting, such as temporal difference learning, assume that future outcomes are discounted ex...

Remarkable progress inspired by twistors has lead to very simple analytic expressions and to new recursive relations for multi-parton color-ordered amplitudes. We show how such relations can be extended to include color and present the corresponding color-dressed formulation for the Berends-Giele, BCF and a new kind of CSW recursive relations. A detailed comparison of the numerical efficiency o...

One method to account for parameters errors in the Kalman filter is to consider their effect in the so-called Schmidt-Kalman filter. This work addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU consider fi...

We instantiate the general comonad-based construction of recursion schemes for the initial algebra of a functor F to the cofree recursive comonad on F . Differently from the scheme based on the cofree comonad on F in a similar fashion, this scheme allows not only recursive calls on elements structurally smaller than the given argument, but also subsidiary recursions. We develop a Mendler formul...