Pages that link to "Item:Q848584"

The following pages link to A fast implicit QR eigenvalue algorithm for companion matrices (Q848584):

Displaying 20 items.

• Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
• New progress in real and complex polynomial root-finding (Q552308) (← links)
• A unification of unitary similarity transforms to compressed representations (Q652255) (← links)
• Implicit QR with compression (Q692576) (← links)
• Structured eigenvalue condition numbers for parameterized quasiseparable matrices (Q728451) (← links)
• Pentadiagonal companion matrices (Q908193) (← links)
• Implicit double shift \(QR\)-algorithm for companion matrices (Q993375) (← links)
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method (Q1945556) (← links)
• Fast computation of eigenvalues of companion, comrade, and related matrices (Q2450887) (← links)
• Implicit QR for rank-structured matrix pencils (Q2450897) (← links)
• Fast fixed-time synchronization control analysis for a class of coupled delayed Cohen-Grossberg neural networks (Q2667460) (← links)
• On the Stability of Some Hierarchical Rank Structured Matrix Algorithms (Q2827062) (← links)
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Q3119536) (← links)
• Factoring Block Fiedler Companion Matrices (Q3294688) (← links)
• Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil (Q4584920) (← links)
• Rank-Structured QR for Chebyshev Rootfinding (Q5006449) (← links)
• Data Driven Koopman Spectral Analysis in Vandermonde--Cauchy Form via the DFT: Numerical Method and Theoretical Insights (Q5240804) (← links)
• Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
• A CMV-Based Eigensolver for Companion Matrices (Q5502142) (← links)
• On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)