A recursive fixed-point-type method is presented to find the optimal control of a statevariable model of the megawatt-frequency control problem of multiarea electric energy systems. The results give the numerical decomposition so that only low-order systems are involved in algebraic computations. This approach is conceptually simple and produces considerable savings of computation.

This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize contextfree grammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.

The quantum correlations of scalar fields are examined as a power series in derivatives. Recursive algebraic equations are derived and determine the amplitudes; all loop integrations are performed. This recursion contains the same information as the usual loop expansion. The approach is pragmatic and generalizable to most quantum field theories.

Structurally recursive XML queries are an important query class that follows the structure of XML data. At present, it is difficult for XQuery to type and optimize structurally recursive queries because of polymorphic recursive functions involved in the queries. In this paper, we propose a new technique called structural function inlining which inlines recursive functions used in a query by mak...

We propose two new modified recursive schemes for solving a class of doubly singular two-point boundary value problems. These schemes are based on Adomian decomposition method ADM and new proposed integral operators. We use all the boundary conditions to derive an integral equation before establishing the recursive schemes for the solution components. Thus we develop recursive schemes without a...

Synopsis We give a general axiomatic construction of solutions to recursive domain equations, applicable both to classical models of domain theory and to realizability models. The approach is based on embedding categories of predomains in models of intuitionistic set theory. We show that the existence of solutions to recursive domain equations depends on the strength of the set theory. Such sol...

This paper presents a framework for synthesizing eecient out-of-core programs for block recursive algorithms such as the fast Fourier transform (FFT) and Batcher's bitonic sort. The block recursive algorithms considered in this paper are described using tensor (Kronecker) product and other matrix operations. The algebraic properties of the matrix representation are used to derive eecient out-of...

We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we do not produce the recursive types via the usual inverse limits constructions we have it for free by working directly with the operational semantics. By extending type expressions to endofunctors on a ‘syntactic’ categ...

Algebraic integers have been proven beneficial to DFT and nonrecursive FIR filter designs [2, 4] since algebraic integers can be dense in C , resulting in short word width, high speed designs. This paper uses another property of algebraic integers: algebraic integers can produce exact pole zero cancellation pairs that are used in recursive FIR, frequency sampling filter designs.

In [13] for a given vectorial Boolean function F from F2 to itself it was defined an associated Boolean function γF (a, b) in 2n variables that takes value 1 iff a 6= 0 and equation F (x) + F (x + a) = b has solutions. In this paper we introduce the notion of differentially equivalent functions as vectorial functions that have equal associated Boolean functions. It is an interesting open proble...