On Computing the Resultant of a Polynomial and an Entire Function

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 polyno...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Programming and computer software Jg. 48; H. 1; S. 59 - 64
Hauptverfasser: Kuzovatov, V. I., Kytmanov, A. A., Myshkina, E. K.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.02.2022
Springer Nature B.V
Schlagworte:
Algebra
Algorithms
Approximation
Artificial Intelligence
Computation
Computer algebra
Computer Science
Entire functions
Mathematical analysis
Operating Systems
Polynomials
Software Engineering
Software Engineering/Programming and Operating Systems
ISSN:0361-7688, 1608-3261
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768822010066