Symbolic computation of Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators (Q5959252): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:49, 4 March 2024
scientific article; zbMATH DE number 1723273
Language | Label | Description | Also known as |
---|---|---|---|
English | Symbolic computation of Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators |
scientific article; zbMATH DE number 1723273 |
Statements
Symbolic computation of Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators (English)
0 references
26 March 2002
0 references
The authors use a symbolic algorithm based on the generalized Lucas polynomials of first kind in order to compute the Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators with polynomial coefficients. Examples are given.
0 references
symbolic algorithm
0 references
generalized Lucas polynomials
0 references
Newton sum rules
0 references
zeros
0 references
polynomial eigenfunctions
0 references
linear differential operators
0 references