Results 1  10
of
2,640
From implicit to recursive equations *
"... The technique of relaxed power series expansion provides an efficient way to solve so called recursive equations of the form F = Φ(F ), where the unknown F is a vector of power series, and where the solution can be obtained as the limit of the sequence 0, Φ(0), Φ(Φ(0)), . With respect to other tech ..."
Abstract
 Add to MetaCart
The technique of relaxed power series expansion provides an efficient way to solve so called recursive equations of the form F = Φ(F ), where the unknown F is a vector of power series, and where the solution can be obtained as the limit of the sequence 0, Φ(0), Φ(Φ(0)), . With respect to other
Hardware Description with Recursion Equations
 In Proceedings of the IFIP 8th International Symposium on Computer Hardware Description Languages and their Applications
, 1987
"... this paper develops such a scheme, called "hardware description with recursion equations" (abbreviated HDRE and pronounced as hydra). A designer using HDRE may describe a circuit using a simple set of primitive functions written in an underlying general purpose programming language, and th ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
this paper develops such a scheme, called "hardware description with recursion equations" (abbreviated HDRE and pronounced as hydra). A designer using HDRE may describe a circuit using a simple set of primitive functions written in an underlying general purpose programming language
Flat Domains and Recursive Equations in
, 2002
"... Flat domains can be viewed as a “logic ” of total functions in which every recursive equation has at least one function that satisfies it. One formalization of flat domains in ACL2 is presented in some detail. Flat domains are reviewed in enough detail to make this paper self contained for those who ..."
Abstract
 Add to MetaCart
Flat domains can be viewed as a “logic ” of total functions in which every recursive equation has at least one function that satisfies it. One formalization of flat domains in ACL2 is presented in some detail. Flat domains are reviewed in enough detail to make this paper self contained for those
TIGHTNESS FOR A FAMILY OF RECURSION EQUATIONS
"... Abstract. In this paper, we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on treelike structures. Examples include the maximal displacement of branching random walk in one dimension, and the cover time of symmetric ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
Abstract. In this paper, we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on treelike structures. Examples include the maximal displacement of branching random walk in one dimension, and the cover time
Lambda Lifting: Transforming Programs to Recursive Equations
, 1985
"... Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules. Different ways of doing lambd ..."
Abstract

Cited by 218 (4 self)
 Add to MetaCart
that the input program is in the form of a set of function definitions, possibly mutually recursive, tog...
Recursive equations for arbitrary scattering processes ∗
, 2006
"... The usefulness of recursive equations to compute scattering matrix elements for arbitrary processes is discussed. Explicit results at tree and oneloop order, obtained by the HELAC/PHEGAS package that is based on the DysonSchwinger recursive equations approach, are briefly presented. 1. ..."
Abstract
 Add to MetaCart
The usefulness of recursive equations to compute scattering matrix elements for arbitrary processes is discussed. Explicit results at tree and oneloop order, obtained by the HELAC/PHEGAS package that is based on the DysonSchwinger recursive equations approach, are briefly presented. 1.
The logic of recursive equations
 the Journal of Symbolic Logic
, 1998
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JS ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.
Recursive Equations for Majorana Currents
, 2009
"... A recursive computation of scattering amplitudes including Majorana fermions requires a consistent definition of the fermion flow, which is introduced by Denner et al. in a diagrammatic setting. A systematic treatment in the offshell current formalism is proposed, which involves explicit reversal o ..."
Abstract
 Add to MetaCart
A recursive computation of scattering amplitudes including Majorana fermions requires a consistent definition of the fermion flow, which is introduced by Denner et al. in a diagrammatic setting. A systematic treatment in the offshell current formalism is proposed, which involves explicit reversal
(T) THE MIGDAL APPROXIMATE RECURSION EQUATION*?
, 1977
"... Migdal’s recursion equation proposed for the Wilson lattice gauge theory is studied for its weak and strong coupling behavior. The model is then solved numerically for the SU(2) gauge field, and it is shown that there is a continuous crossover from the weak coupling (asymptotically free) region to ..."
Abstract
 Add to MetaCart
Migdal’s recursion equation proposed for the Wilson lattice gauge theory is studied for its weak and strong coupling behavior. The model is then solved numerically for the SU(2) gauge field, and it is shown that there is a continuous crossover from the weak coupling (asymptotically free) region
A Temporal Algebra with Recursive Equations
, 1995
"... This paper introduces a recursive temporal algebra for querying timevarying data. The algebra, called ! , is based on a temporal relational data model in which a temporal database is modeled as a collection of timevarying relations. Each timevarying relation is a collection of ordinary relatio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
relations indexed by moments in time. In ! , recursive queries (such as the transitive closure of a given relation) can be formulated through equations. It is shown that other forms of recursion, such as linear recursion, can also be expressed using iteration through time. The meaning of recursive
Results 1  10
of
2,640