Root-finding by expansion with independent constraints
From MaRDI portal
Publication:662237
DOI10.1016/j.camwa.2011.08.029zbMath1232.65074OpenAlexW2017413072MaRDI QIDQ662237
Publication date: 21 February 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.08.029
convolutionpolynomial factorizationroot-findingSylvester matricesexpansion with independent constraintsPFD
Related Items
Efficient polynomial root-refiners: a survey and new record efficiency estimates, Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations, Real polynomial root-finding by means of matrix and polynomial iterations
Uses Software
Cites Work
- The computation of multiple roots of a polynomial
- New progress in real and complex polynomial root-finding
- Iterative inversion of structured matrices
- Matrix computations and polynomial root-finding with preprocessing
- A supplementary bibliography: on roots of polynomials
- Numerical computation of polynomial zeros by means of Aberth's method
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Additive preconditioning for matrix computations
- Numerical methods for roots of polynomials. Part I
- Randomized preprocessing of homogeneous linear systems of equations
- Parallel solution of Toeplitzlike linear systems
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- A bibliography on roots of polynomials
- Polynomial zerofinding iterative matrix algorithms
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- A 2002 update of the supplementary bibliography on roots of polynomials
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Univariate polynomials
- A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Decreasing the Displacement Rank of a Matrix
- Solving a Polynomial Equation: Some History and Recent Progress
- On the Problem of Runs
- Factorization of the Covariance Generating Function of a Pure Moving Average Process
- How to find all roots of complex polynomials by Newton's method.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
