Pages that link to "Item:Q5317659"
From MaRDI portal
The following pages link to An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form (Q5317659):
Displayed 17 items.
- Transformations to rank structures by unitary similarity (Q556881) (← links)
- A QR-method for computing the singular values via semiseparable matrices (Q706231) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- On computing the eigenvectors of a class of structured matrices (Q818220) (← links)
- Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal (Q818797) (← links)
- AQZ-method based on semiseparable matrices (Q932737) (← links)
- Eigen-solving via reduction to DPR1 matrices (Q950043) (← links)
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems. (Q1426814) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values (Q2369041) (← links)
- Computations with quasiseparable polynomials and matrices (Q2378490) (← links)
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices (Q2433783) (← links)
- A small note on the scaling of symmetric positive definite semiseparable matrices (Q2494387) (← links)
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices (Q2501234) (← links)
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form (Q2503145) (← links)
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices (Q2566271) (← links)
- Structures preserved by the QR-algorithm (Q2575096) (← links)