Pages that link to "Item:Q885496"

The following pages link to Numerical methods for roots of polynomials. Part I (Q885496):

Displaying 36 items.

• On an efficient simultaneous method for finding polynomial zeros (Q2345285) (← links)
• On the convergence of Halley's method for multiple polynomial zeros (Q2354280) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
• Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
• Polynomials as polygons (Q2363606) (← links)
• Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
• A highly efficient root-solver of very fast convergence (Q2378767) (← links)
• Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials (Q2402410) (← links)
• Exceptional zeros of polynomials satisfying a three-term recurrence (Q2411662) (← links)
• Algorithms for quaternion polynomial root-finding (Q2434926) (← links)
• Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
• Computational efficiency of some combined methods for polynomial equations (Q2518679) (← links)
• On the convergence of Chebyshev's method for multiple polynomial zeros (Q2634300) (← links)
• A simple yet efficient two-step fifth-order weighted-Newton method for nonlinear models (Q2700017) (← links)
• Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations (Q2855735) (← links)
• Chebyshev-like root-finding methods with accelerated convergence (Q3011656) (← links)
• (Q4600661) (← links)
• How Many Steps Still Left to $x$*? (Q5009892) (← links)
• On optimal parameter of Laguerre's family of zero-finding methods (Q5031805) (← links)
• The Weierstrass–Durand–Kerner root finder is not generally convergent (Q5058658) (← links)
• A Class of Higher-Order Newton-Like Methods for Systems of Nonlinear Equations (Q5082310) (← links)
• Ball convergence of an efficient multi-step scheme for solving equations and systems of equations (Q5095725) (← links)
• (Q5104114) (← links)
• Effective numerical method of spectral analysis of quantum graphs (Q5272605) (← links)
• A CMV-Based Eigensolver for Companion Matrices (Q5502142) (← links)
• On the improved Newton-like methods for the inclusion of polynomial zeros (Q5747715) (← links)
• Computer tools for the construction and analysis of some efficient root-finding simultaneous methods (Q5865291) (← links)
• On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
• Stability domains of explicit multistep methods (Q5882869) (← links)
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method (Q5963455) (← links)
• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees (Q6073133) (← links)
• A class of computationally efficient Newton-like methods with frozen inverse operator for nonlinear systems (Q6173151) (← links)
• Polynomial paradigms. Trends and applications in science and engineering (Q6486131) (← links)
• A new fast root-finder for black box polynomials (Q6658315) (← links)
• Novel range functions via Taylor expansions and recursive Lagrange interpolation with application to real root isolation (Q6666537) (← links)