Pages that link to "Item:Q811090"
From MaRDI portal
The following pages link to Finding the roots of a polynomial on an MIMD multicomputer (Q811090):
Displaying 27 items.
- Some families of two-step simultaneous methods for determining zeros of nonlinear equations (Q420266) (← links)
- Calculating polynomial zeros on a local memory parallel computer (Q582813) (← links)
- On dynamics of iterative techniques for nonlinear equation with applications in engineering (Q779549) (← links)
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
- On Euler-like methods for the simultaneous approximation of polynomial zeros (Q1128293) (← links)
- Orders of convergence for superlinearly convergent chaotic iterations (Q1179545) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Family of simultaneous methods of Hansen--Patrick's type (Q1878394) (← links)
- Finding roots of a real polynomial simultaneously by means of Bairstow's method (Q1914869) (← links)
- Tchebychef-like method for the simultaneous finding zeros of analytic functions (Q1921210) (← links)
- Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications (Q1983392) (← links)
- On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously (Q2167239) (← links)
- On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation (Q2167257) (← links)
- Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation (Q2167274) (← links)
- Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering (Q2193332) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- A family of root-finding methods with accelerated convergence (Q2475888) (← links)
- Computational efficiency of some combined methods for polynomial equations (Q2518679) (← links)
- The Durand-Kerner polynomials roots-finding method in case of multiple roots (Q2640316) (← links)
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs (Q2764998) (← links)
- Computers and the Multiplicity of Polynomial Roots (Q3327625) (← links)
- Börsch-supan-like methods: point estimation and parallel implementation (Q4384045) (← links)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros (Q4831432) (← 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)
- ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS (Q6114669) (← links)
- Numerical solution and optimal control for fractional tumor immune model (Q6616923) (← links)
