Pages that link to "Item:Q2501234"

The following pages link to Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices (Q2501234):

Displaying 10 items.

• 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)
• A multiple shift \(QR\)-step for structured rank matrices (Q1044861) (← 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 Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem (Q2465323) (← links)
• Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations (Q2484224) (← links)
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order (Q2484401) (← 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)