Pages that link to "Item:Q4340817"
From MaRDI portal
The following pages link to Solving a Polynomial Equation: Some History and Recent Progress (Q4340817):
Displayed 50 items.
- A property of the nearly optimal root-bound (Q596173) (← links)
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
- Numerical factorization of multivariate complex polynomials (Q598228) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- Enclosing all zeros of an analytic function - a rigorous approach (Q1019813) (← links)
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
- On solvents of matrix polynomials. (Q1412341) (← links)
- A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications (Q1765801) (← links)
- Symmetric functions and root-finding algorithms (Q1775732) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem (Q1861969) (← links)
- Polynomial factorization through Toeplitz matrix computations (Q1874656) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← 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)
- 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)
- 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><sup>2</sup>)Time<sup>∗</sup> (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)
- 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)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
- A computational comparison of the first nine members of a determinantal family of root-finding methods (Q5937186) (← links)