We consider trigonometric interpolations with shifted equidistant nodes and investigate their accuracies depending on the shift parameter. Two different types of interpolations are in the focus of our attention: the Krylov-Lanczos and the rational-trigonometric-polynomial interpolations. The Krylov-Lanczos interpolation performs convergence acceleration of the classical trigonometric interpolation by polynomial corrections. Additional acceleration is achieved by application of rational corrections which contain some extra parameters. In both cases, we derive the exact constants of the asymptotic errors and, based on these estimates, we find the optimal shifts that provide with the best accuracy. Optimizations are performed for the pointwise...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
We consider convergence acceleration of the truncated Fourier series by sequential application of po...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...
We consider trigonometric interpolations with shifted equidistant nodes and investigate their accura...
We consider trigonometric interpolations with shifted equidistant nodes and investigate their accura...
We investigate convergence of the rational-trigonometric-polynomial interpolations which perform con...
We introduce a procedure for convergence acceleration of the quasi-periodic trigonometric interpolat...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
The paper considers convergence acceleration of the quasi-periodic and the quasi-periodic-rational i...
The paper considers convergence acceleration of the quasi-periodic and the quasi-periodic-rational i...
The paper considers convergence acceleration of the quasi-periodic and the quasi-periodic-rational i...
A well-known result in linear approximation theory states that the norm of the operator, known as th...
AbstractThe Fourier series of a smooth function on a compact interval usually has slow convergence d...
This thesis discusses several topics related to interpolation and how it is used in numerical analys...
This thesis discusses several topics related to interpolation and how it is used in numerical analys...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
We consider convergence acceleration of the truncated Fourier series by sequential application of po...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...
We consider trigonometric interpolations with shifted equidistant nodes and investigate their accura...
We consider trigonometric interpolations with shifted equidistant nodes and investigate their accura...
We investigate convergence of the rational-trigonometric-polynomial interpolations which perform con...
We introduce a procedure for convergence acceleration of the quasi-periodic trigonometric interpolat...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
The paper considers convergence acceleration of the quasi-periodic and the quasi-periodic-rational i...
The paper considers convergence acceleration of the quasi-periodic and the quasi-periodic-rational i...
The paper considers convergence acceleration of the quasi-periodic and the quasi-periodic-rational i...
A well-known result in linear approximation theory states that the norm of the operator, known as th...
AbstractThe Fourier series of a smooth function on a compact interval usually has slow convergence d...
This thesis discusses several topics related to interpolation and how it is used in numerical analys...
This thesis discusses several topics related to interpolation and how it is used in numerical analys...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
We consider convergence acceleration of the truncated Fourier series by sequential application of po...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...