Skip to main content
Top
Published in:
Cover of the book

2013 | OriginalPaper | Chapter

Numerical Computations with Infinite and Infinitesimal Numbers: Theory and Applications

Author : Yaroslav D. Sergeyev

Published in: Dynamics of Information Systems: Algorithmic Approaches

Publisher: Springer New York

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this chapter. It is based on the principle “The part is less than the whole” introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework that is not related to non-standard analysis theories. The Infinity Computer working with numbers of a new kind is described (its simulator has already been realized). The concept of accuracy of mathematical languages and its importance for a number of theoretical and practical issues regarding computations is discussed. Numerous examples dealing with divergent series, infinite sets, probability, limits, fractals, etc. are given.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
Even the brilliant efforts of the creator of the nonstandard analysis Robinson that were made in the middle of the twentieth century have been also directed to a reformulation of the classical analysis (i.e., analysis created 200 years before Robinson) in terms of infinitesimals and not to the creation of a new kind of analysis that would incorporate new achievements of Physics. In fact, he wrote in Sect. 1.1 of his famous book [28]: “It is shown in this book that Leibniz’s ideas can be fully vindicated and that they lead to a novel and fruitful approach to classical analysis and to many other branches of mathematics” (the words classical analysis have been emphasized by the author of this chapter).
 
2
We remind that numeral is a symbol or group of symbols that represents a number. The difference between numerals and numbers is the same as the difference between words and the things they refer to. A number is a concept that a numeral expresses. The same number can be represented by different numerals. For example, the symbols “3,” “three,” and “III” are different numerals, but they all represent the same number.
 
3
In connection with Cantor’s \(\aleph _{0}\) and \(\aleph _{1}\) it makes sense to remind another Amazonian tribe—Mundurukú (see [27]) who fail in exact arithmetic with numbers larger than 5 but are able to compare and add large approximate numbers that are far beyond their naming range. Particularly, they use the words “some, not many” and “many, really many” to distinguish two types of large numbers. Their arithmetic with “some, not many” and “many, really many” reminds strongly the rules Cantor uses to work with \(\aleph _{0}\) and \(\aleph _{1}\), respectively. For instance, compare “some, not many”  + “many, really many” = “many, really many” with \(\aleph _{0} + \aleph _{1} = \aleph _{1}\).
 
4
As it was already mentioned, in 1900, at the second Mathematical Congress in Paris, David Hilbert has presented his 23 problems for the twentieth century promoting the abstract philosophy in Mathematics that was close to Kant. However, before this event, at the first Congress 3 years earlier Henri Poincaré has given a general talk emphasizing the connection of Mathematics with Physics sharing this point of view with Fourier, Laplace, and many others. Clearly, in this dispute between Poincaré and Hilbert the present chapter is closer to the position of Poincaré.
 
5
It is important to emphasize that we speak about axioms of real numbers in sense of Postulate 2, i.e., axioms define formal rules of operations with numerals in a given numeral system. Therefore, if we want to have a numeral system including grossone, we should fix also a numeral system to express finite numbers. In order to concentrate our attention on properties of grossone, this point will be investigated later.
 
6
First, this quantity is inexpressible by numerals used to count the number of elements of finite sets because \(\mathbb{N}\) is infinite. Second, traditional numerals existing to express infinite numbers do not have the required high accuracy (remind that we would like to be able to register the alteration of the number of elements of infinite sets even when one element has been excluded). For example, by using Cantor’s alephs we say that cardinality of the sets \(\mathbb{N}\) and \(\mathbb{N} \setminus \{ 1\}\) is the same—\(\aleph _{0}\). This answer is correct but its accuracy is low—we are not able to register the fact that one element was excluded from the set \(\mathbb{N}\). Analogously, we can say that both of the sets have “many” elements. Again, this answer is correct but its accuracy is low.
 
