Numerical methods for roots of polynomials. II
From MaRDI portal
Publication:1949539
zbMath1279.65053MaRDI QIDQ1949539
Publication date: 8 May 2013
Published in: Studies in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/bookseries/1570579X
eigenvalueerror estimatessuccessive approximation methodtextbookpolynomialspolynomial factorizationintegration methodsecant methodbisection methodGraeffe processroot-solving
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Related Items
On optimal parameter of Laguerre's family of zero-finding methods, Stability domains of explicit multistep methods, An efficient method to find solutions for transcendental equations with several roots, Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation, Identification of MEMS Gyroscope Structure Using Frequency Response Data, On the convergence of Chebyshev's method for multiple polynomial zeros, The Weierstrass–Durand–Kerner root finder is not generally convergent, On the local convergence of Ehrlich method for numerical computation of polynomial zeros, Inventory management for new products with triangularly distributed demand and lead-time, Combined real and imaginary parts method for solving generalized Lyapunov matrix equation, A symbolic-numerical algorithm for isolating real roots of certain radical expressions, On the complexity exponent of polynomial system solving, 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, Implicit and explicit discrete‐time realizations of homogeneous differentiators, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, Nearly optimal refinement of real roots of a univariate polynomial, Efficient polynomial root-refiners: a survey and new record efficiency estimates, On using symmetric polynomials for constructing root finding methods, What to expect from a set of itemsets?, Robust discrete‐time output feedback stabilization of integrator chains, Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation, Explicit transversality conditions and local bifurcation diagrams for bogdanov-Takens bifurcation on center manifolds, Unnamed Item, On the complexity of the Descartes method when using approximate arithmetic, Nonstationary vs. stationary iterative processes, A further analysis of backward error in polynomial deflation, Root refinement for real polynomials using quadratic interval refinement, Parameter estimation and signal reconstruction, Computer visualization and dynamic study of new families of root-solvers, Computing real roots of real polynomials, A nearly optimal algorithm to decompose binary forms, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros, Searching on a line: a complete characterization of the optimal solution, Real root polynomials and real root preserving transformations, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Accelerated tower arithmetic, How Many Steps Still Left to $x$*?, 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, Real polynomial root-finding by means of matrix and polynomial iterations, Accelerated approximation of the complex roots and factors of a univariate polynomial
