Add to ORKGA generalization of the Krylov-Eckhoff method is investigated for removing of the classical Gibbs phenomenon. Convergence acceleration scheme for Fourier expansions of piecewise smooth functions is derived. Numerical results are presented and discussed
We consider convergence acceleration of the truncated Fourier series by sequential application of po...
We prove that any stable method for resolving the Gibbs phenomenon—that is, recover-ing high-order a...
summary:The Fourier expansion in eigenfunctions of a positive operator is studied with the help of a...
A generalization of the Krylov-Eckhoff method is investigated for removing of the classical Gibbs ph...
Because of their widespread utility, it is of interest, especially in applications, to analyze the s...
Abstract. The current paper considers the problem of recovering a function using a lim-ited number o...
In this article, in a few pages, we will try to give an idea of convergence acceleration methods and...
Abstract. Regular matrix methods that improve and accelerate the convergence of sequences and series...
This paper is devoted to the acceleration of the convergence of the classical Fourier series for a s...
Paper deals with a method proposed by Cornelius Lanczos of improving the convergence of derivatives ...
Modified Fourier expansion is a powerful means for the approximation of non-periodic smooth function...
AbstractThe Fourier series of a smooth function on a compact interval usually has slow convergence d...
AbstractWe compare the epsilon algorithm of Wynn with a generalization of summation by parts for acc...
Introduction Slow convergence is a ubiquitous problem in numerical mathematics. Therefore, methods ...
We discuss Levin-type sequence transformations fsng ! fs0 ng that depend linearly on the sequence el...
We consider convergence acceleration of the truncated Fourier series by sequential application of po...
We prove that any stable method for resolving the Gibbs phenomenon—that is, recover-ing high-order a...
summary:The Fourier expansion in eigenfunctions of a positive operator is studied with the help of a...
A generalization of the Krylov-Eckhoff method is investigated for removing of the classical Gibbs ph...
Because of their widespread utility, it is of interest, especially in applications, to analyze the s...
Abstract. The current paper considers the problem of recovering a function using a lim-ited number o...
In this article, in a few pages, we will try to give an idea of convergence acceleration methods and...
Abstract. Regular matrix methods that improve and accelerate the convergence of sequences and series...
This paper is devoted to the acceleration of the convergence of the classical Fourier series for a s...
Paper deals with a method proposed by Cornelius Lanczos of improving the convergence of derivatives ...
Modified Fourier expansion is a powerful means for the approximation of non-periodic smooth function...
AbstractThe Fourier series of a smooth function on a compact interval usually has slow convergence d...
AbstractWe compare the epsilon algorithm of Wynn with a generalization of summation by parts for acc...
Introduction Slow convergence is a ubiquitous problem in numerical mathematics. Therefore, methods ...
We discuss Levin-type sequence transformations fsng ! fs0 ng that depend linearly on the sequence el...
We consider convergence acceleration of the truncated Fourier series by sequential application of po...
We prove that any stable method for resolving the Gibbs phenomenon—that is, recover-ing high-order a...
summary:The Fourier expansion in eigenfunctions of a positive operator is studied with the help of a...