7
At the first glance the record (14) [and, therefore, the numerals (15)] can remind numbers from the Levi–Civita field (see [20]) that is a very interesting and important precedent of algebraic manipulations with infinities and infinitesimals. However, the two mathematical objects have several crucial differences. They have been introduced for different purposes by using two mathematical languages having different accuracies and on the basis of different methodological foundations. In fact, Levi–Civita does not discuss the distinction between numbers and numerals and works with generic numbers while each numeral (15) represents a concrete number. His numbers have neither cardinal nor ordinal properties; they are built using a generic infinitesimal and only its rational powers are allowed; he uses symbol in his construction; there is no numeral system that would allow one to assign numerical values to his numbers; it is not explained how it would be possible to pass from d a generic infinitesimal h to a concrete one (see also the discussion above on the distinction between numbers and numerals).
In no way the said above should be considered as a criticism with respect to results of Levi–Civita. The above discussion has been introduced in this text just to underline that we are in front of two different mathematical tools that should be used in different mathematical contexts.
 
8
Naturally, if we speak about limits of sequences, lim n →  a(n), then \(n \in \mathbb{N}\) and, as a consequence, it follows that n should be less than or equal to grossone.
 
9
Note that even if \(a ={ \textcircled{1}}^{2} + 2+\varepsilon\), where \(\varepsilon\) is an infinitesimal number (remind that all infinitesimals are not equal to zero), we are able to establish that the function has discontinuous formulae.
 
