Numerical methods for roots of polynomials. Part I
From MaRDI portal
Publication:885496
zbMath1143.65002MaRDI QIDQ885496
Publication date: 13 June 2007
Published in: Studies in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/book/9780444527295
Related Items
On optimal parameter of Laguerre's family of zero-finding methods, Stability domains of explicit multistep methods, An efficient derivative free family of fourth order methods for solving systems of nonlinear equations, Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros, An efficient method to find solutions for transcendental equations with several roots, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, A highly efficient root-solver of very fast convergence, On the convergence of Chebyshev's method for multiple polynomial zeros, The Weierstrass–Durand–Kerner root finder is not generally convergent, A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros, On the local convergence of Ehrlich method for numerical computation of polynomial zeros, Efficient families of Newton's method and its variants suitable for non-convergent cases, A preconditioned iterative method for solving systems of nonlinear equations having unknown multiplicity, Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials, A Class of Higher-Order Newton-Like Methods for Systems of Nonlinear Equations, Exceptional zeros of polynomials satisfying a three-term recurrence, Dynamics and limiting behavior of Julia sets of König's method for multiple roots, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method, Ball convergence of an efficient multi-step scheme for solving equations and systems of equations, Duality of multiple root loci, 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, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Several improvements of the 2-point third order midpoint iterative method using weight functions, On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity, A class of computationally efficient Newton-like methods with frozen inverse operator for nonlinear systems, The computation of multiple roots of a polynomial, Algorithms for quaternion polynomial root-finding, New higher-order methods for the simultaneous inclusion of polynomial zeros, A simple yet efficient two-step fifth-order weighted-Newton method for nonlinear models, On a 4-point sixteenth-order King family of iterative methods for solving nonlinear equations, Root-finding by expansion with independent constraints, Parameter estimation and signal reconstruction, Computer visualization and dynamic study of new families of root-solvers, Computing real roots of real polynomials, On an efficient inclusion method for finding polynomial zeros, On a family of Weierstrass-type root-finding methods with accelerated convergence, Evaluation schemes in the ring of quaternionic polynomials, Multi-step derivative-free preconditioned Newton method for solving systems of nonlinear equations, Multi-step preconditioned Newton methods for solving systems of nonlinear equations, Multipoint methods for solving nonlinear equations: a survey, Chebyshev-like root-finding methods with accelerated convergence, Traub's accelerating generator of iterative root-finding methods, On the new fourth-order methods for the simultaneous approximation of polynomial zeros, A study of accelerated Newton methods for multiple polynomial roots, New progress in real and complex polynomial root-finding, On the improved Newton-like methods for the inclusion of polynomial zeros, An optimization of Chebyshev's method, Minimum variance time of arrival estimation for positioning, Accelerating generators of iterative methods for finding multiple roots of nonlinear equations, General convergence theorems for iterative processes and applications to the Weierstrass root-finding method, Searching on a line: a complete characterization of the optimal solution, Unnamed Item, Real root polynomials and real root preserving transformations, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Computational efficiency of some combined methods for polynomial equations, Hyman's method revisited, On the guaranteed convergence of new two-point root-finding methods for polynomial zeros, The self-validated method for polynomial zeros of high efficiency, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial, A CMV-Based Eigensolver for Companion Matrices, On some one-point hybrid iterative methods, Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations, The polynomial pivots as initial values for a new root-finding iterative method, How Many Steps Still Left to $x$*?, On an efficient simultaneous method for finding polynomial zeros, Computer tools for the construction and analysis of some efficient root-finding simultaneous methods, On the efficient global dynamics of Newton’s method for complex polynomials, A class of accurate Newton-Jarratt-like methods with applications to nonlinear models, On the convergence of Halley's method for multiple polynomial zeros, Effective numerical method of spectral analysis of quantum graphs, On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously, Real polynomial root-finding by means of matrix and polynomial iterations, Accelerated approximation of the complex roots and factors of a univariate polynomial, Newton's method in practice: finding all roots of polynomials of degree one million efficiently
