Skip to search formSkip to main contentSkip to account menu

Recurrence relation

Known as: Recurrences, Difference equations, Recurrence relations 
In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
We prove that every n-modal logic between K and S5 is undecidable, whenever n ≥ 3. We also show that each of these logics is non… 
Review
2005
Review
2005
• Objective: To assess the strength of the evidence for disclosing errors to patients, focusing on patients’ and physicians… 
2004
2004
-The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm and our… 
1998
1998
Output dead beat control for a class of nonlinear discrete time systems, which are described by a single input-output (I-O… 
1996
1996
A new version of the unsymmetric Lanczos algorithm without l ok-ahead is described combining elements of numerical stability and… 
1993
1993
A performance bounding methodology that explains the performance of loop-dominated scientific applications on particular systems… 
1992
1992
Miller and co‐workers [J. Chem. Phys. 61, 1823 (1974); ibid., 79, 4889 (1983)] have derived an exact quantum mechanical… 
Highly Cited
1979
Highly Cited
1979
The paper considers filters described by linear shift-variant difference (LSV) equations. We present the notion of a generalized… 
Highly Cited
1974
Highly Cited
1974
A discrete dynamic model of multidimensional high-order difference equations is described for the dynamics of biochemical oxygen… 
1944
1944
Many efforts have been made to find a substance of therapeutic value in typhus feyer. The papers in the literature which cite the…