Pages that link to "Item:Q1780608"

The following pages link to Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608):

Displaying 37 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)
• Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
• Polynomial algebra for Birkhoff interpolants (Q633149) (← links)
• Structured eigenvalue condition numbers for parameterized quasiseparable matrices (Q728451) (← links)
• A fast implicit QR eigenvalue algorithm for companion matrices (Q848584) (← links)
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms (Q865451) (← links)
• Eigen-solving via reduction to DPR1 matrices (Q950043) (← links)
• Rational \(QR\)-iteration without inversion (Q957933) (← links)
• Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
• Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
• Implicit double shift \(QR\)-algorithm for companion matrices (Q993375) (← links)
• A multiple shift \(QR\)-step for structured rank matrices (Q1044861) (← links)
• Fast algorithms for solving the inverse scattering problem for the Zakharov-Shabat system of equations and their applications (Q2170513) (← links)
• Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
• Fast QR iterations for unitary plus low rank matrices (Q2288368) (← links)
• A note on generalized companion pencils in the monomial basis (Q2293107) (← links)
• An efficient method for computing the inverse of arrowhead matrices (Q2349233) (← links)
• Computations with quasiseparable polynomials and matrices (Q2378490) (← links)
• The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
• Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
• Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values'' (Q2443066) (← links)
• Low memory and low complexity iterative schemes for a nonsymmetric algebraic Riccati equation arising from transport theory (Q2448354) (← links)
• Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach (Q2449188) (← links)
• Root-squaring with DPR1 matrices (Q2452939) (← links)
• Structured eigenvalue problems for rational Gauss quadrature (Q2458320) (← links)
• Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries (Q2460590) (← links)
• Fast QR factorization of Cauchy-like matrices (Q2465328) (← links)
• Neville elimination for rank-structured matrices (Q2469525) (← links)
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations (Q2483050) (← links)
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices (Q2566271) (← links)
• On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
• Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory (Q2948084) (← links)
• Fast algorithms for hierarchically semiseparable matrices (Q3090808) (← links)
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Q3119536) (← links)
• Singular matrices whose Moore-Penrose inverse is tridiagonal (Q6048637) (← links)
• Matrix approach to solve polynomial equations (Q6165580) (← links)