New progress in real and complex polynomial root-finding
From MaRDI portal
Recommendations
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real and complex polynomial root-finding by means of eigen-solving
- Faulty sets of Boolean formulas and ukasiewicz logic
- Real polynomial root-finding by means of matrix and polynomial iterations
Cites work
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 5527834 (Why is no real title available?)
- scientific article; zbMATH DE number 3179103 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1263253 (Why is no real title available?)
- scientific article; zbMATH DE number 653122 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 953013 (Why is no real title available?)
- scientific article; zbMATH DE number 3290249 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3039704 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- A fast implicit QR eigenvalue algorithm for companion matrices
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A probabilistic remark on algebraic program testing
- A unifying convergence analysis of second-order methods for secular equations
- Accuracy and Stability of Numerical Algorithms
- Additive preconditioning for matrix computations
- Additive preconditioning, eigenspaces, and the inverse iteration
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Analysis of the quasi-Laguerre method
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Factorization of the Covariance Generating Function of a Pure Moving Average Process
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
- How to find all roots of complex polynomials by Newton's method.
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- Linear construction of companion matrices
- Matrix computations and polynomial root-finding with preprocessing
- Multivariate polynomials, duality, and structured matrices
- New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
- Nichtlineare Behandlung von Eigenwertaufgaben
- Numerical computation of polynomial zeros by means of Aberth's method
- Numerical methods for roots of polynomials. Part I
- On a generalized companion matrix pencil for matrix polynomials expressed in the Lagrange basis
- On the geometry of Graeffe iteration
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Polynomial Root-Finding Algorithms and Branched Covers
- Polynomial zerofinding iterative matrix algorithms
- Quasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems
- Random polynomials and expected complexity of bisection methods for real solving
- Randomized preprocessing of homogeneous linear systems of equations
- Rayleigh quotient algorithms for nonsymmetric matrix pencils
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Root-finding with eigen-solving
- Root-squaring with DPR1 matrices
- Schur aggregation for linear systems and determinants
- Solving Polynomials with Small Leading Coefficients
- Solving a Polynomial Equation: Some History and Recent Progress
- Some Modified Matrix Eigenvalue Problems
- Some modifications of Laguerre's method
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Templates for the Solution of Algebraic Eigenvalue Problems
- The DMM bound: multivariate (aggregate) separation bounds
- The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences
- The Matrix Eigenvalue Problem
- The amended DSeSC power method for polynomial root-finding
- The quasi-Laguerre iteration
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(30)- Structured matrix methods for polynomial root-finding
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- A parallel root-finding algorithm
- Root-finding by expansion with independent constraints
- Real and complex polynomial root-finding by means of eigen-solving
- Characterization and enumeration of good punctured polynomials over finite fields
- Recent results on iterative roots
- Univariate polynomial root-finding by arming with constraints
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Faulty sets of Boolean formulas and ukasiewicz logic
- Root-finding with eigen-solving
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real polynomial root-finding by means of matrix and polynomial iterations
- Numerical methods for roots of polynomials. II
- Computing Real Roots of Real Polynomials ... and now For Real!
- Application of filter diagonalization method to numerical solution of algebraic equations
- The amended DSeSC power method for polynomial root-finding
- Root-squaring with DPR1 matrices
- Fast optimization of viscosities for frequency‐weighted damping of second‐order systems
- Polynomial root finding using iterated eigenvalue computation
- Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Data driven Koopman spectral analysis in Vandermonde-Cauchy form via the DFT: numerical method and theoretical insights
- New Practical Advances in Polynomial Root Clustering
- The polynomial pivots as initial values for a new root-finding iterative method
- Randomized preprocessing versus pivoting
- Recent advances on determining the number of real roots of parametric polynomials
- On the use of the root locus of polynomials with complex coefficients for estimating the basin of attraction for the continuous-time Newton and Householder methods
This page was built for publication: New progress in real and complex polynomial root-finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q552308)
