The algorithmic numbers in non-Archimedean numerical computing environments

DOI10.3934/dcdss.2020449OpenAlexW3099608658MaRDI QIDQ2057688

Vieri Benci, Marco Cococcioni

Publication date: 7 December 2021

Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdss.2020449

zbMATH Keywords

nonstandard analysisinfinitesimal numbersEuclidean numbersfixed-length formatshardware-friendly representationsnon-Archimedean scientific computing

Mathematics Subject Classification ID

Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Non-Archimedean valued fields (12J25) Infinitesimal methods in algebraic geometry (14B10) Nonstandard analysis (26E35) General topics in computing methodologies (68U01) Linear ordinary differential equations and systems in the complex domain (34M03)

Related Items (2)

Non-standard analysis revisited: an easy axiomatic presentation oriented towards numerical applications ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approaches to analysis with infinitesimals following Robinson, Nelson, and others
• Numerosities of labelled sets: A new way of counting
• Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
• Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• An Aristotelian notion of size
• Ultrafunctions and applications
• How to Measure the Infinite
• Linear Programming
• Ultrafunctions and Generalized Solutions

This page was built for publication: The algorithmic numbers in non-Archimedean numerical computing environments