Тип публикации: статья из журнала
Год издания: 2022
Идентификатор DOI: 10.1134/S0361768822010066
Аннотация: Based on Newton's recurrence formulas on the complex plane, the sums of values of one entire function at zeros of another entire function are found. This allows one to determine whether these functions have common zeros or not. An algorithm for computing an approximation to the resultant of a polynomial (or an entire function with Показать полностьюa finite number of zeros) and an entire function is presented. The algorithm is implemented in the Maple computer algebra system. Examples that illustrate the operation of the algorithm are considered. Abstract: Based on Newton’s recurrence formulas on the complex plane, the sums of values of one entire function at zeros of another entire function are found. This allows one to determine whether these functions have common zeros or not. An algorithm for computing an approximation to the resultant of a polynomial (or an entire function with a finite number of zeros) and an entire function is presented. The algorithm is implemented in the Maple computer algebra system. Examples that illustrate the operation of the algorithm are considered. © 2022, Pleiades Publishing, Ltd.
Журнал: PROGRAMMING AND COMPUTER SOFTWARE
Выпуск журнала: Vol. 48, Is. 1
Номера страниц: 59-64
ISSN журнала: 03617688
Место издания: NEW YORK
Издатель: PLEIADES PUBLISHING INC