×

Inverse problem for the model of nonequilibrium sorption dynamics with mixed kinetics. (English. Russian original) Zbl 0805.76073

Comput. Math. Model. 2, No. 1, 55-60 (1991); translation from Tikhonov, A. N. (ed.) et al. Numerical methods for the solution of inverse problems of mathematical physics. Work collection, moskva, 21-29 (1988).
The mathematical model of nonequilibrium sorption dynamics taking into account the diffusion of a gas in the sorbent’s pore is analyzed. The uniqueness theorem for the solution of this inverse problem is proved. Some computational data are presented.

MSC:

76R50 Diffusion
35R30 Inverse problems for PDEs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A. M. Denisov and S. R. Tuikina, ”On some inverse problems of sorption dynamics,” Dokl. Akad. Nauk SSSR,276, No. 1, 100-102 (1984).
[2] A. V. Lukshin, ”A model of sorption dynamics,” Dokl. Akad. Nauk SSSR,213, No. 3, 550-552 (1973).
[3] A. Friedman, Partial Differential Equations of Parabolic Type, Prentice-Hall, Englewood Cliffs, N.J. (1964). · Zbl 0144.34903
[4] L. D. Belyakova, A. M. Denisov, A. V. Kiselev, et al., ”On determination of the adsorption isotherm from the frontal chromatogram by numerical methods,” in: Computer Applications for Solution of Problems of Mathematical Physics [in Russian], Moscow State Univ. (1985). · Zbl 0850.76541
[5] A. M. Denisov and S. R. Tuikina, ”On approximate solution of one inverve problem of sorption dynamics,” Vestn. Mosk. Univ., Ser. 15, Vychisl. Mat. Kiber., No. 3, 27-32 (1983).
[6] A. V. Kiselev and V. P. Drevinch (eds.), Experimental Methods in Adsorption and Molecular Chromatography [in Russian], Moscow State Univ. (1973).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.