Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations

DOI10.1016/J.CAM.2011.07.010MaRDI QIDQ432800zbMATH OpenOpenAlexWikidataFDO

Authors Gerhard König, Michael Moldaschl, Wilfried N. Gansterer

Publication date 4 July 2012

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.cam.2011.07.010

zbMATH Keywords

algorithmsnumerical examplesinverse iterationblock tridiagonal matrixeigenvector computationtwisted block factorizationtwisted factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• A twisted factorization method for complex symmetric tridiagonal eigenvalue decomposition
• Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
• Orthogonal Eigenvectors and Relative Gaps
• The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices

Cites work

• A framework for symmetric band reduction
• Accurate Singular Values of Bidiagonal Matrices
• An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
• An implementation of the dqds algorithm (positive case)
• Block tridiagonalization of "effectively" sparse symmetric matrices
• Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
• Computing an Eigenvector with Inverse Iteration
• Fernando's solution to Wilkinson's problem: An application of double factorization
• For tridiagonals \(T\) replace \(T\) with \(LDL\)
• High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures
• LAPACK Users' Guide
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
• Relatively robust representations of symmetric tridiagonals
• The design and implementation of the MRRR algorithm
• Twisted factorization of a banded matrix

Cited in

(8)

• A block diagonalization based algorithm for the determinants of block k-tridiagonal matrices
• Improving formulas for the eigenvalues of finite block-Toeplitz tridiagonal matrices
• Graph signal processing on dynamic graphs based on temporal-attention product
• Block reduction of matrices to condensed forms for eigenvalue computations
• scientific article; zbMATH DE number 7528976 (Why is no real title available?)
• TWA versus semiclassical unitary approximation for spin-like systems
• A twisted factorization method for complex symmetric tridiagonal eigenvalue decomposition
• Twisted factorization of a banded matrix

Describes a project that uses

Uses Software

• LAPACK

This page was built for publication: Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q432800)