Idempotent mathematics: a correspondence principle and its applications to computing (Q4375239)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1111364
Language Label Description Also known as
default for all languages
No label defined
    English
    Idempotent mathematics: a correspondence principle and its applications to computing
    scientific article; zbMATH DE number 1111364

      Statements

      Idempotent mathematics: a correspondence principle and its applications to computing (English)
      0 references
      0 references
      0 references
      1 February 1998
      0 references
      idempotent semiring
      0 references
      semimodule of functions
      0 references
      idempotent measure
      0 references
      idempotent integral
      0 references
      Bellman equation
      0 references
      semiring algorithms
      0 references
      In this short communication the authors are stressing the possible efficiency of using the so-called ``idempotent mathematics'' presented in some detail in previous works [e.g., \textit{V. P. Maslov} and \textit{V. N. Kolokol'tsov}, ``Idempotent analysis and its applications to optimal control'' (1994; Zbl 0857.49022)]; the main argument seems to be the fact that essentially nonlinear mathematical objects in traditional mathematics over fields become ``linear'' when translated into analogous objects over a semiring \((A,\oplus ,\odot)\) with commutative idempotent addition \(\oplus \), multiplication \(\odot\) with identity element \(1\) and standard partial order: \(a<b\) iff \(a\oplus b=b\). Besides certain problems (e.g., idempotent measure and integration, Hamilton-Jacobi and Bellman equations, standard problems in dynamic programming, etc.) already discussed in previous works, the authors are pointing out here the possibility to use idempotent analogues of standard numerical algorithms and their computer realizations, a problem that seems to be discussed in more detail in [\textit{G. V. Litvinov} and \textit{V. P. Maslov}, ``The correspondence principle for idempotent calculus and some computer applications'' (1998; Zbl 0897.68050)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references