Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
Akra–Bazzi methodAll-pass filterAnalysis of algorithmsBerlekamp–Massey algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Consumption , Aggregate Wealth , and Expected Stock Returns
This paper studies the role of fluctuations in the aggregate consumption-wealth ratio for predicting stock returns. Using U.S… Expand
  • figure 1
  • table IV
  • table V
  • table VI
  • table VII
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A New Particle Swarm Optimization Solution to Nonconvex Economic Dispatch Problems
This paper proposes a new version of the classical particle swarm optimization (PSO), namely, new PSO (NPSO), to solve nonconvex… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Switched Linear Systems: Control and Design
Traditionally, most of the research work in systems and control has been concerned predominantly with dynamical systems that are… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Mathematical models in biology
Part I. Discrete Process in Biology: 1. The theory of linear difference equations applied to population growth 2. Nonlinear… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Linear algebra operators for GPU implementation of numerical algorithms
In this work, the emphasis is on the development of strategies to realize techniques of numerical computing on the graphics chip… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
An Arbitrary Lagrangian-Eulerian Computing Method for All Flow Speeds
A new numerical technique is presented that has many advantages for obtaining solutions to a wide variety of time-dependent… Expand
  • table I
  • figure 3
  • figure 4
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1995
Highly Cited
1995
What Might Cognition Be, If Not Computation?
L'A. propose une alternative au modele computationnel du systeme cognitif qui consiste en un systeme dynamique, definissant les… Expand
  • figure 13
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Subgrid Scale Model for Finite Difference Simulations of Turbulent Flows in Plane Channels and Annuli
High Reynolds number turbulent flows of incompressible fluids in plane channels and annuli are simulated using a finite… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 4
Is this relevant?
Highly Cited
1973
Highly Cited
1973
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf… Expand
  • figure 2
  • table I
  • figure 3
  • table II
  • figure 1
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… Expand
  • figure 1
  • figure 7
  • table 2
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE