Enviar artigo por via de e-mail USING DYNAMIC MEMORY REALLOCATION IN GINV
- Autores: BLINKOV Y.1,2, SHCHETININ E.3
-
Afiliações:
- Chernyshevsky Saratov National Research State University
- Peoples’ Friendship University of Russia
- Financial University under the Government of the Russian Federation
- Edição: Nº 4 (2023)
- Páginas: 21-26
- Seção: КОМПЬЮТЕРНАЯ АЛГЕБРА
- URL: https://journals.rcsi.science/0132-3474/article/view/137637
- DOI: https://doi.org/10.31857/S0132347423020061
- EDN: https://elibrary.ru/GZFUDG
- ID: 137637
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
A new version of GInv (Gröbner Involutive) for computing involutive Gröbner bases is presented as a library in C++11. GInv uses object-oriented memory reallocation for dynamic data structures, such as lists, red-black trees, binary trees, and GMP libraries for arbitrary-precision integer calculations. The interface of the package is designed as a Python3 module.
Sobre autores
Yu. BLINKOV
Chernyshevsky Saratov National Research State University; Peoples’ Friendship University of Russia
Email: blinkovua@info.sgu.ru
Saratov, Russia; Moscow, Russia
E. SHCHETININ
Financial University under the Government of the Russian Federation
Autor responsável pela correspondência
Email: riviera-molto@mail.ru
Moscow, Russia
Bibliografia
- Buchberger B. Gröbner bases: an Buchberger algorithmic method in polynomial ideal theory // Recent Trends in Multidimensional System Theory / Ed. by N.K. Bose. V. 6. Reidel, Dordrecht, 1985. P. 184–232.
- Жарков А.Ю., Блинков Ю.А. Инволютивные системы алгебраических уравнений // Программирование. 1994. № 1. С. 53–56.
- Gerdt V.P., Blinkov Yu.A. Minimal involutive bases // Mathematics and Computers in Simulation. 1998. V. 45. P. 543–560.
- Faugère J.-C. A new efficient algorithm for computing Gröbner bases (F4) // Journal of Pure and Applied Algebra. V. 139 (1–3). 1999. P. 61–88.
- Блинков Ю.А., Гердт В.П. Специализированная система компьютерной алгебры GINV // Программирование. 2008. № 2. С. 67–80.
- McCarthy J. Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I // Commun. ACM, 1960. № 4. P. 184–195.
- Bansal A., Goel S., Shah P., Sanyal A., Kumar P. Garbage Collection Using a Finite Liveness Domain // Proceedings of the 2020 ACM SIGPLAN ISMM, 2020. P. 1–15.
- Yang A.M., Österlund E., Wilhelmsson J., Nyblom H., Wrigstad T. ThinGC: Complete Isolation with Marginal Overhead //Proceedings of the 2020 ACM SIGPLAN ISMM, 2020. P. 74–86.
- Onozawa H., Ugawa T., Iwasaki H. Fusuma: Double-Ended Threaded Compaction //Proceedings of the 2021 ACM SIGPLAN ISMM, 2021. P. 94–106.
- Tripp C., Hyde D., Grossman-Ponemon B. FRC: A High-Performance Concurrent Parallel Deferred Reference Counter for C++ // Proceedings of the 2018 ACM SIGPLAN ISMM, 2018. P. 14–28.
- Seyri A., Pan A., Vamanan B. MemSweeper: Virtualizing Cluster Memory Management for High Memory Utilization and Isolation //Proceedings of the 2022 ACM SIGPLAN ISMM, 2022. P. 15–28.
- Гердт В.П., Янович Д.А., Блинков Ю.А. Быстрый поиск делителя Жане // Программирование. 2001. № 1. С. 32–36.
- Попов А.С. Кубатурные формулы на сфере, инвариантные относительно группы вращений икосаэдра // Сиб. журн. вычисл. математики / РАН. Сиб. отд-ние. Новосибирск, 2008. Т. 11. № 4. С. 433–440.
