Pages that link to "Item:Q4340817"

The following pages link to Solving a Polynomial Equation: Some History and Recent Progress (Q4340817):

Displaying 50 items.

• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
• Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
• Enclosing all zeros of a system of analytic functions (Q2008847) (← links)
• Real root polynomials and real root preserving transformations (Q2038321) (← links)
• On the determination of the number of positive and negative polynomial zeros and their isolation (Q2053518) (← links)
• Computational aspects of the general Rodrigues problem (Q2080604) (← links)
• Characterization of local optima of polynomial modulus over a disc (Q2138407) (← links)
• Fast algorithms for solving the inverse scattering problem for the Zakharov-Shabat system of equations and their applications (Q2170513) (← links)
• Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
• Real forms of the complex Neumann system: a method for finding real roots of polynomial \(U_{\mathcal{S}} ( \lambda )\) (Q2226307) (← links)
• Exponential bounds for intensity of jumps (Q2261925) (← links)
• Fitting \(C^2\) continuous parametric surfaces to frontiers delimiting physiologic structures (Q2262440) (← links)
• A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
• Computing singular points of projective plane algebraic curves by homotopy continuation methods (Q2320699) (← links)
• An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
• The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
• A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
• On the convergence of Halley's method for multiple polynomial zeros (Q2354280) (← links)
• Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
• On general convergence in extracting radicals via a fundamental family of iteration functions (Q2370693) (← links)
• Real algebraic numbers and polynomial systems of small degree (Q2378492) (← links)
• Schur aggregation for linear systems and determinants (Q2378504) (← links)
• The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
• Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
• Algorithms for quaternion polynomial root-finding (Q2434926) (← links)
• On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
• Stability of IMEX Runge-Kutta methods for delay differential equations (Q2475389) (← links)
• On the complexity of real root isolation using continued fractions (Q2476019) (← links)
• A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis (Q2479468) (← links)
• Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves (Q2489393) (← links)
• Computing real roots of a polynomial in Chebyshev series form through subdivision (Q2499750) (← links)
• Method for finding multiple roots of polynomials (Q2507024) (← links)
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← 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)
• Matrix exponentials, \(\mathrm{SU}(N)\) group elements, and real polynomial roots (Q2795524) (← links)
• On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial (Q3627691) (← links)
• General polynomial roots and their multiplicities in<i>O</i>(<i>N</i>)memory and<i>O</i>(<i>N</i>²)Time^∗ (Q3836210) (← links)
• On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
• Calibrating the Black-Derman-Toy model: some theoretical results (Q4541600) (← links)
• Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
• A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (Q4652860) (← links)
• An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound (Q4654024) (← links)
• Computing multiple roots of inexact polynomials (Q4654026) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
• Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders (Q5027172) (← links)
• The Weierstrass–Durand–Kerner root finder is not generally convergent (Q5058658) (← links)
• Newton–Ellipsoid polynomiography (Q5210609) (← links)