Numerical Study of Algebraic Problems Using Stochastic Arithmetic

  • Authors:
  • René Alt;Jean-Luc Lamotte;Svetoslav Markov

  • Affiliations:
  • CNRS, UMR 7606, LIP6, University Pierre et Marie Curie, Paris cedex 05, France 75252;CNRS, UMR 7606, LIP6, University Pierre et Marie Curie, Paris cedex 05, France 75252;Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria 1113

  • Venue:
  • Large-Scale Scientific Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.02

Visualization

Abstract

A widely used method to estimate the accuracy of the numerical solution of real life problems is the CESTAC Monte Carlo type method. In this method, a real number is considered as an N-tuple of Gaussian random numbers constructed as Gaussian approximations of the original real number. This N-tuple is called a "discrete stochastic number" and all its components are computed synchronously at the level of each operation so that, in the scope of granular computing, a discrete stochastic number is considered as a granule. In this work, which is part of a more general one, discrete stochastic numbers are modeled by Gaussian functions defined by their mean value and standard deviation and operations on them are those on independent Gaussian variables. These Gaussian functions are called in this context stochastic numbersand operations on them define continuous stochastic arithmetic (CSA). Thus operations on stochastic numbers are used as a model for operations on imprecise numbers. Here we study some new algebraic structures induced by the operations on stochastic numbers in order to provide a good algebraic understanding of the performance of the CESTAC method and we give numerical examples based on the Least squares method which clearly demonstrate the consistency between the CESTAC method and the theory of stochastic numbers.