Implicit QR for rank-structured matrix pencils
From MaRDI portal
Publication:2450897
Recommendations
- A QR-Based Solver for Rank Structured Matrices
- A QR decomposition for matrix pencils
- A multiple shift \(QR\)-step for structured rank matrices
- Rank-Structured QR for Chebyshev Rootfinding
- A quadratically convergent algorithm for structured low-rank approximation
- Differential qd algorithm with shifts for rank-structured matrices
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- An implicit QR algorithm for symmetric semiseparable matrices
- An implicit multishift QR-algorithm for Hermitian plus low rank matrices
- scientific article; zbMATH DE number 1618017
Cites work
- A fast implicit QR eigenvalue algorithm for companion matrices
- A fast QR algorithm for companion matrices
- An Extension of MATLAB to Continuous Functions and Operators
- AQZ-method based on semiseparable matrices
- Backward error and condition of polynomial eigenvalue problems
- Barycentric Lagrange Interpolation
- Completing a matrix when certain entries of its inverse are specified
- Computing real roots of a polynomial in Chebyshev series form through subdivision
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- scientific article; zbMATH DE number 5734462 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 1406958 (Why is no real title available?)
- Implicit double shift \(QR\)-algorithm for companion matrices
- Implicit QR with compression
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- LAPACK Users' Guide
- Linearization of matrix polynomials expressed in polynomial bases
- Matrix shapes invariant under the symmetric QR algorithm
- On a generalized companion matrix pencil for matrix polynomials expressed in the Lagrange basis
- On a new class of structured matrices
- QR-Like Algorithms for Symmetric Arrow Matrices
- Quasiseparable structures of companion pencils under the QZ-algorithm
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
Cited in
(12)- A real QZ algorithm for structured companion pencils
- Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
- On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity
- Implicit QR for companion-like pencils
- On the stability of computing polynomial roots via confederate linearizations
- Matrix structures in queuing models
- An implicit multishift QR-algorithm for Hermitian plus low rank matrices
- Factoring block Fiedler companion matrices
- Solving Rank-Deficient and Ill-posed Problems Using UTV and QR Factorizations
- Rank-Structured QR for Chebyshev Rootfinding
- Fast and Backward Stable Computation of Roots of Polynomials
- Exact computations with quasiseparable matrices
This page was built for publication: Implicit QR for rank-structured matrix pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450897)
