An O(N^2 ) Method for Computing the Eigensystem of N \times N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach

DOI10.1137/0911010zbMATH Open0701.65026OpenAlexW2021049357MaRDI QIDQ3479447FDOQ3479447

Authors: Doron Gill, Eitan Tadmor 

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911010

Recommendations

• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices
• Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra
• An Algorithm for Symmetric Tridiagonal Eigenproblems: Divide and Conquer with Homotopy Continuation
• Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube

zbMATH Keywords

eigenvaluesnumerical exampleseigenvectorssymmetric tridiagonal matricesdivide and conquer algorithmupdating problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (19)

• Title not available (Why is that?)
• Analysis of third-order methods for secular equations
• Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra
• Gradient-Finite Element Method for Nonlinear Neumann Problems
• Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
• Title not available (Why is that?)
• Block tridiagonalization of "effectively" sparse symmetric matrices
• On the finite section method for computing exponentials of doubly-infinite skew-Hermitian matrices
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• Practical improvement of the divide-and-conquer eigenvalue algorithms
• Efficient computation of tridiagonal matrices largest eigenvalue
• A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices
• The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
• Combining the bisection method and Newton's method to compute eigenvalues of a real symmetric tridiagonal matrix.
• A unifying convergence analysis of second-order methods for secular equations
• An efficient method for obtaining the eigenvectors of a ring system
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• A quantum eigensolver for symmetric tridiagonal matrices
• A numerical comparison of methods for solving secular equations

This page was built for publication: An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach

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