Skip to search formSkip to main contentSkip to account menu

Linear difference equation

Known as: Linear recurrence 
In mathematics and in particular dynamical systems, a linear difference equation or linear recurrence relation equates 0 to a polynomial that is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Abel–Ruffini theoremAutoregressive modelDegree of a polynomialEquation solving

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe… 
2007
2007
On computing the determinants and inverses of some special type of tridiagonal and constant-diagonals matrices
2006
2006
Note on a Linear Difference Equation
is a well-known process that is of crucial importance in such varied areas of mathe matics and engineering as linear algebra… 
2004
2004
Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
Let S 1 , S 2 ,..., S t be t N-periodic sequences over F q . The joint linear complexity L(S 1 ,S 2 ,..., S t ) is the least… 
2002
2002
A Fixed Point Analysis Of A Gene Pool GA With Mutation
This paper analyzes a recombination/mutation/selection genetic algorithm that uses gene pool recombination. For linear fitness… 
Review
1998
Review
1998
Counting divisors of Lucas numbers
Let {Sn} be a second order linear recurrence consisting of integers only. M. Ward [22] proved that, except for some degenerate… 
1994
1994
An O(log N) Algorithm to Solve Linear Recurrences on Hypercubes
1992
1992
Apollonian Tiling, the Lorentz Group and Regular Trees
The Apollonian tiling of the plane into circles is analyzed with respect to its group properties. The relevant group, which is… 
1988
1988
Compiling techniques for first-order linear recurrences on a vector computer
Linear recurrences are the most important class of nonvectorizable problems in typical scientific/engineering calculations. This… 
1985
1985
Shift-Register Synthesis (Modula m)
The Berlekamp algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)