On the stability of computing polynomial roots via confederate linearizations (Q2814445): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PSIFN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chebfun / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130173851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 610: A Portable FORTRAN Subroutine for Derivatives of the Psi Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON MATRICES DEPENDING ON PARAMETERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Backward Stable Computation of Roots of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of eigenvalues of companion, comrade, and related matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CMV-Based Eigensolver for Companion Matrices / 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: Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices / 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: Numerical computation of polynomial zeros by means of Aberth's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit QR for companion-like pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit QR for rank-structured matrix pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing real roots of a polynomial in Chebyshev series form through subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiedler Companion Linearizations and the Recovery of Minimal Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward stability of polynomial root-finding using Fiedler companion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Roots from Companion Matrix Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev interpolation for nonlinear eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on companion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of Gauss Quadrature Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast FFT-based discrete Legendre transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation of the coefficients in the recurrence relation of a class of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Polynomials with Small Leading Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Reduction of Generalized Companion Matrix Pairs for Barycentric Lagrange Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of rootfinding for barycentric Lagrange interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbed recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal polynomials with perturbed recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the common zeros of two bivariate functions via Bézout resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality of matrix pencils, Wong chains and linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / 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: Balancing a matrix for calculation of eigenvalues and eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward error and condition of polynomial eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenstructure of an arbitrary polynomial matrix: Computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Note on the Inclusion L p (μ) ⊂L q (μ) / rank
 
Normal rank

Latest revision as of 05:37, 12 July 2024

scientific article
Language Label Description Also known as
English
On the stability of computing polynomial roots via confederate linearizations
scientific article

    Statements

    On the stability of computing polynomial roots via confederate linearizations (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    0 references
    normwise stability
    0 references
    linearization
    0 references
    root finding methods for polynomials
    0 references
    QZ algorithm
    0 references
    Jacobi orthogonal polynomial
    0 references
    QR algorithm
    0 references
    eigenvalue
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references