Literature
1.
2.
go back to reference G. Cantor. Contributions to the founding of the theory of transfinite numbers. Dover Publications, New York, 1955. G. Cantor. Contributions to the founding of the theory of transfinite numbers. Dover Publications, New York, 1955.
3.
go back to reference J.B. Carroll, editor. Language, Thought, and Reality: Selected Writings of Benjamin Lee Whorf. MIT Press, 1956. J.B. Carroll, editor. Language, Thought, and Reality: Selected Writings of Benjamin Lee Whorf. MIT Press, 1956.
4.
go back to reference A.L. Cauchy. Le Calcul infinitésimal. Paris, 1823. A.L. Cauchy. Le Calcul infinitésimal. Paris, 1823.
6.
go back to reference J. d’Alembert. Différentiel. Encyclopédie, ou dictionnaire raisonné des sciences, des arts et des métiers, 4, 1754. J. d’Alembert. Différentiel. Encyclopédie, ou dictionnaire raisonné des sciences, des arts et des métiers, 4, 1754.
7.
8.
go back to reference S. De Cosmis and R. De Leone. The use of grossone in mathematical programming and operations research. Applied Mathematics and Computation, 218(16):8029–8038, 2012.MathSciNetMATHCrossRef S. De Cosmis and R. De Leone. The use of grossone in mathematical programming and operations research. Applied Mathematics and Computation, 218(16):8029–8038, 2012.MathSciNetMATHCrossRef
9.
go back to reference R.L. Devaney. An Introduction to Chaotic Dynamical Systems. Westview Press Inc., New York, 2003.MATH R.L. Devaney. An Introduction to Chaotic Dynamical Systems. Westview Press Inc., New York, 2003.MATH
10.
go back to reference K. Falconer. Fractal Geometry: Mathematical foundations and applications. John Wiley & Sons, Chichester, 1995. K. Falconer. Fractal Geometry: Mathematical foundations and applications. John Wiley & Sons, Chichester, 1995.
11.
go back to reference K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik, 38:173–198, 1931. K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik, 38:173–198, 1931.
12.
go back to reference K. Gödel. The Consistency of the Continuum-Hypothesis. Princeton University Press, Princeton, 1940.MATH K. Gödel. The Consistency of the Continuum-Hypothesis. Princeton University Press, Princeton, 1940.MATH
13.
go back to reference P. Gordon. Numerical cognition without words: Evidence from Amazonia. Science, 306(15 October):496–499, 2004. P. Gordon. Numerical cognition without words: Evidence from Amazonia. Science, 306(15 October):496–499, 2004.
14.
go back to reference G.H. Hardy. Orders of infinity. Cambridge University Press, Cambridge, 1910.MATH G.H. Hardy. Orders of infinity. Cambridge University Press, Cambridge, 1910.MATH
15.
go back to reference H.M. Hastings and G. Sugihara. Fractals: A user’s guide for the natural sciences. Oxford University Press, Oxford, 1994.MATH H.M. Hastings and G. Sugihara. Fractals: A user’s guide for the natural sciences. Oxford University Press, Oxford, 1994.MATH
16.
go back to reference D. Hilbert. Mathematical problems: Lecture delivered before the International Congress of Mathematicians at Paris in 1900. Bulletin of the American Mathematical Society, 8:437–479, 1902.MathSciNetMATHCrossRef D. Hilbert. Mathematical problems: Lecture delivered before the International Congress of Mathematicians at Paris in 1900. Bulletin of the American Mathematical Society, 8:437–479, 1902.MathSciNetMATHCrossRef
17.
go back to reference D.I. Iudin, Ya.D. Sergeyev, and M. Hayakawa. Interpretation of percolation in terms of infinity computations. Applied Mathematics and Computation, 218(16):8099–8111, 2012. D.I. Iudin, Ya.D. Sergeyev, and M. Hayakawa. Interpretation of percolation in terms of infinity computations. Applied Mathematics and Computation, 218(16):8099–8111, 2012.
18.
go back to reference K. Knopp. Theory and Application of Infinite Series. Dover Publications, New York, 1990. K. Knopp. Theory and Application of Infinite Series. Dover Publications, New York, 1990.
19.
go back to reference G.W. Leibniz and J.M. Child. The Early Mathematical Manuscripts of Leibniz. Dover Publications, New York, 2005. G.W. Leibniz and J.M. Child. The Early Mathematical Manuscripts of Leibniz. Dover Publications, New York, 2005.
20.
go back to reference T. Levi-Civita. Sui numeri transfiniti. Rend. Acc. Lincei, Series 5a, 113:7–91, 1898. T. Levi-Civita. Sui numeri transfiniti. Rend. Acc. Lincei, Series 5a, 113:7–91, 1898.
21.
go back to reference G. Lolli. Infinitesimals and infinites in the history of mathematics: A brief survey. Applied Mathematics and Computation, 218(16):7979–7988, 2012.MathSciNetMATHCrossRef G. Lolli. Infinitesimals and infinites in the history of mathematics: A brief survey. Applied Mathematics and Computation, 218(16):7979–7988, 2012.MathSciNetMATHCrossRef
22.
go back to reference M. Margenstern. Using grossone to count the number of elements of infinite sets and the connection with bijections. p-Adic Numbers, Ultrametric Analysis and Applications, 3(3):196–204, 2011. M. Margenstern. Using grossone to count the number of elements of infinite sets and the connection with bijections. p-Adic Numbers, Ultrametric Analysis and Applications, 3(3):196–204, 2011.
23.
go back to reference M. Margenstern. An application of grossone to the study of a family of tilings of the hyperbolic plane. Applied Mathematics and Computation, 218(16):8005–8018, 2012.MathSciNetMATHCrossRef M. Margenstern. An application of grossone to the study of a family of tilings of the hyperbolic plane. Applied Mathematics and Computation, 218(16):8005–8018, 2012.MathSciNetMATHCrossRef
24.
go back to reference A.A. Markov Jr. and N.M. Nagorny. Theory of Algorithms. FAZIS, Moscow, second edition, 1996.MATH A.A. Markov Jr. and N.M. Nagorny. Theory of Algorithms. FAZIS, Moscow, second edition, 1996.MATH
25.
26.
go back to reference H.-O. Peitgen, H. Jürgens, and D. Saupe. Chaos and Fractals. Springer-Verlag, New York, 1992.CrossRef H.-O. Peitgen, H. Jürgens, and D. Saupe. Chaos and Fractals. Springer-Verlag, New York, 1992.CrossRef
27.
go back to reference P. Pica, C. Lemer, V. Izard, and S. Dehaene. Exact and approximate arithmetic in an amazonian indigene group. Science, 306(15 October):499–503, 2004. P. Pica, C. Lemer, V. Izard, and S. Dehaene. Exact and approximate arithmetic in an amazonian indigene group. Science, 306(15 October):499–503, 2004.
28.
go back to reference A. Robinson. Non-standard Analysis. Princeton Univ. Press, Princeton, 1996.MATH A. Robinson. Non-standard Analysis. Princeton Univ. Press, Princeton, 1996.MATH
29.
go back to reference E.E. Rosinger. Microscopes and telescopes for theoretical physics: How rich locally and large globally is the geometric straight line? Prespacetime Journal, 2(4):601–624, 2011. E.E. Rosinger. Microscopes and telescopes for theoretical physics: How rich locally and large globally is the geometric straight line? Prespacetime Journal, 2(4):601–624, 2011.
30.
go back to reference E. Sapir. Selected Writings of Edward Sapir in Language, Culture and Personality. University of California Press, Princeton, 1958. E. Sapir. Selected Writings of Edward Sapir in Language, Culture and Personality. University of California Press, Princeton, 1958.
31.
go back to reference Ya.D. Sergeyev. Arithmetic of Infinity. Edizioni Orizzonti Meridionali, CS, 2003. Ya.D. Sergeyev. Arithmetic of Infinity. Edizioni Orizzonti Meridionali, CS, 2003.
33.
go back to reference Ya.D. Sergeyev. A few remarks on philosophical foundations of a new applied approach to Infinity. Scheria, 26–27:63–72, 2005. Ya.D. Sergeyev. A few remarks on philosophical foundations of a new applied approach to Infinity. Scheria, 26–27:63–72, 2005.
34.
go back to reference Ya.D. Sergeyev. Mathematical foundations of the Infinity Computer. Annales UMCS Informatica AI, 4:20–33, 2006. Ya.D. Sergeyev. Mathematical foundations of the Infinity Computer. Annales UMCS Informatica AI, 4:20–33, 2006.
35.
go back to reference Ya.D. Sergeyev. Misuriamo l’infinito. Periodico di Matematiche, 6(1):11–26, 2006. Ya.D. Sergeyev. Misuriamo l’infinito. Periodico di Matematiche, 6(1):11–26, 2006.
36.
go back to reference Ya.D. Sergeyev. Blinking fractals and their quantitative analysis using infinite and infinitesimal numbers. Chaos, Solitons & Fractals, 33(1):50–75, 2007. Ya.D. Sergeyev. Blinking fractals and their quantitative analysis using infinite and infinitesimal numbers. Chaos, Solitons & Fractals, 33(1):50–75, 2007.
37.
go back to reference Ya.D. Sergeyev. A new applied approach for executing computations with infinite and infinitesimal quantities. Informatica, 19(4):567–596, 2008. Ya.D. Sergeyev. A new applied approach for executing computations with infinite and infinitesimal quantities. Informatica, 19(4):567–596, 2008.
38.
go back to reference Ya.D. Sergeyev. Evaluating the exact infinitesimal values of area of Sierpinski’s carpet and volume of Menger’s sponge. Chaos, Solitons & Fractals, 42(5):3042–3046, 2009. Ya.D. Sergeyev. Evaluating the exact infinitesimal values of area of Sierpinski’s carpet and volume of Menger’s sponge. Chaos, Solitons & Fractals, 42(5):3042–3046, 2009.
39.
go back to reference Ya.D. Sergeyev. Numerical computations and mathematical modelling with infinite and infinitesimal numbers. Journal of Applied Mathematics and Computing, 29:177–195, 2009. Ya.D. Sergeyev. Numerical computations and mathematical modelling with infinite and infinitesimal numbers. Journal of Applied Mathematics and Computing, 29:177–195, 2009.
40.
go back to reference Ya.D. Sergeyev. Numerical point of view on Calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains. Nonlinear Analysis Series A: Theory, Methods & Applications, 71(12):e1688–e1707, 2009. Ya.D. Sergeyev. Numerical point of view on Calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains. Nonlinear Analysis Series A: Theory, Methods & Applications, 71(12):e1688–e1707, 2009.
41.
go back to reference Ya.D. Sergeyev. Computer system for storing infinite, infinitesimal, and finite quantities and executing arithmetical operations with them. USA patent 7,860,914, 2010. Ya.D. Sergeyev. Computer system for storing infinite, infinitesimal, and finite quantities and executing arithmetical operations with them. USA patent 7,860,914, 2010.
42.
go back to reference Ya.D. Sergeyev. Counting systems and the First Hilbert problem. Nonlinear Analysis Series A: Theory, Methods & Applications, 72(3–4):1701–1708, 2010. Ya.D. Sergeyev. Counting systems and the First Hilbert problem. Nonlinear Analysis Series A: Theory, Methods & Applications, 72(3–4):1701–1708, 2010.
43.
go back to reference Ya.D. Sergeyev. Lagrange Lecture: Methodology of numerical computations with infinities and infinitesimals. Rendiconti del Seminario Matematico dell’Università e del Politecnico di Torino, 68(2):95–113, 2010. Ya.D. Sergeyev. Lagrange Lecture: Methodology of numerical computations with infinities and infinitesimals. Rendiconti del Seminario Matematico dell’Università e del Politecnico di Torino, 68(2):95–113, 2010.
44.
go back to reference Ya.D. Sergeyev. Higher order numerical differentiation on the infinity computer. Optimization Letters, 5(4):575–585, 2011. Ya.D. Sergeyev. Higher order numerical differentiation on the infinity computer. Optimization Letters, 5(4):575–585, 2011.
45.
go back to reference Ya.D. Sergeyev. On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function. p-Adic Numbers, Ultrametric Analysis and Applications, 3(2):129–148, 2011. Ya.D. Sergeyev. On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function. p-Adic Numbers, Ultrametric Analysis and Applications, 3(2):129–148, 2011.
46.
go back to reference Ya.D. Sergeyev. Using blinking fractals for mathematical modelling of processes of growth in biological systems. Informatica, 22(4):559–576, 2011. Ya.D. Sergeyev. Using blinking fractals for mathematical modelling of processes of growth in biological systems. Informatica, 22(4):559–576, 2011.
47.
go back to reference Ya.D. Sergeyev and A. Garro. Observability of Turing machines: A refinement of the theory of computation. Informatica, 21(3):425–454, 2010. Ya.D. Sergeyev and A. Garro. Observability of Turing machines: A refinement of the theory of computation. Informatica, 21(3):425–454, 2010.
48.
go back to reference Ya.D. Sergeyev and D. E. Kvasov. Diagonal Global Optimization Methods. FizMatLit, Moscow, 2008. In Russian. Ya.D. Sergeyev and D. E. Kvasov. Diagonal Global Optimization Methods. FizMatLit, Moscow, 2008. In Russian.
49.
go back to reference R.G. Strongin and Ya.D. Sergeyev. Global Optimization and Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht, 2000. R.G. Strongin and Ya.D. Sergeyev. Global Optimization and Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht, 2000.
50.
go back to reference M.C. Vita, S. De Bartolo, C. Fallico, and M. Veltri. Usage of infinitesimals in the Menger’s Sponge model of porosity. Applied Mathematics and Computation, 218(16):8187–8196, 2012.MathSciNetMATHCrossRef M.C. Vita, S. De Bartolo, C. Fallico, and M. Veltri. Usage of infinitesimals in the Menger’s Sponge model of porosity. Applied Mathematics and Computation, 218(16):8187–8196, 2012.MathSciNetMATHCrossRef
51.
52.
go back to reference A.A. Zhigljavsky. Computing sums of conditionally convergent and divergent series using the concept of grossone. Applied Mathematics and Computation, 218(16):8064–8076, 2012.MathSciNetMATHCrossRef A.A. Zhigljavsky. Computing sums of conditionally convergent and divergent series using the concept of grossone. Applied Mathematics and Computation, 218(16):8064–8076, 2012.MathSciNetMATHCrossRef
53.
go back to reference A. Žilinskas. On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions. Applied Mathematics and Computation, 218(16):8131–8136, 2012.MathSciNetMATHCrossRef A. Žilinskas. On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions. Applied Mathematics and Computation, 218(16):8131–8136, 2012.MathSciNetMATHCrossRef
Metadata
Title
Numerical Computations with Infinite and Infinitesimal Numbers: Theory and Applications
Author
Yaroslav D. Sergeyev
Copyright Year
2013
Publisher
Springer New York
DOI
https://doi.org/10.1007/978-1-4614-7582-8_1