Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
From MaRDI portal
Publication:6057349
DOI10.1007/978-3-031-30448-4_24OpenAlexW4366958023MaRDI QIDQ6057349
Qi Luan, Pan, Victor Y., Soo Go, Liang Zhao
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30448-4_24
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- Implementation of a near-optimal complex root clustering algorithm
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
- Faster numerical univariate polynomial root-finding by means of subdivision iterations
- Acceleration of subdivision root-finding for sparse polynomials
- Old and new nearly optimal polynomial root-finders
- The shifted number system for fast linear algebra on integer matrices
- Univariate polynomials
- Solving a Polynomial Equation: Some History and Recent Progress
- New Practical Advances in Polynomial Root Clustering
- Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders
- Matrix Multiplication, a Little Faster
- New progress in univariate polynomial root finding
