Advertisement

A Numerical Approach for Determination of Sources in Reactive Transport Equations

  • I. Dimov
  • U. Jaekel
  • H. Vereecken
  • D. Wendt
Part of the Lecture Notes in Statistics book series (LNS, volume 127)

Abstract

A new numerical approach for locating the source and quantifying its power is presented and studied. The proposed method may also be helpful when dealing with other transport problems.

The method uses a numerical integration technique to evaluate a linear functional arising from the solution of the adjoint problem. It is shown that using the solution of the adjoint equation an efficient numerical method can be constructed (a method, which is less time comsumpting than the usual schemes applied for solving the original problem). Our approach leads to a well-conditioned numerical problem.

A number of numerical tests are performed for a one-dimentional problem with a linear advection part. The results are compared with results obtained when solving the original problem. The code which realizes the presented method is written in FORTRAN 77.

Keywords

Numerical Scheme Original Problem Elliptic Operator Adjoint Equation Adjoint Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N.S. Bahvalov, On the optimal estimations of convergence of the quadrature processes and integration methods, Numerical methods for solving differential and integral equations Nauka, Moscow, 1964, pp. 5–63.Google Scholar
  2. [2]
    Bitzadze A.V., Equations of the Mathematical Physics, Nauka, 1982.Google Scholar
  3. [3]
    I. Dimov, O. Tonev, Monte Carlo methods with overconvergent probable error, in Numerical Methods and Applications, Proc. of Intern.Conf on Numerical Methods and Appl.,Sofia, (Publ. House of Bulg. Acad. Sci, Sofia, 1989), pp. 116–120.Google Scholar
  4. [4]
    I. Dimov, O. Toney, Random walk on distant mesh points Monte Carlo methods, Journal of Statistical Physics, vol. 70(5/6), 1993, pp. 1333–1342.CrossRefzbMATHMathSciNetGoogle Scholar
  5. [5]
    I. Dimov, O. Toney, Monte Carlo algorithms: performance analysis for some computer architectures. Journal of Computational and Applied Mathematics, vol. 48 (1993), pp. 253–277.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [6]
    S.M. Ermakov, G.A. Mikhailov Statistical Modeling, Nauka, Moscow, 1982.Google Scholar
  7. [7]
    H. Haken, Synergetics, Springer— Verlag, Berlin, Heidelberg, 1977.CrossRefGoogle Scholar
  8. [8]
    J.M. Hammersley, D.C. Handscomb, Monte Carlo methods, John Wiley & Sons, inc., New York, London, Sydney, Methuen, 1964.CrossRefzbMATHGoogle Scholar
  9. [9]
    L.V. Kantorovich, G.P. Akilov, Functional analysis in normed spaces, Pergamon Press, New York, 1964.zbMATHGoogle Scholar
  10. [10]
    G. Megson, V. Aleksandrov, I.Dimov, Systolic Mat rix Inversion Using a Monte Carlo Method, Journal of Parallel Algorithms and Applications, vol. 3 (1994), pp. 311–330.CrossRefzbMATHGoogle Scholar
  11. [11]
    G. A. Mikhailov A new Monte Carlo algorithm for estimating the maximum eigenvalue of an integral operator, Docl. Acad. Nauk SSSR, 191, No 5 (1970), pp. 993–996.Google Scholar
  12. [12]
    G.A. Mikhailov, Optimization of the “weight” Monte Carlo methods Nauka, Moscow, 1987.Google Scholar
  13. [13]
    I.M. Sobol Monte Carlo numerical methods, Nauka, Moscow, 1973.zbMATHGoogle Scholar
  14. [14]
    Tikhonov A.N., Samarski A.A., Equations of the Mathematical Physics. Moskow, Nauka, 1977.Google Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • I. Dimov
    • 1
  • U. Jaekel
    • 2
  • H. Vereecken
    • 2
  • D. Wendt
    • 3
  1. 1.Central Laboratory for Parallel ComputingBulgarian Academy of SciencesSofiaBulgaria
  2. 2.Research Centre JülichICG-4JülichGermany
  3. 3.lnstitute of Theoretical Physics DRWTH AachenAachenGermany

Personalised recommendations