1996
DOI: 10.1016/0010-4655(96)00044-6
|View full text |Cite
|
Sign up to set email alerts
|

A convergence acceleration method of Fourier series

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2007
2007
2010
2010

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 9 publications
0
10
0
Order By: Relevance
“…, 0.8 probably the best approximant of its sum has respectively 15.5, 13.9, 14.3, 12.9, 11.3, 9.4, 7.5 exact digits. For series (11) (which very slowly converges at x = 1) accuracy is a little greater. Also for these x methods from Section 3 are more efficient.…”
Section: Theoremmentioning
confidence: 96%
See 3 more Smart Citations
“…, 0.8 probably the best approximant of its sum has respectively 15.5, 13.9, 14.3, 12.9, 11.3, 9.4, 7.5 exact digits. For series (11) (which very slowly converges at x = 1) accuracy is a little greater. Also for these x methods from Section 3 are more efficient.…”
Section: Theoremmentioning
confidence: 96%
“…After k iterations of such procedure we obtain a linear combination of k + 1 series. Oleksy [11] suggests using a standard convergence acceleration method (e.g. the ε-algorithm or Levin's t-transform) to each of these series and not to the original series.…”
Section: Example 4 the Last Relation Implies Thatmentioning
confidence: 99%
See 2 more Smart Citations
“…which arises in the phase transitions of absorbed submonolayers on metal surfaces [40], and is also the real part of a special case of the ''Lerch zeta-function" in mathematics. If the series is truncated after the N-th term, the error falls only as fast as 1=N over the entire interval except in zones of width Oð1=NÞ near x ¼ AEp where the error is always Oð1Þ, the Gibbs Phenomenon.…”
Section: The Basic Ideamentioning
confidence: 99%