Skip to main content
3 events
when toggle format what by license comment
May 18 at 1:09 comment added Sergio A. Yuhjtman I don't have a final expression, I did it in python. For each $n \in \mathbb{N}$, if we call $A$ the matrix defined above for the first $n$ values of the indices $i, j$, then the result for the $n$-th approximation is $v A^{-1} w$ where $v$ and $w$ are row and column vectors with the values $(\langle f, b_k \rangle)$ and $(\langle h, b_k \rangle)$ respectively. So, what I got is a program that computes good approximations efficiently for any $r \ge 1$.
May 16 at 22:08 comment added მამუკა ჯიბლაძე Could you supply your final result for $\left\langle P_S(f),h\right\rangle$?
May 13 at 15:04 history answered Sergio A. Yuhjtman CC BY-SA 4.0