Pages that link to "Item:Q676928"
From MaRDI portal
The following pages link to Numerical computation of polynomial zeros by means of Aberth's method (Q676928):
Displayed 11 items.
- na10 (Q23452) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
- Computing zeros of analytic functions in the complex plane without using derivatives (Q710001) (← links)
- An algebraic method to compute the critical points of the distance function between two Keplerian orbits (Q816904) (← links)
- Computing curve intersection by means of simultaneous iterations (Q861738) (← links)
- Innovative methods of correlation and orbit determination for space debris (Q990359) (← links)
- A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials (Q1124738) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Determining the number of real roots of polynomials through neural networks (Q2507014) (← links)