Root of a polynomial
Summary
A root of a polynomial over a ring is an element of with . The definition of a root states this precisely.
Where this leads
16 pages build on this one.
- Sendov's conjecture
- Durand–Kerner method
- Splitting circle method
- Marden's theorem
- Aberth method
- Bairstow's method
- Autoregressive–moving-average model
- Autoregressive model
- Prony's method
- Jenkins–Traub algorithm
- Routh–Hurwitz stability criterion
- Schur stable polynomial
- Moving-average model
- Wilkinson's polynomial
- Graeffe's method
- Laguerre's method
Further reading
- Web https://en.wikipedia.org/wiki/Zero_of_a_function, Polynomial roots
About this page
| Tag | 019MA1VTR2 |
|---|---|
| URI | m2://019MA1VTR2 |
| Aliases | zero-of-a-polynomial |
| Kind | concept |
| Writing | W0 stub |
| MSC | 13F20 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Definitions
Results about this
- Sendov's conjecture
- Durand–Kerner method
- Splitting circle method
- Budan's theorem
- Gauss–Lucas theorem
- Marden's theorem
- Aberth method
- Bairstow's method
- Jenkins–Traub algorithm
- Sturm's theorem
- Graeffe's method
- Descartes' rule of signs
- Laguerre's method
Used by
- Sendov's conjecture
- Durand–Kerner method
- Splitting circle method
- Marden's theorem
- Aberth method
- Bairstow's method
- Autoregressive–moving-average model
- Autoregressive model
- Prony's method
- Jenkins–Traub algorithm
- Routh–Hurwitz stability criterion
- Schur stable polynomial
- Moving-average model
- Wilkinson's polynomial
- Graeffe's method
- Laguerre's method