Efficient Stochastic Algorithms for the Sensitivity Analysis Problem in the Air Pollution Modelling

  • Tzvetan OstromskyEmail author
  • Venelin Todorov
  • Ivan Dimov
  • Zahari Zlatev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11958)


Sensitivity analysis of the results of large and complicated mathematical models is rather tuff and time-consuming task. However, this is quite an important problem as far as their critical applications are concerned. There are many such applications in the area of air pollution modelling. On the other hand, there are lots of natural uncertainties in the input data sets and parameters of a large-scale air pollution model. Such a model, the Danish Eulerian Model with its up-to-date high-performance implementations, is under consideration in this work. Its advanced chemical scheme (the Condensed CBM IV) takes into account a large number of chemical species and numerous reactions between them.

Four efficient stochastic algorithms have been used and compared by their accuracy in studying the sensitivity of ammonia and ozone concentration results with respect to the input emission levels and some chemical reactions rate parameters. The results of our numerical experiments show that the stochastic algorithms under consideration are quite efficient for the purpose of our sensitivity studies.



The authors would like to thank Rayna Georgieva for her help. The work is supported in parts by the Bulgarian NSF under Projects DN 12/5-2017 “Efficient Stochastic Methods and Algorithms for Large-Scale Problems” and DN 12/4-2017 “Advanced Analytical and Numerical Methods for Nonlinear Differential Equations with Applications in Finance and Environmental Pollution”, and the Bilateral Project Bulgaria-Russia DNTS 02/12-2018 “Development and investigation of finite-difference schemes of higher order of accuracy for solving applied problems of fluid and gas mechanics and ecology”, by the NSP “Information and Communication Technologies for a Single Digital Market in Science, Education and Security” (ICTinSES), financed by the Ministry of Education and Science.


  1. 1.
    Antonov, I., Saleev, V.: An economic method of computing \(LP_{\tau }\)-sequences. USSR Comput. Math. Phy. 19, 252–256 (1979)CrossRefGoogle Scholar
  2. 2.
    Bratley, P., Fox, B.: Algorithm 659: implementing Sobol’s quasirandom sequence generator. ACM Trans. Math. Softw. 14(1), 88–100 (1988)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Dimov, I., Georgieva, R., Ostromsky, T., Zlatev, Z.: Variance-based sensitivity analysis of the unified Danish Eulerian model according to variations of chemical rates. In: Dimov, I., Faragó, I., Vulkov, L. (eds.) NAA 2012. LNCS, vol. 8236, pp. 247–254. Springer, Heidelberg (2013). Scholar
  4. 4.
    Dimov, I.T., Georgieva, R., Ostromsky, T., Zlatev, Z.: Sensitivity studies of pollutant concentrations calculated by UNI-DEM with respect to the input emissions. Central Eur. J. Math. Numer. Methods Large Scale Sci. Comput. 11(8), 1531–1545 (2013)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Fox, B.: Algorithm 647: implementation and relative efficiency of quasirandom sequence generators. ACM Trans. Math. Softw. 12(4), 362–376 (1986)CrossRefGoogle Scholar
  6. 6.
    Halton, J.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2, 84–90 (1960)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Halton, J., Smith, G.B.: Algorithm 247: radical-inverse quasi-random point sequence. Commun. ACM 7, 701–702 (1964)CrossRefGoogle Scholar
  8. 8.
    Homma, T., Saltelli, A.: Importance measures in global sensitivity analysis of nonlinear models. Reliab. Eng. Syst. Saf. 52, 1–17 (1996)CrossRefGoogle Scholar
  9. 9.
    Hong, H.S., Hickernell, F.J.: ALGORITHM 823: implementing scrambled digital sequences. ACM Trans. Math. Softw. 29(2), 95–109 (2003)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kocis, L., Whiten, W.J.: Computational investigations of low-discrepancy sequences. ACM Trans. Math. Softw. 23(2), 266–294 (1997)CrossRefGoogle Scholar
  11. 11.
    Matousek, J.: On the L2-discrepancy for anchored boxes. J. Complex. 14(4), 527–556 (1998)CrossRefGoogle Scholar
  12. 12.
    Ostromsky, T., Dimov, I., Georgieva, R., Zlatev, Z.: Parallel computation of sensitivity analysis data for the Danish Eulerian model. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2011. LNCS, vol. 7116, pp. 307–315. Springer, Heidelberg (2012). Scholar
  13. 13.
    Ostromsky, T., Dimov, I.T., Georgieva, R., Zlatev, Z.: Air pollution modelling, sensitivity analysis and parallel implementation. Int. J. Environ. Pollut. 46(1/2), 83–96 (2011)CrossRefGoogle Scholar
  14. 14.
    Ostromsky, Tz., Dimov, I.T., Marinov, P., Georgieva, R., Zlatev, Z.: Advanced sensitivity analysis of the Danish Eulerian model in parallel and grid environment. In: Proceedings of the 3rd International Conference on AMiTaNS 2011, AIP Conference Proceedings, vol. 1404, pp. 225–232 (2011)Google Scholar
  15. 15.
    Sobol, I.M., Tarantola, S., Gatelli, D., Kucherenko, S., Mauntz, W.: Estimating the approximation error when fixing unessential factors in global sensitivity analysis. Reliab. Eng. Syst. Saf. 92, 957–960 (2007)CrossRefGoogle Scholar
  16. 16.
    Zlatev, Z.: Computer Treatment of Large Air Pollution Models. KLUWER Academic Publishers, Dorsrecht (1995)CrossRefGoogle Scholar
  17. 17.
    Zlatev, Z., Dimov, I.T.: Computational and Numerical Challenges in Environmental Modelling. Elsevier, Amsterdam (2006)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Tzvetan Ostromsky
    • 1
    Email author
  • Venelin Todorov
    • 1
    • 2
  • Ivan Dimov
    • 1
  • Zahari Zlatev
    • 3
  1. 1.Department of Parallel Algorithms, Institute of Information and Communication TechnologiesBulgarian Academy of Sciences (IICT-BAS)SofiaBulgaria
  2. 2.Department of Information Modelling, Institute of Mathematics and InformaticsBulgarian Academy of Sciences (IMI-BAS)SofiaBulgaria
  3. 3.National Centre for Environment and EnergyUniversity of ÅrhusRoskildeDenmark

Personalised recommendations