Сибирский федеральный университет

Тип публикации: статья из журнала

Год издания: 2021

Идентификатор DOI: 10.1134/S0361768821020080

Аннотация: Abstract: On the basis of Newton’s recurrent formulas, an algorithm for constructing the resultant of two entire functions is described. This algorithm helps eliminate unknowns from systems of nonalgebraic equations. This algorithm is implemented in the computer algebra system Maple. Examples demonstrating the operation of the algorithm are discussed. © 2021, Pleiades Publishing, Ltd.

Журнал: Programming and Computer Software

Выпуск журнала: Vol. 47, Is. 2

Номера страниц: 139-143

ISSN журнала: 03617688

Издатель: Pleiades journals

• Kuzovatov V.I (Siberian Fed Univ, Krasnoyarsk 660041, Russia)
• Kytmanov A.A. (Siberian Fed Univ, Krasnoyarsk 660041, Russia)
• Myshkina E.K. (Russian Acad Sci, Inst Computat Modeling, Siberian Branch, Krasnoyarsk 660036, Russia)

• Scopus
• Web of Science Core Collection
• Ядро РИНЦ (eLIBRARY.RU)