A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices

DOI10.1016/j.acha.2012.06.003zbMath1264.65051OpenAlexW2045557136WikidataQ55952952 ScholiaQ55952952MaRDI QIDQ1948600

Ed S. Coakley, Vladimir Rokhlin

Publication date: 24 April 2013

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2012.06.003

zbMATH Keywords

algorithmnumerical resultseigenvalueseigenvectorsfast multipole methodsymmetric tridiagonal matrixsymmetric eigenproblem

Mathematics Subject Classification ID

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

Related Items

Bayesian model selection in linear mixed models for longitudinal data ⋮ Predicting slow relaxation timescales in open quantum systems ⋮ On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs ⋮ First-Order Methods for Nonconvex Quadratic Minimization ⋮ Refined isogeometric analysis for generalized Hermitian eigenproblems ⋮ Uniform Error Estimates for the Lanczos Method ⋮ Fast sampling from \(\beta \)-ensembles ⋮ On the inverse eigenvalue problem for a special kind of acyclic matrices. ⋮ On the inverse eigenvalue problem for periodic Jacobi matrices ⋮ Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs ⋮ Lamb shift statistics in mesoscopic quantum ensembles ⋮ High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm

This page was built for publication: A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices