General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
From MaRDI portal
Publication:3836210
Recommendations
Cites work
- A QL Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Method for Solving Algebraic Equations Using an Automatic Computer
- A real symmetric tridiagonal matrix with a given characteristic polynomial
- Another look at a matrix of Mark Kac
- Are the coefficients of a polynomial well-conditioned functions of its roots?
- Direkte Verfahren zur Berechnung der Nullstellen von Polynomen
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- Forward Stability and Transmission of Shifts in the QR Algorithm
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 925118 (Why is no real title available?)
- scientific article; zbMATH DE number 3279131 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- Numerical impluimentation of a new algorithm for polynomials with multiple roots
- On the condition of algebraic equations
- Polynomial roots: The ultimate answer?
- Remark on Algorithms to Find Roots of Polynomials
- Solving a Polynomial Equation: Some History and Recent Progress
- The DQR algorithm, basic theory, convergence, and conditional stability
- Weyl's quadtree algorithm for the unsymmetric eigenvalue problem
Cited in
(7)- A global algorithm to estimate the expectations of the components of an observed univariate mixture
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Computing multiple roots of inexact polynomials
- Numerical impluimentation of a new algorithm for polynomials with multiple roots
- Constructive ways for generating (generalized) real orthogonal matrices as products of (generalized) symmetries
- Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations
This page was built for publication: General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3836210)