Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Eigensolve / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: na20 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962978702 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.05392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of polynomial zeros by means of Aberth's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving secular and polynomial equations: a multiprecision algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3847819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast version of the Schur-Cohn algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dandelin, Lobacevskii, or Graeffe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2002 update of the supplementary bibliography on roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for roots of polynomials. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient polynomial root-refiners: a survey and new record efficiency estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for roots of polynomials. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real and Complex Polynomial Root-Finding by Means of Eigen-Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximate computations with Cauchy matrices and polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the boolean complexity of real root refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal refinement of real roots of a univariate polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence conditions of some methods for the simultaneous computation of polynomial zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of the Covariance Generating Function of a Pure Moving Average Process / rank
 
Normal rank

Latest revision as of 23:49, 13 July 2024

scientific article
Language Label Description Also known as
English
Accelerated approximation of the complex roots and factors of a univariate polynomial
scientific article

    Statements

    Accelerated approximation of the complex roots and factors of a univariate polynomial (English)
    0 references
    13 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial equation
    0 references
    roots
    0 references
    root-finding
    0 references
    root-refinement
    0 references
    power sums
    0 references
    complexity
    0 references
    complex univariate polynomial
    0 references
    numerical stability
    0 references
    algorithm
    0 references
    complexity bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references