scientific article; zbMATH DE number 440790
From MaRDI portal
Publication:3140959
Recommendations
- On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros
- scientific article; zbMATH DE number 3435009
- An algorithm for the simultaneous inclusion of real polynomial zeros
- The fast and parallel Halley algorithm for finding all zeros of a polynomial
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- scientific article; zbMATH DE number 1859224
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- scientific article; zbMATH DE number 2098030
- Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial
- On an efficient simultaneous method for finding polynomial zeros
Cited in
(9)- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- scientific article; zbMATH DE number 2098030 (Why is no real title available?)
- Sorting-based localization and stable computation of zeros of a polynomial. II.
- scientific article; zbMATH DE number 4187016 (Why is no real title available?)
- scientific article; zbMATH DE number 440793 (Why is no real title available?)
- scientific article; zbMATH DE number 4078649 (Why is no real title available?)
- scientific article; zbMATH DE number 3872575 (Why is no real title available?)
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140959)
