On exact constants for matrix summation methods

1995 ◽  
Vol 36 (4) ◽  
pp. 800-806
Author(s):  
L. P. Falaleev
2022 ◽  
pp. 1-7
Author(s):  
Alexandr Usachev

Abstract The paper deals with the sets of numbers from [0,1] such that their binary representation is almost convergent. The aim of the study is to compute the Hausdorff dimensions of such sets. Previously, the results of this type were proved for a single summation method (e.g. Cesàro, Abel, Toeplitz). This study extends the results to a wide range of matrix summation methods.


1993 ◽  
Vol 54 (5) ◽  
pp. 1154-1158
Author(s):  
L. P. Falaleev

2001 ◽  
Vol 8 (4) ◽  
pp. 727-732
Author(s):  
L. Ephremidze

Abstract The equivalence of the decreasing rearrangement of the ergodic maximal function and the maximal function of the decreasing rearrangement is proved. Exact constants are obtained in the corresponding inequalities.


2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Arnak Poghosyan

We consider the convergence acceleration of the Krylov-Lanczos interpolation by rational correction functions and investigate convergence of the resultant parametric rational-trigonometric-polynomial interpolation. Exact constants of asymptotic errors are obtained in the regions away from discontinuities, and fast convergence of the rational-trigonometric-polynomial interpolation compared to the Krylov-Lanczos interpolation is observed. Results of numerical experiments confirm theoretical estimates and show how the parameters of the interpolations can be determined in practice.


2017 ◽  
pp. 195-208
Author(s):  
Gilbert W. Bassett Jr. ◽  
Roger Koenker
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document