Moore introduced a class of real-valued “recursive” functions by analogy with Kleene’s formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some technical inaccuracies. Focusing on his “primitive recursive” functions, we pin down what is problematic and discuss possible attempts to remove the ambiguity r...

A recursive formulation of an exponential smoothing filter is developed, within the framework of a least square error approach with data uncertainties that increase exponentially with time. An efficient implementation into Java is presented. By analogy to the Kalman filter, an interpretation of the gain as a ratio of uncertainties leads to a measure of validity for the recursive exponential fil...

Recently recursive algorithm has been used in getting Fisher criterion based linear discriminants through which the features obtained are statistically uncorrelated. This paper investigates a simpler and faster approach to compute uncorrelated discriminants. This is done by first mapping the input data onto an uncorrelated feature space and computing Fisher criterion based discriminants in that...

Recursive algorithms for symmetric indeenite linear systems are considered in the present paper. First, the diiculties with the recur-sive formulation of the LAPACK SYSV algorithm (which implements the Bunch-Kaufman pivoting strategy) are discussed. Then a recursive perturbation based algorithm is proposed and tested. The experiments show that the new algorithm can be about two times faster alt...

In this work we implement a parallel finite element mesh generator for two-dimensional regions, based on recursive spatial division techniques. The main formulation is based on spatial recursive decomposition techniques (RSD) combined with the MPI library. A data structure has been developed aimed at the reduction of inter-processor communication. Results are presented for generation of meshes ...

We investigate the performance benefits of a novel recursive formulation of Strassen’s algorithm over highly tuned matrix-multiply (MM) routines, such as the widely used ATLAS for high-performance systems. We combine Strassen’s recursion with high-tuned version of ATLAS MM and we present a family of recursive algorithms achieving up to 15% speed-up over ATLAS alone. We show experimental results...

Generalized left-corner parsing was originally presented as a technique for generating a parser for the SLR(1) class of grammars but with far fewer states than the SLR(1) parser. This paper modi es and extends the formulation of left-corner parsers so that it is possible to apply the technique to the LALR(1) and LR(1) classes of grammars. It is further shown that left-corner parsers can be conv...

We present a discrete-time mathematical formulation for applying recursive digital filters to non-uniformly sampled signals. Our solution presents several desirable features: it preserves the stability of the original filters; is well-conditioned for low-pass, high-pass, and band-pass filters alike; its cost is linear in the number of samples and is not affected by the size of the filter suppor...