Root-squaring with DPR1 matrices
From MaRDI portal
Publication:2452939
Recommendations
Cites work
- A composite polynomial zerofinding matrix algorithm
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Dandelin, Lobacevskii, or Graeffe
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Polynomial zerofinding iterative matrix algorithms
- Root-finding with eigen-solving
- The amended DSeSC power method for polynomial root-finding
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(5)- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- The amended DSeSC power method for polynomial root-finding
- Linking the TPR1, DPR1 and arrow-head matrix structures
- New progress in real and complex polynomial root-finding
- Eigen-solving via reduction to DPR1 matrices
This page was built for publication: Root-squaring with DPR1 matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452939)