On a Vectorized Version of a Generalized Richardson Extrapolation Process
Abstract: Let ${\xx_m}$ be a vector sequence that satisfies $$ \xx_m\sim \sss+\sum<sup>\infty_{i=1}\alpha_i</sup> \gg_i(m)\quad\text{as $m\to\infty$},$$ $\sss$ being the limit or antilimit of ${\xx_m}$ and being an asymptotic scale as , in the sense that The vector sequences , are known, as well as ${\xx_m}$. In this work, we analyze the convergence and convergence acceleration properties of a vectorized version of the generalized Richardson extrapolation process that is defined via the equations $$ \sum<sup>k_{i=1}\braket{\yy,\Delta\gg_{i}(m)}\widetilde{\alpha}_i=\braket{\yy,\Delta\xx_m},\quad</sup> n\leq m\leq n+k-1;\quad \sss_{n,k}=\xx_n+\sum<sup>k_{i=1}\widetilde{\alpha}<em>i\gg</em>{i}(n),$$ $\sss_{n,k}$ being the approximation to $\sss$. Here $\yy$ is some nonzero vector, is an inner product, such that $\braket{\alpha\aaa,\beta\bb}=\bar{\alpha}\beta\braket{\aaa,\bb}$, and $\Delta\xx_m=\xx_{m+1}-~\xx_m$ and . By imposing a minimal number of reasonable additional conditions on the , we show that the error $\sss_{n,k}-\sss$ has a full asymptotic expansion as . We also show that actual convergence acceleration takes place and we provide a complete classification of it.
Paper Prompts
Sign up for free to create and run prompts on this paper.