On the stability of the J transformation
On the stability of the \(\mathcal J\) transformation
The author continues the study about the \({\mathcal J}\) transformation. This transformation was developed in an attempt to combine useful features of transformations that are derived from given kernels with those of transformations that are derived by iteration of a simple transformation. It is well known that many extrapolation methods are relatively unstable numerically. Hence, a stability analysis for such methods is required and has many potential applications. The author presents theoretical results, very interesting, that contain some of the results of several authors as special cases. Also, an efficient algorithm for the computation of the stability index of the \({\mathcal J}\) transformation is given. Also, a numerical example is given.
- Analytical and numerical studies of the convergence behavior of the \({\mathcal J}\) transformation
- Further convergence and stability results for the generalized Richardson extrapolation process \(GREP^{(1)}\) with an application to the \(D^{(1)}\)-transformation for infinite integrals
- Practical Extrapolation Methods
- scientific article; zbMATH DE number 4068142
- An asymptotically hierarchy-consistent, iterative sequence transformation for convergence acceleration of Fourier series
- Scalar Levin-type sequence transformations
- Numerical evaluation of Hilbert transforms for oscillatory functions: A convergence accelerator approach
- Analytical and numerical studies of the convergence behavior of the \({\mathcal J}\) transformation
- Stability and the Fourier–Mukai transform II
- Stability and J-depth of expansions
- Unstable Compositions Related to the Image of J
- On condition numbers of the Shanks transformation
This page was built for publication: On the stability of the \(\mathcal J\) transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265639)