Name
Abstract | ||
|---|---|---|
Summary. A general method for approximating polynomial solutions of second-order linear homogeneous differential equations with polynomial
coefficients is applied to the case of the families of differential equations defining the generalized Bessel polynomials,
and an algorithm is derived for simultaneously finding their zeros. Then a comparison with several alternative algorithms
is carried out. It shows that the computational problem of approximating the zeros of the generalized Bessel polynomials is
not an easy matter at all and that the only algorithm able to give an accurate solution seems to be the one presented in this
paper.
|
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/s002110000166 | Numerische Mathematik |
Keywords | Field | DocType |
differential equation,second order | Bessel polynomials,Jenkins–Traub algorithm,Orthogonal polynomials,Classical orthogonal polynomials,Mathematical analysis,Bessel process,Bessel filter,Mathematics,Difference polynomials,Bessel function | Journal |
Volume | Issue | ISSN |
86 | 3 | 0029-599X |
Citations | PageRank | References |
4 | 0.86 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Pasquini | 1 | 4 | 0.86 |
| A. Moro | 2 | 4 | 0.86 |