Difference and functional equations Definition
Linear difference equation
Builds on Recurrence relationField
Definition
Let be a field and let be an integer. Let and be sequences in , indexed by , with for all . The linear difference equation with these coefficients is the equation for an unknown sequence in . It is homogeneous if for all , and inhomogeneous otherwise. It has constant coefficients if each is a constant sequence.
Remarks
Since , the equation can be solved for , so it is a recurrence relation of order at most . Example: is a homogeneous linear difference equation with , and ; with its solution is . Non-example: is not linear, because the unknown appears squared; the sequences and show that multiples of solutions need not be solutions. In terms of the shift operator , the equation reads with , a linear operator on sequences. The constant coefficient case is the linear recurrence with constant coefficients.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Recurrence relation definition
- Ring definition
- Commutative ring definition
- Unit of a ring definition
- Field definition
- Linear difference equation definition
Further reading
About this page
| Tag | 5115KV924G |
|---|---|
| URI | m2://5115KV924G |
| Kind | definition |
| Writing | W0 stub |
| MSC | 39A06 |
| Defines | Linear difference equation |
| Uses | Recurrence relation, Field |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.