Pages that link to "Item:Q2958922"
From MaRDI portal
The following pages link to Polynomial root finding using iterated Eigenvalue computation (Q2958922):
Displayed 12 items.
- Parametrization of approximate algebraic curves by lines (Q598227) (← 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)
- A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
- Efficient isolation of polynomial's real roots. (Q1421215) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Intersection of a ruled surface with a free-form surface (Q2463437) (← links)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← links)
- Method for finding multiple roots of polynomials (Q2507024) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
- Parametrization of approximate algebraic surfaces by lines (Q2573848) (← links)