Root-finding by expansion with independent constraints
type: Item
instance of: scholarly article
title: Root-finding by expansion with independent constraints
zbMATH Open document ID: 1232.65074
author: Ai-Long Zheng
author: Victor Y. Pan
publication date: 2012-02-21T00:00:00Z
Mathematics Subject Classification ID: 65H05
zbMATH DE Number: 6008603
zbMATH Keywords: root-finding
zbMATH Keywords: expansion with independent constraints
zbMATH Keywords: polynomial factorization
zbMATH Keywords: convolution
zbMATH Keywords: Sylvester matrices
zbMATH Keywords: PFD
describes a project that uses: na20
describes a project that uses: na10
describes a project that uses: Eigensolve
describes a project that uses: MultRoot
MaRDI profile type: Publication
full work available at URL: j.camwa.2011.08.029
OpenAlex ID: W2017413072
cites work: Q5779155
cites work: Q5572275
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: A bibliography on roots of polynomials
cites work: A supplementary bibliography: on roots of polynomials
cites work: A 2002 update of the supplementary bibliography on roots of polynomials
cites work: Numerical methods for roots of polynomials. Part I
cites work: Q4234125
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros
cites work: Univariate polynomials
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
cites work: Factorization of the Covariance Generating Function of a Pure Moving Average Process
cites work: Q3847819
cites work: Q3309525
cites work: The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences
cites work: A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
cites work: Q4309001
cites work: New progress in real and complex polynomial root-finding
cites work: Q2760974
cites work: Q5689624
cites work: Q4227296
cites work: How to find all roots of complex polynomials by Newton's method.
cites work: Numerical computation of polynomial zeros by means of Aberth's method
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: Q4827950
cites work: Q3162294
cites work: The computation of multiple roots of a polynomial
cites work: On the Problem of Runs
cites work: Polynomial zerofinding iterative matrix algorithms
cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
cites work: Q4250166
cites work: Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
cites work: Randomized preprocessing of homogeneous linear systems of equations
cites work: Additive preconditioning for matrix computations
cites work: Matrix computations and polynomial root-finding with preprocessing
cites work: An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
cites work: Parallel solution of Toeplitzlike linear systems
cites work: Decreasing the Displacement Rank of a Matrix
cites work: Iterative inversion of structured matrices
cites work: Q4775962
cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants
DOI: 10.1016/J.CAMWA.2011.08.029
published in: Computers & Mathematics with Applications
Recommended article: Root-finding with implicit deflation
Recommended article: Univariate polynomial root-finding by arming with constraints
Recommended article: Finding roots by deflated polynomial approximation
Recommended article: Q3447179
Recommended article: Q4526859
Recommended article: Q4847137
Recommended article: Multiple root-finding methods
Recommended article: Q4301332
description: scientific article; zbMATH DE number 6008603