New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem

DOI10.1002/nla.2046zbMath1413.65099arXiv1510.04591OpenAlexW2964056049MaRDI QIDQ2955975

Hao Jiang, Jie Liu, Sheng-Guo Li, Xiang-Ke Liao

Publication date: 13 January 2017

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.04591

zbMATH Keywords

Schur complementeigenvalue problemsHSS matricesdivide-and-conquer algorithmCauchy-like matrices

Mathematics Subject Classification ID

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

Related Items (1)

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

Uses Software

• LAPACK
• PAPI
• VTune
• Algorithm 880

Cites Work

• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• A randomized algorithm for the decomposition of matrices
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Rank-one modification of the symmetric eigenproblem
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• On a new class of structured matrices
• A theory of pseudoskeleton approximations
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• On the existence and computation of rank-revealing LU factorizations
• Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
• Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
• An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
• Randomized algorithms for the low-rank approximation of matrices
• Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
• Fast algorithms for hierarchically semiseparable matrices
• A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• A Fast Adaptive Multipole Algorithm for Particle Simulations
• Some Applications of the Rank Revealing QR Factorization
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• On the Compression of Low Rank Matrices
• Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
• A Fast Solver for HSS Representations via Sparse Matrices
• Some Fast Algorithms for Sequentially Semiseparable Representations
• Approximation of 1/x by exponential sums in [1, ∞)
• A fast algorithm for particle simulations

This page was built for publication: New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem