76 citations · 631 across the 35 of their papers we have counts for
37 papers
Lower and upper estimates of the quantity of algebraic numbers
Yaroslav D. Sergeyev
It is well known that the set of algebraic numbers (let us call it ) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cant…
Some paradoxes of Infinity revisited
Yaroslav D. Sergeyev
In this article, some classical paradoxes of infinity such as Galileo's paradox, Hilbert's paradox of the Grand Hotel, Thomson's lamp paradox, and the rectangle paradox of Torricel…
Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework
Yaroslav D. Sergeyev, Antonio Candelieri, Dmitri E. Kvasov +1
In this paper, the problem of safe global maximization (it should not be confused with robust optimization) of expensive noisy black-box functions satisfying the Lipschitz conditio…
Conjugate-symplecticity properties of Euler--Maclaurin methods and their implementation on the Infinity Computer
F. Iavernaro, F. Mazzia, M. S. Mukhametzhanov +1
Multi-derivative one-step methods based upon Euler-Maclaurin integration formulae are considered for the solution of canonical Hamiltonian dynamical systems. Despite the negative r…
Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
Yaroslav D. Sergeyev
This commentary considers non-standard analysis and a recently introduced computational methodology based on the notion of \G1 (this symbol is called \emph{grossone}). The latter a…
On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov
The necessity to find the global optimum of multiextremal functions arises in many applied problems where finding local solutions is insufficient. One of the desirable properties o…