Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
From MaRDI portal
Cites work
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
- Acceleration of subdivision root-finding for sparse polynomials
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- Faster numerical univariate polynomial root-finding by means of subdivision iterations
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3535615 (Why is no real title available?)
- scientific article; zbMATH DE number 1263253 (Why is no real title available?)
- Implementation of a near-optimal complex root clustering algorithm
- Matrix multiplication, a little faster
- New Practical Advances in Polynomial Root Clustering
- New progress in univariate polynomial root finding
- Old and new nearly optimal polynomial root-finders
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Solving a Polynomial Equation: Some History and Recent Progress
- The shifted number system for fast linear algebra on integer matrices
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
Cited in
(2)
This page was built for publication: Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057349)
