Pages that link to "Item:Q418325"
From MaRDI portal
The following pages link to Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325):
Displayed 10 items.
- Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method (Q467101) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- An efficient matrix iteration for computing weighted Moore-Penrose inverse (Q505776) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Nonstationary vs. stationary iterative processes (Q2220738) (← links)
- Some matrix iterations for computing matrix sign function (Q2336419) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
- Finding the Moore-Penrose inverse by a new matrix iteration (Q2354185) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations (Q2855735) (← links)