Pages that link to "Item:Q3680171"
From MaRDI portal
The following pages link to A Globally Convergent Method for Simultaneously Finding Polynomial Roots (Q3680171):
Displaying 14 items.
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
- Numerical factorization of multivariate complex polynomials (Q598228) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- The Durand-Kerner method for trigonometric and exponential polynomials (Q1094823) (← links)
- Computing singular solutions to polynomial systems (Q1201933) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems (Q1319864) (← links)
- Some remarks on Dvorcuk's root-finding method (Q1335008) (← links)
- Polynomial roots: The ultimate answer? (Q1899387) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem (Q2068644) (← links)
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials (Q2366652) (← links)
- The Durand-Kerner polynomials roots-finding method in case of multiple roots (Q2640316) (← links)
- Durand-Kerner method for the real roots (Q5960870) (← links)
