Pages that link to "Item:Q4069691"
From MaRDI portal
The following pages link to A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial (Q4069691):
Displayed 15 items.
- Two observations on Durand-Kerner's root-finding method (Q800688) (← links)
- An algorithm for the computation of zeros of a special class of entire functions (Q1062726) (← links)
- Locating multiple zeros interactively (Q1067359) (← links)
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros (Q1112563) (← links)
- On the convergence order of a modified method for simultaneous finding polynomial zeros (Q1171870) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- A high-order iterative formula for simultaneous determination of zeros of a polynomial (Q1184136) (← links)
- On rediscovered iteration methods for solving equations (Q1300719) (← links)
- On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros (Q1365319) (← links)
- Higher-order iteration functions for simultaneously approximating polynomial zeros (Q3311583) (← links)
- A method for computing all the zeros of a polynomial with real coefficients (Q3900917) (← links)
- A family of simultaneous methods for the determination of polynomial complex zeros (Q3942315) (← links)
- Comments on a root finding method using Padé approximation (Q4144112) (← links)
- An algorithm for the total, or partial, factorization of a polynomial (Q4151651) (← links)
- A note on a paper by G.Pólya (Q5666072) (← links)
