2008
DOI: 10.3176/proc.2008.1.01
|View full text |Cite
|
Sign up to set email alerts
|

On the acceleration of convergence by regular matrix methods

Abstract: Regular matrix methods that improve and accelerate the convergence of sequences and series are studied. Some problems related to the speed of convergence of sequences and series with respect to matrix methods are discussed. Several theorems on the improvement and acceleration of the convergence are proved. The results obtained are used to increase the order of approximation of Fourier expansions and Zygmund means of Fourier expansions in certain Banach spaces.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…First we notice that there exists no convergent sequence, converging faster or μ-faster than any sequence of ϕ. It is shown in [3], that if a sequence y = (y n ) ∈ c converges faster than x = (x n ) ∈ c \ ϕ, then y converges also μ-faster than x. But the converse assertion is not valid.…”
Section: Introductionmentioning
confidence: 96%
See 4 more Smart Citations
“…First we notice that there exists no convergent sequence, converging faster or μ-faster than any sequence of ϕ. It is shown in [3], that if a sequence y = (y n ) ∈ c converges faster than x = (x n ) ∈ c \ ϕ, then y converges also μ-faster than x. But the converse assertion is not valid.…”
Section: Introductionmentioning
confidence: 96%
“…It is shown in [3] that every sequence x ∈ c \ ϕ has the limit speed of convergence and for each x ∈ c \ ϕ there exists an element μ ∈ μ x , which is not the limit speed of x. We say that the limit speed of convergence μ * = (μ * n ) of a sequence y is higher than the limit speed of convergence λ * = (λ * n ) of a sequence x if the ratio λ * n /μ * n is upper-bounded, but not lower-bounded.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations