Pages that link to "Item:Q885496"
From MaRDI portal
The following pages link to Numerical methods for roots of polynomials. Part I (Q885496):
Displaying 50 items.
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously (Q262691) (← links)
- An efficient derivative free family of fourth order methods for solving systems of nonlinear equations (Q272459) (← links)
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros (Q273377) (← links)
- An efficient method to find solutions for transcendental equations with several roots (Q277596) (← links)
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros (Q331804) (← links)
- Efficient families of Newton's method and its variants suitable for non-convergent cases (Q337957) (← links)
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method (Q389577) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Several improvements of the 2-point third order midpoint iterative method using weight functions (Q419562) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- On a 4-point sixteenth-order King family of iterative methods for solving nonlinear equations (Q456608) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- On an efficient inclusion method for finding polynomial zeros (Q492088) (← links)
- Multipoint methods for solving nonlinear equations: a survey (Q505804) (← links)
- Traub's accelerating generator of iterative root-finding methods (Q540311) (← links)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros (Q548297) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- New higher-order methods for the simultaneous inclusion of polynomial zeros (Q639989) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- On a family of Weierstrass-type root-finding methods with accelerated convergence (Q668566) (← links)
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros (Q742856) (← links)
- Duality of multiple root loci (Q891671) (← links)
- A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
- Minimum variance time of arrival estimation for positioning (Q985637) (← links)
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations (Q988247) (← links)
- Hyman's method revisited (Q1008688) (← links)
- The self-validated method for polynomial zeros of high efficiency (Q1034672) (← links)
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
- On some one-point hybrid iterative methods (Q1049019) (← links)
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros (Q1643868) (← links)
- A preconditioned iterative method for solving systems of nonlinear equations having unknown multiplicity (Q1662605) (← links)
- Dynamics and limiting behavior of Julia sets of König's method for multiple roots (Q1680126) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity (Q1697274) (← links)
- Evaluation schemes in the ring of quaternionic polynomials (Q1742581) (← links)
- Multi-step derivative-free preconditioned Newton method for solving systems of nonlinear equations (Q1742856) (← links)
- Multi-step preconditioned Newton methods for solving systems of nonlinear equations (Q1742863) (← links)
- Real root polynomials and real root preserving transformations (Q2038321) (← links)
- A class of accurate Newton-Jarratt-like methods with applications to nonlinear models (Q2115014) (← links)
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
- Parameter estimation and signal reconstruction (Q2230559) (← links)
- Computer visualization and dynamic study of new families of root-solvers (Q2231295) (← links)
- An optimization of Chebyshev's method (Q2272151) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
- 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)
