Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
DOI10.1007/S00211-005-0665-7zbMATH Open1086.65040OpenAlexW2093019367MaRDI QIDQ818797FDOQ818797
Authors: Raf Vandebril, Marc van Barel, Ellen Van Camp, Nicola Mastronardi 
Publication date: 21 March 2006
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-005-0665-7
Recommendations
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- scientific article; zbMATH DE number 1974608
- Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rankk
- A Lanczos-like reduction of symmetric structured matrices to semiseparable form
- Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values
computational complexityconvergencenumerical experimentsymmetric matrixreduction algorithmdiagonal-plus-semiseparable matrixorthogonal similarity transformation
Complexity and performance of numerical algorithms (65Y20) Canonical forms, reductions, classification (15A21)
Cites Work
- Title not available (Why is that?)
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Title not available (Why is that?)
- An implicit QR algorithm for symmetric semiseparable matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- Title not available (Why is that?)
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A note on the representation and definition of semiseparable matrices
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
- Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- Title not available (Why is that?)
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- Title not available (Why is that?)
Cited In (14)
- A unification of unitary similarity transforms to compressed representations
- Eigenvalue computation for unitary rank structured matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- Orthogonal transformation of a trace free symmetric matrix into one with zero diagonal elements
- On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
- Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values
- A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
- A small note on the scaling of symmetric positive definite semiseparable matrices
- Eigen-solving via reduction to DPR1 matrices
- Structural properties of matrix unitary reduction to semiseparable form
- Title not available (Why is that?)
- Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rankk
- Structured eigenvalue problems for rational Gauss quadrature
- Linking the TPR1, DPR1 and arrow-head matrix structures
This page was built for publication: Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818797)
