Article
Licensed
Unlicensed
Requires Authentication
Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
-
E. A. Karatsuba
Published/Copyright:
May 1, 2014
Abstract
A new fast approximation to the Catalan constant is constructed, which makes it possible to calculate this constant with a complexity bound that is close to optimal.
The work was supported partially by the RFBR (grant No 13-01-00657).
Published Online: 2014-5-1
Published in Print: 2013-12-1
© 2014 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Front matter
- Criterion for propositional calculi to be finitely generated
- Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
- Cycle indices of an automaton
- Definability in the language of functional equations of a countable-valued logic
- On bigram languages
- The diagnosis of states of contacts
- Finite systems of generators of infinite subgroups of the Golod group
- On the number of cyclic points of random A-mapping
Articles in the same Issue
- Front matter
- Criterion for propositional calculi to be finitely generated
- Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
- Cycle indices of an automaton
- Definability in the language of functional equations of a countable-valued logic
- On bigram languages
- The diagnosis of states of contacts
- Finite systems of generators of infinite subgroups of the Golod group
- On the number of cyclic points of random A-mapping
