Fast and Backward Stable Computation of Roots of Polynomials (Q5265003): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The uniqueness in the inverse problem for transmission eigenvalues for the spherically symmetric variable-speed wave equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix / 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: A CMV-Based Eigensolver for Companion Matrices / 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: A fast implicit QR eigenvalue algorithm for companion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shifted QR iteration applied to companion matrices / 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: Design, analysis, and implementation of a multiprecision polynomial rootfinder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective fast algorithms for polynomial spectral factorization / 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: Implicit QR with compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wiener-Hopf and spectral factorization of real polynomials by Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5448146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank perturbation of regular matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing the eigenvalues of block 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: Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The QR Transformation A Unitary Analogue to the LR Transformation--Part 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles for Testing Polynomial Zerofinding Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Deflations in Extended QR Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudozeros of polynomials and pseudospectra of companion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit double shift \(QR\)-algorithm for companion matrices / 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: An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Francis’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential qd Algorithm with Shifts for Rank-Structured Matrices / rank
 
Normal rank

Latest revision as of 13:39, 10 July 2024

scientific article; zbMATH DE number 6460691
Language Label Description Also known as
English
Fast and Backward Stable Computation of Roots of Polynomials
scientific article; zbMATH DE number 6460691

    Statements

    Fast and Backward Stable Computation of Roots of Polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2015
    0 references
    companion matrix
    0 references
    eigenvalue
    0 references
    QR algorithm
    0 references
    roots of polynomials
    0 references
    Hessenberg matrix
    0 references
    Francis's algorithm
    0 references
    Givens rotators
    0 references
    numerical experiment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers