On computable approximations of Landau's constant
We present an algorithm which computes the Landau constant up to any given precision.
Main Author: | Robert Rettinger |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2012-11-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1189/pdf |
Similar Items
-
Computational Complexity of Smooth Differential Equations
by: Akitoshi Kawamura, et al.
Published: (2014-02-01) -
Nested multilevel Monte Carlo methods and a modified Euler-Maruyama scheme utilising approximate Gaussian random variables suitable for vectorised hardware and low-precisions
by: Sheridan-Methven, O
Published: (2021) -
Computing and mathematical modeling /
by: Thangavel, K., et al.
Published: (2006) -
Numerical methods for computer science, engineering and mathematics /
by: 313798 Mathews, John H.
Published: (1987) -
Exponential convergence of spectral approximations and time-domain computation of scattering problems.
by: Zhao, Xiaodan.
Published: (2013)