FAQ

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

Related topics

Related topics

50 relations
Algorithms for calculating varianceAll-pass filterBiconjugate gradient stabilized methodCharacteristic polynomial
(More)

Broader (1)

Theory of computation

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Recurrence relation
Nonlinear system
Population
Recursion
Steady state
Finite difference

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Monte Carlo Methods for Index Computation ( mod p )
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
Classification of biomaterials and their related complications in abdominal wall hernia surgery
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
Building a Reactive Immune System for Software Services
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
Feedback utilization control in distributed real-time systems with end-to-end tasks
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
Fourth Order Chebyshev Methods with Recurrence Relation
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
The On-Line Encyclopedia of Integer Sequences
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
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable
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
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
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
Two-dimensional discrete Markovian fields
 
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 5
Is this relevant?
Highly Cited
1967
Highly Cited
1967
The Organization of Computations for Uniform Recurrence Equations
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?