Discrete and Continuous Models and Applied Computational ScienceDiscrete and Continuous Models and Applied Computational ScienceDiscrete and Continuous Models and Applied Computational Science2658-46702658-7149Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)2942610.22363/2658-4670-2021-29-4-306-336ArticlesСтатьиPersonalIn Memory of Vladimir GerdtПамяти Владимира Гердтаhttps://orcid.org/0000-0002-5125-0603EdneralVictor F.ЕднералВ. Ф.

Candidate of Physical and Mathematical Sciences, Senior Researcher of Skobeltsyn Institute of Nuclear Physics

edneral@theory.sinp.msu.ruLomonosov Moscow State UniversityНИИ ядерной физики имени Д.В. Скобельцына МГУPeoples’ Friendship University of Russia (RUDN University)Российский университет дружбы народов12112021294VOL 29, NO4 (2021)ТОМ 29, №4 (2021)30633612112021Copyright ©; 2021, Edneral V.F.Copyright ©; 2021, Еднерал В.Ф.2021Edneral V.F.Еднерал В.Ф.http://creativecommons.org/licenses/by/4.0https://journals.rudn.ru/miph/article/view/29426

Center for Computational Methods in Applied Mathematics of RUDN, Professor V.P. Gerdt, whose passing was a great loss to the scientific center and the computer algebra community. The article provides biographical information about V.P. Gerdt, talks about his contribution to the development of computer algebra in Russia and the world. At the end there are the author’s personal memories of V.P. Gerdt.

Настоящая статья - мемориальная, она посвящена памяти руководителя научного центра вычислительных методов в прикладной математике РУДН, профессора В.П. Гердта, чей уход стал невосполнимой потерей для научного центра и всего сообщества компьютерной алгебры. В статье приведены биографические сведения о В.П. Гердте, рассказано о его вкладе в развитие компьютерной алгебры в России и мире. В конце приведены личные воспоминания автора о В.П. Гердте.

computer algebraquantum computingmimetic methodspolynomial computer algebra methodsкомпьютерная алгебраквантовые вычислениямиметические методыметоды полиномиальной компьютерной алгебрыC. Riquier, Les Systèmes d’Equations aux Dérivées Partielles. Paris: Gauthier-Villars, 1910.M. Janet, “Systèmes d’équations aux dérivées partielles,” Journals de mathématiques, 8e série, vol. 3, pp. 65-151, 1920.J. Thomas, Differential systems. New York: American Mathematical Society, 1937.D. Robertz, Formal algorithmic elimination for PDEs. Springer, 2014.D. Cox, J. Little, and D. O’Shea, Ideals, varieties, and algorithms, 3rd ed. Springer, 2007.F. S. Macaulay, “Some properties of enumeration in the theory of modular systems,” Proceedings of the London Mathematical Society, vol. s2-26, no. 1, pp. 531-555, 1927. DOI: 10.1112/plms/s2-26.1.531.A. Y. Zharkov and Y. A. Blinkov, “Involution approach to solving systems of algebraic equations,” in Proceedings of the 1993 International IMACS Symposium on Symbolic Computation. Laboratoire d’Informatique Fondamentale de Lille, France, 1993, pp. 11-16.A. Y. Zharkov, “Involutive polynomial bases: General case,” in Preprint JINR E5-94-224. Dubna, 1994.A. Y. Zharkov and Y. A. Blinkov, “Algorithm for constructing involutive bases of polynomial ideal,” in International Conference on Interval and Computer-Algebraic Methods in Science and Engineering. St-Petersburg, 1994, pp. 258-260.A. Y. Zharkov and Y. A. Blinkov, “Involutive bases of zero-dimensional ideals,” in Preprint JINR E5-94-318. Dubna, 1994.V. P. Gerdt, “Gröbner bases and involutive methods for algebraic and differential equations,” in Computer Algebra in Science and Engineering. Singapore: World Scientific, 1995, pp. 117-137.J. Apel, “A Gröbner approach to involutive bases,” Journal of Symbolic Computation, vol. 19, no. 5, pp. 441-458, 1995.V. P. Gerdt and Y. A. Blinkov, “Involutive polynomial bases,” in Publication IT-95-271. Laboratoire d’Informatique Fondamentale de Lille, 1995.V. P. Gerdt and Y. A. Blinkov, “Involutive Bases of Polynomial Ideals,” in Preprint-Nr.1/1996. Naturwissenschaftlich-Theoretisches Zentrum, University of Leipzig, 1996.V. P. Gerdt, “Gröbner bases and involutive methods for algebraic and differential equations,” Mathematical and computer modelling, vol. 25, no. 8-9, pp. 75-90, 1997. DOI: 10.1016/S0895-7177(97)00060-5.V. P. Gerdt and Y. A. Blinkov, “Involutive bases of polynomial ideals,” in Preprint JINR E5-97-3. Dubna, 1997.V. P. Gerdt, “Involutive divisions in mathematica: Implementation and some applications,” in Proceedings of the Rhein Workshop on Computer Algebra. Institute for Algorithms and Scientific Computing, GMD-SCAI, 1998, pp. 74-91.V. P. Gerdt and Y. A. Blinkov, “Involutive divisions of monomials,” Programming and Computer Software, vol. 24, no. 6, pp. 283-285, 1998.Y. A. Blinkov, “Division and algorithms in the ideal membership problem [Deleniye i algoritmy v zadache o prinadlezhnosti k idealu],” Izvestija Saratovskogo universiteta, vol. 1, no. 2, pp. 156-167, 2001, In Russian.K. Lipnikov, G. Manzini, and M. Shashkov, “Mimetic finite difference method,” Journal of Computational Physics, vol. 257, pp. 1163-1227, 2014. DOI: 10.1016/j.jcp.2013.07.031.B. Koren, R. Abgrall, P. Bochev, J. Frank, and B. Perot, “Physicscompatible numerical methods,” Journal of Computational Physics, vol. 257, no. Part B, pp. 1039-1524, 2014. DOI: 10.1016/j.jcp.2013.10.015.M. Shashkov, Conservative finite difference methods. Boca Raton: CRC Press, 1996.D. Arnold, P. Bonchev, R. Lehoucq, R. Nikolaides, and M. Shashkov, Compatible spatial discretizations. Springer-Verlag, Berlin, 2006.L. B. da Veiga, K. Lipnikov, and G. Manzini, The mimetic finite difference method for elliptic problems. Springer, 2014, vol. 11.J. E. Castillo and G. F. Miranda, Mimetic discretization methods. Chapman and Hall/CRC, 2013.V. P. Gerdt, D. Robertz, and Y. A. Blinkov, “Strong Consistency and Thomas Decomposition of Finite Difference Approximations to Systems of Partial Differential Equations,” 2020. arXiv: 2009.01731[cs.SC].