A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
From MaRDI portal
Publication:4325685
DOI10.1137/S0895479892241287zbMath0815.65050OpenAlexW2072396164MaRDI QIDQ4325685
Publication date: 13 March 1995
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479892241287
numerical resultsdeflationspectral decompositionsymmetric tridiagonal matrixdivide-and-conquer algorithmsymmetric tridiagonal eigenproblemsymmetric arrowhead matrix
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (54)
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ Fast algorithms using orthogonal polynomials ⋮ Iterative refinement for symmetric eigenvalue decomposition ⋮ Computations with quasiseparable polynomials and matrices ⋮ LINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS IN ARROWHEAD FORM ⋮ Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ A fixed-point method for approximate projection onto the positive semidefinite cone ⋮ An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems ⋮ The structure of matrices in rational Gauss quadrature ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ An adaptive Richardson iteration method for indefinite linear systems ⋮ Efficient computation of tridiagonal matrices largest eigenvalue ⋮ New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem ⋮ Note on a rank-one modification of the singular value decomposition ⋮ A mathematical biography of Danny C. Sorensen ⋮ Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations ⋮ Fast algorithms for spherical harmonic expansions. II. ⋮ GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and Hermitian eigenproblems ⋮ Subspace choices for the Celis-Dennis-Tapia problem ⋮ Parallel block tridiagonalization of real symmetric matrices ⋮ Numerical solution of linear eigenvalue problems ⋮ Explicit barycentric formulae for osculatory interpolation at roots of classical orthogonal polynomials ⋮ Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices ⋮ On Computing Eigenvectors of Symmetric Tridiagonal Matrices ⋮ Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices ⋮ Refined bounds on the number of distinct eigenvalues of a matrix after low-rank update ⋮ A quantum eigensolver for symmetric tridiagonal matrices ⋮ Non-Toeplitz decay bounds for inverses of Hermitian positive definite tridiagonal matrices ⋮ A new vector field method for eigen-decomposition of symmetric matrices ⋮ On homogeneous least-squares problems and the inconsistency introduced by mis-constraining ⋮ Solving secular and polynomial equations: a multiprecision algorithm ⋮ Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance ⋮ A uniform object-oriented solution to the eigenvalue problem for real symmetric and Hermitian matrices ⋮ Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices ⋮ Computing the confidence levels for a root-mean-square test of goodness-of-fit ⋮ Structured Eigenvalue Problems ⋮ An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures ⋮ Fast algorithms for spherical harmonic expansions. III ⋮ Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update ⋮ Computation of Gauss-Kronrod quadrature rules ⋮ The Szegö-Markov-Bernstein inequalities and barycentric representations of the osculatory interpolating operators for classical iterated weights ⋮ A projected gradient method for optimization over density matrices ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics ⋮ On symmetrizing the ultraspherical spectral method for self-adjoint problems ⋮ Recurrence relations and fast algorithms ⋮ Eigenvalue computation in the 20th century ⋮ A numerical study of the Legendre-Galerkin method for the evaluation of the prolate spheroidal wave functions ⋮ Generalized anti-Gauss quadrature rules ⋮ The orthogonal Rayleigh quotient iteration (ORQI) method ⋮ Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD ⋮ Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation ⋮ High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm
This page was built for publication: A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
