Recurrence relation

Known as: Recursion, Recurrences, Difference equations 
In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1949-2018
020040060019492017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We describe some novel methods to compute the index of any integer relative to a given primitive root of a prime p. Our first… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The value of the use of biomaterials for the repair of abdominal wall hernias is gaining increasing recognition. The use of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a reactive approach for handling a wide variety of software failures, ranging from remotely exploitable… (More)
  • figure 1
  • figure 4
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
An increasing number of distributed real-time systems face the critical challenge of providing quality of service guarantees in… (More)
  • figure 1
  • table 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Abstract. In this paper, a new family of fourth order Chebyshev methods (also called stabilized methods) is constructed. These… (More)
  • figure 2.1
  • table 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We all recognize 0, 1, 1, 2, 3, 5, 8, 13, . . . but what about 1, 2, 4, 6, 3, 9, 12, 8, 10, 5, 15, . . .? If you come across a… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We describe the GFUN package which contains functions for manipulating sequences, linear recurrences, or differential equations… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An mnth-order recurrence problem is defined as the compurirst order, all linear mth-order recurrence equations can be cast into… (More)
  • figure 2
  • table I
  • figure 3
  • table II
  • figure 1
Is this relevant?
Highly Cited
1972
Highly Cited
1972
 
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 5
Is this relevant?
Highly Cited
1967
Highly Cited
1967
A set equations in the quantities <italic>a<subscrpt>i</subscrpt></italic>(<italic>p</italic>), where <italic>i</italic> = 1, 2… (More)
  • figure 1
  • figure 7
  • table 2
Is this relevant?