Pages that link to "Item:Q5663315"
From MaRDI portal
The following pages link to A root-finding algorithm based on Newton's method (Q5663315):
Displayed 8 items.
- The computation of multiple roots of a polynomial (Q425345) (← links)
- A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Finding zeros of nonlinear functions using the hybrid parallel cell mapping method (Q2199589) (← links)
- Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088) (← links)
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
- How to calculate ruin probabilities according to the classical risk theory (Q4134785) (← links)
- A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (Q4652860) (← links)