Pages that link to "Item:Q1949539"
From MaRDI portal
The following pages link to Numerical methods for roots of polynomials. II (Q1949539):
Displaying 43 items.
- 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)
- Inventory management for new products with triangularly distributed demand and lead-time (Q342323) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← 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)
- A further analysis of backward error in polynomial deflation (Q1731614) (← links)
- A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros (Q2008912) (← links)
- Real root polynomials and real root preserving transformations (Q2038321) (← links)
- Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation (Q2134542) (← links)
- Combined real and imaginary parts method for solving generalized Lyapunov matrix equation (Q2165854) (← links)
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
- Explicit transversality conditions and local bifurcation diagrams for bogdanov-Takens bifurcation on center manifolds (Q2215700) (← links)
- Nonstationary vs. stationary iterative processes (Q2220738) (← links)
- Parameter estimation and signal reconstruction (Q2230559) (← links)
- Computer visualization and dynamic study of new families of root-solvers (Q2231295) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- Accelerated tower arithmetic (Q2338646) (← 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)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- On the convergence of Chebyshev's method for multiple polynomial zeros (Q2634300) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)
- How Many Steps Still Left to $x$*? (Q5009892) (← links)
- On optimal parameter of Laguerre's family of zero-finding methods (Q5031805) (← links)
- Identification of MEMS Gyroscope Structure Using Frequency Response Data (Q5054396) (← links)
- The Weierstrass–Durand–Kerner root finder is not generally convergent (Q5058658) (← links)
- On using symmetric polynomials for constructing root finding methods (Q5113669) (← 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)
- Implicit and explicit discrete‐time realizations of homogeneous differentiators (Q6089708) (← links)
- (Q6151427) (← links)
- What to expect from a set of itemsets? (Q6190045) (← links)
- Robust discrete‐time output feedback stabilization of integrator chains (Q6194768) (← links)