Displaying similar documents to “Determination of the best constant in an inequality of Hardy, Littlewood, and Pólya.”

Fast and correctly rounded logarithms in double-precision

Florent de Dinechin, Christoph Lauter, Jean-Michel Muller (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these goals in the library. There are two novel aspects to this approach. The first is the proof framework, and in general the techniques used to balance performance and provability. The second is the introduction of processor-specific optimization to get performance equivalent to the best...

Towards a theory of practice in metaheuristics design: A machine learning perspective

Mauro Birattari, Mark Zlochin, Marco Dorigo (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

A number of methodological papers published during the last years testify that a need for a thorough revision of the research methodology is felt by the operations research community – see, for example, [Barr (1995) 9–32; Eiben and Jelasity, 582–587; Hooker, (1995) 33–42; Rardin and Uzsoy, (2001) 261–304]. In particular, the performance evaluation of nondeterministic methods, including widely studied metaheuristics such as evolutionary...

Extension of the C-XSC Library with Scalar Products with Selectable Accuracy

Zimmer, Michael, Krämer, Walter, Bohlender, Gerd, Hofschuster, Werner (2010)

Serdica Journal of Computing

Similarity:

The C++ class library C-XSC for scientific computing has been extended with the possibility to compute scalar products with selectable accuracy in version 2.3.0. In previous versions, scalar products have always been computed exactly with the help of the so-called long accumulator. Additionally, optimized floating point computation of matrix and vector operations using BLAS-routines are added in C-XSC version 2.4.0. In this article the algorithms used and their implementations, as well...