Pages that link to "Item:Q2345285"
From MaRDI portal
The following pages link to On an efficient simultaneous method for finding polynomial zeros (Q2345285):
Displaying 16 items.
- The self-validated method for polynomial zeros of high efficiency (Q1034672) (← links)
- On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously (Q2167239) (← links)
- Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation (Q2167274) (← links)
- Iterative schemes for finding all roots simultaneously of nonlinear equations (Q2171149) (← links)
- Sorting-based localization and stable computation of zeros of a polynomial. II. (Q2458056) (← links)
- A method for finding zeros of polynomial equations using a contour integral based eigensolver (Q2959027) (← links)
- (Q3140959) (← links)
- (Q3363314) (← links)
- (Q4321534) (← links)
- (Q4806121) (← links)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros (Q4831432) (← links)
- (Q4837008) (← links)
- ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS (Q5880723) (← links)
- ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS (Q5880764) (← links)
- An iterative scheme to obtain multiple solutions simultaneously (Q6170053) (← links)
- Simultaneous roots for vectorial problems (Q6172867) (← links)
