0
$\begingroup$

Question:
how can the initial values $\left(a[0],\,\dots,\,a[k-1]\right)$ and the coefficients $\left(c_k,\,\dots,\,c_0\right)$ be determined that solve

  • $\min\limits_{a[0],\dots,a[k-1]\\ c_k,\dots,c_0} \left\|\left(x[0]-a[0],\,\dots,\,x[N]-a[N]\right)\right\|$
  • $n\ge k\implies a[n]=c_0+\sum\limits_{i=1}^k c_ia[n-i]$

i.e. how to find for a given sequence the best approximating linear recursion with given depth $k$

Improve this question
$\endgroup$
2
  • $\begingroup$ What norm is this? L2? $\endgroup$
    – Daniel Weber
    Commented Apr 30 at 9:07
  • $\begingroup$ @CommandMaster you may assume the Euclidean norm, which is easier to handle, but I don't want to rule out sum norm or maximum norm $\endgroup$
    – Manfred Weis
    Commented Apr 30 at 10:12

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .