No CrossRef data available.
Article contents
Recursive averages and the renewal theorem
Published online by Cambridge University Press: 12 November 2024
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Consider the sequence of numbers an defined by the iteration (1) for n ≥ k, where pr 1 ≤ r ≤ k) are non-negative numbers with and the starting values are given. So an is a weighted average of the previous k terms.
- Type
- Articles
- Information
- Copyright
- © The Authors, 2024 Published by Cambridge University Press on behalf of The Mathematical Association
References
Flanders, H., Averaging sequences again, Math. Gaz. 80 (July 1996) pp. 219-222.CrossRefGoogle Scholar
Lord, N., Sequences of averages revisited, Math. Gaz. 95 (July 2011) pp. 314-317.CrossRefGoogle Scholar
Rohan Manojkumar Shenoy, The discrete renwal theorem with bounded inter-event times, Math. Gaz. 107 (July 2023) pp. 343-348.CrossRefGoogle Scholar
Lotka, A. J., A contribution to the theory of self-renewing aggregates, with special reference to industrial replacement, Ann. Math. Stats. 10 (1939) pp. 1–25.CrossRefGoogle Scholar
You have
Access